End-to-end communication in unreliable networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Tight bounds for the sequence transmission problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A quantitative approach to dynamic networks
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Bootstrap network resynchronization (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Connection-based communication in dynamic networks
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The slide mechanism with applications in dynamic networks
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The impossibility of implementing reliable communication in the face of crashes
Journal of the ACM (JACM)
Reliable communication over unreliable channels
Journal of the ACM (JACM)
Connection management without retaining information
Information and Computation
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
The complexity of end-to-end communication in memoryless networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Short Headers Suffice for Communication in a DAG with Link Failures
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Tight Size Bounds for Packet Headers in Narrow Meshes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Towards a formalism for routing in challenged networks
Proceedings of the second ACM workshop on Challenged networks
Pragmatic self-stabilization of atomic memory in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing mobile node location management and message routing
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 14.99 |
An end-to-end data delivery protocol for dynamic communication networks is presented. The protocol uses bounded sequence numbers and can tolerate both link failures and (intermediate) processor crashes. Previous bounded end-to-end protocols could not tolerate crashes.We present a self-stabilizing version of the algorithm that can recover from crashes of the sender and the receiver as well as of intermediate processors. Starting with the network in an arbitrary state, the self-stabilizing version guarantees proper transmission of messages following a finite convergence period.