Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Fair scheduling of uplink traffic in HiperAccess

Publiceringsår: 2003
Språk: Engelska
Sidor: 1198-1204
Publikation/Tidskrift/Serie: 9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)
Dokumenttyp: Konferensbidrag
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.


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


  • Electrical Engineering, Electronic Engineering, Information Engineering
  • Communication Systems
  • wireless communication system
  • time-slotted system
  • best-effort traffic
  • real-time traffic
  • QoS
  • quality of service
  • HiperAccess
  • fair traffic scheduling
  • uplink traffic


9th Asia-Pacific Conference on Communications
  • ISBN: 0-7803-8114-9

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen