Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Fair scheduling of uplink traffic in HiperAccess

In English

Författare

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

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.

Ämne

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

Nyckelord

  • 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/Övrigt

  • ISBN: 0-7803-8114-9