Efficient admission criterion of traffic-shaped rate monotonic scheduler for VBR traffic

Tsern-Huei Lee*, Yaw Wen Kuo

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

Abstract

Rate monotonic algorithm has recently been proposed to be used along with traffic shapers to provide quality of service guarantee in ATM networks. In [2], a necessary and sufficient condition for admission control was derived assuming that cell arrivals are periodic (i.e., CBR traffic). For bursty traffic, this criterion is obviously conservative and may significantly reduce bandwidth utilization. In this paper, we present an efficient admission criterion for bursty or VBR sources. We assume that the traffic generated by a VBR source is regulated with a token bucket regulator. Our admission criterion takes into consideration of traffic characteristics. Since traffic characteristics changes from hop to hop, every network node is required to know how many hops a connection has traversed. Numerical results show that, compared with the conservative criterion which assumes periodic cell arrivals, system utilization can be largely improved using our admission criterion.

Original languageEnglish
Pages19-24
Number of pages6
DOIs
StatePublished - 1 Jan 1999
EventProceedings of the 1999 5th IEEE ATM Workshop 'Opening the New Horizons toward Global Multimedia Services' - Kochi, Jpn
Duration: 24 May 199927 May 1999

Conference

ConferenceProceedings of the 1999 5th IEEE ATM Workshop 'Opening the New Horizons toward Global Multimedia Services'
CityKochi, Jpn
Period24/05/9927/05/99

Fingerprint Dive into the research topics of 'Efficient admission criterion of traffic-shaped rate monotonic scheduler for VBR traffic'. Together they form a unique fingerprint.

Cite this