Abstract
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 selfstabilizing 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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Research supported by NSF award CAREER 97-9953 and DARPA contract F33615- 01-C-1901.
This work is supported in part by Japan Society for the Promotion of Science (JSPS), Grant-in-Aid for Scientific Research((c)(2)12680349).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A Arora, S Dolev, and MG Gouda. Maintaining digital clocks in step. Parallel Processing Letters, 1:11–18, 1991.
A Bui, AK Datta, F Petit and V Villain. Snap-stabilizing PIF algorithm in the tree networks without sense of direction. In Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO’99), Carleton University Press, pp. 32–46, 1999.
A Bui, AK Datta, F Petit and V Villain. State-Optimal Snap-Stabilizing PIF in Tree Networks. In Proceedings of the 4th Workshop on Self-Stabilizing Systems (WSS’99), IEEE Computer Society Press, pp. 78–85, 1999.
M Bui, AK Datta, O Flauzac, DT Nguyen. Randomized adaptive routing based on mobile agents. Proceedings of International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), pp. 380–385, 1999.
E Bonabeau and G Théraulaz. Swarm smarts. Scientific American, pp. 72–79, March 2000.
JM Couvreur, N Francez, and MG Gouda. Asynchronous unison. In ICDCS’92 Proceedings of the 12th International Conference on Distributed Computing Systems, pages 486–493, 1992.
S Dolev and T Herman. Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science, 3(4), 1997.
S Dolev, DK Pradhan, and JL Welch. Modified tree structure for location management in mobile environments. Computer Communications, 19:335–345, 1996.
S Dolev, A Israeli, and S Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3–16, 1993.
S Ghosh. Agents, distributed algorithms, and stabilization. In Computing and Combinatorics (COCOON 2000), Springer-Verlag LNCS:1858, pp. 242–251, 2000.
MG Gouda and F Haddix. The linear alternator. In Proceedings of the Third Workshop on Self-Stabilizing Systems, pp. 31–47. Carleton University Press, 1997.
MG Gouda and F Haddix. The alternator. In Proceedings of the Third Workshop on Self-Stabilizing Systems (published in association with ICDCS’99 The 19th IEEE International Conference on Distributed Computing Systems), pp. 48–53. IEEE Computer Society, 1999.
MG Gouda and T Herman. Stabilizing unison. Information Processing Letters, 35:171–175, 1990.
SKS Gupta, A Bouabdallah, and PK Srimani. Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks (research note). In Euro-par 2000 Parallel Processing, Proceedings LNCS:1900, pp. 600–604, 2000.
CAR Hoare. Communicating Sequential Processes. Communications of the ACM, 21(8):666–677, 1978.
ST Huang. The fuzzy philosophers. In Parallel and Distributed Processing (IPDPS Workshops 2000), Springer-Verlag LNCS:1800, pp. 130–136, 2000.
DS Milojicic, F Douglis (Editor), RG Wheeler. Mobility: Processes, Computers, and Agents, Addison-Wesley, 1999.
M Mizuno and H Kakugawa. A timestamp based transformation of self-stabilizing programs for distributed computing environments. In WDAG’96 Distributed Algorithms 10th International Workshop Proceedings, Springer-Verlag LNCS:1151, pp. 304–321, 1996.
M Mizuno and M Nesterenko. A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments. Information Processing Letters, 66(6):285–290, 1998.
M Nesterenko and A Arora. Stabilization-preserving atomicity refinement. In DISC99 Distributed Computing 13th International Symposium, Springer-Verlag LNCS:1693, pp. 254–268, 1999.
G Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herman, T., Masuzawa, T. (2001). Self-Stabilizing Agent Traversal. In: Datta, A.K., Herman, T. (eds) Self-Stabilizing Systems. WSS 2001. Lecture Notes in Computer Science, vol 2194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45438-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-45438-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42653-0
Online ISBN: 978-3-540-45438-0
eBook Packages: Springer Book Archive