# US 8,279,754 B1 · RSVP-passive interfaces for traffic engineering peering links in MPLS networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 8,279,754 B1
- Document ID: US8279754B1
- Status: Granted
- Kind: B1
- Application number: 12/491,800
- Filed: 2009-06-25
- Granted: 2012-10-02
- Earliest claimed: 2004-10-26
- Assignees: Juniper Networks, Inc.
- Inventors: Ina Minei; Der-Hwa Gan; Pedro R. Marques
- Web page: https://patentgrep.com/patent/US8279754B1

## CPC

- H04L 45/24: Multipath
- H04L 45/50: using label swapping, e.g. multi-protocol label switch [MPLS]
- H04L 47/10: Flow control; Congestion control
- H04L 47/125: by balancing the load, e.g. traffic engineering
- H04L 47/724: at intermediate nodes, e.g. resource reservation protocol [RSVP]
- H04L 47/822: {Collecting or measuring resource availability data}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Constraint information associated with peering links is taken into account when establishing label switched paths (LSPs) to exit points of a network. Devices within the network, such as routers, designate interfaces associated with peering links as “passive interfaces” to indicate that the interfaces should be included for bandwidth accounting purposes and internal path computation. Other devices within the network utilize the constraint information, e.g., bandwidth availability, when computing and establishing LSPs to the exit points of the network to avoid congested peering links.

## Claims

### Claim 1

A method comprising:
executing an interior gateway protocol (IGP) within a first network device of a first network to receive from one or more other network devices of the first network a routing communication that includes constraint information for a plurality of peering links and data designating an interface associated with at least one of the peering links as a passive interface for which bandwidth reservations with a resource reservation protocol are unsupported, wherein the peering links are external to the first network and couple respective exit points of the first network to a second network; and
computing a path within the first network to one of the exit points, wherein the path is computed such that the path conforms to a specified constraint and such that the peering link coupled to the one of the exit points is a peering link for which the received constraint information conforms to the specified constraint.

### Claim 2 (depends on 1)

The method of claim 1, further comprising establishing a label switched path in accordance with the computed path.

### Claim 3 (depends on 1)

The method of claim 1, further comprising selecting one of a plurality of established label switched paths in accordance with the computed path.

### Claim 4 (depends on 1)

The method of claim 1, wherein computing a path comprises executing a constrained shorted path first (CSPF) algorithm that utilizes the constraint information for the peering link to compute the path within the network.

### Claim 5 (depends on 1)

The method of claim 1, wherein the constraint information comprises bandwidth availability information for the peering link.

### Claim 6 (depends on 5)

The method of claim 5, wherein computing a path comprises:
computing a path to a first exit point when the bandwidth availability for the peering link coupled to the first exit point satisfies a requested amount of bandwidth; and
computing a path to a second exit point of the first network when the bandwidth availability for the peering link coupled to the first exit point fails to satisfy the requested amount of bandwidth.

### Claim 7 (depends on 1)

The method of claim 1, wherein computing a path comprises:
invoking an offline software tool to compute the path based on the constraint information; and
manually establishing a label switched path (LSP) in accordance with the path computed by the offline software tool.

### Claim 8 (depends on 1)

The method of claim 1, wherein the constraint information comprises bandwidth information for traffic on the peering links that utilizes unreserved bandwidth of the peering links.

### Claim 9 (depends on 1)

The method of claim 1, further comprising computing the path based on the constraint information when the interface is designated as a passive interface.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
establishing a label switched path (LSP) segment in accordance with the computed path; and
stitching the LSP segment with other LSP segments to form an end-to-end LSP across multiple networks.

### Claim 11 (depends on 1)

The method of claim 1, further comprising:
selecting one of a plurality of label switched path (LSP) segments within the network in accordance with the computed path; and
stitching the selected LSP segment with LSP segments of other networks to form an LSP through the networks.

### Claim 12 (depends on 1)

The method of claim 1, wherein the IGP comprises the Open Shortest Path First (OSPF) protocol or the Intermediate System-Intermediate System (ISIS) protocol.

### Claim 13 (depends on 1)

The method of claim 1, wherein the constraint information comprises one or more of bandwidth information, administrative attributes, or priorities for label switched paths (LSPs).

### Claim 14

A device comprising:
an interior gateway protocol (IGP) executing within a control unit, wherein the interior gateway protocol receives from one or more network devices of the first network a routing communication that includes constraint information for plurality of peering links and data designating an interface associated with at least one of the peering links as a passive interface for which bandwidth reservations with a resource reservation protocol are unsupported, wherein the peering links arc external to the first network and couple respective exit points of the first network to a second network; and
a second protocol executing within the control unit that computes a path within the network to one of the exit points, wherein second protocol computes the path such that the path conforms to a specified constraint and such that the peering link coupled to the one of the exit points is a peering link for which the received constraint information conforms to the specified constraint.

### Claim 15 (depends on 14)

The device of claim 14, wherein the second protocol executing within the control unit establishes a label switched path in accordance with the computed path.

### Claim 16 (depends on 15)

The device of claim 15, wherein the second protocol comprises the resource reservation protocol.

### Claim 17 (depends on 16)

The device of claim 16, wherein the resource reservation protocol comprises the Resource Reservation Protocol with Traffic Engineering extensions (RSVP-TE).

### Claim 18 (depends on 14)

The device of claim 14, wherein the second protocol executing within the control unit selects one of a plurality of established label switched paths in accordance with the computed path.

### Claim 19 (depends on 14)

The device of claim 14, wherein the second protocol includes a constrained shorted path first (CSPF) algorithm that utilizes the constraint information for the peering link to compute the path within the network.

### Claim 20 (depends on 14)

The device of claim 14, wherein the constraint information comprises bandwidth availability information for the peering link.

### Claim 21 (depends on 20)

The device of claim 20, wherein the second protocol includes a constrained shortest path first (CSPF) algorithm that computes the path to a first exit point when the bandwidth availability for the peering link coupled to the first exit point satisfies a requested amount of bandwidth, and computes the path to a second exit point of the network when the bandwidth availability for the peering link coupled to the first exit point fails to satisfy the requested amount of bandwidth.

### Claim 22 (depends on 14)

The device of claim 14, wherein the constraint information comprises bandwidth information for traffic on the peering links that utilizes unreserved bandwidth of the peering links.

### Claim 23 (depends on 14)

The device of claim 14, further comprising a traffic engineering database storing the constraint information for the peering links, wherein the database stores the data designating the interface associated with the at least one of the peering links as a passive interface for which bandwidth reservations with a resource reservation protocol are unsupported.

### Claim 24 (depends on 14)

The device of claim 14, wherein the IGP comprises the Open Shortest Path First (OSPF) protocol or the Intermediate System-Intermediate System (ISIS) protocol.

### Claim 25

A non-transitory computer-readable medium comprising instructions for causing a programmable processor of a network device of a first network to:
execute an interior gateway protocol (IGP) to receive a routing communication that includes constraint information from one or more other network devices of the first network for a plurality of peering links and data designating an interface associated with at least one of the peering links as a passive interface for which bandwidth reservations with a resource reservation protocol are unsupported, wherein the peering links are external to the first network and couple respective exit points of the first network to a second network;
compute a path within the first network one of the exit points, wherein the path is computed such that the path conforms to a specified constraint and such that the peering link coupled to the one of the exit points is a peering link for which the received constraint information conforms to the specified constraint; and
execute a second protocol to establish a label switched path to the selected exit point in accordance with the computed path.

### Claim 26 (depends on 25)

The non-transitory computer-readable medium of claim 25, wherein the second protocol comprises the resource reservation protocol.

### Claim 27 (depends on 26)

The non-transitory computer-readable medium of claim 26, wherein the resource reservation protocol comprises the Resource Reservation Protocol with Traffic Engineering extensions (RSVP-TE).
