Fast Data Collection in Multipath Routing With Independent Directed Acyclic Graphs
نویسندگان
چکیده
in this paper, we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) to achieve resilient multipath routing. The algorithm developed in this paper: (1) achieves multipath routing; (2) guarantees recovery from single link failure. The multipath routing scheme consists of an algorithm to determine a set of multiple disjoint or partially disjoint paths and a mechanism for distributing traffic over a multipath route to reduce the traffic load on a congested link. Multipath routing is capable of aggregating the resources of multiple paths and reducing the blocking capabilities in QoS oriented networks, allowing data transfer at higher rate when compared to single path. To improve the failure resiliency without jeopardizing the routing stability, we propose a local rerouting based approach called failure insensitive routing. Under this approach, upon a link failure, adjacent router suppresses global updating and instead initiates local rerouting. We demonstrate that the proposed approach provides higher service availability than the existing routing
منابع مشابه
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 li...
متن کاملA Literature Review of Reliable Multipath Routing Techniques
Nowadays the demand of network is increasing rapidly. The ever increasing usage of such network requirements additionally demands fast recovery from network failures. Multipath routing is one in all the most promising routing schemes to accommodate the various needs of the network. It has basic features like load balancing and improved bandwidth. Author Cho et al. introduced a reliable multipat...
متن کاملOn the Broadcast Routing Problem
Given an undirected graph G = (V,E), and a vertex r ∈ V , an r-acyclic orientation of G is an orientation OE of the edges of G such that the digraph OG = (V,OE) is acyclic and r is the unique vertex with indegree equal to 0. For w ∈ RE+, k(G,w) is the w-maximum packing of r-arborescences for all r ∈ V and all racyclic orientations OE of G. In this case, the Broadcast Routing (in Computers Netwo...
متن کامل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...
متن کاملLoop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented, validated, and analyzed. According to this algorithms, which is called DASM (Diffusing Algorithm for Shortest Multipath), each router maintains a set of entries for each destination in its routing table, and each such entry consists of a...
متن کامل