Technology/Business Opportunity
Non-Confidential Description
University of California - Santa Cruz Campus
TRAFFIC SCHEDULING SYSTEM FOR PACKET-SWITCHED NETWORKS WITH FAIRNESS AND LOW LATENCY
BACKGROUND: 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 scheduling algorithms for packet networks have been proposed; however, schemes that provide for QoS guarantees incur a prohibitively expensive implementation cost.
DESCRIPTION: Researchers at the University of California have developed novel
scheduling algorithms that provide high QoS guarantees with simple implementation.
APPLICATIONS: These algorithms has 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.
ADVANTAGES: These UC 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.
INQUIRIES TO: Valentin Fikovsky, Associate Director
Tel: (510) 748-6600
Fax: (510) 748-6639
Email: valentin.fikovsky@ucop.edu
REFERENCE: UC Case 95-312 (see also UC Case 96-221)
© Copyright 1996 The Regents of the University of California. All Rights Reserved.