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.
CITATION STYLE
Choi, J. S., Bae, B. S., Lee, H. H., & Lee, H. S. (2002). Round-robin scheduling algorithm with multiple distributed windows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2344, pp. 814–819). Springer Verlag. https://doi.org/10.1007/3-540-45801-8_76
Mendeley helps you to discover research relevant for your work.