A Fair Scheduling Algorithm for Wireless Packet Networks

Mooryong JEONG; Hiroyuki MORIKAWA; Tomonori AOYAMA

A Fair Scheduling Algorithm for Wireless Packet Networks

Mooryong JEONG, Hiroyuki MORIKAWA, Tomonori AOYAMA

Full Text Views

0

Cite this

Summary :

Fairness as defined in wireline network cannot be achieved in wireless packet networks due to the bursty and location-dependent channel errors of wireless link. Channel-state dependent scheduling and compensation mechanism for errored flows are generally employed to improve the fairness in wireless packet scheduling algorithms. Most of the wireless scheduling algorithms, however, have two common significant problems. One problem is that they operate incorrectly unless all flows have the same packet size. This is due to the incorrect lead-and-lag model and the swapping-based rough compensation mechanism of the algorithms. The other problem is the degradation of error-free flow during compensation. The root of the degradation is that the bandwidth for compensation cannot be reserved since it is very difficult to predict. In this paper, we introduce WGPS (Wireless General Processor Sharing) to define fairness in wireless networks and present PWGPS as a packetized algorithm of WGPS. In our method, lead and lag of all flows are defined in terms of virtual time which is flexible enough to deal with packet size differences. Further, compensation is done by increasing the service share of the errored flow to a predetermined amount Δ. This enables the maximum bandwidth for compensation can be estimated and thus reserved. Our method can be proved to achieve improved fairness as compared with the previous scheduling algorithms.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.7 pp.1624-1635

Publication Date: 2001/07/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Multi-dimensional Mobile Information Networks)

Category

Cite this

Copy

Mooryong JEONG, Hiroyuki MORIKAWA, Tomonori AOYAMA, "A Fair Scheduling Algorithm for Wireless Packet Networks" in IEICE TRANSACTIONS on Fundamentals, vol. E84-A, no. 7, pp. 1624-1635, July 2001, doi: .
Abstract: Fairness as defined in wireline network cannot be achieved in wireless packet networks due to the bursty and location-dependent channel errors of wireless link. Channel-state dependent scheduling and compensation mechanism for errored flows are generally employed to improve the fairness in wireless packet scheduling algorithms. Most of the wireless scheduling algorithms, however, have two common significant problems. One problem is that they operate incorrectly unless all flows have the same packet size. This is due to the incorrect lead-and-lag model and the swapping-based rough compensation mechanism of the algorithms. The other problem is the degradation of error-free flow during compensation. The root of the degradation is that the bandwidth for compensation cannot be reserved since it is very difficult to predict. In this paper, we introduce WGPS (Wireless General Processor Sharing) to define fairness in wireless networks and present PWGPS as a packetized algorithm of WGPS. In our method, lead and lag of all flows are defined in terms of virtual time which is flexible enough to deal with packet size differences. Further, compensation is done by increasing the service share of the errored flow to a predetermined amount Δ. This enables the maximum bandwidth for compensation can be estimated and thus reserved. Our method can be proved to achieve improved fairness as compared with the previous scheduling algorithms.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_7_1624/_p

Copy

@ARTICLE{e84-a_7_1624,
author={Mooryong JEONG, Hiroyuki MORIKAWA, Tomonori AOYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Fair Scheduling Algorithm for Wireless Packet Networks},
year={2001},
volume={E84-A},
number={7},
pages={1624-1635},
abstract={Fairness as defined in wireline network cannot be achieved in wireless packet networks due to the bursty and location-dependent channel errors of wireless link. Channel-state dependent scheduling and compensation mechanism for errored flows are generally employed to improve the fairness in wireless packet scheduling algorithms. Most of the wireless scheduling algorithms, however, have two common significant problems. One problem is that they operate incorrectly unless all flows have the same packet size. This is due to the incorrect lead-and-lag model and the swapping-based rough compensation mechanism of the algorithms. The other problem is the degradation of error-free flow during compensation. The root of the degradation is that the bandwidth for compensation cannot be reserved since it is very difficult to predict. In this paper, we introduce WGPS (Wireless General Processor Sharing) to define fairness in wireless networks and present PWGPS as a packetized algorithm of WGPS. In our method, lead and lag of all flows are defined in terms of virtual time which is flexible enough to deal with packet size differences. Further, compensation is done by increasing the service share of the errored flow to a predetermined amount Δ. This enables the maximum bandwidth for compensation can be estimated and thus reserved. Our method can be proved to achieve improved fairness as compared with the previous scheduling algorithms.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - A Fair Scheduling Algorithm for Wireless Packet Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1624
EP - 1635
AU - Mooryong JEONG
AU - Hiroyuki MORIKAWA
AU - Tomonori AOYAMA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2001
AB - Fairness as defined in wireline network cannot be achieved in wireless packet networks due to the bursty and location-dependent channel errors of wireless link. Channel-state dependent scheduling and compensation mechanism for errored flows are generally employed to improve the fairness in wireless packet scheduling algorithms. Most of the wireless scheduling algorithms, however, have two common significant problems. One problem is that they operate incorrectly unless all flows have the same packet size. This is due to the incorrect lead-and-lag model and the swapping-based rough compensation mechanism of the algorithms. The other problem is the degradation of error-free flow during compensation. The root of the degradation is that the bandwidth for compensation cannot be reserved since it is very difficult to predict. In this paper, we introduce WGPS (Wireless General Processor Sharing) to define fairness in wireless networks and present PWGPS as a packetized algorithm of WGPS. In our method, lead and lag of all flows are defined in terms of virtual time which is flexible enough to deal with packet size differences. Further, compensation is done by increasing the service share of the errored flow to a predetermined amount Δ. This enables the maximum bandwidth for compensation can be estimated and thus reserved. Our method can be proved to achieve improved fairness as compared with the previous scheduling algorithms.
ER -