Fair scheduling of uplink traffic in HiperAccess
(2003) 9th Asia-Pacific Conference on Communications 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:
https://lup.lub.lu.se/record/612611
- author
- Holmberg, Torgny LU and Karlsson, Johan M LU
- organization
- publishing date
- 2003
- 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
- host publication
- 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
- conference location
- Penang, Malaysia
- conference dates
- 2003-09-21 - 2003-09-24
- 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
- 2016-04-04 10:32:42
- date last changed
- 2022-02-21 03:17:48
@inproceedings{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}}, booktitle = {{9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)}}, isbn = {{0-7803-8114-9}}, keywords = {{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 = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Fair scheduling of uplink traffic in HiperAccess}}, url = {{http://dx.doi.org/10.1109/APCC.2003.1274290}}, doi = {{10.1109/APCC.2003.1274290}}, year = {{2003}}, }