Self-Stabilizing Agent Traversal

This paper introduces the problem of n mobile agents that repeatedly visit all n nodes of a given network, subject to the constraint that no two agents can simultaneously occupy a node. It is shown for a tree network and a synchronous model that this problem has O(?n) upper and lower time bounds where ? is the maximum degree of any vertex in the communication network. The synchronous algorithm is self-stabilizing and can also be used for an asynchronous system. A second algorithm is presented and analyzed to show O(n) round complexity for the case of a line of n asynchronous processes.

[1]  Mohamed G. Gouda,et al.  The linear alternator , 1997, WSS.

[2]  Shing-Tsaan Huang.  The Fuzzy Philosophers , 2000, IPDPS Workshops.

[3]  J.-M. Couvreur,et al.  Asynchronous unison , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[4]  Ajoy Kumar Datta,et al.  State-optimal snap-stabilizing PIF in tree networks , 1999, Proceedings 19th IEEE International Conference on Distributed Computing Systems.

[5]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[6]  Dhiraj K. Pradhan,et al.  Modified tree structure for location management in mobile environments , 1995, Comput. Commun..

[7]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[8]  Hirotsugu Kakugawa,et al.  A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments , 1996, WDAG.

[9]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

[10]  Masaaki Mizuno,et al.  A Transformation of Self-Stabilizing Serial Model Programs for Asynchronous Parallel Computing Environments , 1998, Inf. Process. Lett..

[11]  Shlomi Dolev,et al.  SuperStabilizing protocols for dynamic distributed systems , 1995, PODC '95.

[12]  Ajoy Kumar Datta,et al.  Randomized adaptive routing based on mobile agents , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[13]  Sandeep K. S. Gupta,et al.  Self-Stabilizing Protocol for Shortest Path Tree for Multi-cast Routing in Mobile Networks (Research Note) , 2000, Euro-Par.

[14]  Anish Arora,et al.  Stabilization-Preserving Atomicity Refinement , 1999, DISC.

[15]  Anish Arora,et al.  Maintaining Digital Clocks in Step , 1991, Parallel Process. Lett..

[16]  Sukumar Ghosh,et al.  Agents, Distributed Algorithms, and Stabilization , 2000, COCOON.

[17]  Mohamed G. Gouda,et al.  Stabilizing Unison , 1990, Inf. Process. Lett..