A low complexity shortest path tree restoration scheme for IP networks

Authors:
Huan Chen;Po-Kai Tseng
Affiliations:
Dept. of Electrical Engineering, National Chung Cheng University, Taiwan;Dept. of Electrical Engineering, National Chung Cheng University, Taiwan
Venue:
IEEE Communications Letters
Year:
2010

Citing 5
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
New dynamic algorithms for shortest path tree computation

IEEE/ACM Transactions on Networking (TON)
New dynamic SPT algorithm based on a ball-and-string model

IEEE/ACM Transactions on Networking (TON)
Incremental Algorithms for the Single-Source Shortest Path Problem

Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.