Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

Abstract

Abstract-We present a new algorithm which creates redundant trees on arbitrary node-redundant or link-redundant networks. These trees are such that any node is connected to the common root of the trees by at least one of the trees in case of node or link failure. Our scheme provides rapid preplanned recovery of communications with great flexibility in the topology design. Unlike previous algorithms, our algorithm can establish two redundant trees in the case of a node failing in the network. In the case of failure of a communications link, our algorithm provides a superset of the previously known trees.

Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees

“…In the redundant tree protocol [7], [13]- [15], a packet from a node to a node is transmitted from to the root node and then from the root node to . For example, a packet from to in Fig.…”

“…In Section II, we introduce concepts and definitions relating to fast recovery using redundant trees and define the optimization problems involving quality-of-service (QoS) and QoP. In Section III, we first present the MFBG scheme of [15] and illustrate this with an example. We then present a scheme, called the G-MFBG scheme, which generalizes the MFBG scheme.…”

“…ROTECTION and restoration in high-speed networks is an important issue that has been studied extensively [1], [6], [7], [13]- [15], [17], [19], [20], [22], [25], [26], [30]- [33]. It has important applications in synchronous optical network (SONET) and wavelength-division multiplexing (WDM) networks [1], [4], [5], [10], [18]- [20], [29], [35].…”

“…It has important applications in synchronous optical network (SONET) and wavelength-division multiplexing (WDM) networks [1], [4], [5], [10], [18]- [20], [29], [35]. In [15], Médard et al proposed a tree-based preplanned recovery scheme (we will call it the MFBG scheme), which is applicable to any protocol, in particular, WDM, SONET, and ATM, which allows the use of tree routings and redundancy for recovery from failures. For two-connected graphs, the MFBG scheme constructs two directed trees rooted at the root node.…”

Candidate-cycle-based heuristic algorithm for node-and-link protection of dynamic multicast traffic in optical DWDM networks

“…Five major multicast protection approaches are proposed in the literature and most of them focus on link failure recovery: 1) tree-based protection [1]- [2]- [3], 2) path-based protection [4]- [5], 3) segment-based protection [6]- [7], 4) ring-based protection [8]- [9], and 4) p-cycle (preconfigured protection cycle) based protection [10]- [11]. In [12], G. Xue et al propose to deploy two link-disjoint light-trees: an active lighttree and a backup light-tree.…”