Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet

Prompted by the advent of QoS routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and optimal paths can be computed with a generalized Dijsktra's (1959) algorithm. For this purpose we define an algebra of weights which contains a binary operation, for the composition of link weights into path weights, and an order relation. Isotonicity is the key property of the algebra. It states that the order relation between the weights of any two paths is preserved if both of them are either prefixed or appended by a common, third, path. We show that isotonicity is both necessary and sufficient for a generalized Dijkstra's algorithm to yield optimal paths. Likewise, isotonicity is also both necessary and sufficient for hop-by-hop routing. However, without strict isotonicity, hop by-hop routing based on optimal paths may produce routing loops. They are prevented if every node computes what we call lexicographic-optimal paths. These paths can be computed with an enhanced Dijkstra's algorithm that has the same complexity as the standard one. Our findings are extended to multipath routing as well. As special cases of the general approach, we conclude that shortest-widest paths can neither be computed with a generalized Dijkstra's algorithm nor can packets be routed hop-by-hop over those paths. In addition, loop free hop by hop routing over widest and widest-shortest paths requires that each node computes lexicographic-optimal paths, in general.

[1]  Carl Tropper,et al.  A new metric for dynamic routing algorithms , 1990, IEEE Trans. Commun..

[2]  Roch Guérin,et al.  Implementation and performance measurements of QoS routing extensions to OSPF , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[5]  Jennifer Rexfordz,et al.  Eecient Precomputation of Quality-of-service Routes , 1998 .

[6]  J. J. Garcia-Lunes-Aceves.  Loop-free routing using diffusing computations , 1993 .

[7]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[8]  Ibrahim Matta,et al.  Type-of-Service Routing in Datagram Delivery Systems , 1995, IEEE J. Sel. Areas Commun..

[9]  F. Kelly.  Network routing , 1991, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences.

[10]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.

[11]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[12]  Ariel Orda,et al.  Networks with advance reservations: the routing perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[14]  Tony Li.  MPLS and the evolving Internet architecture , 1999, IEEE Commun. Mag..

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

[16]  Pierre A. Humblet,et al.  Routing subject to quality of service constraints in integrated communication networks , 1995, IEEE Netw..

[17]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

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

[19]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[20]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

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

[22]  I. Anderson,et al.  Graphs and Networks , 1981, The Mathematical Gazette.