ACM Home Page
Please provide us with feedback. Feedback
Brief announcement: optimal self-stabilizing multi-token ring: a randomized solution
Full text PdfPdf (433 KB)
Source
Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the 28th ACM symposium on Principles of distributed computing table of contents
Calgary, AB, Canada
SESSION: B2-1 table of contents
Pages 302-303  
Year of Publication: 2009
ISBN:978-1-60558-396-9
Authors
Andrew Berns  University of Iowa, Iowa City, IA, USA
Anurag Dasgupta  University of Iowa, Iowa City, IA, USA
Sukumar Ghosh  University of Iowa, Iowa City, IA, USA
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 23,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1582716.1582777
What is a DOI?

ABSTRACT

The token ring is a seminal topic in self-stabilization research. It has been expanded to include multiple tokens, and improved upon using randomization to lower the state space requirements. In this brief announcement, we discuss how the two ideas can be brought together for an optimal solution to the multi-token ring problem.



Collaborative Colleagues:
Andrew Berns: colleagues
Anurag Dasgupta: colleagues
Sukumar Ghosh: colleagues