Fast Reroute using Alternative Shortest Paths
draft-tian-frr-alt-shortest-path-01

Document Type Expired Internet-Draft (individual)
Last updated 2004-07-21
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-tian-frr-alt-shortest-path-01.txt

Abstract

Repair path mechanism is an important element in IP/LDP fast reroute. In this document we propose a way to calculate local repair paths using alternative shortest paths. The solution can provide complete coverage for all destinations within an IGP area that can possibly be protected. In this document we also suggested an "Explicit Path with Loose Segment" model that can be used to characterize, classify, and analyse repair paths. We proved some of the common properties of loose segments, and showed that the model can be used to characterize all existing fast reroute solutions.

Authors

Albert Tian (tian@redback.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)