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

Sheng Tzong Cheng, Ming Hung Tao

Research output: Contribution to journalArticle

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 Jan 1

Fingerprint

Packet networks
Scheduling algorithms
Global system for mobile communications
Wireless networks
Quality of service
Throughput

All Science Journal Classification (ASJC) codes

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

Cite this

@article{14926cc22398428692837d0e1c3bb26c,
title = "Design and evaluation of a weighted sacrificing fair queueing algorithm for wireless packet networks",
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.",
author = "Cheng, {Sheng Tzong} and Tao, {Ming Hung}",
year = "2005",
month = "1",
day = "1",
doi = "10.1093/ietcom/e88-b.4.1568",
language = "English",
volume = "E88-B",
pages = "1568--1576",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "4",

}

Design and evaluation of a weighted sacrificing fair queueing algorithm for wireless packet networks. / Cheng, Sheng Tzong; Tao, Ming Hung.

In: IEICE Transactions on Communications, Vol. E88-B, No. 4, 01.01.2005, p. 1568-1576.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Cheng, Sheng Tzong

AU - Tao, Ming Hung

PY - 2005/1/1

Y1 - 2005/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=24144483142&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144483142&partnerID=8YFLogxK

U2 - 10.1093/ietcom/e88-b.4.1568

DO - 10.1093/ietcom/e88-b.4.1568

M3 - Article

AN - SCOPUS:24144483142

VL - E88-B

SP - 1568

EP - 1576

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 4

ER -