The Slide Mechanism with Applications in Dynamic Networks (1992)
| Venue: | In Proceedings of the 11th ACM Symposium on Principles of Distributed Computing |
| Citations: | 21 - 3 self |
BibTeX
@INPROCEEDINGS{Afek92theslide,
author = {Yehuda Afek and Eli Gafni and Adi Rosen},
title = {The Slide Mechanism with Applications in Dynamic Networks},
booktitle = {In Proceedings of the 11th ACM Symposium on Principles of Distributed Computing},
year = {1992},
pages = {35--46}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
) Yehuda Afek Eli Gafni y Adi Ros'en z Abstract This paper presents a simple and efficient building block, called slide, for constructing communication protocols in dynamic networks whose topology frequently changes. We employ slide to derive (1) an end-to-end communication protocol with optimal amortized message complexity, and (2) a general method to efficiently and systematically combine dynamic and static algorithms. (Dynamic algorithms are designed for dynamic networks, and static algorithms work in networks with stable topology.) The new end-to-end communication protocol has amortized message communication complexity O(n) (assuming that the sender is allowed to gather enough data items before transmitting them to the receiver), where n is the total number of nodes in the network (the previous best bound was O(m), where m is the total number of links in the network). This protocol also has bit communication complexity O(nD), where D is the data item size in bits (assuming ...
