On Shortest Path Representation

Lately, it has been proposed to use shortest path first routing to implement Traffic Engineering in IP networks. The idea is to set the link weights so that the shortest paths, and the traffic thereof, follow the paths designated by the operator. Clearly, only certain shortest path representable path sets can be used in this setting, that is, paths which become shortest paths over some appropriately chosen positive, integer-valued link weights. Our main objective in this paper is to distill and unify the theory of shortest path representability under the umbrella of a novel flow-theoretic framework. In the first part of the paper, we introduce our framework and state a descriptive necessary and sufficient condition to characterize shortest path representable paths. Unfortunately, traditional methods to calculate the corresponding link weights usually produce a bunch of superfluous shortest paths, often leading to congestion along the unconsidered paths. Thus, the second part of the paper is devoted to reducing the number of paths in a representation to the bare minimum. To the best of our knowledge, this is the first time that an algorithm is proposed, which is not only able to find a minimal representation in polynomial time, but also assures link weight integrality. Moreover, we give a necessary and sufficient condition to the existence of a one-to-one mapping between a path set and its shortest path representation. However, as revealed by our simulation studies, this condition seems overly restrictive and instead, minimal representations prove much more beneficial.

[1]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[3]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[4]  András Faragó,et al.  Inverse Optimization in High-speed Networks , 2003, Discret. Appl. Math..

[5]  Mikkel Thorup,et al.  Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..

[6]  Tibor Cinkler,et al.  Practical OSPF traffic engineering , 2004, IEEE Communications Letters.

[7]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[8]  Ravindra K. Ahuja,et al.  Inverse Optimization, Part I: Linear Programming and General Problem , 1998 .

[9]  Fillia Makedon,et al.  Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..

[10]  João L. Sobrinho.  Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet , 2002, TNET.

[11]  Gábor Rétvári,et al.  On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity , 2004, NETWORKING.

[12]  Zheng Wang,et al.  Internet QoS: Architectures and Mechanisms for Quality of Service , 2001 .

[13]  Tibor Cinkler,et al.  A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[14]  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).

[15]  Jeff L. Kennington,et al.  A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..

[16]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

[17]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[18]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[19]  Zheng Wang,et al.  Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[20]  Michal Pióro,et al.  On open shortest path first related network optimisation problems , 2002, Perform. Evaluation.

[21]  James R. Evans.  The simplex method for integral multicommodity networks , 1978 .

[22]  Anukool Lakhina,et al.  BRITE: Universal Topology Generation from a User''s Perspective , 2001 .

[23]  Tibor Cinkler,et al.  Notes On Shortest Path Representation ( Technical Report ) , 2022 .

[24]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[25]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[26]  Hanif D. Sherali,et al.  Linear programming and network flows (2nd ed.) , 1990 .

[27]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[28]  Walid Ben-Ameur,et al.  Internet Routing and Related Topology Issues , 2003, SIAM J. Discret. Math..