# US 2024/0205136 A1 · Centralized approach to SR-TE paths with bandwidth guarantee using a single SID

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

- Number: US 2024/0205136 A1
- Document ID: US20240205136A1
- Status: Published application
- Kind: A1
- Application number: 18/287,159
- Filed: 2022-11-07
- Published: 2024-06-20
- Earliest claimed: 2022-11-07
- Assignees: Ciena Corporation
- Applicants: Ciena Corporation
- Inventors: Muthurajah Sivabalan; Sami Boutros; Cengiz Alaettinoglu
- Web page: https://patentgrep.com/patent/US20240205136A1

## CPC

- H04L 45/16: Multipoint routing
- H04L 45/125: based on throughput or bandwidth
- H04L 45/34: {Source routing}
- H04L 45/42: Centralised routing
- H04L 45/48: Routing tree calculation
- H04L 45/44: Distributed routing
- H04L 45/70: {Routing based on monitoring results}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems and methods include determining (52) a Multi-Point to Point (MP2P) tree from a plurality of source nodes (S1-S5) to a destination node (D) in a Segment Routing network (10), wherein the plurality of source nodes (S1-S5) are sending traffic with guaranteed bandwidth requirements to the destination node (D), and wherein the MP2P tree is determined based on the guaranteed bandwidth; assigning (54) a globally unique Segment Identifier (SID) for the MP2P tree; and causing (56) programming of forwarding entries in the plurality of source nodes (S1-S5), any intermediate nodes, and the destination node (D), based on the MP2P tree. The steps can further include receiving (58) measurements from nodes on the MP2P tree of bandwidth utilized against the globally unique SID; and updating (60) the MP2P tree if required based on the measurements. Each of the plurality of source nodes (S1-S5) utilize the globally unique SID to send traffic with guaranteed bandwidth requirements to the destination node (D).

## Claims

### Claim at position 1

1-13. (canceled)

### Claim 14

A non-transitory computer-readable medium having instructions stored thereon for programming a processing device to perform steps of:
determining guaranteed bandwidth flows from plurality of source nodes to a destination node in a Segment Routing network;
determining a Multi-Point to Point (MP2P) tree from the plurality of source nodes to the destination node based on the guaranteed bandwidth;
assigning a Segment Identifier (SID) for the MP2P tree; and
causing programming of forwarding entries in one or more of the plurality of source nodes, any intermediate nodes, and the destination node, based on the MP2P tree.

### Claim 15 (depends on 14)

The non-transitory computer-readable medium of claim 14, wherein the processing device is a Path Computation Engine (PCE).

### Claim 16 (depends on 14)

The non-transitory computer-readable medium of claim 14, wherein the SID is not flooded in the Segment Routing network.

### Claim 17 (depends on 14)

The non-transitory computer-readable medium of claim 14, wherein the determining guaranteed bandwidth flows is by dynamically learning from the Segment Routing network.

### Claim 18 (depends on 14)

The non-transitory computer-readable medium of claim 14, wherein the determining guaranteed bandwidth flows is via provisioning.

### Claim 19 (depends on 14)

The non-transitory computer-readable medium of claim 14, wherein the programming is via extensions to south bound protocols.

### Claim 20 (depends on 14)

The non-transitory computer-readable medium of claim 14, wherein the MP2P tree is one of a plurality of MP2P trees for the destination node, each being used for any of bandwidth class and differentiated forwarding behavior.

### Claim 21

A Path Computation Engine (PCE) comprising:
at least one processor and memory comprising instructions that, when executed, cause the at least one processor to
determine guaranteed bandwidth flows from plurality of source nodes to a destination node in a Segment Routing network,
determine a Multi-Point to Point (MP2P) tree from the plurality of source nodes to the destination node based on the guaranteed bandwidth,
assign a Segment Identifier (SID) for the MP2P tree, and
cause programming of forwarding entries in one or more of the plurality of source nodes, any intermediate nodes, and the destination node, based on the MP2P tree.

### Claim 22 (depends on 21)

The PCE of claim 21, wherein the SID is not flooded in the Segment Routing network.

### Claim 23 (depends on 21)

The PCE of claim 21, wherein the determining guaranteed bandwidth flows is by dynamically learning from the Segment Routing network.

### Claim 24 (depends on 21)

The PCE of claim 21, wherein the determining guaranteed bandwidth flows is via provisioning.

### Claim 25 (depends on 21)

The PCE of claim 21, wherein the programming is via extensions to south bound protocols.

### Claim 26 (depends on 21)

The PCE of claim 21, wherein the MP2P tree is one of a plurality of MP2P trees for the destination node, each being used for any of bandwidth class and differentiated forwarding behavior.

### Claim 27

A method implemented by a processing device comprising steps of:
determining guaranteed bandwidth flows from plurality of source nodes to a destination node in a Segment Routing network;
determining a Multi-Point to Point (MP2P) tree from the plurality of source nodes to the destination node based on the guaranteed bandwidth;
assigning a Segment Identifier (SID) for the MP2P tree; and
causing programming of forwarding entries in one or more of the plurality of source nodes, any intermediate nodes, and the destination node, based on the MP2P tree.

### Claim 28 (depends on 27)

The method of claim 27, wherein the processing device is a Path Computation Engine (PCE).

### Claim 29 (depends on 27)

The method of claim 27, wherein the SID is not flooded in the Segment Routing network.

### Claim 30 (depends on 27)

The method of claim 27, wherein the determining guaranteed bandwidth flows is by dynamically learning from the Segment Routing network.

### Claim 31 (depends on 27)

The method of claim 27, wherein the determining guaranteed bandwidth flows is via provisioning.

### Claim 32

(canceled)

### Claim 33

(canceled)

### Claim 34 (depends on 20)

The non-transitory computer-readable medium of claim 20, wherein each of the plurality of MP2P trees for the destination node is assigned a respective Segment Identifier (SID).

### Claim 35 (depends on 26)

The PCE of claim 26, wherein each of the plurality of MP2P trees for the destination node is assigned a respective Segment Identifier (SID).
