A distributed algorithm for edge-disjoint path problem
Proc. of the sixth conference on Foundations of software technology and theoretical computer science
The multi-tree approach to reliability in distributed networks
Information and Computation
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Computer Networks: A Systems Approach, 3rd Edition
Computer Networks: A Systems Approach, 3rd Edition
Distributed computation of all node replacements of a minimum spanning tree
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A distributed algorithm for finding all best swap edges of a minimum diameter spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
In systems using shortest-path routing tables, a single link failure is enough to interrupt the message transmission by disconnecting one or more shortest path spanning trees. The on-line recomputation of an alternative path or of the entire new shortest path trees, rebuilding the routing tables accordingly, is rather expensive and causes long delays in the message's transmission [5, 10]. Hopefully, some of these costs will be reduced if the serial algorithms for dynamic graphs (e.g., those of [1]) could be somehow employed; to date, the difficulties of finding an e.cient distributed implementation have not been overcome (e.g., see [9]).