Dynamic load balancing without packet reordering
US8705366B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 23, 2012 |
| Grant date | Apr 22, 2014 |
| Priority date | — |
| Expiry date | May 31, 2032 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L47/125
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Flows of packets are dynamically mapped to resource queues. Flows of packets are received at a network device to be routed from the network device in a network. Each flow comprises packets to be sent from a source to a connection. Data is stored for a queue allocation table that maintains a plurality of buckets to which received packets for a flow are assigned and indicating which of a plurality of resource queues are allocated for respective buckets. For each packet in a flow, a hash function is computed from values in a header of the packet and the packet is assigned to one of the plurality of buckets based on the computed hash function. One of a plurality of resource queues is allocated for each bucket to which packets are assigned based on the computed hash function.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.