@techreport{bashandy-idr-bgp-repair-label-04,
    number =    {draft-bashandy-idr-bgp-repair-label-04},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-bashandy-idr-bgp-repair-label/04/},
    author =    {Ahmed Bashandy and Burjiz and Jakob Heitz},
    title =     {{Scalable, Loop-Free BGP FRR using Repair Label}},
    pagetotal = 13,
    year =      2012,
    month =     may,
    day =       1,
    abstract =  {Consider a BGP free core scenario. Suppose the provider edge BGP speakers PE1, PE2,..., PEn know about a prefix P/m via the external routers CE1, CE2,..., CEm. If the PE router PEi loses connectivity to the primary path, it is desirable to immediately restore traffic by rerouting packets arriving from the core to PEi and destined to the prefix P/m to one of the other PE routers that advertised P/m, say PEj, until BGP re-converges. However if the loss of connectivity of PEi to the primary path also resulted in the loss of connectivity between PEj and CEj, rerouting a packet before the control plane converges may result in a loop. In this document, we propose using a repair label for traffic restoration while avoiding loops. We propose advertising the "repair" label through BGP.},
}