Fault-containing network protocols

Abstract

Self-stabilization is a simple and elegant approach towards designing fault-tolerant network protocols. While self-stabilization provides automatic recovery from arbitrary transient faults, self-stabilizing systems do not incorporate any optimization for more efficient recovery from limited transient faults, even though such limited faults are more likely to occur in practice than arbitrary faults. Fault-containing self-stabilizing protocols are proposed to efficiently contain the effects of more frequent, limited transient faults while retaining the desirable property of self-stabilization. In this paper, we propose a methodology for designing fault-containing selfstabilizing network protocols. The methodology views the properties of self-stabilization and fault-containment in separation. Since self-stabilizing protocols already exist for many important network problems, the design starts with an existing self-stabilizing protocol, and adds to it the fault-containment property. The feasibilitv of this technique is illustrated bv the design of a fault-containing self-stabilizing protocol for the breadthfirst-search (BFS) spanning tree problem. The applicability of the technique used in deriving the BFS protocol to other problems is also discussed.

Energy optimization for proactive unicast route maintenance in MANETs under end-to-end reliability requirements

“…Further, it allows higher scalability of the proactive protocols with increased network size. [22], TBRPF [5]) PP+BP (FSR [21], IARP [12]) PP+BT (WRP [19], STAR [7]) PP+B (BFST [9], SS-SPST [11]) Table 2 Symbols and Definitions. Table 5 Variation of β opt and ϕ opt ('↑', '↓', and '−' mean "increase", "decrease", & "no change" respectively).…”

Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property

“…We consider a subclass of fault-containing protocols Π such that each ffault-containing protocol P ∈ Π satisfies Assumption 2, 3, 4, and 5. Many existing fault-containing protocols satisfy Assumption 2, 3, 4, and 5 [15], [17], [18], [21].…”

“…We can obtain a more accurate value of the inconsistency range by analyzing the behavior of the protocol. In many 1-fault-containing protocols [15], [17], [18], [21], inconsistency range is 1: in theses protocols, in a 1-faulty configuration the faulty process or its neighbors may suspect it is faulty and exchange the local information with neighbors. If a correct process finds the faulty process, the process waits until the faulty process changes its variables.…”

“…An f -fault-containing self-stabilizing protocol promises self-stabilization and fault-containment [15]- [17], [21]: from any f -faulty configuration ( f ≤ f ), it reaches a legitimate configuration in the time and in the space depending on f or less. (We call it f -fault-containing protocol.)…”

Best-effort group service in dynamic networks

“…Self-stabilization property needs then to be completed. This has been studied in [21,15,23,30]. In this paper, we propose another way by adding the notion of continuity to the self-stabilization.…”