Locating and repairing faults in a network with mobile agents
From MaRDI portal
Publication:962168
DOI10.1016/J.TCS.2010.01.011zbMATH Open1191.68722OpenAlexW2132927293MaRDI QIDQ962168FDOQ962168
Tomasz Radzik, Ralf Klasing, Colin Cooper
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
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
Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42) Distributed systems (68M14)
Cites Work
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Collective tree exploration
- Approximation bounds for Black Hole Search problems
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Hardness and approximation results for black hole search in arbitrary networks
- Black Hole Search in Asynchronous Rings Using Tokens
- Searching for a Black Hole in Synchronous Tree Networks
- Black hole search in common interconnection networks
- Mobile search for a black hole in an anonymous ring
- Performing Work Efficiently in the Presence of Faults
- Randomization helps to perform independent tasks reliably
- Locating and Repairing Faults in a Network with Mobile Agents
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
- Principles of Distributed Systems
Cited In (10)
- Gathering of robots in a ring with mobile faults
- Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Computing the fault tolerance of multi-agent deployment
- Synchronous black hole search in directed graphs
- Explore and repair graphs with black holes using mobile entities
- Exploration of Faulty Hamiltonian Graphs
- Exploring an unknown dangerous graph with a constant number of tokens
- Tight bounds for black hole search with scattered agents in synchronous rings
- Locating and Repairing Faults in a Network with Mobile Agents
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)
