Abstract
Scheduling algorithms are important components for providing quality-of-service (QoS) guarantees in wireless networks. The design of such algorithms need to take into account bursty errors and location-dependent channel capacity that are characteristics of wireless networks. In this paper, a new scheduling algorithm for packet cellular networks, wireless deficit round robin (WDRR), is proposed. WDRR is a round robin scheduler that has low implementation complexity and offers a low delay bound, tight fairness index, and good isolation property. In error-prone channels, the algorithm provides short-term fairness among sessions that perceive a clean channel, long-term fairness among all sessions, ability to meet specified throughput objectives for all sessions, and graceful service degradation among sessions that received excess service. Both analysis and simulation are used to verify the WDRR properties.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
H. Zhang, Service disciplines for guaranteed performance service in packet-switching networks, Proceedings of the IEEE, Vol. 83, pp. 1374–1396, October 1995.
R. Guerin and V. Peris, Quality-of-service in packet networks: basic mechanisms and directions, Computer Networks, Vol. 31, pp. 169–189, 1999.
S. Lu, V. Bharghavan, and T. Nandagopal, Fair queueing in wireless networks: Issues and approaches, IEEE Personal Communications Magazine, Vol. 6, pp. 44–53, February 1999.
S. Lu, V. Bharghavan, and T. Nandagopal, Design and analysis of an algorithm for fair service in error-prone wireless channels, ACM/Baltzer Wireless Networks Journal, Vol. 6, pp. 323–343, August 2000.
P. Ramanathan and P. Agrawal, Adapting packet fair queuing algorithms to wireless networks, ACM MOBICOM, pp. 1–9, October 1998.
A. K. Parekh and R. G. Gallager, A generalized processor sharing approach to flow control–the single node case, IEEE Computer and Communications Societies Conference (INFOCOM), Florence, Italy, Vol. 2, pp. 915–924, May 1992.
D. Duchamp and N. Reynolds, Measured performance of a wireless LAN, IEEE 17th Conference on Local Computer Networks, Minneapolis, MN, pp. 494–499, September 1992.
S. Lu, V. Bharghavan, and R. Sirkant, Fair scheduling in wireless packet networks, IEEE/ACM Transactions on Networking, Vol. 7, no. 4, pp. 473–489, August 1999.
T. S. Ng, I. Stoica, and H. Zhang, Packet fair queuing algorithms for wireless networks with location-dependent errors, IEEE Computer and Communications Societies Conference (INFOCOM), San Francisco, CA, USA, Vol. 3, pp. 1103–1111, March 1998.
M. Shreedhar and G. Varghese, Efficient fair queueing using deficit round robin, IEEE/ACM Transactions on Networking, Vol. 4, pp. 375–385, June 1996.
J. C. R. Bennett and H. Zhang, WF2Q: worst-case fair weighted fair queueing, IEEE Computer and Communications Societies Conference (INFOCOM), San Francisco, CA, pp. 120–128, March 1996.
L. Kleinrock, Queueing Systems, Vol. 2, John Wiley & Sons, Inc., 1976.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fattah, H., Leung, C. An Improved Round Robin Packet Scheduler for Wireless Networks. International Journal of Wireless Information Networks 11, 41–54 (2004). https://doi.org/10.1023/B:IJWI.0000031813.76079.2a
Issue Date:
DOI: https://doi.org/10.1023/B:IJWI.0000031813.76079.2a