Università di Pisa
Sistema bibliotecario di ateneo

Computing All the Best Swap Edges Distributively

Flocchini, Paola and Pagli, Linda and Prencipe, Giuseppe and Santoro, Nicola and Widmayer, P. and Zuva, T. (2004) Computing All the Best Swap Edges Distributively. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (281Kb)


    Recently great attention has been given to {\em 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 {\em 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 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 computation of all the optimal swap edges under several optimization criteria.

    Item Type: Book
    Uncontrolled Keywords: Swap edge, Routing, Distributed algorithms
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 09 Dec 2014 11:14
    Last Modified: 09 Dec 2014 11:14
    URI: http://eprints.adm.unipi.it/id/eprint/2123

    Repository staff only actions

    View Item