Black hole search in common interconnection networks

DOI10.1002/NET.20095MaRDI QIDQ5469124zbMATH OpenOpenAlexFDO

Authors

Publication date 16 May 2006

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20095

zbMATH Keywords

anonymous networksbiconnected graphsdistributed mobile computingdistributed searchinterconnection networksmalicious hostmobile agentstraversal pair

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• Mobile search for a black hole in an anonymous ring
• Searching for a black hole in arbitrary networks, optimal mobile agent protocols
• Principles of Distributed Systems
• Structural Information and Communication Complexity

Cites work

• Deterministic rendezvous in graphs
• scientific article; zbMATH DE number 1696681 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 2006651 (Why is no real title available?)
• scientific article; zbMATH DE number 2102782 (Why is no real title available?)
• scientific article; zbMATH DE number 2119714 (Why is no real title available?)
• LATIN 2004: Theoretical Informatics
• STACS 2004

Cited in

(20)

• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• Hardness and approximation results for black hole search in arbitrary networks
• Minimum rank and zero forcing number for butterfly networks
• Time optimal algorithms for black hole search in rings
• Exploration of Faulty Hamiltonian Graphs
• Black hole search with finite automata scattered in a synchronous torus
• Black hole search in directed graphs
• Locating and Repairing Faults in a Network with Mobile Agents
• Approximation bounds for Black Hole Search problems
• USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
• Tight bounds for black hole search with scattered agents in synchronous rings
• Searching for a black hole in arbitrary networks, optimal mobile agent protocols
• Structural Information and Communication Complexity
• Principles of Distributed Systems
• Searching for black holes in subways
• Synchronous black hole search in directed graphs
• Explore and repair graphs with black holes using mobile entities
• Improved periodic data retrieval in asynchronous rings with a faulty host
• Exploring an unknown dangerous graph with a constant number of tokens
• Locating and repairing faults in a network with mobile agents

This page was built for publication: Black hole search in common interconnection networks

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