Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing (original) (raw)

Multipath Routing With Directed Acyclic Graphs in MANETS

2020

Abstract: An approach for resilient multipath routing with independent directed acyclic graphs is presented in this paper and developed polynomial time algorithms to construct node independent and link independent DAGs using all possible edges in the network. In this multiple pairs of colored trees approaches to prove the validity of the algorithm. The IDAGs approach performs significantly better than the independent trees approach in terms of increasing no. of paths offered, reducing the probability of a two-link failure disconnecting a node from the destination and average link load. The trees based on the shortest paths on the IDAGs have better performance than that of the ITrees approach since the average shortest path length on the IDAGs is shorter than the average path length on the ITrees. Multiple pairs of colored trees approach is better in terms of the product of the no. of critical links and average link load compared to the ITrees and IDAGs approaches.Keywords: Multipath...

Survey of Multipath routing Methodology based on (Independent Directed Acyclic Graph) IDAG

International Journal of Engineering Sciences & Research Technology, 2014

In Networking when packet is send from source node to the destination node, there are different types of problems are occurred in path of that particular packet, that is Node Failure or Link Failure and many more, the result is that increasing of network traffic or Congestion & there is also the problem that packet not deliver to the node. To overcome these in networking to achieve the Multipath routing or Multipath Routing is very important, there are different things are available but the best result can be achieve with the help proposed system that is Yet Another Multipath Routing . In other Routing Mechanism packet dropping & Packet Redirection, Delay , is available, to overcome these Yet Another Multipath Routing scheme is Best. The algorithm in our system provides the: i) Multipath Routing with Network Efficiency, ii)Backup Link, iii)Packet Redirection, iv)Decrease the Packet Delay, V)Provides SECURITY.

A NOVEL SCHEME FOR RELIABLE MULTIPATH ROUTING THROUGH NODE-INDEPENDENT DIRECTED ACYCLIC GRAPHS

Multipath routing is essential in the wake of voice over IP, multimedia streaming for efficient data transmission. The growing usage of such network requirements also demands fast recovery from network failures. Multipath routing is one of the promising routing schemes to accommodate the diverse requirements of the network with provision such as load balancing and improved bandwidth. Cho et al. introduced a resilient multipath routing scheme known as directed acyclic graphs. These graphs enable multipath routing with all possible edges while ensuring guaranteed recovery from single point of failures. We also built a prototype application that demonstrates the efficiency of the scheme. The simulation results revealed that the scheme is useful and can be used in real world network applications.

Optimal multi-path routing and bandwidth allocation under utility max-min fairness

2009 17th International Workshop on Quality of Service, 2009

An important goal of bandwidth allocation is to maximize the utilization of network resources while sharing the resources in a fair manner among network flows. To strike a balance between fairness and throughput, a widely studied criterion in the network community is the notion of max-min fairness. However, the majority of work on max-min fairness has been limited to the case where the routing of flows has already been defined and this routing is usually based on a single fixed routing path for each flow. In this paper, we consider the more general problem in which the routing of flows, possibly over multiple paths per flow, is an optimization parameter in the bandwidth allocation problem. Our goal is to determine a routing assignment for each flow so that the bandwidth allocation achieves optimal utility max-min fairness with respect to all feasible routings of flows. We present evaluations of our proposed multi-path utility max-min fair allocation algorithms on a statistical traffic engineering application to show that significantly higher minimum utility can be achieved when multi-path routing is considered simultaneously with bandwidth allocation under utility maxmin fairness, and this higher minimum utility corresponds to significant application performance improvements.

An Approach for Resilient Multipath Routing With Independent Directed Acyclic Graphs

2020

Abstract: An approach for resilient multipath routing with independent directed acyclic graphs is presented in this paper and developed polynomial time algorithms to construct node independent and link independent DAGs using all possible edges in the network. In this multiple pairs of colored trees approaches to prove the validity of thealgorithm. The IDAGs approach performs significantly better than the independent trees approach in terms of increasing no. of paths offered, reducing the probability of a two-link failure disconnecting a node from the destination and average link load. The trees based on the shortest paths on the IDAGs have better performance than that of the ITrees approach since the average shortest path length on the IDAGs is shorter than the average path length on the ITrees. Multiple pairs of colored trees approach is better in terms of the product of the no. of critical links and average link load compared to the ITrees and IDAGs approaches.

On single-path network routing subject to max-min fair flow allocation

Fair allocation of flows in multicommodity networks has been attracting a growing attention. In Max-Min Fair (MMF) flow allocation, not only the flow of the commodity with the smallest allocation is maximized but also, in turn, the second smallest, the third smallest, and so on. Since the MMF paradigm allows to approximate the TCP flow allocation when the routing paths are given and the flows are elastic, we address the network routing problem where, given a graph with arc capacities and a set of origin-destination pairs with unknown demands, we must route each commodity over a single path so as to maximize the throughput, subject to the constraint that the flows are allocated according to the MMF principle. After discussing two properties of the problem, we describe a column generation based heuristic and report some computational results.

Routing with congestion in acyclic digraphs

Information Processing Letters, 2019

We study the version of the k-disjoint paths problem where k demand pairs (s 1 , t 1),. .. , (s k , t k) are specified in the input and the paths in the solution are allowed to intersect, but such that no vertex is on more than c paths. We show that on directed acyclic graphs the problem is solvable in time n O(d) if we allow congestion k − d for k paths. Furthermore, we show that, under a suitable complexity theoretic assumption, the problem cannot be solved in time f (k)n o(d/ log d) for any computable function f. Digital Object Identifier 10.4230/LIPIcs...

A New and Efficient Approach For Optimization Of Route Redistribution Network

A switch which is running from various steering forms does not as a matter of course of route redistribute courses among these procedures. Course redistribution (RR) should be expressly designed. Course redistribution (RR) has turned into a necessary piece of IP system plan as the aftereffect of a developing requirement for spreading certain courses crosswise over directing convention limits. While RR is generally utilized and looks like BGP as a part of a few nontrivial angles, shockingly, the wellbeing of RR has not been methodically contemplated by the systems administration group. Utilizing the model, we demonstrate that given a RR design, figuring out if the redistributions result in a cycle is NP-hard. Given this multifaceted nature, we display an adequate condition, which can be checked in polynomial time with the proposed expository model, for guaranteeing the wellbeing of a RR design. The setup and operation of RR can be mind boggling. In Cisco, course delineates system overseers to change the courses, organize the got declarations (by doling out various AD values) and adjust the qualities of the redistributed courses.. In opposition to most directing conventions which advance a metric, RR is driven by arrangements, making it fundamentally the same as BGP. As in BGP, get to control records can be connected and labels can also be allotted to the diverse prefixes

MARA: Maximum Alternative Routing Algorithm

2009

In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constructing a directed acyclic graph (DAG) which includes all edges in the network. We define new DAG construction problems with the objectives of 1) maximizing the minimum connectivity, 2) maximizing the minimum max-flow, and 3) maximizing the minimum max-flow as an extension of shortest path routing. A family of new algorithms called Maximum Alternative Routing Algorithms (MARAs) is described, proven formally to solve the problems optimally, and contrasted with existing multipath algorithms. MARAs are evaluated for the number of paths, the length of paths, the computational complexity, and the computation time, using simulations based on several real Internet Autonomous System (AS) network topologies. We show that MARAs run in sub-second times on moderate-speed processors and achieve a significant increase in the number of paths compared to existing multipath routing algorithms. These results should help further the process of deploying multipath routing in real-world networks.