Time dependent priority scheduling for guaranteed QOS systems

S. Chaudhry*, Alok Choudhary

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

With the advances in server technology, and the advent of fast Gigabit networks, it has become possible to support multi-media applications. To support the requirements for the transmission of isochronous data, the network must provide service guarantees to connections, including minimum bandwidth, packet delay, delay jitter, and loss. Three factors determine the utilization of the network when providing these services. These are the scheduling algorithm employed at each switch; the accuracy (tightness) of the admission control (schedulability condition) that detects violations to the service guarantees; accuracy of the input traffic characterization. In this paper we present a scheduling algorithm, its schedulability condition and implementation. The schedulability condition is free of input traffic characterization and thus any input traffic model can be used. Further, the algorithm is capable of achieving up to maximum efficiency possible at each switch.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Computer Communications and Networks, ICCCN
PublisherIEEE
Pages236-241
Number of pages6
StatePublished - Dec 1 1997
EventProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA
Duration: Sep 22 1997Sep 25 1997

Other

OtherProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97
CityLas Vegas, NV, USA
Period9/22/979/25/97

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Time dependent priority scheduling for guaranteed QOS systems'. Together they form a unique fingerprint.

Cite this