Loading...
Please wait, while we are loading the content...
Similar Documents
Self-stabilization by Counter Flushing (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Varghese, George |
| Description | In PODC94 Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing A useful way to design simple and robust protocols is to make them self-stabilizing. A protocol is said to be self-stabilizing if it begins to exhibit correct behavior even after starting in an arbitrary state. We describe a simple technique for self-stabilization called counter flushing which is applicable to a number of distributed algorithms. We show how our technique helps to understand and improve some previous distributed algorithms. We also apply it to create new self-stabilizing protocols for propagation of information with feedback and resets. The resulting protocols are simple, require few changes from the non-stabilizing equivalents, and have fast stabilization times. Keywords. distributed algorithms, self-stabilization AMC subject classifications. 68Q22, 68Q60, 68Q25 1 Introduction As the world moves from an industrial economy to an information based economy, we are already dependent on networks and will become even more so. Most users of data networks, however, agree t... |
| File Format | |
| Language | English |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Subject Keyword | Distributed Algorithm New Self-stabilizing Protocol Robust Protocol Stabilization Time Resulting Protocol Non-stabilizing Equivalent Simple Technique Data Network Self-stabilization Amc Subject Classification Counter Flushing Correct Behavior Arbitrary State Useful Way Industrial Economy |
| Content Type | Text |
| Resource Type | Article |
