Fairness and congestion control convergence

Patent metadata

Field	Value
Publication number	US-12452175-B2
Application number	US-202318507707-A
Country	US
Kind code	B2
Filing date	Nov 13, 2023
Priority date	Aug 6, 2023
Publication date	Oct 21, 2025
Grant date	Oct 21, 2025

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.

First claim

The invention claimed is:

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.

Assignees

• Microsoft Technology Licensing Llc

Inventors

• Kabbani Abdul
• Hoefler Torsten

Classifications

• H04L47/6245

  Modifications to standard FIFO or LIFO · CPC title

• H04L47/6225

  Fixed service order, e.g. Round Robin · CPC title

• H04L47/24 Primary

  Traffic characterised by specific attributes, e.g. priority or QoS · CPC title

• H04L47/30

  in combination with information about buffer occupancy at either end or at transit nodes · CPC title

• H04L47/43

  Assembling or disassembling of packets, e.g. segmentation and reassembly [SAR] · CPC title