IP Library Granted Patent US 12,452,175
Granted Patent B2
US 12,452,175 · App. 18/507,707 · Granted Oct 21, 2025

Fairness and congestion control convergence

Inventors: Abdul Kabbani (Redmond, WA); Torsten Hoefler (Pfaeffikon, CH)
Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
H04L47/125H04L47/11H04L47/115H04L47/12H04L47/18H04L47/24H04L47/263H04L47/27H04L47/30H04L47/33H04L47/43H04L47/6225H04L47/6245
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,452,175
App. No.
18/507,707
Granted
Oct 21, 2025
Kind
B2
Abstract

A first ratio of a sending rate limit to a full line rate for a link in the computing network is accessed. A second ratio of a sending window size to W_max for the link is accessed. W_max is the maximum allowed window size or the window size that utilizes an end-to-end path for the link. One or more of the first or second ratio is used to determine an amount to reduce the sending rate or window for the link in response to an indication of network congestion in the link.

Claims (35)

1. A method for managing a computing network, the method comprising:

receiving a congestion notification message indicating a network congestion event in the computing network;

accessing a first ratio of a sending rate limit to a full line rate for a link in the computing network;

accessing a second ratio of a sending window size to W_max for the link, wherein W_max is a maximum allowed window size or a window size that utilizes an end-to-end path for the link;

using both the first ratio and the second ratio, determining an amount to reduce a sending rate for the link in response to the congestion notification message, the amount being representative of a contribution of the link to the network congestion event in the computing network, and wherein larger ratios result in a larger reduction to the sending rate; and

reducing the sending rate for the link by the determined amount.

2. The method of claim 1 , wherein the full line rate is for network interface card (NIC) speed.

3. The method of claim 1 , wherein the first ratio is for a function that combines a current rate limit and the full line rate.

4. The method of claim 1 , wherein the W_max is a function of a bandwidth delay product (BDP).

5. The method of claim 1 , wherein the second ratio is for a window-based scheme or a rate-based scheme.

6. The method of claim 1 , wherein the second ratio is for a function that combines a current window size and W_max.

7. The method of claim 1 , wherein the sending rate or window is indicative of an amount that a current connection is contributing to the network congestion event.

8. A system for managing a computing network, the system comprising a network device and computing node, the system configured to perform operations comprising:

receiving a congestion notification message indicating a network congestion event in the computing network;

accessing a first ratio of a sending rate limit to a full line rate for a link in the computing network;

accessing a second ratio of a sending window size to W_max for the link, wherein W_max is a maximum allowed window size or a window size that utilizes an end-to-end path for the link; and

using both the first ratio and the second ratio, determining an amount to reduce a sending rate for the link in response to the congestion notification message, the amount being representative of a contribution of the link to the network congestion event in the computing network, and wherein larger ratios result in a larger reduction to the sending rate; and

reducing the sending rate for the link by the determined amount.

9. The system of claim 8 , wherein the full line rate is for network interface card (NIC) speed.

10. The system of claim 8 , wherein the first ratio is for a function that combines a current rate limit and the full line rate.

11. The system of claim 8 , wherein the W_max is a bandwidth delay product (BDP).

12. The system of claim 8 , wherein the second ratio is for a window- based scheme.

13. The system of claim 8 , wherein the second ratio is for a function that combines a current window size and W_max.

14. The system of claim 13 , wherein the sending rate or window is indicative of an amount that a current connection is contributing to the network congestion event.

15. A computer readable storage medium comprising computer readable instructions for managing a computing network, the computer readable instructions operable, when executed by a computing node, to perform operations comprising:

receiving a congestion notification message indicating a network congestion event in the computing network;

accessing a first ratio of a sending rate limit to a full line rate for a link in the computing network;

accessing a second ratio of a sending window size to W_max for the link, wherein W_max is a maximum allowed window size or a window size that utilizes an end-to-end path for the link; and

using both the first ratio and the second ratio, determining an amount to reduce a sending rate for the link in response to the congestion notification message, the amount being representative of a contribution of the link to the network congestion event in the computing network, and wherein larger ratios result in a larger reduction to the sending rate; and

reducing the sending rate for the link by the determined amount.

16. The computer readable storage medium of claim 15 , wherein the full line rate is for network interface card (NIC) speed.

17. The computer readable storage medium of claim 15 , wherein the first ratio is for a function that combines a current rate limit and the full line rate.

18. The computer readable storage medium of claim 15 , wherein the W_max is a bandwidth delay product (BDP).

19. The computer readable storage medium of claim 15 , wherein the second ratio is for a window-based scheme.

20. The computer readable storage medium of claim 15 , wherein the second ratio is for a function that combines a current window size and W_max.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 15, 2023
From: KABBANI, ABDUL; HOEFLER, TORSTEN
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 065889/0882 →
Continuity (8)
Provisional Application 63530992 · Aug 6, 2023
Provisional Application 63530991 · Aug 6, 2023
Provisional Application 63517918 · Aug 6, 2023
Provisional Application 63530997 · Aug 6, 2023
Provisional Application 63517919 · Aug 6, 2023
Provisional Application 63517917 · Aug 6, 2023
Provisional Application 63531000 · Aug 6, 2023
Related Publication 20250047600A1 · Feb 6, 2025
References Cited (116)
US 6105064A · Davis · 2000 [cited by examiner]
US 6614755B1 · Dote · 2003 [cited by examiner]
US 6839321B1 · Chiruvolu · 2005 [cited by examiner]
US 6850488B1 · Wesley · 2005 [cited by applicant]
US 6996062B1 · Freed · 2006 [cited by applicant]
US 7092357B1 · Ye · 2006 [cited by applicant]
US 7957293B2 · Mayhew · 2011 [cited by applicant]
US 8443072B1 · Orbach · 2013 [cited by applicant]
US 8904034B2 · Song · 2014 [cited by applicant]
US 9112797B2 · Ludwig · 2015 [cited by applicant]
US 9185036B2 · Malhotra · 2015 [cited by applicant]
US 9444739B2 · Huysegems · 2016 [cited by applicant]
US 9473408B1 · Kabbani · 2016 [cited by applicant]
US 9544233B2 · Ansari · 2017 [cited by applicant]
US 9654399B2 · Liu · 2017 [cited by applicant]
US 9692696B2 · Decusatis · 2017 [cited by applicant]
US 11575609B2 · Srinivasan · 2023 [cited by applicant]
US 11616723B2 · Friedman · 2023 [cited by applicant]
US 11621918B2 · Friedman · 2023 [cited by applicant]
US 12224940B2 · Musleh · 2025 [cited by applicant]
US 20020141341A1 · Haggar · 2002 [cited by examiner]
US 20040109443A1 · Gai · 2004 [cited by applicant]
US 20060193261A1 · Sethi · 2006 [cited by applicant]
US 20060203728A1 · Kwan · 2006 [cited by examiner]
US 20060203730A1 · Zur · 2006 [cited by applicant]
US 20060256784A1 · Feng · 2006 [cited by applicant]
US 20080037420A1 · Tang · 2008 [cited by applicant]
US 20080239948A1 · Bai · 2008 [cited by applicant]
US 20090245112A1 · Okazaki · 2009 [cited by examiner]
US 20090310610A1 · Sandstrom · 2009 [cited by applicant]
US 20100061251A1 · Nassor · 2010 [cited by applicant]
US 20100118703A1 · Mayhew · 2010 [cited by applicant]
US 20110205898A1 · Ichiki · 2011 [cited by applicant]
US 20120120801A1 · Ramakrishnan · 2012 [cited by applicant]
US 20120185594A1 · Huysegems · 2012 [cited by applicant]
US 20130232228A1 · Ramamurthy · 2013 [cited by examiner]
US 20130308455A1 · Kapadia · 2013 [cited by applicant]
US 20140112128A1 · Kwan · 2014 [cited by examiner]
US 20140226473A1 · Jin · 2014 [cited by examiner]
US 20140321289A1 · Liu · 2014 [cited by applicant]
US 20150029849A1 · Frost · 2015 [cited by applicant]
US 20150131446A1 · Kwan · 2015 [cited by applicant]
US 20150172075A1 · Decusatis · 2015 [cited by applicant]
US 20170019803A1 · Nguyen · 2017 [cited by applicant]
US 20170324629A1 · Iyer · 2017 [cited by examiner]
US 20190044861A1 · Wandler · 2019 [cited by examiner]
US 20190116122A1 · Friedman · 2019 [cited by applicant]
US 20200236052A1 · Srinivasan · 2020 [cited by applicant]
US 20200366608A1 · Pan · 2020 [cited by examiner]
US 20210119930A1 · Debbage et al. · 2021 [cited by applicant]
US 20210297350A1 · Vegesna · 2021 [cited by examiner]
US 20210297351A1 · Vegesna et al. · 2021 [cited by applicant]
US 20210320820A1 · Ruan et al. · 2021 [cited by applicant]
US 20210328930A1 · Nikolaidis · 2021 [cited by applicant]
US 20210344782A1 · Shpigelman · 2021 [cited by applicant]
US 20220078118A1 · Ao · 2022 [cited by examiner]
US 20220085916A1 · Debbage · 2022 [cited by applicant]
US 20220210075A1 · Musleh · 2022 [cited by applicant]
US 20220210097A1 · Yang · 2022 [cited by applicant]
US 20220311711A1 · Jepsen · 2022 [cited by applicant]
US 20220368633A1 · Liu · 2022 [cited by applicant]
US 20230198895A1 · Amir · 2023 [cited by applicant]
US 20230246966A1 · Sun · 2023 [cited by applicant]
US 20230269184A1 · Zemach · 2023 [cited by applicant]
US 20230336490A1 · Arslan · 2023 [cited by examiner]
US 20230362099A1 · Tilmans · 2023 [cited by examiner]
US 20240396839A1 · Friedman · 2024 [cited by applicant]
US 20240414093A1 · Sah · 2024 [cited by applicant]
US 20240430200A1 · Zhao · 2024 [cited by applicant]
US 20250047598A1 · Kabbani · 2025 [cited by applicant]
US 20250047603A1 · Kabbani · 2025 [cited by applicant]
US 20250047604A1 · Kabbani · 2025 [cited by applicant]
US 20250047610A1 · Kabbani · 2025 [cited by applicant]
US 20250047613A1 · Kabbani · 2025 [cited by applicant]
US 20250047616A1 · Hoefler · 2025 [cited by applicant]
US 20250055797A1 · Gary · 2025 [cited by applicant]
CN 113411264A · 2021 [cited by applicant]
CN 115314442A · 2022 [cited by applicant]
CN 117527698A · 2024 [cited by examiner]
CN 117692396A · 2024 [cited by examiner]
WO 0189160A1 · 2001 [cited by applicant]
WO 2020236297A1 · 2020 [cited by applicant]
WO 2021238799A1 · 2021 [cited by applicant]
Kabbani, Abdul, et al. “AF-QCN: Approximate fairness with quantized congestion notification for multi-tenanted data centers.” 2010 18th ieee symposium on high performance interconnects. IEEE, 2010. (Year: 2010). [cited by examiner]
Malekpour, Amirhossein, Antonio Carzaniga, and Fernando Pedone. “End-to-end congestion control for content-based networks.” 2014 IEEE 33rd International Symposium on Reliable Distributed Systems. IEEE, 2014. (Year: 2014… [cited by examiner]
Menikkumbura, Danushka, et al. “Congestion control for datacenter networks: A control-theoretic approach.” IEEE Transactions on Parallel and Distributed Systems 34.5 (2023): 1682-1696. (Year: 2023). [cited by examiner]
Adams, et al., “Active Queue Management: A Survey”, IEEE Communications Surveys & Tutorials, vol. 15, No. 3, 2013, pp. 1425-1476. [cited by applicant]
Choi, et al., “On Fair Window Control for TCP With ECN Using Congestion Level”, IEICE Transaction on Communication, vol. E68-B, No. 12, Dec. 2003, pp. 3651-3654. [cited by applicant]
Floyd, Sally, “TCP and Explicit Congestion Notification”, ACM SIGCOMM—Computer Communication Review, 1994, pp. 8-23. [cited by applicant]
Gilad, et al., “MPCC Online Learning Multipath Transport”, Proceedings of the IEEE/ACM 42nd International Conference on Software Engineering Workshops, ACMPUB27, New York, NY, USA, Nov. 23, 2020, pp. 121-135. [cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/US2024/039448, mailed on Oct. 10, 2024, 18 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/US2024/039450, Oct. 14, 2024, 17 pages. [cited by applicant]
Karandikar, et al., “TCP rate control”, ACM SIGCOMM—Computer Communication Review, 2000, pp. 45-58. [cited by applicant]
Karnik, et al., “Performance of TCP congestion control with explicit rate feedback”, IEEE /ACM Transactions on Networking, vol. 13, No. 1, Feb. 2005, pp. 108-120. [cited by applicant]
Notice of Allowance mailed on Oct. 24, 2024, in U.S. Appl. No. 18/508,137, 8 pages. [cited by applicant]
Tang, et al., “Tuning Target Delay for RTT-based Congestion Control”, 2022 IEEE 30th International Conference on Network Protocols (ICNP), IEEE, Oct. 30, 2022, pp. 1-11. [cited by applicant]
Alibaba, et al., “MPLS Segment Routing Over IP; rfc8663.txt”, Internet Engineering Task Force, IETF; Standard, Internet Society (ISOC) 4, Rue Des Falaises CH—1205 Geneva, Switzerland, Dec. 6, 2019, Retrieved from URL: h… [cited by applicant]
Alipio, et al., “TCP incast solutions in data center networks: A classification and survey”, Journal of network and computer applications, vol. No. 146, Aug. 8, 2019, 28 Pages. [cited by applicant]
Hu, et al., “Coding-Based Distributed Congestion-Aware Packet Spraying to Avoid Reordering in Data Center Networks”, IEEE Access, vol. 9, Mar. 1, 2021, pp. 35539-35548. [cited by applicant]
International Search Report and Written Opinion Issued in PCT Application No. PCT/US2024/039446, Mailed on Nov. 14, 2024, 13 Pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/US2024/039444, Nov. 13, 2024, 13 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/US2024/039445, Nov. 12, 2024, 16 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/US2024/039447, Nov. 18, 2024, 16 pages. [cited by applicant]
Invitation to Pay Additional Fees received for PCT Application No. PCT/US2024/039449, Nov. 13, 2024, 12 pages. [cited by applicant]
Key, et al., “Combining Multipath Routing and Congestion Control for Robustness”, 40th Annual Conference on Information Sciences and Systems—IEEE, Mar. 22, 2006, 07 pages. [cited by applicant]
Non-Final Office Action mailed on Dec. 16, 2024, in U.S. Appl. No. 18/507,788, 12 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/US2024/039449, Jan. 9, 2025, 20 pages. [cited by applicant]
Non-Final Office Action mailed on Jan. 8, 2025, in U.S. Appl. No. 18/507,831, 14 pages. [cited by applicant]
Non-Final Office Action mailed on Mar. 3, 2025, in U.S. Appl. No. 18/508,036, 11 pages. [cited by applicant]
Final Office Action mailed on Apr. 15, 2025, in U.S. Appl. No. 18/507,788, 13 pages. [cited by applicant]
Notice of Allowance mailed on Mar. 26, 2025, in U.S. Appl. No. 18/508,128 10 pages. [cited by applicant]
Final Office Action mailed on Jul. 15, 2025, in U.S. Appl. No. 18/507,831, 16 pages. [cited by applicant]
Non-Final Office Action mailed on Aug. 22, 2025, in U.S. Appl. No. 18/507,788, 13 pages. [cited by applicant]
Notice of Allowance mailed on Jun. 26, 2025, in U.S. Appl. No. 18/508,036, 07 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/US2024/039448, mailed on Sep. 12, 2025, 18 pages. [cited by applicant]
Matsuda, et al., “Active ECN Mechanism for Fairness Among TCP Sessions with Different Round Trip Times”, IEICE Transaction on Communication, Communications Society, vol. E87-B, No. 10, Oct. 1, 2004, pp. 2931-2938. [cited by applicant]
Cited By (1)
US 12,706,861