In this paper, we propose a routing technique, “recursive Loop-Free Alternates (rLFAs)”, to alleviate packet loss due to transient link failures. The technique consists of a backup path calculation with corresponding re-routing scheme based on the Loop-Free Condition (LFC) as defined in the basic specification for IP Fast Re-Route (IPFRR). Under this routing strategy, nodes calculate backup paths by modifying the weights of links in the primary shortest path tree. If a failure occurs, the detecting node determines the number of recursions, which indicates the number of times packets must be forwarded along the alternate next hops to bypass the failed link. This technique guarantees full repair coverage for single link failures. We evaluate the performance of our proposed technique through simulations and show that the incurred overheads, the stretch of its pre-computed alternate paths, and the failure-state Maximum Link Utilisation (MLU) are minimal.


    Access

    Download


    Export, share and cite



    Title :

    Recursive Loop-Free Alternates for full protection against transient link failures


    Contributors:
    Lor, SS (author) / Ali, R (author) / Landa, R (author) / Rio, M (author)

    Publication date :

    2010-01-01


    Remarks:

    In: IEEE symposium on Computers and Communications: ISCC 2010: June 22-25, 2010, Riccione, Italy. (pp. 44 - 49). IEEE: Piscataway, US. (2010)


    Type of media :

    Paper


    Type of material :

    Electronic Resource


    Language :

    English


    Classification :

    DDC:    629



    Fuel Policies and Filed Alternates

    Connell, Linda / Doyle, Dennis | NTRS | 2014



    Dual-mode engine alternates paired cylinders

    Scott,D. / Alfa-Romeo,IT | Automotive engineering | 1982


    Auto-excitation of alternates by means of capacities

    Bethenod, J. | Engineering Index Backfile | 1920


    Pros, Cons, and Alternates to Weight Based Cost Estimating

    Joyner, Claude / Laurie, Jonathan / Levack, Daniel et al. | AIAA | 2011