Link Independent and Node Independent Algorithms for Efficient Multipath Routing
نویسندگان
چکیده
Link-independent and node-independent DAGs satisfy the property that any path from a source to the root on one DAG is link-disjoint (node-disjoint) with any path from the source to the root on the other DAG. To achieve resilient multipath routing, first introduce the concept of independent directed acyclic graphs (IDAGs). For a given a network, we develop polynomialtime algorithms to compute link independent and node-independent DAGs. The algorithm developed in this paper is provides multipath routing, utilizes all possible edges, guarantees recovery from single link failure and achieves all these with at most one bit per packet as overhead when routing is based on destination address and incoming edge. Keywords— Directed acyclic graphs (DAGs), failure recovery, independent trees, IP fast rerouting, multipath routing, network protection.
منابع مشابه
Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملشیوه های توزیع بار در مهندسی ترافیک
Because of rapidly rising network traffic, ISP providers are trying to create new network structures and extend more resources to control the growth of demands. It is important to efficiently split the network bandwidth among different sources so that each user has enough bandwidth. Traffic engineering is used to achieve this goal. Performing reliable and efficient network ope...
متن کاملEvolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol
The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...
متن کاملScalable Techniques for Failure Recovery and localization
Failure localization and recovery is one of the most important issues in network management to provide continuous connectivity to users. In this dissertation, we develop several algorithms for network failure localization and recovery. First, to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs). Link-independent (Node-independent) DAGs s...
متن کاملEvaluating Multipath TCP Resilience against Link Failures
Standard TCP is the de facto reliable transfer protocol for the Internet. It is designed to establish a reliable connection using only a single network interface. However, standard TCP with single interfacing performs poorly due to intermittent node connectivity. This requires the re-establishment of connections as the IP addresses change. Multi-path TCP (MPTCP) has emerged to utilize multiple ...
متن کامل