Skip to main content
SpringerLink
Log in

The Wandering Token: Congestion Avoidance of a Shared Resource

  • Conference paper
Distributed and Parallel Systems

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

Access this chapter

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 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Afek, Y. and Brown, G. (1993). Self-stabilization over unreliable communication media. Distributed Computing, 7(1):27-34.

    Article  Google Scholar 

  • Bshouty, N. H., Higham, L., and Warpechowska-Gruca, J. (1999). Meeting times of random walks on graphs. Information Processing Letters, 69(5):259-265.

    Article  MathSciNet  Google Scholar 

  • Ciuffoletti, A. (2006). Scalable accessibility of a recoverable database using a wandering token. Technical Report TR-06-02, Università di Pisa, Largo Pontecorvo - Pisa -ITALY.

    Google Scholar 

  • Dijkstra, E. W. (1974). Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644.

    Article  MATH  Google Scholar 

  • Israeli, A. and Jalfon, M. (1990). Token management schemes and random walks yield self stabilizing mutual exclusion. In Proceedings of the Ninth Annual ACM Symposium on Distributed Computing, pages 119-129, Quebec City, Quebec, Canada.

    Chapter  Google Scholar 

  • Jonasson, J. (1998). On the cover time of random walks on random graphs. Combinatorics, Probability and Computing, (7):265-279.

    Google Scholar 

  • Kwon, G. and Byers, J. (2003). ROMA: Reliable overlay multicast with loosely coupled TCP connections. Technical Report BU-CS-TR-2003-015, Boston University.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Resource and Workflow Monitoring Services INFN/CNAF, CoreGRID Institute of Grid Information, 40127, Via Berti Pichat, Bologna

    Augusto Ciuffoletti

Authors
  1. Augusto Ciuffoletti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lab. Parallel and Distributed Systems, MTA SZTAKI Research Institute, Victor Hugo u. 18-22, 1132, Budapest, Hungary

    Péter Kacsuk

  2. Institut für Informatik, University of Innsbruck, Technikerstr. 21a, 6020, Innsbruck, Austria

    Thomas Fahringer

  3. Lab. Parallel and Distributed Systems, MTA SZTAKI Research Institute, Victor Hugo u. 18-22, 1132, Budapest, Hungary

    Zsolt Németh

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Science+Business Media, LLC

About this paper

Cite this paper

Ciuffoletti, A. (2007). The Wandering Token: Congestion Avoidance of a Shared Resource. In: Kacsuk, P., Fahringer, T., Németh, Z. (eds) Distributed and Parallel Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-69858-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-69858-8_1

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-69857-1

  • Online ISBN: 978-0-387-69858-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation