# US 2015/0103667 A1 · Detection of root and victim network congestion

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0103667 A1
- Document ID: US20150103667A1
- Status: Published application
- Kind: A1
- Application number: 14/052,743
- Filed: 2013-10-13
- Published: 2015-04-16
- Earliest claimed: 2013-10-13
- Assignees: Mellanox Technologies, Ltd.
- Applicants: Mellanox Technologies Ltd.
- Inventors: George Elias; Eyal Srebro; Ido Bukspan; Itamar Rabenstein; Ran Ravid; Barak Gafni; Anna Saksonov
- Web page: https://patentgrep.com/patent/US20150103667A1

## CPC

- H04L 47/30: in combination with information about buffer occupancy at either end or at transit nodes
- H04L 47/11: Identifying congestion
- H04L 47/12: Avoiding congestion; Recovering from congestion
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method in a communication network includes defining a root congestion condition for a network switch if the switch creates congestion in the network while switches downstream are congestion free, and a victim congestion condition if the switch creates the congestion as a result of one or more other congested switches downstream. A buffer fill level in a first switch, created by network traffic, is monitored. A binary notification is received from a second switch, which is connected to the first switch. A decision whether the first switch or the second switch is in a root or a victim congestion condition is made, based on both the buffer fill level and the binary notification. A network congestion control procedure is applied based on the decided congestion condition.

## Claims

### Claim 1

A method in a communication network, comprising:
defining a root congestion condition for a network switch if the switch creates congestion in the network while switches downstream are congestion free, and a victim congestion condition if the switch creates the congestion as a result of one or more other congested switches downstream.
monitoring in a first switch a buffer fill level created by network traffic;
receiving from a second switch, which is connected to the first switch, a binary notification;
deciding whether the first switch or the second switch is in a root or a victim congestion condition based on both the buffer fill level and the binary notification; and
applying a network congestion control procedure based on the decided congestion condition.

### Claim 2 (depends on 1)

The method according to claim 1, wherein deciding whether the first or second switch is in the root or victim congestion condition comprises detecting the victim congestion condition when the buffer fill level exceeds a predefined level, and a time duration that elapsed since receiving the binary notification exceeds a predefined duration.

### Claim 3 (depends on 1)

The method according to claim 1, wherein deciding whether the first or second switch is in the root or victim congestion condition comprises detecting the root congestion condition when the buffer fill level exceeds a predefined level, and a time duration that elapsed since receiving the binary notification does not exceed a predefined duration.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the network traffic flows from the first switch to the second switch, wherein monitoring the buffer fill level comprises monitoring a level of an output queue of the first switch, and wherein deciding whether the first or second switch is in the root or victim congestion condition comprises deciding on the congestion condition of the first switch.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the network traffic flows from the second switch to the first switch, wherein monitoring the buffer fill level comprises monitoring a level of an input buffer of the first switch, and wherein deciding whether the first or second switch is in the root or victim congestion condition comprises deciding on the congestion condition of the second switch.

### Claim 6 (depends on 1)

The method according to claim 1, wherein applying the congestion control procedure comprises applying the congestion control procedure only in response to detecting the root congestion condition and not in response to detecting the victim congestion condition.

### Claim 7 (depends on 1)

The method according to claim 1, wherein applying the congestion control procedure comprises applying the congestion control procedure only after a predefined time that elapsed since detecting the victim congestion condition exceeds a predefined timeout.

### Claim 8

Apparatus in a communication network, comprising:
multiple ports for communicating over the communication network; and
control logic, which is configured to define a root congestion condition for a network switch if the switch creates congestion in the network while switches downstream are congestion free, and a victim congestion condition if the switch creates the congestion as a result of one or more other congested switches downstream, to monitor in a first switch a buffer fill level created by network traffic, to receive from a second switch, which is connected to the first switch, a binary notification, to decide whether the first switch or the second switch is in a root or a victim congestion condition based on both the buffer fill level and the binary notification, and to apply a network congestion control procedure based on the decided congestion condition.

### Claim 9 (depends on 8)

The apparatus according to claim 8, wherein the control logic is configured to detect the victim congestion condition when the buffer fill level exceeds a predefined level, and a time duration that elapsed since receiving the binary notification exceeds a predefined duration.

### Claim 10 (depends on 8)

The apparatus according to claim 8, wherein the control logic is configured to detect the root congestion condition when the buffer fill level exceeds a predefined level, and a time duration that elapsed since receiving the binary notification does not exceed a predefined duration.

### Claim 11 (depends on 8)

The apparatus according to claim 8, wherein the network traffic flows from the first switch to the second switch, and wherein the control logic is configured to monitor a level of an output queue of the first switch, and to decide on the congestion condition of the first switch.

### Claim 12 (depends on 8)

The apparatus according to claim 8, wherein the network traffic flows from the second switch to the first switch, and wherein the control logic is configured to monitor a level of an input buffer of the first switch, and to decide on the congestion condition of the second switch.

### Claim 13 (depends on 8)

The apparatus according to claim 8, wherein the control logic is configured to apply the congestion control procedure only in response to detecting the root congestion condition and not in response to detecting the victim congestion condition.

### Claim 14 (depends on 8)

The apparatus according to claim 8, wherein the control logic is configured to apply the congestion control procedure only after a time that elapsed since detecting the victim congestion condition exceeds a predefined timeout.
