Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Reverse path forwarding of broadcast packets
Communications of the ACM
Broadcast protocols in packet switched computer networks.
Broadcast protocols in packet switched computer networks.
The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A resilient distributed protocol for network synchronization
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Epidemic algorithms for replicated database maintenance
ACM SIGOPS Operating Systems Review
Distributed process groups in the V Kernel
ACM Transactions on Computer Systems (TOCS)
Using History Information to Process Delayed Database Updates
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
On the complexity of computation in the presence of link failures: the case of a ring
Distributed Computing
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Feasibility and complexity of broadcasting with random transmission failures
Theoretical Computer Science
Hi-index | 0.00 |
We deal with communication networks whose topology changes arbitrarily subject to the restriction that no edge-cut in the network persists forever. Up to now, no formal-ground rules have been proposed for such networks, and no protocol has been proved to possess any desirable property. We introduce a new proof methodology, in the sense that link-behavior in such networks is axiomatized. Our methodology is exemplified on broadcast protocols. A reliable broadcast protocol must deliver copies of a message to all nodes in a communication network, in finite time and in the correct order. No existing broadcast protocol with a reasonable cost is reliable, and in fact, one is inclined to believe that a communication protocol cannot be reliable, unless it knows in advances which links will fail in the future, or sends the information along all links. However, we present a new broadcast protocol which does achieve reliability with minimum cost. Moreover, in stable networks, minimum delay is achieved, too. As a by-product, we achieve a new reliable routing protocol. The main idea of our protocol is to perform the broadcast along a dynamic tree, such that the father of each node is the neighbor which has received the maximum number of messages. This guarantees that the tree will eventually reconnect each sub-network to its complement.