Local delay allocation for rate-based packet scheduling algorithms

Authors:
W. C. Chiang;Y. H. Huang;R. J. Huang;C. L. Lee;Y. P. Chu
Affiliations:
Department of Information Management, HsiuPing Institute of Technology, No. 11, Gungye Rd., Dali City, Taichung, Taiwan 412, R.O.C;Department of Information Management, HsiuPing Institute of Technology, No. 11, Gungye Rd., Dali City, Taichung, Taiwan 412, R.O.C;Department of Applied Mathematics, National Chung Hsing University, No. 250, Kuokuang Rd., Taichung City, Taiwan 402, R.O.C.;Department of Information Management, HsiuPing Institute of Technology, No. 11, Gungye Rd., Dali City, Taichung, Taiwan 412, R.O.C;Department of Applied Mathematics, National Chung Hsing University, No. 250, Kuokuang Rd., Taichung City, Taiwan 402, R.O.C.
Venue:
ICCC '02 Proceedings of the 15th international conference on Computer communication
Year:
2002

Citing 7
Cited 0

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping

IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service

IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking (TON)
Efficient Admission Control for EDF Schedulers

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Network delay analysis of a class of fair queueing algorithms

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Much research efforts on the worst-case end-to-end delay bound, yet to date methods for mapping the end-to-end delay requirement into the local switching nodes have been relatively neglected. In this paper, we propose an allocation for allocating the end-to-end delay requirement to the local delay requirement under the rate-based packet scheduling algorithms. Both policies, equal allocation (EA) and remaining capacity allocation (RCA), were applied to construct this model. Based on this model, we can derive the relation between the number of maximum allowable connections and the different allocation policies through mathematical analysis. From the numerical results, we have show that the proposed model can clearly prove different effects based on different allocation policies and packet scheduling algorithms.