Weighted random early back-to-sender notification

Patent metadata

Field	Value
Publication number	US-2025317397-A1
Application number	US-202519246594-A
Country	US
Kind code	A1
Filing date	Jun 23, 2025
Priority date	Aug 6, 2023
Publication date	Oct 9, 2025
Grant date	—

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

1 . A method for managing a computing network, the method comprising:
receiving, by a computing node from a network device of the computing network, a congestion notification message; reading an Explicit Congestion Notification (ECN) bit of the congestion notification message; based on a value of the ECN bit, determining that the congestion notification message is a second congestion notification message for a same packet; and in response to determining that the congestion notification message is the second congestion notification message for the same packet, responding only to an earlier congestion notification message for the same packet.

2 . The method of claim 1 , wherein the congestion notification message is sent based on a timing profile for sending the congestion notification message based on a level of a network congestion event associated with the congestion notification message.

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

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

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

6 . The method of claim 2 , 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 4 , wherein the frequency is increased when the level of the network congestion event exceeds a threshold.

10 . A system for managing a computing network, the system comprising a network device and computing node, the system configured to perform operations comprising:
receiving, by the computing node from the network device of the computing network, a congestion notification message; reading an Explicit Congestion Notification (ECN) bit of the congestion notification message; based on a value of the ECN bit, determining that the congestion notification message is a second congestion notification message for a same packet; and in response to determining that the congestion notification message is the second congestion notification message for the same packet, responding only to an earlier congestion notification message for the same packet.

11 . The system of claim 10 , wherein the congestion notification message is sent based on a timing profile for sending the congestion notification message based on a level of a network congestion event associated with the congestion notification message.

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 a level of the network congestion event associated with the congestion notification message.

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

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

16 . 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.

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

18 . 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, by a computing node from a network device of the computing network, a congestion notification message; reading an Explicit Congestion Notification (ECN) bit of the congestion notification message; based on a value of the ECN bit, determining that the congestion notification message is a second congestion notification message for a same packet; and in response to determining that the congestion notification message is the second congestion notification message for the same packet, responding only to an earlier congestion notification message for the same packet.

19 . The computer readable storage medium of claim 18 , wherein the congestion notification message is sent based on a timing profile for sending the congestion notification message based on a level of a network congestion event associated with the congestion notification message.

20 . The computer readable storage medium of claim 19 , wherein the congestion notification message is probabilistically generated based on a congestion measure.

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