Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents

DOI10.1007/978-3-540-72951-8_23MaRDI QIDQ5425978zbMATH OpenOpenAlexFDO

Authors Shantanu Das, P. Flocchini, N. Santoro, Masafumi Yamashita

Publication date 15 November 2007

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72951-8_23

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Agent technology and artificial intelligence (68T42)

Recommendations

• How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults
• An Algorithmic Theory of Mobile Agents
• scientific article; zbMATH DE number 2040819
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• Locating and Repairing Faults in a Network with Mobile Agents

Cited in

(6)

• Move-optimal gossiping among mobile agents
• Local Maps: New Insights into Mobile Agent Algorithms
• Dynamic Fault Tolerance in Distributed Simulation System
• How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults
• scientific article; zbMATH DE number 2209389 (Why is no real title available?)
• Locating and repairing faults in a network with mobile agents

This page was built for publication: Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents

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