System, method and apparatus conforming path cost criteria across multiple ABRs
AssigneeAlcatel Lucent
InventorsPradeep G. Jain, Kanwar D. Singh, Palak D. Mehta
Life of this patent
Estimating the term…
Abstract
A system, method and apparatus for adapting the operation of Area Border Routers (ABRs) in a network such that all ABRs use a common tie-breaking mechanism or process to select a particular path where equal cost multiple paths (ECMP) exist.
Claims20
A method, comprising:
- receiving a resource reservation protocol (RSVP) path message including an indication of an established label switched path (LSP) cost constraint mechanism;
- if a next hop from an Area Border Router (ABR) comprises a loose hop, performing an explicit route object (ERO) expansion operation to reach the next hop in accordance with the indication of the established LSP cost constraint mechanism;
- and
- forwarding the RSVP path message including the indication of the established LSP cost constraint mechanism toward the next hop.
An apparatus, comprising a processor configured for:
- receiving a resource reservation protocol (RSVP) path message including an indication of an established label switched path (LSP) cost constraint mechanism;
- if a next hop from an Area Border Router (ABR) comprises a loose hop, performing an explicit route object (ERO) expansion operation to reach the next hop in accordance with the indication of the established LSP cost constraint mechanism;
- and
- forwarding the RSVP path message including the indication of the established LSP cost constraint mechanism toward the next hop.
A tangible and non-transient computer readable storage medium storing instructions which, when executed by a computer, provide a method, comprising:
- receiving a resource reservation protocol (RSVP) path message including an indication of an established label switched path (LSP) cost constraint mechanism;
- if a next hop from an Area Border Router (ABR) comprises a loose hop, performing an explicit route object (ERO) expansion operation to reach the next hop in accordance with the indication of the established LSP cost constraint mechanism;
- and
- forwarding the RSVP path message including the indication of the established LSP cost constraint mechanism toward the next hop.
A computer program product wherein a computer is operative to process computer instructions, stored in a non-transitory computer readable storage medium when processed by the computer, to provide a method, comprising:
- receiving a resource reservation protocol (RSVP) path message including an indication of an established label switched path (LSP) cost constraint mechanism;
- if a next hop from an Area Border Router (ABR) comprises a loose hop, performing an explicit route object (ERO) expansion operation to reach the next hop in accordance with the indication of the established LSP cost constraint mechanism;
- and
- forwarding the RSVP path message including the indication of the established LSP cost constraint mechanism toward the next hop.
Dependencies are inferred from the claim text.