International Journal of Digital Communication and Analog Signals

Weighted Fair Queuing in Wireless Networks

  1. Pooja Mishra ✉

Abstract

Due to the rapid growth of wireless data services, the issues of providing different quality of services and fair channel access have become more and more crucial. In wireless networks, there are many mature fair queuing algorithms that can provide fairness and bounded delay properties. However, they cannot be directly applied to wireless networks because of the bursty and location-dependent error characteristics of wireless channels. So many fair queuing algorithms designed for wireless networks are proposed. In this paper, we introduce the concept of fair queuing and Weighted Fair Queuing (WFQ) in wireline networks. We have discuss the problems and difficulties to apply them to wireless networks, and provide a comprehensive survey of recent research on wireless fair queuing algorithms.

References (10)

  1. S. Lu, T. Nandagopal, and V. Bharghavan, “Design and analysis of an algorithm for fair service in error-prone wireless channels,” Wireless Networks, vol. 6, no. 4, pp. 323–343, 2000.
  2. H. Zhang, “Service disciplines for guaranteed performance servicein packet-switching networks,” Proc. IEEE, vol. 83, pp. 1374–1396, 1995.
  3. A.K. Parekh and R.G. Gallager, “A generalized processor sharing approach to flow control in integrated services networks: the single- node case,” IEEE/ACM Trans. Networking, vol. 1, pp. 344–357, 1993.
  4. P. Goyal, H.M. Vin, and H. Cheng, “Start-time fair queueing: a scheduling algorithm for integrated services packet switching net- works,” IEEE/ACM Trans. Networking, vol. 5, no. 5, pp. 690–704, 1997.
  5. S.J. Golestani, “A self-clocked fair queueing scheme for broadband applications,” Proc. IEEE INFOCOM, pp. 12– 16, 1994.
  6. J.C.R. Bennett and H. Zhang, “WF2Q: worst-case fair weighted fair queueing,” Proc. IEEE INFOCOM, vol. 1, pp. 120–128, 1996.
  7. V. Bharghavan, S. Lu, and T. Nandagopal, “Fair queuing in wireless networks: issues and approaches,” IEEE Personal Commun., vol. 6, pp. 44–53, 1999.
  8. Y. Cao and V.O.K. Li, “Scheduling algorithms in broadband wireless networks,” Proc. IEEE, vol. 89, pp. 76–87, 2001.
  9. T. Nandagopal, S. Lu, and V. Bharghavan, “A unified architecture for the design and evaluation of wireless fair queueing algorithms,” Wireless Networks, vol. 8, pp. 231– 247, 2002.
  10. K.C. Wang and Y.L. Chin, “A fair scheduling algorithm with adaptive compensation in wireless networks,” Proc. IEEE Global Telecomm. Conf., pp. 3543–3547, 2001.

Read more of it

Subscribe to one journal or build your own list of several. One invoice, one payment, access for a full year.

Subscribe to journals →

Publish your article

Peer-reviewed journals across every subject, with open access options. Send your manuscript to the right editor today.

Publish with us → Calculate your APC
Support