Admission control for ATM networks using rate monotonic traffic scheduling algorithm

Tsern-Huei Lee*, An Bang Chang

*Corresponding author for this work

研究成果: Paper同行評審

3 引文 斯高帕斯(Scopus)

摘要

Rate monotonic scheduling algorithm had been shown [1] to be the optimum static priority assignment scheme for an environment where packets are of variable length and a higher priority packet can preempt a lower priority one without causing any loss. It is optimum in the sense that if a set of m constant bit rate connections are schedulable (i.e., every packet is served before its succeeding packet arrives) with any static priority assignment scheme, then they are schedulable with rate monotonic scheduling algorithm. In this paper, we study the schedulability issue of rate monotonic scheduling algorithm for ATM networks where all packets are of the same length. We prove a necessary and sufficient condition for a set of m constant bit rate connections to be rate monotonic schedulable. Based on the necessary and sufficient condition, we design a simple admission control algorithm. We also present a sufficient condition which can be used for fast admission control if there are only a few possible periods for the connections.

原文English
頁面1355-1360
頁數6
DOIs
出版狀態Published - 3 十一月 1997
事件Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) - Phoenix, AZ, USA
持續時間: 3 十一月 19978 十一月 1997

Conference

ConferenceProceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3)
城市Phoenix, AZ, USA
期間3/11/978/11/97

指紋 深入研究「Admission control for ATM networks using rate monotonic traffic scheduling algorithm」主題。共同形成了獨特的指紋。

引用此