A consensus algorithm for synchronous distributed systems using mobile agent

In this paper, we present a consensus algorithm for synchronous distributed systems using cooperating mobile agents. The algorithm is designed within a framework for mobile agent enabled distributed server groups (MADSG), where cooperating mobile agents are used to achieve coordination among the servers. Being autonomous and cooperative, cooperating mobile agents exchange information among themselves to achieve consensus. The correctness proof of the proposed algorithm is presented. Performance evaluation of the algorithm has been carried out by both theoretical analysis and simulation.

[1]  Jiannong Cao,et al.  A framework of using cooperating mobile agents to achieve load sharing in distributed Web server groups , 2002, Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings..

[2]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[3]  Jie Wu,et al.  A Mobile Agent Enabled Fully Distributed Mutual Exclusion Algorithm , 2002, Mobile Agents.

[4]  Jiannong Cao,et al.  Checkpointing and rollback of wide-area distributed applications using mobile agents , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[5]  Danny B. Lange,et al.  Programming and Deploying Java¿ Mobile Agents with Aglets¿ , 1998 .

[6]  Danny B. Lange,et al.  Seven good reasons for mobile agents , 1999, CACM.

[7]  André Schiper,et al.  Uniform consensus is harder than consensus , 2004, J. Algorithms.

[8]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[9]  Pattie Maes,et al.  Cooperating Mobile Agents for Dynamic Network Routing , 1999 .

[10]  George Cybenko,et al.  Mobile Agents: Motivations and State-of-the-Art Systems , 2000 .

[11]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[12]  Rachid Guerraoui,et al.  Synchronous system and perfect failure detector: Solvability and efficiency issues , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

[13]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[14]  Flaviu Cristian,et al.  The Timed Asynchronous Distributed System Model , 1998, IEEE Trans. Parallel Distributed Syst..

[15]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[16]  Marcos K. Aguilera,et al.  Failure detection and consensus in the crash-recovery model , 2000, Distributed Computing.

[17]  Danny Dolev,et al.  Early stopping in Byzantine agreement , 1990, JACM.

[18]  Rachid Guerraoui,et al.  Consensus in Asynchronous Distributed Systems: A Concise Guided Tour , 1999, Advances in Distributed Systems.

[19]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[20]  Jie Wu,et al.  Achieving replication consistency using cooperating mobile agents , 2001, Proceedings International Conference on Parallel Processing Workshops.