Packet scheduling using hierarchical scheduling process with priority propagation
US10447608B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 14, 2014 |
| Grant date | Oct 15, 2019 |
| Priority date | — |
| Expiry date | Oct 18, 2035 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L47/6215
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
System and method of data routing according to a hierarchical scheduling process. Incoming data traffic is allocated to various queues of a buffer. A scheduling tree has a top level for queues, a bottom level for egress ports, and a plurality of intermediate levels corresponding to different granularities with respect to service categories. Each queue is assigned to a particular node in each intermediate level of the scheduling tree. The scheduling tree traverses through multiple scheduling stages from the bottom to the top level to select a winner node in each level based on a variety of fairness and differentiating variables. A queue associated with the winner nodes in various levels is selected for outgoing transmission at the selected egress port. Priority information is dynamically propagated from upper nodes to lower nodes such that a subsequent scheduling process uses the updated priority information.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.