Packet scheduling in a communication network with statistical multiplexing of service classes
US6567415B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 20, 1999 |
| Grant date | May 20, 2003 |
| Priority date | — |
| Expiry date | Mar 20, 2019 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2012/5679
- WIPO fieldTelecommunications
- WIPO sectorElectrical engineering
Abstract
This Generalized Processor Sharing (GPS) is the basis for the packet scheduler of choice in IP routers and ATM switches of the future. The currently accepted approach for the design of GPS schedulers is based on deterministic QoS guarantees, which, it is generally accepted, is overly conservative and leads to limitations on capacity. To address this problem we develop a framework for GPS scheduling which is based on statistical QoS guarantees and statistical multiplexing. We give the design of GPS weights which maximize the coverage of operating points, and also the design of the connection admission control (CAC). The general framework is end-to-end, with two heterogeneous QoS classes coexisting with a third, best effort class. Each QoS class has a specified delay bound together with a bound on the probability of its violation. An important objective is to maximize the bandwidth available to best effort traffic while just satisfying the guarantees of the QoS classes. To this end, we consider output regulated GPS scheduling which has the additional feature of limiting each connection's share of the bandwidth to a specified value, a design parameter which is determined by our analys…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.