Loading...
Please wait, while we are loading the content...
Optimal PIF In Tree Networks (1999)
| Content Provider | CiteSeerX |
|---|---|
| Author | Bui, Alain Datta, Ajoy K. Petit, Franck Villain, Vincent |
| Description | In this paper, we consider rooted tree networks, as well as trees without sense of direction. We propose a new PIF scheme, called Propagation of Information with Feedback and Cleaning (PF C ). We present both selfstabilizing and snap-stabilizing PF C algorithms. A self-stabilizing system, regardless of the initial states of the processors and initial messages in the links, is guaranteed to converge to the intended behavior in finite time. A snap-stabilizing 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. All the proposed algorithms are optimal PIF schemes in terms of the number of states and/or stabilization time. Keywords Fault-tolerance, optimality, PIF, self-stabilization, snap-stabilization, synchronization. 1 Introduction Fault-tolerance is one of the most important requirements of modern ... |
| File Format | |
| Language | English |
| Publisher | Carleton Univerty Press |
| Publisher Date | 1999-01-01 |
| Publisher Institution | In Proceedings of DIMACS Workshop on Distributed Data and Structures |
| Access Restriction | Open |
| Subject Keyword | Important Requirement Arbitrary System Configuration New Pif Scheme Snap-stabilizing Pf Algorithm Optimal Pif Scheme Snap-stabilizing Protocol Stabilization Time Initial Message Keywords Fault-tolerance Snap-stabilizing Protocol Guarantee Optimal Pif Self-stabilizing Protocol Introduction Fault-tolerance Tree Network Self-stabilizing System Initial State Finite Time |
| Content Type | Text |
| Resource Type | Article |
