A low complexity shortest path tree restoration scheme for IP networks

This letter proposes a novel low complexity shortest path tree restoration scheme to address link cost perturbation problem for link state routing in IP Networks. The proposed scheme can reduce the number of unnecessary shortest path tree recomputations and also provides a low-complexity computation when the Shortest Path Tree (SPT) restoration process executes. The proposed scheme has been designed based on the Network Simplex Method (NSM) and Sensitivity Analysis (SA) techniques to perform the optimality test for the current shortest path tree. The computational overhead is compared with various dynamic schemes over six network benchmarks.

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

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

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

[4]  Edwin Hsing-Mean Sha,et al.  Minimum dynamic update for shortest path tree construction , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

[6]  Athina Markopoulou,et al.  Characterization of failures in an IP backbone , 2004, IEEE INFOCOM 2004.

[7]  S. Nash,et al.  Linear and Nonlinear Programming , 1987 .

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

[9]  Daniele Frigioni,et al.  Incremental Algorithms for the Single-Source Shortest Path Problem , 1994, FSTTCS.

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

[11]  Jiannong Cao,et al.  Dynamic update of shortest path tree in OSPF , 2004, 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings..

[12]  Kai-Yeung Siu,et al.  New dynamic SPT algorithm based on a ball-and-string model , 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).

[13]  Chin-Tau A. Lea,et al.  Optimal Link Weights for Maximizing QoS Traffic , 2007, 2007 IEEE International Conference on Communications.