Apparatus and method for packet scheduling
US7760747B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 17, 2005 |
| Grant date | Jul 20, 2010 |
| Priority date | — |
| Expiry date | Oct 19, 2026 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L47/58
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
In a network router, a tree structure or a sorting network is used to compare scheduling values and select a packet to be forwarded from an appropriate queue. In the tree structure, each leaf represents the scheduling value of a queue and internal nodes of the structure represent winners in comparisons of scheduling values of sibling nodes of the tree structure. CBR scheduling values may first be compared to select a queue and, if transmission from a CBR queue is not timely, a packet may be selected using WFQ scheduling values. The scheduling values are updated to reflect variable packet lengths and byte stuffing in the prior packet. Scheduling may be performed in multiple stages.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.