# US 2023/0412523 A1 · Queue protection using a shared global memory reserve

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

- Number: US 2023/0412523 A1
- Document ID: US20230412523A1
- Status: Published application
- Kind: A1
- Application number: 18/460,264
- Filed: 2023-09-01
- Published: 2023-12-21
- Earliest claimed: 2016-08-29
- Assignees: Cisco Technology, Inc.
- Applicants: Cisco Technology, Inc.
- Inventors: Vinod Mitulal; Krishnan Subramani; Peter Newman; Georges Akis
- Web page: https://patentgrep.com/patent/US20230412523A1

## CPC

- H04L 49/103: using a shared central buffer; using a shared memory
- H04L 47/29: {using a combination of thresholds}
- H04L 47/30: in combination with information about buffer occupancy at either end or at transit nodes
- H04L 47/32: by discarding or delaying data units, e.g. packets or frames
- H04L 49/108: {using shared central buffer}
- H04L 49/3036: {Shared queuing}
- H04L 49/9005: using dynamic buffer space allocation
- H04L 49/9084: {Reactions to storage capacity overflow}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The subject technology relates to the management of a shared buffer memory in a network switch. Systems, methods, and machine readable media are provided for receiving a data packet at a first network queue from among a plurality of network queues, determining if a fill level of a queue in a shared buffer of the network switch exceeds a dynamic queue threshold, and in an event that the fill level of the shared buffer exceeds the dynamic queue threshold, determining if a fill level of the first network queue is less than a static queue minimum threshold.

## Claims

### Claim 1

A method of managing memory in a network switch, the method comprising:
configuring a memory space to have a first shared allocated space, wherein the first shared allocated space is associated with a dynamic maximum threshold that is a function of available space in the first shared allocated space, and a second shared allocated space,
wherein the memory space is associated with a plurality of ports including a first port, wherein the first port is associated with a first queue for enqueuing packets within the memory space;
upon receiving a packet on the first port, comparing a fill level of the first queue to the dynamic maximum threshold;
upon determining that the fill level of the first queue is below the dynamic maximum threshold, enqueuing the packet in the first shared allocated space; and
upon determining that the fill level of the first queue is above the dynamic maximum threshold, enqueuing the packet in the second shared allocated space.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
after receiving the packet on the first port, determining if there is any space available in the first shared allocated space.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
upon receiving the packet and before comparing a fill level of the first queue to the dynamic maximum threshold, determining if there is any unallocated space available in the memory that includes the first shared allocated space and the second shared allocated space.

### Claim 4 (depends on 3)

The method of claim 3, further comprising:
upon determining that there is no unallocated space available in the memory that includes the first shared allocated space and the second shared allocated space, dropping the packet.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
before comparing a fill level of the first queue to the dynamic maximum threshold, determining if the first shared allocated space is above a designated fill level.

### Claim 6 (depends on 1)

The method of claim 1, wherein the method further comprises: upon determining that the first shared allocated space is above a designated fill level, identifying whether the memory allocated to the packets from the first port is below a minimum threshold.

### Claim 7 (depends on 6)

The method of claim 6, wherein the method further comprises: upon identifying that the memory allocated to the packets from the first port is below the minimum threshold, enqueuing the packet.

### Claim 8

A shared memory network switch comprising:
at least one processor;
a plurality of ports;
a buffer memory;
a memory device storing instructions that, when executed by the at least one processor,
cause the at least one processor to perform operations comprising:
configuring the buffer memory to have a first shared allocated space, wherein the first shared allocated space is associated with a dynamic maximum threshold that is a function of available space in the first shared allocated space, and a second shared allocated space;
associating a first port of the plurality of ports with a first queue for enqueuing packets within a first allocated memory space;
upon receiving a packet on the first port, comparing a fill level of the first queue to the dynamic maximum threshold;
upon determining that the fill level of the first queue is below the dynamic maximum threshold, enqueuing the packet in the first shared allocated space; and
upon determining that the fill level of the first queue is above the dynamic maximum threshold, enqueuing the packet in the second shared allocated space.

### Claim 9 (depends on 8)

The shared memory network switch of claim 8, wherein the operations further comprise:
after receiving the packet on the first port, determining if there is any space available in the first shared allocated space.

### Claim 10 (depends on 8)

The shared memory network switch of claim 8, wherein the operations further comprise:
upon receiving the packet and before comparing a fill level of the first queue to the dynamic maximum threshold, determining if there is any unallocated space available in the memory that includes the first shared allocated space and the second shared allocated space.

### Claim 11 (depends on 10)

The shared memory network switch of claim 10, wherein the operations further comprise:
upon determining that there is no unallocated space available in the memory that includes the first shared allocated space and the second shared allocated space, dropping the packet.

### Claim 12 (depends on 8)

The shared memory network switch of claim 8, wherein the operations further comprise:
before comparing the fill level of the first queue to the dynamic maximum threshold, determining if the first shared allocated space is above a designated fill level.

### Claim 13 (depends on 8)

The shared memory network switch of claim 8, wherein the operations further comprise:
upon determining that the first shared allocated space is above a designated fill level, identifying whether the memory allocated to the packets from the first port is below a minimum threshold.

### Claim 14 (depends on 13)

The shared memory network switch of claim 13, wherein the operations further comprise:
upon identifying that the memory allocated to the packets from the first port is below the minimum threshold, enqueuing the packet.

### Claim 15

A non-transitory computer-readable storage medium comprising instructions stored therein, which when executed by one or more processors, cause the one or more processors to perform operations comprising:
configuring a buffer memory to have a first shared allocated space, wherein the first shared allocated space is associated with a dynamic maximum threshold that is a function of available space in the first shared allocated space, and a second shared allocated space;
associating a first port of a plurality of ports with a first queue for enqueuing packets within a first allocated memory space;
upon receiving a packet on the first port, comparing a fill level of the first queue to the dynamic maximum threshold;
upon determining that the fill level of the first queue is below the dynamic maximum threshold, enqueuing the packet in the first shared allocated space; and
upon determining that the fill level of the first queue is above the dynamic maximum threshold, enqueuing the packet in the second shared allocated space.

### Claim 16 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the operations further comprise:
after receiving the packet on the first port, determining if there is any space available in the first shared allocated space.

### Claim 17 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the operations further comprise:
upon receiving the packet and before comparing a fill level of the first queue to the dynamic maximum threshold, determining if there is any unallocated space available in the memory that includes the first shared allocated space and the second shared allocated space.

### Claim 18 (depends on 17)

The non-transitory computer-readable storage medium of claim 17, wherein the operations further comprise:
upon determining that there is no unallocated space available in the memory that includes the first shared allocated space and the second shared allocated space, dropping the packet.

### Claim 19 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the operations further comprise:
before comparing the fill level of the first queue to the dynamic maximum threshold, determining if the first shared allocated space is above a designated fill level.

### Claim 20 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein the operations further comprise:
upon determining that the first shared allocated space is above a designated fill level, identifying whether the memory allocated to the packets from the first port is below a minimum threshold, and
upon identifying that the memory allocated to the packets from the first port is below the minimum threshold, enqueuing the packet.
