Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Approaches to Fault-Tolerant and Transactional Mobile Agent Execution -- An Algorithmic View
 
research article

Approaches to Fault-Tolerant and Transactional Mobile Agent Execution -- An Algorithmic View

Pleisch, Stefan
•
Schiper, André  
2004
ACM Computing Surveys

Over the past years, mobile agent technology has attracted considerable attention, and a significant body of literature has been published. To further develop mobile agent technology, reliability mechanisms such as fault tolerance and transaction support are required. This article aims at structuring the field of fault-tolerant and transactional mobile agent execution and thus at guiding the reader to understand the basic strengths and weaknesses of existing approaches. It starts with a discussion on providing fault tolerance in a system in which processes simply fail. For this purpose, we first identify two basic requirements for fault-tolerant mobile agent execution: (1) non-blocking (i.e., a single failure does not prevent progress of the mobile agent execution) and (2) exactly-once (i.e., multiple executions of the agent are prevented). This leads us to introduce the notion of a local transaction as the basic building block for fault-tolerant mobile agent execution and to classify existing approaches according to when and by whom the local transactions are committed. In a second part, we show that transactional mobile agent execution additionally ensures execution atomicity and present a survey of existing approaches. In the last part of the survey, we extend the notion of fault tolerance to arbitrary Byzantine failures and security-related issues of the mobile agent execution.

  • Files
  • Details
  • Metrics
Type
research article
DOI
10.1145/1035570.1035571
Author(s)
Pleisch, Stefan
Schiper, André  
Date Issued

2004

Published in
ACM Computing Surveys
Volume

36

Issue

3

Start page

219

End page

262

Subjects

ACID

•

Agreement problem

•

Asynchronous system

•

Byzantine failures

•

Commit

•

Crash failures

•

Fault tolerance

•

Malicious places

•

Mobile agents

•

Replication

•

Security

•

Transactions

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LSR-IC  
Available on Infoscience
July 26, 2006
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/232725
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés