Multipath Routing Algorithms for Congestion Minimization

Unlike traditional routing schemes that route all traffic along a single path, multipath routing strategies split the traffic among several paths in order to ease congestion. It has been widely recognized that multipath routing can be fundamentally more efficient than the traditional approach of routing along single paths. Yet, in contrast to the single-path routing approach, most studies in the context of multipath routing focused on heuristic methods. We demonstrate the significant advantage of optimal (or near optimal) solutions. Hence, we investigate multipath routing adopting a rigorous (theoretical) approach. We formalize problems that incorporate two major requirements of multipath routing. Then, we establish the intractability of these problems in terms of computational complexity. Finally, we establish efficient solutions with proven performance guarantees

[1]  Matthew Mathis,et al.  Automatic TCP buffer tuning , 1998, SIGCOMM '98.

[2]  G. R. Ash,et al.  Dynamic network evolution, with examples from AT&T's evolving dynamic network , 1995, IEEE Commun. Mag..

[3]  Pawel Gburzynski,et al.  Multiple path routing in networks with inaccurate link state information , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

[5]  Wai Sum Lai,et al.  Network Hierarchy and Multilayer Survivability , 2002, RFC.

[6]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[7]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[8]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[9]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..

[10]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[12]  Ariel Orda,et al.  The Power of Tuning: A Novel Approach for the Efficient Design of Survivable Networks , 2004, IEEE/ACM Transactions on Networking.

[13]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[14]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[15]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[16]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[17]  Gil Zussman,et al.  Energy efficient routing in ad hoc disaster recovery networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  T. V. Lakshman,et al.  Restorable dynamic quality of service routing , 2002 .

[19]  Thomas Voice,et al.  Stability of end-to-end algorithms for joint routing and rate control , 2005, CCRV.

[20]  Douglas E. Comer,et al.  Internetworking with TCP/IP - Principles, Protocols, and Architectures, Fourth Edition , 1988 .

[21]  Serge A. Plotkin.  Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[22]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[23]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[24]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[25]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[26]  B. Hurley,et al.  A survey of dynamic routing methods for circuit-switched traffic , 1987, IEEE Communications Magazine.

[27]  Andreas Bley,et al.  On the complexity of vertex-disjoint length-restricted path problems , 2004, computational complexity.

[28]  David Thaler,et al.  Multipath Issues in Unicast and Multicast Next-Hop Selection , 2000, RFC.

[29]  Jon M. Kleinberg,et al.  Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[30]  Donal O'Mahony,et al.  Secure routing for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

[31]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[32]  T. V. Lakshman.  Capacity design of fast path restorable optical networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[33]  B. Bellur,et al.  Quality-of-service routing using maximally disjoint paths , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[34]  Srihari Nelakuditi,et al.  On Selection of Paths for Multipath Routing , 2001, IWQoS.

[35]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[36]  J. M. Akinpelu,et al.  The overload performance of engineered networks with nonhierarchical and hierarchical routing , 1984, AT&T Bell Laboratories Technical Journal.

[37]  Baruch Awerbuch.  Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization , 1985, Networks.

[38]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[39]  Andreas Pitsillides,et al.  Addressing network survivability issues by finding the K-best paths through a trellis graph , 1997, Proceedings of INFOCOM '97.

[40]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1997, J. Algorithms.

[41]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[42]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[43]  Zheng Wang,et al.  Explicit routing algorithms for Internet traffic engineering , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[44]  V. Paxson.  End-to-end routing behavior in the internet , 2006, CCRV.

[45]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1993, J. Algorithms.

[46]  Curtis Villamizar,et al.  OSPF Optimized Multipath (OSPF-OMP) , 1999 .

[47]  R. Srikant,et al.  Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet , 2006, IEEE/ACM Transactions on Networking.

[48]  Philippe Mahey,et al.  A Survey of Algorithms for Convex Multicommodity Flow Problems , 2000 .

[49]  Panagiotis Papadimitratos,et al.  Secure link state routing for mobile ad hoc networks , 2003, 2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings..

[50]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[51]  Raphael Rom,et al.  Analysis of multi-path routing , 1999, TNET.

[52]  Michel X. Goemans,et al.  On the Single-Source Unsplittable Flow Problem , 1999, Comb..