Computing All the Best Swap Edges Distributively [chapter]

P. Flocchini, L. Pagli, G. Prencipe, N. Santoro, P. Widmayer, T. Zuva
2005 Lecture Notes in Computer Science  
Recently great attention has been given to point-of-failure swap rerouting, an efficient technique for routing in 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 amount of precomputed information required in addition to the routing table is rather small: a single
more » ... link per each destination. Several efficient serial algorithms have been presented to compute this information; none of them can unfortunately be efficiently implemented in a distributed environment. In this paper we present protocols, based on a new strategy, that allow the efficient distributed computation of all the optimal swap edges under several optimization criteria. 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.
doi:10.1007/11516798_11 fatcat:kkgbc37ij5gqpj3afrokqibky4