IP Library Granted Patent US 12,199,872
Granted Patent B2
US 12,199,872 · App. 18/083,768 · Granted Jan 14, 2025

Protocol agnostic cognitive congestion control

Inventors: Bilgehan Erman (Weehawken, NJ); Ejder Bastug (Paris, FR); Bruce Cilli (Atlantic Highlands, NJ); Andrea Francini (Pittsboro, NC); Luoyao Hao (New York, NY)
Assignee: Nokia Solutions and Networks Oy
H04L47/12H04L47/25H04L47/50H04L69/321H04L69/325
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,199,872
App. No.
18/083,768
Granted
Jan 14, 2025
Kind
B2
Abstract

Various example embodiments for supporting congestion control in a communication network are presented. Various example embodiments for supporting congestion control in a communication network may be configured to support protocol agnostic cognitive congestion control in the communication network. Various example embodiments for supporting protocol agnostic cognitive congestion control in a communication network may be configured to support protocol agnostic cognitive congestion control in the communication network by enabling a sending node of a path over which a set of flows is to be communicated to determine the minimum target transmission rate among the links along the path over which the flows are to be communicated and to use the minimum target transmission rate among the links along the path over which flows are to be communicated in order to control transmission of packets over the path at Layer 3 of the Open Systems Interconnection (OSI) model.

Claims (41)

1. An apparatus, comprising:

at least one processor; and

at least one memory including instructions that, when executed by the at least one processor, cause the apparatus at least to:

receive, by a layer 3 protocol handler from a layer 4 protocol handler for a flow to be transmitted over a path between a sending node and a receiving node that includes a set of transit nodes, a protocol data unit of the flow and a context key associated with the flow;

associate, by the layer 3 protocol handler, the context key with a packet queue storing a set of packets generated based on the protocol data unit;

determine, by the layer 3 protocol handler for the context key, a minimum target transmission rate associated with the path for the context key, wherein to determine the minimum target transmission rate associated with the path for the context key comprises to send, by the layer 3 protocol handler, a request for each of the transit nodes of the path to provide a respective target transmission rate associated with the path for the context key; and

send, by the layer 3 protocol handler based on the minimum target transmission rate associated with the path for the context key, the set of packet.

2. The apparatus of claim 1 , wherein the flow belongs to an application session of an application on the sending node.

3. The apparatus of claim 2 , wherein the context key uniquely identifies the application session of the application.

4. The apparatus of claim 2 , wherein the context key is generated by the application.

5. The apparatus of claim 1 , wherein the context key is generated by the layer 4 protocol handler.

6. The apparatus of claim 1 , wherein the set of packets is generated by the layer 3 protocol handler from the protocol data unit.

7. The apparatus of claim 1 , wherein, to send the request for each of the transit nodes of the path to provide the respective target transmission rate associated with the path for the context key, the instructions, when executed by the at least one processor, cause the apparatus at least to:

include, by the layer 3 protocol handler within a first packet of the set of packets sent via the path, the context key and an indication of the request for each of the transit nodes of the path to provide the respective target transmission rate associated with the path for the context key.

8. The apparatus of claim 1 , wherein, to determine the minimum target transmission rate associated with the path, the instructions, when executed by the at least one processor, cause the apparatus at least to:

receive, by the layer 3 protocol handler from the receiving node of the path, a packet including the minimum target transmission rate associated with the path for the context key.

9. The apparatus of claim 1 , wherein, to determine the minimum target transmission rate associated with the path, the instructions, when executed by the at least one processor, cause the apparatus at least to:

receive, by the layer 3 protocol handler from the receiving node of the path, a packet including the respective target transmission rates provided by the transit nodes of the path; and

select, by the layer 3 protocol handler from the respective target transmission rates provided by the transit nodes of the path, the minimum target transmission rate associated with the path for the context key.

10. A method, comprising:

receiving, by a layer 3 protocol handler from a layer 4 protocol handler for a flow to be transmitted over a path, a protocol data unit of the flow and a context key associated with the flow;

associating, by the layer 3 protocol handler, the context key with a packet queue storing a set of packets generated based on the protocol data unit;

determining, by the layer 3 protocol handler for the context key, a minimum target transmission rate associated with the path for the context key, wherein said determining the minimum target transmission rate associated with the path for the context key comprises sending a request for each of the transit nodes of the path to provide a respective target transmission rate associated with the path for the context key; and

sending, by the layer 3 protocol handler based on the minimum target transmission rate associated with the path for the context key, the set of packets.

11. An apparatus, comprising:

at least one processor; and

at least one memory including instructions that, when executed by the at least one processor, cause the apparatus at least to:

receive, by a transit node from a sending node, a packet intended for delivery to a receiving node over a path from the sending node to the receiving node that includes an egress interface of the transit node, wherein the packet includes a context key and an indication of a request by the sending node for the transit node to provide a target transmission rate for the context key;

determine, by the transit node in response to the indication of the request by the sending node for the transit node to provide the target transmission rate for the context key and based on measurements of traffic on the egress interface of the transit node, the target transmission rate for the context key, wherein the target transmission rate is indicative of a prediction by the transit node that, when the sending node sends a set of flows associated with the context key at the target transmission rate, buffer delays encountered by the flows at the transit node are not expected to exceed a target buffering delay;

insert, by the transit node, the target transmission rate for the context key into the packet to form a modified packet; and

send, by the transit node toward the receiving node via the egress interface of the transit node, the modified packet.

12. The apparatus of claim 11 , wherein the target transmission rate for the context key is determined based on a determination that a utilization of a set of egress queues satisfies a target utilization.

13. The apparatus of claim 12 , wherein the utilization of the set of egress queues is based on a predicted number of active context flows, a predicted average throughput for the context key, the target transmission rate for the context key, and an egress transmission capacity of the egress interface.

14. The apparatus of claim 12 , wherein the target utilization is determined based on use of a probability distribution function related to a probability that a packet is delayed in the set of egress queues.

15. The apparatus of claim 12 , wherein the target utilization is determined based on use of at least one function to dynamically compute the target utilization for a given set of criteria for the egress interface of the transit node, wherein the at least one function includes at least one of an artificial intelligence function or a machine learning function.

16. An apparatus, comprising:

at least one processor; and

at least one memory including instructions that, when executed by the at least one processor, cause the apparatus at least to:

receive, by a receiving node of a path between a sending node and the receiving node that includes a set of transit nodes, a first packet that includes a context key, a respective set of target transmission rates of the respective transit nodes for the context key, and respective sets of statistical measures provided by the transit nodes for respective egress interfaces of the transit nodes; and

send, by the receiving node toward the sending node, a second packet including the context key, the set of target transmission rates of the respective transit nodes for the context key, and the respective sets of statistical measures provided by the transit nodes for respective egress interfaces of the transit nodes.

17. The apparatus of claim 16 , wherein the first packet is associated with a flow of an application session of an application on the sending node, wherein the context key uniquely identifies the application session of the application.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 22, 2022
From: BASTUG, EJDER
To: NOKIA NETWORKS FRANCE (AS OF 1 SEPTEMBER 2022, FORMERLY ALCATEL-LUCENT INTERNATIONAL S.A.)
Reel/Frame 062178/0670 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 22, 2022
From: ERMAN, BILGEHAN; CILLI, BRUCE; FRANCINI, ANDREA; HAO, LUOYAO
To: NOKIA OF AMERICA CORPORATION
Reel/Frame 062178/0676 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 22, 2022
From: NOKIA NETWORKS FRANCE (AS OF 1 SEPTEMBER 2022, FORMERLY ALCATEL-LUCENT INTERNATIONAL S.A.)
To: NOKIA SOLUTIONS AND NETWORKS OY
Reel/Frame 062178/0680 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 22, 2022
From: NOKIA OF AMERICA CORPORATION
To: NOKIA SOLUTIONS AND NETWORKS OY
Reel/Frame 062178/0687 →
Continuity (1)
Related Publication 20240205155A1 · Jun 20, 2024
References Cited (19)
US 7706345B2 · Meier · 2010 [cited by examiner]
US 10230681B2 · Ge · 2019 [cited by examiner]
US 11575579B2 · Gill · 2023 [cited by examiner]
US 11855850B2 · Gill · 2023 [cited by examiner]
US 20050128951A1 · Chawla et al. · 2005 [cited by applicant]
US 20210135988A1 · Erman et al. · 2021 [cited by applicant]
WO 2012058320A1 · 2012 [cited by applicant]
Lorincz, Josip, Zvonimir Klarin, and Julije Ožegović, “A Comprehensive Overview of TCP Congestion Control in 5G Networks: Research Challenges and Future Perspectives,” Sensors 21.13 (2021): 4510; pp. 41. [cited by applicant]
Fabio M. Chiussi, Ambalavanar Arulambalam, Ye Xia and Xiaoqiang Chen, “Explicit Rate ABR Schemes Using Traffic Load as Congestion Indicator,” Bell Laboratories, Lucent Technologies, Holmdel, NJ 07733, USA; Aug. 13, 1997… [cited by applicant]
J. Iyengar, Ed., M. Thomson, Ed., “QUIC: A UDP-Based Multiplexed and Secure Transport,” IETF, RFC 9000, ISSN 2070-1721, May 2021; pp. 151. [cited by applicant]
S. Deering, R. Hinden, “Internet Protocol, Version 6 (IPv6) Specification,” IETF, RFC 8200, ISSN 2070-1721, Jul. 2017; pp. 42. https://datatracker.ietf.org/doc/html/rfc8200. [cited by applicant]
Dordal, Peter Lors, “8.6: IPV6 Extension Headers,” LibreTexts, printed on Apr. 18, 2024; pp. 3. https://eng.libretexts.org/Bookshelves/Computer_Science/Networks/Book%3A_An_Introduction_to_Computer_Networks_(Dordal)/08%3… [cited by applicant]
S. Floyd, M. Allman, A. Jain, P. Sarolahti, “Quick-Start for TCP and IP,” IETF, RFC 4782, ICIR, F5 Networks, Nokia Research Center; Jan. 2007, pp. 82. https://datatracker.ietf.org/doc/html/rfc4782. [cited by applicant]
IETF, RFC 3168, “The Addition of Explicit Congestion Notification (ECN) to IP,” Sep. 2001; pp. 63. [cited by applicant]
Mohammad Alizadeh, Albert Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, Murari Sridharan, “Data Center TCP (DCTCP),” ACM SIGCOMM Conference, Microsoft Research, Stanford … [cited by applicant]
I. Rhee, L. Xu, S. Ha, A. Zimmermann, L. Eggert, R. Scheffenegger, “CUBIC for Fast Long-Distance Networks,” IETF, RFC 8312, ISSN 2070-1721, Feb. 2018; pp. 18. [cited by applicant]
Neal Cardwell, Yuchung Cheng, C. Stephen Gunn, Soheil Hassas Yeganeh, Van Jacobson, “BBR: Congestion-Based Congestion Control,” Communications of the ACM, 60(2), 2017; pp. 55-86. [cited by applicant]
The ATM Forum, “The ATM Forum Technical Committee; Traffic Management Specification Version 4.0,” Apr. 1996; pp. 108. [cited by applicant]
Extended European Search Report, Application No. 23213430.4-1213, Mar. 4, 2024; pp. 9. [cited by applicant]