Computing all the best swap edges distributively
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 of each destination. Several efficient serial algorithms have been presented to compute this information for several optimization criteria (F-dist, F-sum, F-incr, F-max). Only the algorithm corresponding to F-dist 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-sum, F-incr, F-max. Although considerably more difficult than F-dist, 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. (c) 2008 Elsevier Inc. All rights reserved.
swap edge fault-tolerant routing point of failure rerouting distributed algorithms