Approaches to fault-tolerant and transactional mobile agent execution - An algorithmic view

被引:20
作者
Pleisch, S [1 ]
Schiper, A [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Distributed Syst Lab, CH-1015 Lausanne, Switzerland
关键词
reliability; algorithms; design; theory; ACID; agreement problem; asynchronous system; Byzantine failures; commit; crash failures; fault tolerance; malicious places; mobile agents; replication; security; transaction;
D O I
10.1145/1035570.1035571
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:219 / 262
页数:44
相关论文
共 90 条
  • [1] ALGESHEIMER J, 2001, P S SEC PRIV OAKL CA
  • [2] ALPERN B, 1985, INFORMATION PROCESSI, V21
  • [3] [Anonymous], 1998, LNCS
  • [4] Assis Silva F., 1998, LNCS, V1477, P14
  • [5] Bernstein P.A., 1987, Concurrency Control and Recovery in Database Systems
  • [6] BIESZCZAD A, 1998, IEEE COMMUN SURV
  • [7] Cachin C, 2000, LECT NOTES COMPUT SC, V1853, P512
  • [8] Unreliable failure detectors for reliable distributed systems
    Chandra, TD
    Toueg, S
    [J]. JOURNAL OF THE ACM, 1996, 43 (02) : 225 - 267
  • [9] ITINERANT AGENTS FOR MOBILE COMPUTING
    CHESS, D
    GROSOF, B
    HARRISON, C
    LEVINE, D
    PARRIS, C
    TSUDIK, G
    [J]. IEEE PERSONAL COMMUNICATIONS, 1995, 2 (05): : 34 - 49
  • [10] CHESS D, 1998, LNCS, V1419, P25