Skip to main content

Agents, Distributed Algorithms, and Stabilization

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2000)

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

Included in the following conference series:

Abstract

This note illustrates the use of agents in the stabilization of distributed systems. The goal is to build stabilizing systems on the Internet, where the component processes are not under the control of a single administration. Two examples are presented to illustrate the idea: the first is that of mutual exclusion on a unidirectional ring, and the second deals with the construction of a DFS spanning tree.

This research was supported in part by the National Science Foundation under grant CCR-9901391, and by the Alexander Von Humboldt Foundation, Germany while the author was visiting the University of Dortmund.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arora, A., Gouda, M.G.: Closure and Convergence: A Foundation of Fault-tolerant Computing. IEEE Transactions on Software Engineering, Volume 19 (1993) 1015–1027.

    Article  Google Scholar 

  2. Chandy K.M., Lamport L.: Distributed Snapshots: Determining Global States of a Distributed System. ACM Trans. Computer Systems, Volume 3, No. 1 (1985) 63–75.

    Article  Google Scholar 

  3. N.S. Chen,_ H.P. Yu, S.T. Huang.: A Self-Stabilizing Algorithm for Constructing a Spanning Tree. Information Processing Letters, Volume 39 (1991) 147–151.

    Article  MATH  MathSciNet  Google Scholar 

  4. Dijkstra, E.W.: Self-Stabilizing Systems In Spite of Distributed Control. Communications of the ACM, Volume 17 (1974) 643–644.

    Article  MATH  Google Scholar 

  5. Gouda M.G., Haddix F.: The Stabilizing Token Ring in Three Bits. Journal of Parallel and Distributed Computing, Volume 35 (1996) 43–48.

    Article  MATH  Google Scholar 

  6. Katz, S., Perry K.: Self-Stabilizing Extensions for Message-passing Systems. Proc. 9th Annual Symposium on Principles of Distributed Computing (1990) 91–101.

    Google Scholar 

  7. Gray Robert, 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghosh, S. (2000). Agents, Distributed Algorithms, and Stabilization. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-44968-X_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67787-1

  • Online ISBN: 978-3-540-44968-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics