The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Fair scheduling of uplink traffic in HiperAccess

På svenska

Author

Summary, in English

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

Publishing year

2003

Language

English

Pages

1198-1204

Publication/Series

9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering
  • Communication Systems

Keywords

  • wireless communication system
  • time-slotted system
  • best-effort traffic
  • real-time traffic
  • QoS
  • quality of service
  • HiperAccess
  • fair traffic scheduling
  • uplink traffic

Conference name

9th Asia-Pacific Conference on Communications

Conference date

2003-09-21 - 2003-09-24

Conference place

Penang, Malaysia

Status

Published

ISBN/ISSN/Other

  • ISBN: 0-7803-8114-9