Black hole search despite Byzantine agents

DOI10.1007/978-3-030-34992-9_28zbMATH Open1543.68059MaRDI QIDQ6536342FDOQ6536342

Authors: Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue 

Publication date: 19 April 2024

Recommendations

• Mobile search for a black hole in an anonymous ring
• scientific article; zbMATH DE number 2006651
• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• Searching for a Black Hole in Synchronous Tree Networks
• Identifying hostile nodes in networks using mobile agents

zbMATH Keywords

mobile agentByzantine faultsynchronous networkblack-hole search problem

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites Work

• Hardness and approximation results for black hole search in arbitrary networks
• Black Hole Search in Asynchronous Rings Using Tokens
• Mobile search for a black hole in an anonymous ring
• Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
• Black hole search with finite automata scattered in a synchronous torus

This page was built for publication: Black hole search despite Byzantine agents

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