W2F2Q: Packet fair queuing in wireless packet networks

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 432
  • Download : 0
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 (W2F2Q). The proposed W2F2Q is based on W F2Q+ [1, 2], which is the most accurate packet scheduling algorithm among those emulating the ideal GPS algorithm. W2F2Q uses the tight globally bounded timestamp (GBT) property [9] of WF2Q+ to detect leading and lagging status of each flow. Theoretical analysis verifies that W2F2Q guarantees the fairness property among flows. Also, simulation experiments show the effect of readjusting and graceful degradation in W2F2Q.
Publisher
ACM
Issue Date
2000-07
Language
ENG
Citation

ACM INTERNATIONAL WORKSHOP ON WIRELESS MOBILE MULTIMEDIA, pp.2 - 10

URI
http://hdl.handle.net/10203/69724
Appears in Collection
NE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0