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

Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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 messagepassing 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.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 14th International Colloquium, SIROCCO 2007, Proceedings
Pages289-303
Number of pages15
Publication statusPublished - Dec 1 2007
Event14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007 - Castiglioncello, Italy
Duration: Jun 5 2007Jun 8 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4474 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007
CountryItaly
CityCastiglioncello
Period6/5/076/8/07

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Das, S., Flocchini, P., Santoro, N., & Yamashita, M. (2007). Fault-tolerant simulation of message-passing algorithms by mobile agents. In Structural Information and Communication Complexity - 14th International Colloquium, SIROCCO 2007, Proceedings (pp. 289-303). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4474 LNCS).