IP Library › Granted Patent US 12,395,433
Granted Patent B2
US 12,395,433 · App. 18/298,660 · Granted Aug 19, 2025

Machine learning segment routing for multiple traffic matrices

Inventors: Muralidharan Kodialam (Austin, TX); Tv Lakshman (Morganville, NJ)
Assignee: Nokia Solutions and Networks Oy
H04L47/12H04L41/16H04L45/34
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 12,395,433
App. No.
18/298,660
Filed
Apr 11, 2023
Granted
Aug 19, 2025
Kind
B2
Examiner
SHIU, HO T
Art Unit
2443
USPC
709/238
Abstract

In some embodiments, there may be provided a method that includes receiving a first traffic matrix; receiving information regarding links associated with each segment of the network; determining a total amount of segment flow using the at least one non-linear deflection parameter applied to the traffic demand of the first traffic matrix; determining a link flow for each of the links using the total amount of segment flow and the second input to the machine learning model; determining link utilization for each of the links using the link flows and a capacity for each of the links; learning, by the machine learning model using a gradient descent, a minimum of a maximum amount of the link utilization over the links by at least adjusting a value of the at least one non-linear deflection parameter. Related systems, methods, and articles of manufacture are also disclosed.

Claims (47)

1. A method comprising:

receiving, as a first input to a machine learning model, a first traffic matrix, wherein the first traffic matrix indicates traffic demand between at least a source node and a destination node of a network;

receiving, as a second input to the machine learning model, information regarding links associated with each segment of the network, wherein each segment corresponds to a pair of nodes of the network;

transforming, by the machine learning model, at least one deflection parameter into at least one non-linear deflection parameter, wherein the at least one deflection parameter indicates a fractional amount of traffic that is carried between the source node and the destination node and deflected to an intermediary node;

determining, by the machine learning model, a total amount of segment flow using the at least one non-linear deflection parameter applied to the traffic demand of the first traffic matrix;

determining, by the machine learning model, a link flow for each of the links using the total amount of segment flow and the second input to the machine learning model;

determining, by the machine learning model, link utilization for each of the links using the link flows and a capacity for each of the links;

learning, by the machine learning model using a gradient descent, a minimum of a maximum amount of the link utilization over the links by at least adjusting a value of the at least one non-linear deflection parameter; and

providing, by the machine learning model, an output comprising the at least one non-linear deflection parameter and/or the at least one non-linear deflection parameter transformed back into a linear domain.

2. The method of claim 1 , further comprising:

receiving a plurality of traffic matrices indicative of traffic demands between at least the source node and the destination node of the network.

3. The method of claim 2 , wherein the total amount of segment flow is determined using the at least one non-linear deflection parameter applied to the traffic demands obtained from the plurality of traffic matrices.

4. The method of claim 1 , wherein the output comprising the at least one non-linear deflection parameter and/or the at least one non-linear deflection parameter transformed back into the linear domain takes into account the learning using a plurality of traffic matrices indicative of traffic demands between at least the source node and the destination node of the network.

5. The method of claim 1 , wherein the output is provided to one or more routing tables of the network.

6. The method of claim 1 , wherein the output provides the fractional amount of traffic that is deflected to the intermediary node.

7. The method of claim 1 , wherein the at least one non-linear deflection parameter is generated by at least transforming the at least one deflection parameter into an exponential domain and then normalizing the at least one non-linear deflection parameter to a value between zero and one.

8. The method of claim 1 , wherein the machine learning model comprises a loss function including the at least one non-linear deflection parameter.

9. The method of claim 1 , wherein the machine learning model performs the learning as an unconstrained optimization of the minimum of the maximum amount of the link utilization.

10. An apparatus comprising:

at least one processor;

at least one memory including instructions, which when executed by the at least one processor causes the apparatus to cause operations comprising:

receiving, as a first input to a machine learning model, a first traffic matrix, wherein the first traffic matrix indicates traffic demand between at least a source node and a destination node of a network;

receiving, as a second input to the machine learning model, information regarding links associated with each segment of the network, wherein each segment corresponds to a pair of nodes of the network;

transforming, by the machine learning model, at least one deflection parameter into at least one non-linear deflection parameter, wherein the at least one deflection parameter indicates a fractional amount of traffic that is carried between the source node and the destination node and deflected to an intermediary node;

determining, by the machine learning model, a total amount of segment flow using the at least one non-linear deflection parameter applied to the traffic demand of the first traffic matrix;

determining, by the machine learning model, a link flow for each of the links using the total amount of segment flow and the second input to the machine learning model;

determining, by the machine learning model, link utilization for each of the links using the link flows and a capacity for each of the links;

learning, by the machine learning model using a gradient descent, a minimum of a maximum amount of the link utilization over the links by at least adjusting a value of the at least one non-linear deflection parameter; and

providing, by the machine learning model, an output comprising the at least one non-linear deflection parameter and/or the at least one non-linear deflection parameter transformed back into a linear domain.

11. The apparatus of claim 10 , further comprising:

receiving a plurality of traffic matrices indicative of traffic demands between at least the source node and the destination node of the network.

12. The apparatus of claim 11 , wherein the total amount of segment flow is determined using the at least one non-linear deflection parameter applied to the traffic demands obtained from the plurality of traffic matrices.

13. The apparatus of claim 10 , wherein the output comprising the at least one non-linear deflection parameter and/or the at least one non-linear deflection parameter transformed back into the linear domain takes into account the learning using a plurality of traffic matrices indicative of traffic demands between at least the source node and the destination node of the network.

14. The apparatus of claim 10 , wherein the output is provided to one or more routing tables of the network.

15. The apparatus of claim 10 , wherein the output provides the fractional amount of traffic that is deflected to the intermediary node.

16. The apparatus of claim 10 , wherein the at least one non-linear deflection parameter is generated by at least transforming the at least one deflection parameter into an exponential domain and then normalizing the at least one non-linear deflection parameter to a value between zero and one.

17. The apparatus of claim 10 , wherein the machine learning model comprises a loss function including the at least one non-linear deflection parameter.

18. The apparatus of claim 10 , wherein the machine learning model performs the learning as an unconstrained optimization of the minimum of the maximum amount of the link utilization.

19. A non-transitory computer-readable storage medium including instructions, which when executed by at least one processor causes operations comprising:

receiving, as a first input to a machine learning model, a first traffic matrix, wherein the first traffic matrix indicates traffic demand between at least a source node and a destination node of a network;

receiving, as a second input to the machine learning model, information regarding links associated with each segment of the network, wherein each segment corresponds to a pair of nodes of the network;

transforming, by the machine learning model, at least one deflection parameter into at least one non-linear deflection parameter, wherein the at least one deflection parameter indicates a fractional amount of traffic that is carried between the source node and the destination node and deflected to an intermediary node;

determining, by the machine learning model, a total amount of segment flow using the at least one non-linear deflection parameter applied to the traffic demand of the first traffic matrix;

determining, by the machine learning model, a link flow for each of the links using the total amount of segment flow and the second input to the machine learning model;

determining, by the machine learning model, link utilization for each of the links using the link flows and a capacity for each of the links;

learning, by the machine learning model using a gradient descent, a minimum of a maximum amount of the link utilization over the links by at least adjusting a value of the at least one non-linear deflection parameter; and

providing, by the machine learning model, an output comprising the at least one non-linear deflection parameter and/or the at least one non-linear deflection parameter transformed back into a linear domain.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 15, 2023
From: KODIALAM, MURALIDHARAN; LAKSHMAN, TV
To: NOKIA OF AMERICA CORPORATION
Reel/Frame 063959/0005 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 15, 2023
From: NOKIA OF AMERICA CORPORATION
To: NOKIA SOLUTIONS AND NETWORKS OY
Reel/Frame 063959/0126 →
Continuity (1)
Related Publication 20240348547A1 · Oct 17, 2024
References Cited (14)
US 10277475B2 · Girmonsky · 2019 [cited by applicant]
US 10277476B2 · Mermoud et al. · 2019 [cited by applicant]
US 10873533B1 · Ismailsheriff et al. · 2020 [cited by applicant]
US 10990878B2 · Olabiyi et al. · 2021 [cited by applicant]
US 20160294699A1 · Kodialam · 2016 [cited by examiner]
US 20170134089A1 · Mansouri Rad · 2017 [cited by examiner]
US 20170310395A1 · Mehrvar · 2017 [cited by examiner]
US 20180176134A1 · Pignataro · 2018 [cited by examiner]
Bernárdez, G. et al. “Is Machine Learning Ready for Traffic Engineering Optimization?” 2021 IEEE 29th International Conference on Network Protocols (ICNP). IEEE, 2021. [cited by applicant]
Chretien, S. et al. “Online shortest paths with confidence intervals for routing in a time varying random network.” 2018 International Joint Conference on Neural Networks (IJCNN). 2018. [cited by applicant]
Kodialam, M. et al. “Network Link Weight Setting: a Machine Learning Based Approach.” IEEE Conference on Computer Communications, IEEE INFOCOM 2022, pp. 2048-2057. [cited by applicant]
Mesquita, L. et al. “Traffic Matrix Prediction for Optical Networks.” 2019 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC). IEEE, 2019. [cited by applicant]
Todorov, D. et al., “Load Balancing model based on Machine Learning and Segment Routing in SDN,” 2020 International Conference Automatics and Informatics (ICAI), IEEE, Oct. 1, 2020, 4 pages. [cited by applicant]
Extended European Search Report issued in co-pending European Application No. 24168303.6-1206 mailed Aug. 13, 2024, 8 pages. [cited by applicant]