Deficit round robin scheduling using multiplication factors
US8588242B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 4, 2011 |
| Grant date | Nov 19, 2013 |
| Priority date | — |
| Expiry date | Nov 5, 2031 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L47/6225
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Some of the embodiments of the present disclosure provide a method for scheduling processing of packets received from a network, comprising assigning a corresponding queue weight to each of a plurality of queues that are configured to enqueue the packets for processing; for each of the plurality of queues, determining a corresponding multiplication factor (MF) as a function of a number of cycles until a next packet is available from the corresponding queue for processing; and incrementing a plurality of counters, associated with the corresponding plurality of queues, based at least in part on the multiplication factors. Other embodiments are also described and claimed.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.