W2F2Q: packet fair queuing in wireless packet networks

  • Authors:
  • Yung Yi;Yongho Seok;Taekyoung Kwon;Yanghee Choi;Junseok Park

  • Affiliations:
  • Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea;Electronics and Telecommunications Research Institute, Seoul, Korea

  • Venue:
  • WOWMOM '00 Proceedings of the 3rd ACM international workshop on Wireless mobile multimedia
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, there is a growing interest in wireless packet communications due to the explosive growth in wireless communications and the Internet. In this stage, quality of service (QoS) provisioning in wireless/mobile packet networks is becoming more and more important. A key factor in QoS provisioning is packet-scheduling. However, conventional scheduling algorithms in wired network cannot be directly applicable to wireless communication environments because of wireless-specific characteristics : bursty and location-dependent errors.In this paper, we propose a new wireless packet scheduling method: Wireless Worst-case Fair Weighted Fair Queuing (W2 F2Q). The proposed W2 F2Q is based on W F2Q+ [1, 2], which is the most accurate packet scheduling algorithm among those emulating the ideal GPS algorithm. W2 F2Q uses the tight globally bounded timestamp (GBT) property [9] of W F2Q+ to detect leading and lagging status of each flow. Theoretical analysis verifies that W2 F2Q guarantees the fairness property among flows. Also, simulation experiments show the effect of readjusting and graceful degradation in W2 F2Q.