Recursive Loop-Free Alternates for full protection against transient link failures.
IEEE symposium on Computers and Communications: ISCC 2010: June 22-25, 2010, Riccione, Italy.
(pp. 44 - 49).
IEEE: Piscataway, US.
Available under License : See the attached licence file.
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.
|Title:||Recursive Loop-Free Alternates for full protection against transient link failures|
|Open access status:||An open access version is available from UCL Discovery|
|Additional information:||© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.|
|UCL classification:||UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Engineering Science
Archive Staff Only