Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
Meeting times of random walks on graphs
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
Distributed Token Circulation on Mobile Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
On the Cover Time for Random Walks on Random Graphs
Combinatorics, Probability and Computing
Topological adaptability for the distributed token circulation paradigm in faulty environment
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Secure token passing at application level
Future Generation Computer Systems
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In a distributed system where scalability is an issue, the problem of enforcing mutual exclusion often arises in a soft form: the infrequent failure of the mutual exclusion predicate is tolerated, without compromising the consistent operation of the overall system. For instance this occurs when the operation subject to mutual exclusion requires massive use of a shared resource. We introduce a scalable soft mutual exclusion algorithm, based on token passing: one distinguished feature of our algorithm is that instead of introducing an overlay topology we adopt a random walk approach. The consistency of our proposal is evaluated by simulation, and we exemplify its use in the coordination of large data transfers in a backbone based network. This algorithm is studied in the frame of the CoreGRID Institute of Grid Information, Resource and Workflow Monitoring Services, in cooperation with the FORTH Institute, in Greece.