Pitfalls in the design of distributed routing algorithms
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Design of inter-administrative domain routing protocols
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Incremental algorithms for minimal length paths
Journal of Algorithms
Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
Dynamic algorithms for shortest paths in planar graphs
Theoretical Computer Science
Routing in the Internet
Routing in communications networks
Routing in communications networks
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
End-to-end routing behavior in the Internet
IEEE/ACM Transactions on Networking (TON)
Fully dynamic output bounded single source shortest path problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
Introduction to algorithms
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Incremental Algorithms for the Single-Source Shortest Path Problem
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Routing in multihop packet switching networks: Gb/s challenge
IEEE Network: The Magazine of Global Internetworking
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Incremental Nonlinear Dimensionality Reduction by Manifold Learning
IEEE Transactions on Pattern Analysis and Machine Intelligence
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Does path cleaning help in dynamic all-pairs shortest paths?
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Interface split routing for finer-grained traffic engineering
Performance Evaluation
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Dynamic SPT update for multiple link state decrements in network routing
The Journal of Supercomputing
Multiple path routing algorithm for IP networks
Computer Communications
Intra-domain routing convergence with centralized control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Convergence of intra-domain routing with centralized control
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
A low complexity shortest path tree restoration scheme for IP networks
IEEE Communications Letters
MPCT: minimum protection cost tree for IP fast reroute using tunnel
Proceedings of the Nineteenth International Workshop on Quality of Service
Metaphors and analogies for teaching algorithms
Proceedings of the 43rd ACM technical symposium on Computer Science Education
A novel neural network method for shortest path tree computation
Applied Soft Computing
Minimum Protection Cost Tree: A tunnel-based IP Fast Reroute Scheme
Computer Communications
Parallel dynamic spt update algorithm in OSPF
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
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. Our 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.