Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Self-Stabilizing Systems

WSS 2001: Self-Stabilizing Systems pp 152–166Cite as

Self-Stabilizing Agent Traversal

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2194))

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.

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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A Arora, S Dolev, and MG Gouda. Maintaining digital clocks in step. Parallel Processing Letters, 1:11–18, 1991.

    Article  Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. E Bonabeau and G Théraulaz. Swarm smarts. Scientific American, pp. 72–79, March 2000.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. S Dolev and T Herman. Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science, 3(4), 1997.

    Google Scholar 

  8. S Dolev, DK Pradhan, and JL Welch. Modified tree structure for location management in mobile environments. Computer Communications, 19:335–345, 1996.

    Article  Google Scholar 

  9. S Dolev, A Israeli, and S Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3–16, 1993.

    Article  Google Scholar 

  10. S Ghosh. Agents, distributed algorithms, and stabilization. In Computing and Combinatorics (COCOON 2000), Springer-Verlag LNCS:1858, pp. 242–251, 2000.

    Chapter  Google Scholar 

  11. 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.

    Google Scholar 

  12. 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.

    Google Scholar 

  13. MG Gouda and T Herman. Stabilizing unison. Information Processing Letters, 35:171–175, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  14. 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.

    Chapter  Google Scholar 

  15. CAR Hoare. Communicating Sequential Processes. Communications of the ACM, 21(8):666–677, 1978.

    Article  Google Scholar 

  16. ST Huang. The fuzzy philosophers. In Parallel and Distributed Processing (IPDPS Workshops 2000), Springer-Verlag LNCS:1800, pp. 130–136, 2000.

    Chapter  Google Scholar 

  17. DS Milojicic, F Douglis (Editor), RG Wheeler. Mobility: Processes, Computers, and Agents, Addison-Wesley, 1999.

    Google Scholar 

  18. 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.

    Google Scholar 

  19. 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.

    Article  MATH  Google Scholar 

  20. M Nesterenko and A Arora. Stabilization-preserving atomicity refinement. In DISC99 Distributed Computing 13th International Symposium, Springer-Verlag LNCS:1693, pp. 254–268, 1999.

    Google Scholar 

  21. G Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Iowa, USA

    Ted Herman

  2. Osaka University, Japan

    Toshimitsu Masuzawa

Authors
  1. Ted Herman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshimitsu Masuzawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Nevada, Box 454019, Las Vegas, NV, 89154-4019, USA

    Ajoy K. Datta

  2. Department of Computer Science, University of Iowa, Iowa City, IA, 52242, USA

    Ted Herman

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation