Scheduler method and device in a switch
US6944171B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 12, 2001 |
| Grant date | Sep 13, 2005 |
| Priority date | — |
| Expiry date | Jul 25, 2023 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L49/351
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
The invention relates to a scheduler method and device for handling output queues in a switch. The invention incorporates a number of co-operating techniques such as weighted and deficit driven round-robin and interleaving. The invention provides a scheduling method in a switch in which an input data stream is received and stored in a number of output queues, the method comprising the steps of: polling all queues in order; if the polled queue contains data, refilling a deficit value indicating a maximum amount of data that may be sent from this queue; if the deficit value permits, sending data, and decreasing the deficit value a corresponding amount for the polled queue, else disabling the queue; if any queue is permitted to send after all the queues have been polled, going to a local round, else start polling the first queue of the order again. The invention enables e.g. priority treatment of queues, fairness with regard to varying packet lengths and avoids burstiness.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.