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
Sparser: a paradigm for running distributed algorithms
Journal of Algorithms
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)
Computer Networks: A Systems Approach, 3rd Edition
Computer Networks: A Systems Approach, 3rd Edition
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively
IEICE - Transactions on Information and Systems
Single backup table schemes for shortest-path routing
Theoretical Computer Science - Foundations of software science and computation structures
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Stable routing under the Spanning Tree Protocol
Operations Research Letters
| Hi-index | 0.00 |
Recently great attention has been given to point-of-failure swap rerouting, an efficient technique for routing in the presence of transient failures. According to this technique, a message follows the normal routing table information unless the next hop has failed; in this case, it is redirected towards a precomputed link, called swap; once this link has been crossed, normal routing is resumed. The choice of the swap edge is done according to some optimization criteria on the resulting new route. The amount of precomputed information required in addition to the routing table is rather small: a single link per each destination. Several efficient serial algorithms have been presented to compute this information for several optimization criteria (F"d"i"s"t, F"s"u"m, F"i"n"c"r, F"m"a"x). Only the algorithm corresponding to F"d"i"s"t has been efficiently implemented in a distributed environment, while for the other optimization criteria no distributed solution has been devised yet. In this paper we present protocols, based on a new strategy, that allow the efficient distributed computation of all the optimal swap edges under F"s"u"m, F"i"n"c"r, F"m"a"x. Although considerably more difficult than F"d"i"s"t, these problems can be solved with the same cost. In systems allowing long messages, we develop solution protocols based on the same strategy that use only O(n) messages without increasing the total amount of transmitted data items.