Maintenance of a Spanning Tree in Dynamic Networks
Proceedings of the 13th International Symposium on Distributed Computing
| Hi-index | 0.00 |
A framework is introduced that provides a unified way for proving correctness as well as analyzing performance of a class of communication protocols called (asynchronous) reset protocols. They are logarithmic transformers, converting protocols working in a static asynchronous network into protocols working in a dynamic asynchronous network. The design of reset protocols is a classical problem in communication networking, renowned for its complexity. A paradigm is developed that gives fresh insight into this complicated problem. This additional insight leads to the development of reset protocols with complexities bounded by the communication complexity of the original protocol.