DMCA
State-Optimal Snap-Stabilizing PIF in Tree Networks (Extended Abstract) (1999)
| Venue: | In Proceedings of the Fourth Workshop on Self-Stabilizing Systems |
| Citations: | 64 - 29 self |
BibTeX
@INPROCEEDINGS{Bui99state-optimalsnap-stabilizing,
author = {Alain Bui and Ajoy K. Datta and Franck Petit and Vincent Villain},
title = {State-Optimal Snap-Stabilizing PIF in Tree Networks (Extended Abstract)},
booktitle = {In Proceedings of the Fourth Workshop on Self-Stabilizing Systems},
year = {1999},
pages = {78--85},
publisher = {IEEE Computer Society Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
) Alain Bui, 1 Ajoy K. Datta, 2 Franck Petit, 1 Vincent Villain 1 1 LaRIA, Universit e de Picardie Jules Verne, France 2 Department of Computer Science, University of Nevada, Las Vegas Abstract In this paper, we introduce the notion of snapstabilization. A snap-stabilizing algorithm protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in 0 steps. We propose a snap-stabilizing Propagation of Information with Feedback (PIF) scheme on a rooted tree network. We call this scheme Propagation of information with Feedback and Cleaning (PFC). We present two algorithms. The first one is a basic PFC scheme which is inherently snapstabilizing. However, it can be delayed O(h 2 ) steps (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic PFC algori...
Keyphrases
tree network extended abstract state-optimal snap-stabilizing pif la vega abstract second algorithm alain bui arbitrary system configuration snap-stabilizing protocol scheme propagation basic pfc algori snap-stabilizing propagation basic pfc scheme snap-stabilizing algorithm protocol guarantee undesirable local state computer science vincent villain picardie jules verne first one self-stabilizing protocol franck petit
