Advanced

Fair scheduling of uplink traffic in HiperAccess

Holmberg, Torgny LU and Karlsson, Johan M LU (2003) 9th Asia-Pacific Conference on Communications In 9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732) p.1198-1204
Abstract
In HiperAccess, the scheduling problem takes two forms; firstly, the base station reserves capacity on the uplink for the different terminals, and secondly, the terminals schedule their respective traffic in its assigned share of the channel capacity. Further, the base station generally has less and older information than the terminals, hence, the base station and the terminals may act differently for a given scenario. In view of this, scheduling traffic with quality of service (QoS) demands can be very difficult. In this paper, we propose a terminal scheduler capable of serving real-time and best-effort traffic with demands on QoS. Further, a new measure of fairness which is well suited for time-slotted systems is proposed
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
wireless communication system, time-slotted system, best-effort traffic, real-time traffic, QoS, quality of service, HiperAccess, fair traffic scheduling, uplink traffic
in
9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)
pages
1198 - 1204
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
9th Asia-Pacific Conference on Communications
external identifiers
  • WOS:000189415600251
  • Scopus:84947313635
ISBN
0-7803-8114-9
DOI
10.1109/APCC.2003.1274290
language
English
LU publication?
yes
id
9bf93447-9818-45cb-b1e9-3299e6402574 (old id 612611)
date added to LUP
2007-11-28 15:13:14
date last changed
2016-10-13 04:40:36
@misc{9bf93447-9818-45cb-b1e9-3299e6402574,
  abstract     = {In HiperAccess, the scheduling problem takes two forms; firstly, the base station reserves capacity on the uplink for the different terminals, and secondly, the terminals schedule their respective traffic in its assigned share of the channel capacity. Further, the base station generally has less and older information than the terminals, hence, the base station and the terminals may act differently for a given scenario. In view of this, scheduling traffic with quality of service (QoS) demands can be very difficult. In this paper, we propose a terminal scheduler capable of serving real-time and best-effort traffic with demands on QoS. Further, a new measure of fairness which is well suited for time-slotted systems is proposed},
  author       = {Holmberg, Torgny and Karlsson, Johan M},
  isbn         = {0-7803-8114-9},
  keyword      = {wireless communication system,time-slotted system,best-effort traffic,real-time traffic,QoS,quality of service,HiperAccess,fair traffic scheduling,uplink traffic},
  language     = {eng},
  pages        = {1198--1204},
  publisher    = {ARRAY(0xaa92568)},
  series       = {9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)},
  title        = {Fair scheduling of uplink traffic in HiperAccess},
  url          = {http://dx.doi.org/10.1109/APCC.2003.1274290},
  year         = {2003},
}