The Wandering Token: Congestion Avoidance of a Shared Resource
KeywordsShared 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.
- 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
- 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
© Springer Science+Business Media, LLC 2007