# US 2024/0205157 A1 · Expressing traffic engineering intents on sub paths

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

- Number: US 2024/0205157 A1
- Document ID: US20240205157A1
- Status: Published application
- Kind: A1
- Application number: 18/069,081
- Filed: 2022-12-20
- Published: 2024-06-20
- Earliest claimed: 2022-12-20
- Assignees: Nokia Solutions and Networks Oy
- Applicants: Nokia Solutions and Networks Oy
- Inventors: Andrew Stone
- Web page: https://patentgrep.com/patent/US20240205157A1

## CPC

- H04L 45/34: {Source routing}
- H04L 47/22: Traffic shaping
- H04L 45/04: {Interdomain routing, e.g. hierarchical routing}
- H04L 45/42: Centralised routing
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Various embodiments relate to a path computation element configured to calculate a path through a network, including: at least one processor; and at least one memory storing instructions, that when executed by the at least one processor, cause the apparatus at least to: receive a TE path expression including a plurality of segments; calculate first portion of the path through the network based upon a first segment of the plurality of segments of the TE path expression; determine if the calculated path has reached its end point; calculate a next portion of the path through the network based upon a next segment of the plurality of segments of the TE path expression; and perform post processing on the calculated path based upon the received TE path expression.

## Claims

### Claim 1

A path computation element configured to calculate a path through a network, comprising:
at least one processor; and
at least one memory storing instructions, that when executed by the at least one processor, cause the path computation element at least to:
receive a traffic engineered (TE) path expression including a plurality of segments;
calculate first portion of the path through the network based upon a first segment of the plurality of segments of the TE path expression;
determine if the calculated path has reached its end point;
calculate a next portion of the path through the network based upon a next segment of the plurality of segments of the TE path expression when the calculated path has not reached its end point; and
perform post processing on the calculated path based upon the received TE path expression when the calculated path has reached its end point.

### Claim 2 (depends on 1)

The path computation element of claim 1, wherein the segments of the plurality of segments includes an instruction, a terminator, and a quantification.

### Claim 3 (depends on 2)

The path computation element of claim 2, wherein the instruction includes parameters relating to a portion of the network.

### Claim 4 (depends on 2)

The path computation element of claim 2, wherein the terminator identifies a type of node in the network where a portion of the path associated with the segment should end.

### Claim 5 (depends on 2)

The path computation element of claim 2, wherein quantification defines a number of hops allowed along a portion of the path associated with the segment.

### Claim 6 (depends on 1)

The path computation element of claim 1, wherein each segment of the plurality of segments is associated with a portion of the network.

### Claim 7 (depends on 1)

The path computation element of claim 1, wherein performing post processing on the calculated path based upon the received TE path expression includes performing label stack reduction along the calculated path based upon the TE path expression.

### Claim 8

A path computation element configured to calculate a path through a network, comprising:
at least one processor; and
at least one memory storing instructions, that when executed by the at least one processor, cause the path computation element at least to:
receive a TE path expression including a plurality of segments wherein the segments of the plurality of segments includes an instruction, a terminator, and a quantification;
calculate first portion of the path through the network based upon a first segment of the plurality of segments of the TE path expression;
determine if the calculated path has reached its end point, and
calculate a next portion of the path through the network based upon a next segment of the plurality of segments of the TE path expression when the calculated path has not reached its end point.

### Claim 9 (depends on 8)

The path computation element of claim 8, further comprising performing post processing on the calculated path based upon the received TE path expression when the calculated path has reached its end point.

### Claim 10 (depends on 9)

The path computation element of claim 9, wherein performing post processing on the calculated path based upon the received TE path expression includes performing label stack reduction along the calculated path based upon the TE path expression.

### Claim 11 (depends on 8)

The path computation element of claim 8, wherein the instruction includes parameters relating to a portion of the network.

### Claim 12 (depends on 8)

The path computation element of claim 8, wherein the terminator identifies a type of node in the network where a portion of the path associated with the segment should end.

### Claim 13 (depends on 8)

The path computation element of claim 8, wherein quantification defines a number of hops allowed along a portion of the path associated with the segment.

### Claim 14 (depends on 8)

The path computation element of claim 8, wherein each segment of the plurality of segments is associated with a portion of the network.

### Claim 15

A method to calculate a path through a network, comprising:
receiving a TE path expression including a plurality of segments wherein the segments of the plurality of segments includes an instruction, a terminator, and a quantification;
calculating first portion of the path through the network based upon a first segment of the plurality of segments of the TE path expression;
determining if the calculated path has reached its end point; and
calculating a next portion of the path through the network based upon a next segment of the plurality of segments of the TE path expression when the calculated path has not reached its end point.

### Claim 16 (depends on 15)

The method of claim 15, further comprising performing post processing on the calculated path based upon the received TE path expression when the calculated path has reached its end point.

### Claim 17 (depends on 16)

The method of claim 16, wherein performing post processing on the calculated path based upon the received TE path expression includes performing label stack reduction along the calculated path based upon the TE path expression.

### Claim 18 (depends on 15)

The method of claim 15, wherein the instruction includes parameters relating to a portion of the network.

### Claim 19 (depends on 15)

The method of claim 15, wherein the terminator identifies a type of node in the network where a portion of the path associated with the segment should end.

### Claim 20 (depends on 15)

The method of claim 15, wherein quantification defines a number of hops allowed along a portion of the path associated with the segment.
