Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Self-Stabilizing Systems

WSS 2001: Self-Stabilizing Systems pp 1–18Cite as

Cooperating Mobile Agents and Stabilization

  • Conference paper
  • First Online:

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

Abstract

In the execution of distributed algorithms on a network of processes, the actions of the individual processes are scheduled by their local schedulers or demons. The schedulers communicate with their immediate neighbors using shared registers or message passing. This paper examines an alternative approach to the design of distributed algorithms, where mobile agents are allowed to traverse a network, extract state information, and make appropriate modification of the local states to steer the system towards a global goal. The primary emphasis of this paper is system stabilization. Both single-agent and multi-agent protocols are examined, and the advantages and disadvantages of agent-based stabilization are discussed.

This research was supported in part by the National Science Foundation under grant CCR-9901391.

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. Araragi T, Attie P, Keidar I, Kogure K, Luchanugo V, Lynch N, Mano K. On formal modeling agent computations. NASA Workshop on Formal Approaches to Agent-based Systems (2000).

    Google Scholar 

  2. Wang YM, Russell W, and Arora A. A toolkit for building dependable and extensible home networking applications. Fourth USENIX Windows Systems Symposium USENIX-WIN 2000 (2000)

    Google Scholar 

  3. Arora A, Gouda MG. Closure and convergence: A foundation of fault-tolerant computing. IEEE Transactions on Software Engineering 19 (1993) pp. 1015–1027.

    Article  Google Scholar 

  4. Arora A, Gouda MG. Distributed reset. IEEE Transactions on Computers 43 (1994) pp. 1026–1038, 1994.

    Article  MATH  Google Scholar 

  5. Chandra TD, Toueg S. Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43:2 (1996) pp. 225–267.

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen NS, Yu HP, Huang ST. A self-stabilizing algorithm for constructing a spanning tree. Information Processing Letters 39 (1991) pp.147–151.

    Article  MATH  MathSciNet  Google Scholar 

  7. Dijkstra EW. Self stabilizing systems in spite of distributed control. Communications of the ACM 17 (1974) pp. 643–644.

    Article  MATH  Google Scholar 

  8. Dorigo M, Maniezzo V, and Colorni A. The Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics 26:1 (1996) pp. 1–13.

    Google Scholar 

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

    Chapter  Google Scholar 

  10. Gouda MG, Haddix F. The alternator. Proceedings of the Third Workshop on Self-Stabilizing Systems. (published in association with ICDCS’99. The 19th IEEE International Conference on Distributed Computing Systems), pages 48–53, 1999.

    Google Scholar 

  11. Herman T. Self-stabilization: randomness to reduce space. Distributed Computing 6 (1992) pp. 95–98.

    Article  MATH  MathSciNet  Google Scholar 

  12. Korach E, Kutten S, and Moran S. A modular technique for the design of efficient leader finding algorithms. ACM Transactions on Programming Languages and Systems 12 (1990), pp. 84–101.

    Article  Google Scholar 

  13. Katz S, Perry K. Self-stabilizing extensions for message-passing systems. Proceedings of 9th Annual Symposium on Principles of Distributed Computing (1990) pp. 91–101.

    Google Scholar 

  14. Gray R, Kotz D, Nog S, Rus D, Cybenko G. Mobile agents for mobile computing. Proceedings of the Second Aizu International Symposium on Parallel Algorithms/ Architectures Synthesis, Fukushima, Japan (1997).

    Google Scholar 

  15. Tel G. Introduction to Distributed Algorithms. Cambridge University Press (1994).

    Google Scholar 

  16. Varghese G. Self-stabilization by counter flushing. SIAM Journal on Computing, 30(2):486–510, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  17. White T, and Pagurek B. Towards multi-swarm problem solving in networks. Proceedings of the Third International Conference on Multi-Agent Systems (ICMAS’98), July 1998, pp. 333–340.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Iowa, USA

    Sukumar Ghosh

Authors
  1. Sukumar Ghosh
    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

Ghosh, S. (2001). Cooperating Mobile Agents and Stabilization. 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_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-45438-1_1

  • 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