.png){kind=icon}
Return
Token-based self-stabilizing uniform algorithms
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.2001.1832.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This work focuses on self-stabilizing algorithms for mutual exclusion and leader election-two fundamental tasks for distributed systems. Self-stabilizing systems are able to recover by themselves, regaining their consistency from any initial or intermediary faulty configuration. The proposed algorithms are designed for any directed, anonymous network and stabilize under any distributed scheduler. The keystones of the algorithms are the token management and routing policies. In order to break the network symmetry, randomization is used. The space complexity is O((D+ + D-)(log(snd(n)) = 2)) where it is the network size, snd(n) is the smallest integer that does not divide n and D+ and D- are the maximal out and in degree, respectively. It should be noted that snd(n) is constant on the average and equals 2 on odd-size networks. (C) 2002 Elsevier Science (USA).
Keywords:
self-stabilization
randomized protocol
unfair scheduler
leader election
mutual exclusion
directed network
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
Use of cross correlation in studying the response of lightly damped structures to random forces..png)
AIAA Journal
AIAA JournalIF0
PREAI
ShareSave
ShareSave
ShareSave no more
no more