# US 2021/0006509 A1 · Managing virtual output queues

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

- Number: US 2021/0006509 A1
- Document ID: US20210006509A1
- Status: Published application
- Kind: A1
- Application number: 16/503,843
- Filed: 2019-07-05
- Published: 2021-01-07
- Earliest claimed: 2019-07-05
- Assignees: Cisco Technology, Inc.
- Applicants: Cisco Technology, Inc.
- Inventors: Dennis Khoa Dang Nguyen; Sha Ma; Thomas J. Edsall; Keerthi Manjunathan Swarnamanjunathan; Parvin Taheri
- Web page: https://patentgrep.com/patent/US20210006509A1

## CPC

- H04L 49/3045: {Virtual queuing}
- H04L 47/52: by attributing bandwidth to queues
- H04L 47/525: by redistribution of residual bandwidth
- H04L 47/621: {Individual queue per connection or flow, e.g. per VC}
- H04L 47/629: Ensuring fair share of resources, e.g. weighted fair queuing [WFQ]
- H04L 47/805: {QOS or priority aware}
- H04L 49/3027: {Output queuing}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A first node of a packet switched network transmits at least one flow of protocol data units of a network to at least one output context of one of a plurality of second nodes of the network. The first node includes X virtual output queues (VOQs). The first node receives, from at least one of the second nodes, at least one fair rate record. Each fair rate record corresponds to a particular second node output context and describes a recommended rate of flow to the particular output context. The first node allocates up to X of the VOQs among flows corresponding to i) currently allocated VOQs, and ii) the flows corresponding to the received fair rate records. The first node operates each allocated VOQ according to the corresponding recommended rate of flow until a deallocation condition obtains for the each allocated VOQ.

## Claims

### Claim 1

A method, comprising:
in a first node of a packet switched network, the first node transmitting at least one flow of protocol data units of the network to at least one output context of one of a plurality of second nodes of the network, the first node comprising a defined quantity (X) of virtual output queues (VOQs):
receiving, from at least one of the second nodes, at least one fair rate record, each fair rate record corresponding to a particular second node output context and describing a recommended rate of flow to the particular output context;
allocating up to X of the VOQs among i) flows corresponding to currently allocated VOQs, and ii) the flows corresponding to the received fair rate records; and
operating each allocated VOQ according to the corresponding recommended rate of flow, wherein operating each allocated VOQ further comprises modifying a transmission rate of a particular allocated VOQ until a deallocation condition obtains for each allocated VOQ.

### Claim 2 (depends on 1)

The method of claim 1, wherein allocating up to X of the VOQs comprises:
prioritizing the flows corresponding to each currently allocated VOQ and each received fair rate record;
maintaining each currently allocated VOQ corresponding to a flow prioritized as X or higher; and
allocating a VOQ corresponding to each received fair rate record flow prioritized as X or higher.

### Claim 3 (depends on 1)

The method of claim 1,
wherein operating each allocated VOQ comprises periodically increasing the transmission rate of a particular allocated VOQ until a deallocation condition obtains for each allocated VOQ, and
wherein the deallocation condition for the particular VOQ obtains upon the transmission rate for the particular VOQ exceeding a predetermined threshold.

### Claim 4 (depends on 1)

The method of claim 1, further comprising determining, by the first node, a reception rate for each flow received by the first node,
wherein allocating a VOQ to a particular flow comprises:
comparing the determined reception rate for the particular flow to the recommended rate for the particular flow; and
allocating a VOQ to the particular flow only if the recommended rate exceeds the determined reception rate by a second predetermined threshold.

### Claim 5 (depends on 1)

The method of claim 1, wherein the fair rate record is received in an IEEE 802.1p tagged Ethernet frame.

### Claim 6 (depends on 1)

The method of claim 1,
wherein the fair rate record is included in a PDU comprising a plurality of fair rate records, the PDU addressed to a plurality of nodes of the network including the first node;
the method further comprising identifying, by the first node, each flow received by the first node, and
wherein allocating a VOQ to a particular flow further comprises allocating a VOQ to a particular flow only if the particular flow is a flow identified as being received by the first node.

### Claim 7

(canceled)

### Claim 8

A computer program product, comprising:
a non-transitory computer-readable storage device having computer-executable program instructions embodied thereon that when executed by a computer cause the computer to manage virtual output queues (VOQs), the computer-executable program instructions comprising computer-executable instructions to:
in a first node of a packet switched network, the first node transmitting at least one flow of protocol data units of the network to at least one output context of one of a plurality of second nodes of the network, the first node comprising a defined quantity (X) of virtual output queues (VOQs):
receive, from at least one of the second nodes, at least one fair rate record, each fair rate record corresponding to a particular second node output context and describing a recommended rate of flow to the particular output context;
allocate up to X of the VOQs among flows corresponding to currently allocated VOQs and flows corresponding to the received fair records; and
operate each allocated VOQ according to the corresponding recommended rate of flow until a deallocation condition obtains for the each allocated VOQ, wherein operating each allocated VOQ further comprises modifying a transmission rate of a particular allocated VOQ until a deallocation condition obtains for each allocated VOQ.

### Claim 9 (depends on 8)

The computer program product of claim 8, wherein allocation and operation of the VOQs is implemented in silicon within each first node.

### Claim 10 (depends on 8)

The computer program product of claim 8, wherein allocating up to X of the VOQs comprises:
prioritizing the flows corresponding to each currently allocated VOQ and each received fair rate record;
maintaining each currently allocated VOQ corresponding to a flow prioritized as X or higher; and
allocating a VOQ corresponding to each received fair rate record flow prioritized as X or higher.

### Claim 11 (depends on 8)

The computer program product of claim 8,
wherein operating each allocated VOQ comprises periodically increasing the transmission rate from a particular allocated VOQ, and
wherein the deallocation condition for the particular VOQ obtains upon the transmission rate for particular VOQ exceeding a predetermined threshold.

### Claim 12 (depends on 8)

The computer program product of claim 8,
further comprising determining, by the first node, a reception rate for each flow received by the first node, and
allocating a VOQ to a particular flow further comprises:
comparing the determined reception rate for the particular flow to the recommended rate for the particular flow, and
allocating a VOQ to the particular flow only if the recommended rate exceeds the determined reception rate by a second predetermined threshold.

### Claim 13 (depends on 8)

The computer program product of claim 8, wherein the fair rate record is received in an IEEE 802.1p tagged Ethernet frame.

### Claim 14 (depends on 8)

The computer program product of claim 8,
wherein the fair rate record in included in a PDU comprising a plurality of fair rate records, the PDU addressed to a plurality of nodes of the network including the first node;
further comprising identifying, by the first node, each flow received by the first node, and
allocating a VOQ to a particular flow further comprises allocating a VOQ to a particular flow only if the particular flow is a flow identified as being received by the first node.

### Claim 15

A modular data communication equipment (DCE) assembly, comprising:
at least one fabric module; and
at least one first line card and at least one second line card, each line card in communication with each fabric module and in communication with each other line card via the at least one fabric module;
each first line card characterized by a plurality of output contexts and operative to:
send flows of protocol data units from the switching assembly and into a packet switched network via a particular one of the output contexts; and
periodically determine a fair rate to be applied to each flow entering the assembly via one or more of the second line cards and destined for each output context, and
communicate the determined fair rates to the at least one second line cards; and
each second line card comprising a number X of virtual output queues (VOQs), wherein X is a defined quantity of VOQs and X is less than the plurality of output contexts, and each second line card operative to:
transmit at least one flow to at least one of the output contexts;
receive, from at least one of the first nodes, a fair rate record corresponding to a particular first node output context, each fair rate record describing a recommended a fair rate of flow to the corresponding output context;
allocate up to X of the VOQs among flows corresponding to currently allocated VOQs and flows corresponding to the received fair records; and
operate each allocated VOQ until a deallocation condition obtains for the each allocated VOQ, wherein operating each allocated VOQ further comprises modifying a transmission rate of a particular allocated VOQ until a deallocation condition obtains for each allocated VOQ.

### Claim 16 (depends on 15)

The assembly of claim 15, wherein allocation and operation of the VOQs is implemented in silicon within each second line card.

### Claim 17 (depends on 15)

The assembly of claim 15, wherein allocating comprises:
prioritizing the flows corresponding to each currently allocated VOQ and each received fair rate record;
maintaining each currently allocated VOQ corresponding to a flow prioritized as X or higher; and
allocating a VOQ corresponding to each received fair rate record flow prioritized as X or higher.

### Claim 18 (depends on 15)

The assembly of claim 15,
wherein operating each allocated VOQ comprises periodically increasing the transmission rate from a particular allocated VOQ, and
wherein the deallocation condition for the particular VOQ obtains upon the transmission rate for particular VOQ exceeding a predetermined threshold.

### Claim 19 (depends on 15)

The assembly of claim 15,
further comprising determining, by the first node, a reception rate for each flow received by the first node, and
allocating a VOQ to a particular flow further comprises:
comparing the determined reception rate for the particular flow to the recommended rate for the particular flow, and
allocating a VOQ to the particular flow only if the recommended rate exceeds the determined reception rate by a second predetermined threshold.

### Claim 20 (depends on 15)

The assembly of claim 15,
wherein the fair rate record in included in a PDU comprising a plurality of fair rate records, the PDU addressed to a plurality of nodes of the network including the first node;
further comprising identifying, by the first node, each flow received by the first node, and allocating a VOQ to a particular flow further comprises allocating a VOQ to a particular flow only if the particular flow is a flow identified as being received by the first node.
