The impossibility of implementing reliable communication in the face of crashes
Journal of the ACM (JACM)
Connection management without retaining information
Information and Computation
Computer networks (3rd ed.)
The complexity of crash failures
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
Stabilizing Inter-domain Routing in the Internet (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Stabilizing inter-domain routing in the Internet
Journal of High Speed Networks - Self-Stabilizing Systems, Part 1
Route preserving stabilization
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Snap-stabilization in message-passing systems
Journal of Parallel and Distributed Computing
Algorithms and theory of computation handbook
Low communication self-stabilization through randomization
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Formal proof of impossibility of reliability in crashing protocols
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
| Hi-index | 0.00 |
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driven to arbitrary global states, where each node is in a state reached in some (possibly different) execution, and each link has an arbitrary mixture of packets sent in (possibly different) executions. Our theorem considerably generalizes an earlier result, due to Fekete et al., which states that there is no correct crashing Data Link Protocol. For example, we prove that there is no correct crashing protocol for token passing and for many other resource allocation protocols such as k-exclusion, and the drinking and dining philosophers problems. We further characterize the reachable states caused by crash failures using reliable non-FIFO and reliable FIFO links. We show that with reliable non-FIFO links any acyclic subset of nodes and links can be driven to arbitrary states. We show that with reliable FIFO links, only nodes can be driven to arbitrary states. Overall, we show a strict hierarchy in terms of the set of states reachable by crash failures in the three link models.