Improved periodic data retrieval in asynchronous rings with a faulty host

DOI10.1016/j.tcs.2015.09.019zbMath1333.68246OpenAlexW2178915531MaRDI QIDQ896144

Aris Pagourtzis, Matoula Petrolia, Evangelos Bampas, Euripides Markou, Nikos Leonardos

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.019

zbMATH Keywords

distributed algorithmmobile agentgray holemalicious hostperiodic data retrievalred holeunreliable whiteboard

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Agent technology and artificial intelligence (68T42)

Cites Work

• Unnamed Item
• Unnamed Item
• More efficient periodic traversal in anonymous undirected graphs
• Searching for black holes in subways
• Mobile search for a black hole in an anonymous ring
• Sense of direction in distributed computing
• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• Ping pong in dangerous graphs: optimal black hole search with pebbles
• TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS
• Black Hole Search in Asynchronous Rings Using Tokens
• Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
• Periodic Data Retrieval Problem in Rings Containing a Malicious Host
• USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
• Sense of direction: Definitions, properties, and classes
• Principles of Distributed Systems
• Black hole search in common interconnection networks

This page was built for publication: Improved periodic data retrieval in asynchronous rings with a faulty host