Locating and repairing faults in a network with mobile agents

DOI10.1016/J.TCS.2010.01.011MaRDI QIDQ962168zbMATHOpenAlexFDO

Authors Colin Cooper, Ralf Klasing, Tomasz Radzik

Publication date 6 April 2010

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

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

zbMATH Keywords

distributed computinggraph explorationmobile agents

Mathematics Subject Classification ID

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

Recommendations

• Locating and Repairing Faults in a Network with Mobile Agents
• Finding network resources by using mobile agents
• Mobile agents in distributed computing: network exploration
• Algorithmic Applications in Management
• Interacting with networks of mobile agents
• Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents
• Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links

Cites work

• A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• Approximation bounds for Black Hole Search problems
• Black Hole Search in Asynchronous Rings Using Tokens
• Black hole search in common interconnection networks
• Collective tree exploration
• Hardness and approximation results for black hole search in arbitrary networks
• Locating and Repairing Faults in a Network with Mobile Agents
• Mobile search for a black hole in an anonymous ring
• Performing Work Efficiently in the Presence of Faults
• Principles of Distributed Systems
• Randomization helps to perform independent tasks reliably
• Searching for a Black Hole in Synchronous Tree Networks
• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective

Cited in

(11)

• Gathering of robots in a ring with mobile faults
• Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents
• Explore and repair graphs with black holes using mobile entities
• Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
• Computing the fault tolerance of multi-agent deployment
• Exploration of Faulty Hamiltonian Graphs
• Locating and Repairing Faults in a Network with Mobile Agents
• Tight bounds for black hole search with scattered agents in synchronous rings
• Exploring an unknown dangerous graph with a constant number of tokens
• Synchronous black hole search in directed graphs
• Searching for black holes in subways

This page was built for publication: Locating and repairing faults in a network with mobile agents

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