scientific article; zbMATH DE number 2006651

MaRDI QIDQ4436049zbMATH OpenFDO

Authors Stefan Dobrev, P. Flocchini, G. Prencipe, N. Santoro

Publication date 23 November 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2180/21800166.htm

zbMATH Keywords

Distributed ComputingMobile AgentsHazardous SearchRing Network

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Mobile search for a black hole in an anonymous ring
• USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
• Towards cosmological black rings
• Black Hole Search in Asynchronous Rings Using Tokens
• Searching for black holes in subways
• Search for black hole ringdown signals in LIGO S4 data
• Principles of Distributed Systems

Cited in

(16)

• Black hole search in common interconnection networks
• Principles of Distributed Systems
• Mobile search for a black hole in an anonymous ring
• Approximation bounds for Black Hole Search problems
• Hardness and approximation results for black hole search in arbitrary networks
• Improved periodic data retrieval in asynchronous rings with a faulty host
• Time optimal algorithms for black hole search in rings
• Survivability of bouncing robots
• Time optimal algorithms for black hole search in rings
• Tight bounds for black hole search with scattered agents in synchronous rings
• USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
• Treasure hunt with barely communicating agents
• Periodic data retrieval problem in rings containing a malicious host (extended abstract)
• Distributed chasing of network intruders
• Want to gather? No need to chatter!
• Black hole search despite Byzantine agents

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436049)