Fault-tolerant simulation of message-passing algorithms by mobile agents

  • Authors:

  • Shantanu Das;Paola Flocchini;Nicola Santoro;Masafumi Yamashita

  • Affiliations:

  • School of Information Technology and Engineering, University of Ottawa, Canada;School of Information Technology and Engineering, University of Ottawa, Canada;School of Computer Science, Carleton University, Canada;Dept. of Computer Science and Communication Engg., Kyushu University, Japan

  • Venue:
  • SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The recently established computational equivalence between the traditional message-passing model and the mobile-agents model is based on the existence of a mobile-agents algorithm that simulates the execution of message-passing algorithms. Like most existing protocols for mobile agents, this simulation protocol works correctly only if the agents are fault-free. We consider the problem of performing the simulation of message-passing algorithms when the simulating agents may crash unexpectedly. We show how to simulate any distributed algorithm for the message-passing model in a mobile-agents system with k agents, tolerating up to f ≤ k - 1 crashes during the simulation. Two fault-tolerant simulation algorithms are presented, one for non-anonymous settings (i.e., where either the networks nodes or the agents or both have distinct identities), and one for anonymous systems (where both the network nodes and the agents are anonymous). In both cases, the simulation overhead is polynomial. Unlike the existing fault-free simulation algorithm, both our protocols are able to detect termination even if the simulated algorithm has no explicit termination detection.