Fault tolerance for internet agent systems: in cases of stop failure and byzantine failure

ABSTRACT

In this demo, we present our two fault-tolerant systems to overcome stop failure and Byzantine failure, respectively, for agent execution platforms such as JADE and Aglets. For both failures, we have extended traditional fault tolerance methods for intranet to make them applicable to Internet agent systems, which are huge, open, dynamic, autonomous, and unorganized distributed systems.

REFERENCES

• 1: Miguel Castro , Barbara Liskov, Practical byzantine fault tolerance and proactive recovery, ACM Transactions on Computer Systems (TOCS), v.20 n.4, p.398-461, November 2002 [doi>10.1145/571637.571640]
• 2: K. Mani Chandy , Leslie Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems (TOCS), v.3 n.1, p.63-75, Feb. 1985 [doi>10.1145/214451.214456]
• 3: Richard Koo , Sam Toueg, Checkpointing and rollback-recovery for distributed systems, IEEE Transactions on Software Engineering, v.13 n.1, p.23-31, Jan. 1987 [doi>10.1109/TSE.1987.232562]
• 4: S. Moriya, T. Araragi: Dynamic Snapshot Algorithm and Partial Rollback Algorithm for Internet Agents, DISC 2001 Brief Announcement, DI-FCUL TR-01-7 J. Welch (ed.): 23--28(2001).
• 5: Christian Cachin , Klaus Kursawe , Victor Shoup, Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract), Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, p.123-132, July 16-19, 2000, Portland, Oregon, United States [doi>10.1145/343477.343531]