Round-Robin Scheduling Algorithm with Multiple Distributed Windows

Authors:
Jin Seek Choi;Bum Sik Bae;Hyeong Ho Lee;Hyeung Sub Lee
Affiliations:
-;-;-;-
Venue:
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
Year:
2002

Citing 6
Cited 0

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

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

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)
ATM Network Performance

ATM Network Performance
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
A service architecture for ATM: from applications to scheduling

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new efficient cell scheduling scheme based on the round-robin scheme with multiple distributed windows. The proposed scheduler consists of a set of windows. Each input queue may be linked with windows in proportional to the reserved bandwidth. The scheduler rotates along the windows in a round-robin manner and each window generates a token. Token enables a cell to get service in a slot time. The proposed scheme can be implemented with simple hardware logic of O(1) round-robin technique and can reduce the maximum delay. The proposed scheme also provides good fairness of weighted fair queueing.