Design and evaluation of a wireless fair queueing algorithm with weighted-sacrificing policy

Sheng-Tzong Cheng, Ming Hung Tao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS.In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ) scheduling algorithm for small-area and device-limited wireless networks. WSFQ slows down the growth of queue length in limited-buffer devices, still maintains the properties of fairness, and guarantees the throughputs of the system. Moreover, WSFQ can easily adapt itself to various kinds of traffic load. We also implement a packet-based scheduling algorithm, the Packetized Weighted Sacrificing Fair Queueing (PWSFQ), to approach the WSFQ. WSFQ and PWSFQ are evaluated by comparing with other algorithms by mathematic analysis simulations.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Wireless Networks, ICWN'04 - Proceedings of the International Conference on Pervasive Computing and Communications, PCC'04
EditorsH.R. Arabnia, L.T. Yang, C.-H. Yeh
Pages492-498
Number of pages7
Volume2
Publication statusPublished - 2004
EventProceedings of the International Conference on Wireless Networks, ICWN'04 - Las Vegas, NV, United States
Duration: 2004 Jun 212004 Jun 24

Other

OtherProceedings of the International Conference on Wireless Networks, ICWN'04
Country/TerritoryUnited States
CityLas Vegas, NV
Period04-06-2104-06-24

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Design and evaluation of a wireless fair queueing algorithm with weighted-sacrificing policy'. Together they form a unique fingerprint.

Cite this