Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The complexity of crash failures
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Information Processing Letters
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Stabilization-Preserving Atomicity Refinement
Proceedings of the 13th International Symposium on Distributed Computing
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
Self-Stabilizing Real-Time OPS5 Production Systems
IEEE Transactions on Knowledge and Data Engineering
An efficient leader election protocol for mobile networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
A local self-stabilizing enumeration algorithm
DAIS'06 Proceedings of the 6th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
| Hi-index | 0.00 |
Abstract: The paper dispels the myth that it is impossible for any stabilizing message-passing program to be terminating. We identify fixpoint-symmetry as a necessary condition for a message-passing stabilizing program to be terminating. Our results do confirm that a number of well-known input-output problems (e.g., leader election and consensus) do not admit a terminating and stabilizing solution. On the flip side, they show that reactive problems such as mutual exclusion and reliable-transmission do admit such solutions. We go on to present stabilizing and terminating programs for both problems. Also, we describe a way to add termination to a stabilizing program, and demonstrate it in the context of our design of a solution to the reliable- transmission problem.