The Wandering Token: Congestion Avoidance of a Shared Resource

  • Augusto Ciuffoletti


Shared Resource Mutual Exclusion Interarrival Time Congestion Avoidance Token Passing 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Afek, Y. and Brown, G. (1993). Self-stabilization over unreliable communication media. Distributed Computing, 7(1):27-34.CrossRefGoogle Scholar
  2. Bshouty, N. H., Higham, L., and Warpechowska-Gruca, J. (1999). Meeting times of random walks on graphs. Information Processing Letters, 69(5):259-265.CrossRefMathSciNetGoogle Scholar
  3. 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
  4. Dijkstra, E. W. (1974). Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644.MATHCrossRefGoogle Scholar
  5. 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.CrossRefGoogle Scholar
  6. Jonasson, J. (1998). On the cover time of random walks on random graphs. Combinatorics, Probability and Computing, (7):265-279.Google Scholar
  7. 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

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Augusto Ciuffoletti
    • 1
  1. 1.Resource and Workflow Monitoring Services INFN/CNAFCoreGRID Institute of Grid InformationBologna

Personalised recommendations