New dynamic SPT algorithm based on a ball-and-string model

A key functionality in today's widely used interior gateway routing protocols such as OSPF and IS-IS involves the computation of a shortest path tree (SPT). In many existing commercial routers, the computation of an SPT is done from scratch following changes in the link states of the network. As there may coexist multiple SPTs in a network with a set of given link states, such recomputation of an entire SPT not only is inefficient but also causes frequent unnecessary changes in the topology of an existing SPT and creates routing instability. This paper presents a new dynamic SPT algorithm that makes use of the structure of the previously computed SPT. This algorithm is derived by recasting the SPT problem into an optimization problem in a dual linear programming framework, which can also be interpreted using a ball-and-string model. In this model, the increase (or decrease) of an edge weight in the tree corresponds to the lengthening (or shortening) of a string. By stretching the strings until each node is attached to a tight string, the resulting topology of the model defines an (or multiple) SPT(s). By emulating the dynamics of the ball-and-string model, we can derive an efficient algorithm that propagates changes in distances to all affected nodes in a natural order and in a most economical way. Compared with existing results, our algorithm has the best-known performance in terms of computational complexity as well as minimum changes made to the topology of an SPT. Rigorous proofs for correctness of our algorithm and simulation results illustrating its complexity are also presented.

[1]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[2]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[3]  M. Steenstrup Routing in communications networks , 1995 .

[4]  Daniele Frigioni,et al.  Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs , 1997, STACS.

[5]  Daniele Frigioni,et al.  Fully dynamic output bounded single source shortest path problem , 1996, SODA '96.

[6]  Alberto Marchetti-Spaccamela,et al.  Dynamic algorithms for shortest paths in planar graphs , 1993, Theor. Comput. Sci..

[7]  Giuseppe F. Italiano,et al.  Incremental algorithms for minimal length paths , 1991, SODA '90.

[8]  R. Perlman A comparison between two routing protocols: OSPF and IS-IS , 1991, IEEE Network.

[9]  Paul Traina,et al.  BGP-4 Protocol Analysis , 1995, RFC.

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

[11]  SiuKai-Yeung,et al.  New dynamic SPT algorithm based on a ball-and-string model , 2001 .

[12]  Pawel Gburzynski,et al.  Routing in multihop packet switching networks: Gb/s challenge , 1995, IEEE Netw..

[13]  Deborah Estrin,et al.  Design of inter-administrative domain routing protocols , 1990, SIGCOMM 1990.

[14]  Dave Katz,et al.  Application of the Border Gateway Protocol in the Internet , 1990, RFC.

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

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

[17]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[18]  Vern Paxson,et al.  End-to-end routing behavior in the Internet , 1996, TNET.

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

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

[21]  G. Varghese,et al.  Pitfalls in the design of distributed routing algorithms , 1988, SIGCOMM 1988.

[22]  P. Hoffman Internet Draft , 1998 .

[23]  Deborah Estrin,et al.  Design of inter-administrative domain routing protocols , 1990, SIGCOMM '90.

[24]  Daniele Frigioni,et al.  Incremental algorithms for single-source shortest path trees , 1994 .

[25]  Kai-Yeung Siu,et al.  New dynamic algorithms for shortest path tree computation , 2000, TNET.

[26]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[27]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[28]  Farnam Jahanian,et al.  Internet routing instability , 1997, SIGCOMM '97.

[29]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[30]  T. B. Boffey Linear Network Optimization: Algorithms and Codes , 1994 .