MATHEMATICAL ENGINEERING TECHNICAL REPORTS Computing a DAG using MA ordering for the all-to-one maximum ∞ow routing problem

The purpose of the Internet routing system is to construct a Directed Acyclic Graph (DAG) for each destination. Although the number of paths and the connectivity of the graph are important properties, constructing a DAG that includes all edges to increase the number of paths and the connectivity has not been studied. In this paper we describe a new problem called all-to-one maximum flow routing problem that maximizes the minimum of maximum flow among all nodes to a destination. We studied an algorithm that utilizes the MA ordering to find the desirable DAG for a given network. It is proven that the algorithm produces the optimal solution, and the time complexity is the same with that of the MA ordering, O(m+n log n) where m and n are the number of edges and nodes, respectively. Simulations showed that the routing calculated by MA ordering outperforms current shortest path routing significantly in terms of maximum flow on each pair of nodes, but for the link utilization on a traffic demand of random model between multiple pair of nodes, MA ordering is outperformed by the shortest path routing because of a lack of efficient method to compute traffic split ratio.

[1]  J. J. Garcia-Luna-Aceves,et al.  An algorithm for multipath computation using distance-vectors with predecessor information , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[2]  David Wetherall,et al.  Source selectable path diversity via routing deflections , 2006, SIGCOMM 2006.

[3]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[4]  Toshihide Ibaraki,et al.  Graph connectivity and its augmentation: applications of MA orderings , 2002, Discret. Appl. Math..

[5]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[6]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[7]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[8]  D. R. Fulkerson,et al.  On the Max Flow Min Cut Theorem of Networks. , 1955 .

[9]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.

[11]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Chen-Nee Chuah,et al.  Proactive vs reactive approaches to failure resilient routing , 2004, IEEE INFOCOM 2004.