@misc{rfc4829,
    series =    {Request for Comments},
    number =    4829,
    howpublished =  {RFC 4829},
    publisher = {RFC Editor},
    doi =       {10.17487/RFC4829},
    url =       {https://www.rfc-editor.org/info/rfc4829},
    author =    {JP Vasseur and Caterina Scoglio and Leonardo Chen and Jaudelice Oliveira},
    title =     {{Label Switched Path (LSP) Preemption Policies for MPLS Traffic Engineering}},
    pagetotal = 19,
    year =      2007,
    month =     apr,
    abstract =  {When the establishment of a higher priority (Traffic Engineering Label Switched Path) TE LSP requires the preemption of a set of lower priority TE LSPs, a node has to make a local decision to select which TE LSPs will be preempted. The preempted LSPs are then rerouted by their respective \textbackslash{}\%Head-end Label Switch Router (LSR). This document presents a flexible policy that can be used to achieve different objectives: preempt the lowest priority LSPs; preempt the minimum number of LSPs; preempt the set of TE LSPs that provide the closest amount of bandwidth to the required bandwidth for the preempting TE LSPs (to minimize bandwidth wastage); preempt the LSPs that will have the maximum chance to get rerouted. Simulation results are given and a comparison among several different policies, with respect to preemption cascading, number of preempted LSPs, priority, wasted bandwidth and blocking probability is also included. This memo provides information for the Internet community.},
}