Routing packets based on congestion of minimal and non-minimal routes
US-2019104054-A1 · Apr 4, 2019 · US
US2025039109A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2025039109-A1 |
| Application number | US-202318225562-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jul 24, 2023 |
| Priority date | Jul 24, 2023 |
| Publication date | Jan 30, 2025 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A system, a computing system, and a switch are provided. In one example, a system for routing data to one of a plurality of queues comprises a processor to poll a depth of one or more queues of the plurality of queues, determine a weight for each polled queue based on the depth of each polled queue, and route data received via a port to a first queue of the plurality of queues based on the determined weight for each polled queue.
Opening claim text (preview).
What is claimed is: 1 . A system to route data to one of a plurality of queues, the system comprising: a processor to: poll a depth of one or more queues of the plurality of queues; determine a weight for each polled queue based on the depth of each polled queue; and route data received via a port to a first queue of the plurality of queues based on the determined weight for each polled queue. 2 . The system of claim 1 , wherein the depth of each polled queue is stored periodically in a database. 3 . The system of claim 1 , wherein each of the one or more queues of the plurality of queues is associated with an egress port. 4 . The system of claim 1 , wherein the depth is polled periodically or continuously. 5 . The system of claim 1 , further comprising assigning each polled queue a grade based on one of a percentage or an amount of occupied or available space of each respective queue, and wherein determining the weight for each polled queue is based on the assigned grade of the respective queue. 6 . The system of claim 1 , wherein the weight is determined further based on a size of each polled queue. 7 . The system of claim 1 , wherein the data is a packet received from one or more ingress ports. 8 . The system of claim 7 , wherein the system comprises a switch, and wherein routing the data comprises balancing traffic of the switch by routing the packet from one of the ingress ports to the first queue based on the determined weight for each polled queue. 9 . The system of claim 1 , further comprising a counter, wherein the counter is used to determine how many bytes are sent to each port. 10 . The system of claim 9 , wherein routing the data to the first queue is further based on a value of the counter. 11 . The system of claim 10 , further comprising updating the weight for the one or more queues based on the value of the counter. 12 . The system of claim 1 , wherein routing the data to the first queue is further based on a score associated with remote link failures. 13 . The system of claim 12 , wherein the score associated with remote link failures is determined based on data received from a remote peer. 14 . The system of claim 13 , wherein the data received from the remote peer indicates a quality associated with a queue associated with a destination of the data. 15 . The system of claim 1 , wherein routing the data to the first queue is based on the determined weight of each polled queue, a counter value indicating a size of previous data sent to each queue, and data from a remote peer indicating a quality associated with a remote link between the remote peer and a destination of the data. 16 . The system of claim 15 , further comprising averaging each of the determined weights for each queue, the counter value, and the data from the remote peer. 17 . The system of claim 15 , wherein the data is routed to the first queue by performing a round robin selection of the first queue based on grades associated with the determined weight for each queue. 18 . The system of claim 15 , wherein the data is routed to the first queue by randomly selecting the first queue based on grades associated with the determined weight for each queue. 19 . A computing system comprising one or more circuits to: determine an amount of data stored in each queue of a plurality of queues; determine a weight for each queue based on the data stored in each queue; and generate a routing instruction based on the determined weight for each queue, wherein data received by the computing system is routed to a first queue of the plurality of queues based on the routing instruction. 20 . A switch comprising one or more circuits to: determine an amount of available space in each queue of a plurality of queues; determine a weight for each queue based on the amount of available space in each queue; and generate a routing instruction based on the determined weight for each queue, wherein data received by the switch is routed to a first queue of the plurality of queues based on the routing instruction.
queue load conditions, e.g. longest queue first · CPC title
Weighted service order · CPC title
including multiple buffers, e.g. buffer pools · CPC title
by balancing the load, e.g. traffic engineering · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.