Dynamic snapshot algorithm and partial rollback algorithm for internet agents

This paper considers an Internet agent system in which a tremendous number of agents operate, frequently appearing and disappearing, and discusses the fault‐tolerant algorithm. Application of the snapshot algorithm to the agent system is considered. The snapshot algorithm is used to view the whole s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronics & communications in Japan. Part 3, Fundamental electronic science Ročník 88; číslo 12; s. 43 - 57
Hlavní autoři: Moriya, Sen, Araragi, Tadashi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.12.2005
Témata:
distributed algorithm
fault-tolerance
Internet agent
rollback algorithm
snapshot algorithm
ISSN:1042-0967, 1520-6440
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper considers an Internet agent system in which a tremendous number of agents operate, frequently appearing and disappearing, and discusses the fault‐tolerant algorithm. Application of the snapshot algorithm to the agent system is considered. The snapshot algorithm is used to view the whole situation (snapshot) of the distributed system. The snapshot algorithm of Chandy and Lamport [2] is considered as a representative snapshot algorithm, in terms of the high efficiency and the simplicity of the procedure. It is not practical, however, to apply their snapshot algorithm to the distributed agent system in which a tremendous number of agents operate. From such a viewpoint, this paper extends the idea of Chandy and Lamport's algorithm and proposes a subsnapshot algorithm, in which the snapshot is taken among the agents who are in the causal relation, through message exchange and agent creation. Then, an efficient rollback algorithm is proposed, which is based on the snapshots taken by the subsnapshot algorithm. In the general rollback algorithm utilizing the snapshot, all agents must roll back. In contrast, in the rollback algorithm proposed in this paper, it suffices that only some agents should roll back. © 2005 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 88(12): 43–57, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20208
Bibliografie:istex:6DB84268AECE25CBF46B3791889334AF96A29D1C
ark:/67375/WNG-81BTKG9T-N
ArticleID:ECJC20208
Presently with the Department of Information Science, Kinki University.
ISSN:1042-0967
1520-6440
DOI:10.1002/ecjc.20208