Design and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.4 pp.1568-1576
- Publication Date
- 2005/04/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.4.1568
- Type of Manuscript
- PAPER
- Category
- Wireless Communication Technologies
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Sheng-Tzong CHENG, Ming-Hung TAO, "Design and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 4, pp. 1568-1576, April 2005, doi: 10.1093/ietcom/e88-b.4.1568.
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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.4.1568/_p
Copy
@ARTICLE{e88-b_4_1568,
author={Sheng-Tzong CHENG, Ming-Hung TAO, },
journal={IEICE TRANSACTIONS on Communications},
title={Design and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks},
year={2005},
volume={E88-B},
number={4},
pages={1568-1576},
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.},
keywords={},
doi={10.1093/ietcom/e88-b.4.1568},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Design and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1568
EP - 1576
AU - Sheng-Tzong CHENG
AU - Ming-Hung TAO
PY - 2005
DO - 10.1093/ietcom/e88-b.4.1568
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2005
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.
ER -
English
