Fair circulation of a token

IEEE Transactions on Parallel and Distributed Systems

Volumn 13, Issue 4, 2002, Pages 367-372

  Ikeda, Satoshi ^b   Kubo, Izumi ^c   Okumoto, Norihiro ^d   Yamashita, Masafumi ^a,e  

^a IEEE   (Japan)

^b TOKYO UNIVERSITY OF AGRICULTURE AND TECHNOLOGY   (Japan)

^c HIROSHIMA UNIVERSITY   (Japan)

^d HITACHI LTD   (Japan)

^e KYUSHU UNIVERSITY   (Japan)

Author keywords

Cover time; Distributed systems; Random walk; Self stabilizing systems; Token circulation

Indexed keywords

COVER TIME; SELF STABILIZING SYSTEMS; TOKEN CIRCULATION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; RESPONSE TIME (COMPUTER SYSTEMS); TELECOMMUNICATION LINKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036530296     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.995817     Document Type: Article

References (10)

1. Random walks, universal traversal sequences, and the complexity of maze problems
2. Maximum hitting time for random walks on graphs
3. Collision among random walks on a graph
4. Token management schemes and random walks yield self stabilizing mutual exclusion
5. Randomized algorithms
6. Self-stabilization