Fault-tolerant Multicast Routing Research Articles

Fault-tolerant multicast routing in infocommunication network with path and bandwidth protection

The article presents and investigates a flow-based mathematical model of fault-tolerant multicast routing. Under the proposed mathematical model, the technical task of fault-tolerant multicast routing was reduced to the Boolean programming optimization problem. The mathematical model was based on linear optimality criterion and constraints represented by the conditions of single-path routing, flow conservation, multicast connectivity, and prevention of overload and looping. The routing variables that guided the multicast routing process were Boolean. The optimal primary and backup paths are calculated by implementing path and bandwidth protection schemes within the model for each multicast flow. The restrictions on routing variables introduced into the model were responsible for protecting the route and bandwidth. The optimality criterion in determining the optimal and backup multicast paths at the level of routing metrics considered the network topology and links bandwidth. The additive nature of the criterion focused on finding paths that included a minimum number of communication links. According to the selected routing metric, a feature of the model is to ensure priority in assigning the primary route of the path that had a shorter «length» than the backup path. The analysis of the obtained solutions confirmed their operability under the specified protection scheme’s implementation and their optimality according to variants of the used routing metrics. The proposed mathematical model can be used to develop the fault-tolerant multicast routing protocols of multimedia flows.

Congestion Control for Fault Tolerant Multicast Routing in MANET

Mobile Ad hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator a dynamic network consisting of several mobile nodes communicating wirelessly. MANET is an infrastructure less network and each member node is free to move in and out of the network in a random manner. Congestion may occur in any node when data packets travel from source to destination. Controlling congestion is critical to ensure adequate network operation and performance. Due to this mobile nature of the nodes in MANET, the possibility for the network to get congested is high. This may result in isolated nodes and reduced network performance. So in this paper, we proposed to develop a congestion control technique for fault tolerant multicast routing in MANET. In this technique, the congestion probability around the forwarding node is initially estimated and then according to the congestion level, the future transmission rates are adapted. The data transmission rate is varied dynamically to efficiently handle the congestion in the network. In this way, the network performance is enhanced.

Pseudo-cycle-based multicast routing in wormhole-routed networks

This paper addresses the problem of fault-tolerant multicast routing in wormhole-routed multicomputers. A new pseudo-cycle-based routing method is presented for constructing deadlock-free multicast routing algorithms. With at most two virtual channels this technique can be applied to any connected networks with arbitrary topologies. Simulation results show that this technique results in negligible performance degradation even in the presence of a large number of faulty nodes.

An efficient fault-tolerant multicast routing protocol with core-based tree techniques

In this paper, we design and analyze an efficient fault-tolerant multicast routing protocol. Reliable multicast communication is critical for the success of many Internet applications. Multicast routing protocols with core-based tree techniques (CBT) have been widely used because of their scalability and simplicity. We enhance the CBT protocol with fault tolerance capability and improve its efficiency and effectiveness. With our strategy, when a faulty component is detected, some pre-defined backup path(s) is (are) used to bypass the faulty component and enable the multicast communication to continue. Our protocol only requires that routers near the faulty component be reconfigured, thus reducing the runtime overhead without compromising much of the performance. Our approach is in contrast to other approaches that often require relatively large tree reformation when faults occur. These global methods are usually costly and complicated in their attempt to achieve theoretically optimal performance. Our performance evaluation shows that our new protocol performs nearly as well as the best possible global method while utilizing much less runtime overhead and implementation cost.

Fault-tolerant multicasting in MINs for ATM switches

This article proposes a fault-tolerant multicast routing algorithm in multistage interconnection networks (MINs) for ATM switch architectures. It employs both region and cube encoding schemes as the header encoding scheme. A multicast packet can be routed to its destinations in only two phases through the MIN having a single faulty element.