Locality in distributed graph algorithms
SIAM Journal on Computing
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
| Hi-index | 0.00 |
In this brief announcement, we discuss the trade-off between the locality of information and the optimality of convergence for self-stabilization. We define the optimality of convergence, called monotonic stabilization, and propose a new metrics for the locality of information to achieve monotonic stabilization. Then, we examine the locality of many well-known distributed problems.