# US 2024/0205142 A1 · Latency sensitive network plane via SR Flex Algorithm for layer 1 services

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

- Number: US 2024/0205142 A1
- Document ID: US20240205142A1
- Status: Published application
- Kind: A1
- Application number: 18/101,677
- Filed: 2023-01-26
- Published: 2024-06-20
- Earliest claimed: 2022-12-14
- Assignees: Ciena Corporation
- Applicants: Ciena Corporation
- Inventors: Bhupendra Yadav; Prabhu Vaithilingam; Gerald Smallegange; Alwyn Joy George
- Web page: https://patentgrep.com/patent/US20240205142A1

## CPC

- H04L 45/34: {Source routing}
- H04L 45/121: by minimising delays
- H04L 45/50: using label swapping, e.g. multi-protocol label switch [MPLS]
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems and methods include maintaining a network plane in Segment Routing (SR) Flexible Algorithm having a Flexible Algorithm Definition (FAD) based on latency; receiving a request for a service over a SR network where the service is sensitive to a specific latency; and determining a label stack including one or more Segment Identifiers (SID) for the service, with the one or more SIDs based on the network plane in SR Flexible Algorithm. This can be used for Private Line Emulation (PLE) services and Circuit Emulation (CEM) services over SR, ensuring latency while not requiring large label stacks.

## Claims

### Claim 1

A processing device comprising:
at least one processor and memory storing instructions that, when executed, cause the at least one processor to
maintain a network plane in Segment Routing (SR) Flexible Algorithm having a Flexible Algorithm Definition (FAD) based on latency,
receive a request for a service over a SR network where the service is sensitive to a specific latency, and
determine a label stack including one or more Segment Identifiers (SID) for the service, with the one or more SIDs based on the network plane in SR Flexible Algorithm.

### Claim 2 (depends on 1)

The processing device of claim 1, wherein the instructions that, when executed, further cause the at least one processor to
receive Link State Advertisements (LSA) with a Type-Length-Value (TLV) and a sub-TLV for the FAD.

### Claim 3 (depends on 2)

The processing device of claim 2, wherein the TLV specifies the FAD and the sub-TLV includes one or more values for latency on a given link in the SR network.

### Claim 4 (depends on 1)

The processing device of claim 1, wherein the FAD includes one or more of a latency range, a latency value, and a latency tolerance, for each of a plurality of links in the SR network.

### Claim 5 (depends on 4)

The processing device of claim 4, wherein values for latency are based on measurements at lower layers over which the SR network operates.

### Claim 6 (depends on 1)

The processing device of claim 1, wherein the FAD is maintained over time based on network events and flooding of adjusted latency information.

### Claim 7 (depends on 1)

The processing device of claim 1, wherein the service is one of a Private Line Emulation (PLE) service and a Circuit Emulation (CEM) service.

### Claim 8

A non-transitory computer-readable medium comprising instructions that, when executed, cause at least one processor to perform steps of:
maintaining a network plane in Segment Routing (SR) Flexible Algorithm having a Flexible Algorithm Definition (FAD) based on latency;
receiving a request for a service over a SR network where the service is sensitive to a specific latency; and
determining a label stack including one or more Segment Identifiers (SID) for the service, with the one or more SIDs based on the network plane in SR Flexible Algorithm.

### Claim 9 (depends on 8)

The non-transitory computer-readable medium of claim 8, wherein the steps further include
receiving Link State Advertisements (LSA) with a Type-Length-Value (TLV) and a sub-TLV for the FAD.

### Claim 10 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein the TLV specifies the FAD and the sub-TLV includes one or more values for latency on a given link in the SR network.

### Claim 11 (depends on 8)

The non-transitory computer-readable medium of claim 8, wherein the FAD includes one or more of a latency range, a latency value, and a latency tolerance, for each of a plurality of links in the SR network.

### Claim 12 (depends on 11)

The non-transitory computer-readable medium of claim 11, wherein values for latency are based on measurements at lower layers over which the SR network operates.

### Claim 13 (depends on 8)

The non-transitory computer-readable medium of claim 8, wherein the FAD is maintained over time based on network events and flooding of adjusted latency information.

### Claim 14 (depends on 8)

The non-transitory computer-readable medium of claim 8, wherein the service is one of a Private Line Emulation (PLE) service and a Circuit Emulation (CEM) service.

### Claim 15

A method comprising steps of:
maintaining a network plane in Segment Routing (SR) Flexible Algorithm having a Flexible Algorithm Definition (FAD) based on latency;
receiving a request for a service over a SR network where the service is sensitive to a specific latency; and
determining a label stack including one or more Segment Identifiers (SID) for the service, with the one or more SIDs based on the network plane in SR Flexible Algorithm.

### Claim 16 (depends on 15)

The method of claim 15, wherein the steps further include
receiving Link State Advertisements (LSA) with a Type-Length-Value (TLV) and a sub-TLV for the FAD.

### Claim 17 (depends on 16)

The method of claim 16, wherein the TLV specifies the FAD and the sub-TLV includes one or more values for latency on a given link in the SR network.

### Claim 18 (depends on 15)

The method of claim 15, wherein the FAD includes one or more of a latency range, a latency value, and a latency tolerance, for each of a plurality of links in the SR network.

### Claim 19 (depends on 18)

The method of claim 18, wherein values for latency are based on measurements at lower layers over which the SR network operates.

### Claim 20 (depends on 15)

The method of claim 15, wherein the FAD is maintained over time based on network events and flooding of adjusted latency information.
