Journal article icon

Journal article

On stabilization in Herman's algorithm

Abstract:

Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics of the protocol very difficult to analyze. In this paper we study the expected time to stabilization in terms of the initial configuration. It is straightforward that the algorithm achieves stabilization almost surely from any initial configuration, and it is known that the worst-case expected time to stabilization (wi...

Expand abstract

Actions


Access Document


Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
Journal:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume:
6756 LNCS
Issue:
PART 2
Pages:
466-477
Publication date:
2011-01-01
DOI:
EISSN:
1611-3349
ISSN:
0302-9743
URN:
uuid:ac8f67cc-7a41-4bb9-a0de-bd211031b620
Source identifiers:
166772
Local pid:
pubs:166772
Language:
English

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP