Traffic Shaping And Scheduling System For Packet-Switched Networks With Fairness And Low Latency
Tech ID: 10070 / UC Case 1995-312-0
Many future applications of computer networks such
as teleconferencing (interactive voice and video), distance
education, and remote collaboration will rely on the ability of
networks to provide "Quality of Service" (QoS) guarantees. These
guarantees are usually in the form of bounds on end-to-end delay,
bandwidth, delay jitter, packet loss rate, or a combination of
these parameters. Several shaping and scheduling algorithms for
packet networks have been proposed; however, schemes that provide
for QoS guarantees incur a prohibitively expensive implementation
DESCRIPTIONResearchers at the University of California have developed novel scheduling algorithms that provide high QoS guarantees with simple implementation. They have also developed a shaping algorithm that increases fairness of the scheduling without high computational costs.
APPLICATIONSThese algorithms have been implemented both for Asynchronous Transfer Mode (ATM) networks and packet networks with larger packet sizes. They can be implemented either in hardware or in software.
ADVANTAGESUC scheduling algorithms achieve high QoS guarantees without a prohibitive expense of implementation. They support:
- Fair allocation of the output link bandwidth;
- Low end-to-end delay bounds;
- Simple implementation.
The shaping algorithm can be used to improve fairness. An integrated UC shaper-scheduler is much more efficient than other current shaper-schedulers, requiring only a fraction of the computations to send each packet.
|United States Of America||Issued Patent||5,859,835||01/12/1999||1995-312|
- Stiliadis, Dimitrios
- Varma, Anujan