DQFS service: A tunable scheme to reduce scheduling overhead in integrated services networks

Michael S. Boykin, Taieb F. Znati

Research output: Contribution to journalConference articlepeer-review

Abstract

Discrete service disciplines have been shown capable of emulating the ideal Generalized Processor Sharing discipline within one maximum-sized packet's transmission time. As a result, the accuracy of such schemes increases with improvements in link speed due to the corresponding reduction in packet transmission delay. However, the merits of such accuracy diminish with improvements in link speed as its impact on call admission decisions decreases. Meanwhile, overhead, in terms of the number of scheduling decisions to be made per unit time, increases with the number of packets transmitted. In response, this paper will present the DQFS service discipline which enables GPS emulation servers to dynamically `tune' their service quanta based upon the QoS requirements of their currently supported applications rather than the network's maximum packet size. It will also demonstrate how the overhead of a GPS emulation server can be reduced in high speed networks without jeopardizing QoS guarantees or adversely impacting fairness.

Original languageEnglish
Pages (from-to)130-139
Number of pages10
JournalConference on Local Computer Networks
Publication statusPublished - 1998
Externally publishedYes
EventProceedings of the 1998 23rd Conference on Local Computer Networks - Boston, MA, USA
Duration: Oct 11 1998Oct 14 1998

ASJC Scopus subject areas

  • Software
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'DQFS service: A tunable scheme to reduce scheduling overhead in integrated services networks'. Together they form a unique fingerprint.

Cite this