Weighted random early back-to-sender notification

Patent metadata

Field	Value
Publication number	US-12388756-B2
Application number	US-202318508128-A
Country	US
Kind code	B2
Filing date	Nov 13, 2023
Priority date	Aug 6, 2023
Publication date	Aug 12, 2025
Grant date	Aug 12, 2025

Abstract

It is determined that a computing node is contributing to a network congestion event. A congestion notification message is generated. A timing profile is determined for sending the congestion notification message based on the level of the network congestion event. Based on the timing profile, the congestion notification message is forwarded to the computing node determined to be contributing to the network congestion event.

First claim

The invention claimed is:

1. A method for managing a computing network, the method comprising:
determining, by a network device of the computing network, that a computing node is contributing to a network congestion event;
in response to the determining, causing generation of a congestion notification message;
determining a timing profile for sending the congestion notification message based on a level of the network congestion event; and
based on the timing profile, forwarding the congestion notification message to the computing node determined to be contributing to the network congestion event.

2. The method of claim 1 , wherein the congestion notification message is probabilistically generated based on a congestion measure.

3. The method of claim 1 , wherein a frequency with which the congestion notification message is sent is varied proportionally as a function of the level of the network congestion event.

4. The method of claim 3 , wherein the frequency is increased when the level of the network congestion event exceeds a threshold.

5. The method of claim 1 , wherein the level of the network congestion event is based on queue length.

6. The method of claim 1 , wherein the timing profile is a Weighted Random profile.

7. The method of claim 1 , wherein the congestion notification message is probabilistically generated based on a queue occupancy in a linear fashion.

8. The method of claim 1 , wherein the congestion notification message is probabilistically generated based on a queue occupancy in a varied or non-linear approach.

9. The method of claim 1 , further comprising setting an Explicit Congestion Notification (ECN) bit for a data packet that has triggered a Back-to-Sender (BTS) message, wherein future queues do not trigger an additional BTS message when the ECN bit is set, except when the data packet is dropped.

10. The method of claim 9 , wherein the BTS message further comprises one or more of a relative queue size, a number of active output flows, total transmitted bytes on port or queue combination within a switch along with a timestamp for that snapshot, cumulative buffer occupancy at the port or buffer level, or queue size gradient.

11. A system for managing a computing network, the system comprising a network device and computing node, the system configured to perform operations comprising:
determining, by a network device of the computing network, that a computing node is contributing to a network congestion event;
in response to the determining, causing generation of a congestion notification message;
determining a timing profile for sending the congestion notification message based on a level of the network congestion event; and
based on the timing profile, forwarding the congestion notification message to the computing node determined to be contributing to the network congestion event.

12. The system of claim 11 , wherein the congestion notification message is probabilistically generated based on a congestion measure.

13. The system of claim 11 , wherein a frequency with which the congestion notification message is sent is varied proportionally as a function of the level of the network congestion event.

14. The system of claim 13 , wherein the frequency is increased when the level of the network congestion event exceeds a threshold.

15. The system of claim 11 , wherein the level of the network congestion event is based on queue length.

16. The system of claim 11 , wherein the congestion notification message is probabilistically generated based on a queue occupancy in a linear fashion.

17. The system of claim 11 , wherein the congestion notification message is probabilistically generated based on a queue occupancy in a varied or non-linear approach.

18. The system of claim 11 , further comprising setting an Explicit Congestion Notification (ECN) bit for a data packet that has triggered a Back-to-Sender (BTS) message, wherein future queues do not trigger an additional BTS message when the ECN bit is set, except when the data packet is dropped.

19. The system of claim 18 , wherein the BTS message further comprises one or more of a relative queue size, a number of active output flows, total transmitted bytes on port or queue combination within a switch along with a timestamp for that snapshot, cumulative buffer occupancy at the port or buffer level, or queue size gradient.

20. 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:
determining, by a network device of the computing network, that a computing node is contributing to a network congestion event;
in response to the determining, causing generation of a congestion notification message;
determining a timing profile for sending the congestion notification message based on a level of the network congestion event; and
based on the timing profile, forwarding the congestion notification message to the computing node determined to be contributing to the network congestion event.

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