Servicing output queues dynamically according to bandwidth allocation in a frame environment
US6470016B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 9, 1999 |
| Grant date | Oct 22, 2002 |
| Priority date | — |
| Expiry date | Feb 9, 2019 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L47/6255
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
An adaptive weighted round robin scheduling apparatus and method schedules variable-length frame transmissions from a plurality of output queue having different transmission priorities by first allocating, for each queue, a number of bandwidth segments for a bandwidth cycle and a number of transmission opportunities for a round robin cycle, and then processing the queues consecutively in a round-robin fashion, beginning with a highest priority queue, until none of the queues has any bandwidth remaining. More specifically, during each iteration of a round robin cycle, a queue is permitted to transmit a frame if the queue has at least one remaining transmission opportunity, the queue has a frame ready for transmission, and the queue has at least one remaining bandwidth segment, and furthermore the number of transmission opportunities for the queue is decremented by at least one. Upon transmitting a frame, the number of bandwidth segments for the queue is decreased by the number of bandwidth segments in the frame. If a queue has no frame ready for transmission, then the queue may be either penalized, in which case the number of bandwidth segments for the queue is reduced, or forced to…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.