Design and evaluation of a weighted sacrificing fair queueing algorithm for wireless packet networks

Sheng Tzong Cheng, Ming Hung Tao

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 mathematical analysis and simulations.

Original languageEnglish
Pages (from-to)1568-1576
Number of pages9
JournalIEICE Transactions on Communications
VolumeE88-B
Issue number4
DOIs
Publication statusPublished - 2005

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Design and evaluation of a weighted sacrificing fair queueing algorithm for wireless packet networks'. Together they form a unique fingerprint.

Cite this