Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
Efficient parallel shortest-paths in digraphs with a separator decomposition
Journal of Algorithms
Parallel and dynamic shortest-path algorithms for sparse graphs
Parallel and dynamic shortest-path algorithms for sparse graphs
A parallel priority queue with constant time operations
Journal of Parallel and Distributed Computing - Parallel and distributed data structures
A simple parallel algorithm for the single-source shortest path problem on planar digraphs
Journal of Parallel and Distributed Computing
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
Stability issues in OSPF routing
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
Experience in black-box OSPF measurement
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
Shortest-Path-Tree (SPT) computation, as the main load in OSPF protocol, contributes to the slow convergence time in intra-domain routing. With the increasing interest for upcoming routers of multi-core based processing board, efficient parallel routing algorithms are required to take this advantage to speedup SPT computation in order to meet the needs for fast failure recovery applications such as VoIP. However, currently available parallel SPT algorithms are all based on static method, which re-computes the entire tree for each link change. In this paper, we explore parallel algorithms for dynamic SPT update, a more efficient method, which only updates the affected nodes by making use of the previous SPT We first analyze characters of dynamic method to show how they affect parallel design; then we give our parallel dynamic SPT algorithm framework, which uses: (1) parallel distance-updating mode, to get a near liner speedup (assuming perfect load balance) and (2) group-removal schema, to reduce communication cost. Further, to provide load balance, we give a task distribution algorithm called RR_DFS, which makes use of the topology information of the previous SPT. Complexity analysis and simulation result are also presented