IP Library Granted Patent US 11,570,084
Granted Patent B2
US 11,570,084 · App. 17/334,759 · Granted Jan 31, 2023

Path routing with delay constraints

Inventors: Qiong Zhang (Plano, TX); Virgil Vladescu (Hillsdale, NJ); Paparao Palacharla (Richardson, TX)
Assignee: FUJITSU LIMITED
H04L45/123H04L45/02H04L45/22H04L45/24H04L45/302
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,570,084
App. No.
17/334,759
Granted
Jan 31, 2023
Kind
B2
Abstract

An example method may include obtaining network information of a network and determining a second path from a first node of multiple nodes to a second node of the multiple nodes. The network information may include a network topology that may include the multiple nodes and multiple links connecting the multiple nodes. The multiple links may include a first routing metric and a second routing metric. The network information may also include multiple first paths from each node of the multiple nodes to all other nodes of the multiple nodes along the multiple links. The multiple first paths may be determined based on the first routing metric. The determining the second path may include selecting path segments for the second path along the multiple links based on the path segments being included in the multiple first paths based on the second routing metric of the multiple links included in the path segments.

Claims (50)

1. A method comprising:

obtaining network information of a network, the network information including:

a network topology that includes a plurality of nodes and a plurality of links connecting the plurality of nodes, each of the plurality of links including a first routing metric and a second routing metric; and

a plurality of first paths from each node of the plurality of nodes to all other nodes of the plurality of nodes along the plurality of links, the plurality of first paths determined based on the first routing metric;

after obtaining the network information, determining a second path from a first node of the plurality of nodes to a second node of the plurality of nodes, the determining the second path including selecting path segments for the second path along the plurality of links based on the path segments being included in the plurality of first paths and based on the second routing metric of the plurality of links included in the path segments; and

obtaining, at the first node, an indication of nodes included in the second path, the indication of nodes including nodes of the plurality of nodes to constrain routing along the second path based on the first path metric,

wherein determining the second path comprises:

obtaining a transmission delay constraint and an input path from the plurality of first paths that satisfy the first routing metric;

adding a first node identifier associated with the first node to the indication of nodes;

traversing the input path from the first node to the second node adding one or more intermediate node identifiers to the indication of nodes, the one or more intermediate node identifiers comprising:

a first intermediate node that includes a successor node, the successor node having multiple predecessor nodes wherein less than all paths from the first node to the second node, routed through the predecessor nodes, satisfy the transmission delay constraint; and

a second intermediate node wherein a link of the plurality of links between a previous node and the second intermediate node is not included on any paths of the plurality of first paths; and

adding a last node identifier associated with the second node to the indication of nodes; and

wherein satisfying the transmission delay constraint comprises:

computing a first delay between the first node and a current node, a second delay between the current node and a second successor node, and a remaining delay between the second successor node and the second node, wherein the first delay, the second delay, and the remaining delay include a worst case delay computation;

comparing a sum of the first delay, the second delay, and the remaining delay to the transmission delay constraint; and

in instances in which the sum is greater than the transmission delay constraint, adding a node identifier of the current node to the indication of nodes.

2. The method of claim 1 , wherein the second path is determined in response to receiving a request from the second node for data from the first node.

3. The method of claim 2 , wherein the request includes a transmission delay constraint, the second routing metric is a transmission delay, and the path segments for the second path are selected to include the path segments included in the plurality of first paths with transmission delays that satisfy the transmission delay constraint for the second path.

4. The method of claim 1 , wherein the first routing metric is a cost associated with using a link of the plurality of links and the second routing metric is a transmission delay associated with using the link.

5. The method of claim 1 , wherein the second path is determined in response to a sum of the second routing metric associated with the path segments of the plurality of first paths being less than a transmission delay constraint.

6. The method of claim 1 , wherein the indication of nodes does not include all the nodes of the plurality of nodes included in the second path.

7. The method of claim 1 , wherein the plurality of nodes represent one or more routers or one or more switches.

8. The method of claim 1 , further comprising updating the network information in response to a new node being added to the plurality of nodes or a new link being added to the plurality of links.

9. A system comprising:

one or more computer-readable storage media configured to store instructions; and

one or more processors communicatively coupled to the one or more computer-readable storage media and configured to, in response to execution of the instructions, cause the system to perform operations, the operations comprising:

obtaining network information of a network, the network information including:

a network topology that includes a plurality of nodes and a plurality of links connecting the plurality of nodes, each of the plurality of links including a first routing metric and a second routing metric; and

a plurality of first paths from each node of the plurality of nodes to all other nodes of the plurality of nodes along the plurality of links, the plurality of first paths determined based on the first routing metric;

after obtaining the network information, determining a second path from a first node of the plurality of nodes to a second node of the plurality of nodes, the determining the second path including selecting path segments for the second path along the plurality of links based on the path segments being included in the plurality of first paths and based on the second routing metric of the plurality of links included in the path segments;

obtaining, at the first node, an indication of nodes included in the second path, the indication of nodes including nodes of the plurality of nodes to constrain routing along the second path based on the first path metric,

wherein determining the second path comprises:

obtaining a transmission delay constraint and an input path from the plurality of first paths that satisfy the first routing metric;

adding a first node identifier associated with the first node to the indication of nodes;

traversing the input path from the first node to the second node adding one or more intermediate node identifiers to the indication of nodes, the one or more intermediate node identifiers comprising:

a first intermediate node that includes a successor node, the successor node having multiple predecessor nodes wherein less than all paths from the first node to the second node, routed through the predecessor nodes, satisfy the transmission delay constraint; and

a second intermediate node wherein a link of the plurality of links between a previous node and the second intermediate node is not included on any paths of the plurality of first paths; and

adding a last node identifier associated with the second node to the indication of nodes; and

wherein satisfying the transmission delay constraint comprises:

computing a first delay between the first node and a current node, a second delay between the current node and a second successor node, and a remaining delay between the second successor node and the second node, wherein the first delay, the second delay, and the remaining delay include a worst case delay computation;

comparing a sum of the first delay, the second delay, and the remaining delay to the transmission delay constraint; and

in instances in which the sum is greater than the transmission delay constraint, adding a node identifier of the current node to the indication of nodes.

10. The system of claim 9 , wherein the second path is determined in response to receiving a request from the second node for data from the first node.

11. The system of claim 10 , wherein the request includes a transmission delay constraint, the second routing metric is a transmission delay, and the path segments for the second path are selected to include the path segments included in the plurality of first paths with transmission delays that satisfy the transmission delay constraint for the second path.

12. The system of claim 9 , wherein the first routing metric is a cost associated with using a link of the plurality of links and the second routing metric is a transmission delay associated with using the link.

13. The system of claim 9 , wherein the second path is determined in response to a sum of the second routing metric associated with the path segments of the plurality of first paths being less than a transmission delay constraint.

14. The system of claim 9 , wherein the indication of nodes does not include all the nodes of the plurality of nodes included in the second path.

15. The system of claim 9 , wherein the plurality of nodes represent one or more routers or one or more switches.

16. The system of claim 9 , wherein the operations further comprise updating the network information in response to a new node being added to the plurality of nodes or a new link being added to the plurality of links.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 13, 2025
From: FUJITSU LIMITED
To: 1FINITY INC.
Reel/Frame 072432/0884 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 2, 2021
From: ZHANG, QIONG; VLADESCU, VIRGIL; PALACHARLA, PAPARAO
To: FUJITSU LIMITED
Reel/Frame 056417/0048 →
Continuity (1)
Related Publication 20220385567A1 · Dec 1, 2022