@techreport{tian-frr-alt-shortest-path-01,
    number =    {draft-tian-frr-alt-shortest-path-01},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-tian-frr-alt-shortest-path/01/},
    author =    {Albert Tian},
    title =     {{Fast Reroute using Alternative Shortest Paths}},
    pagetotal = 11,
    year =      2004,
    month =     jul,
    day =       21,
    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.},
}