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

Scheduling deadline driven packet flows in HiperAccess

Publiceringsår: 2003
Språk: Engelska
Sidor: 108-113
Publikation/Tidskrift/Serie: Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003
Dokumenttyp: Konferensbidrag
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.


Wireless communication systems are by nature and by regulations limited in bandwidth and hence capacity. Services with high demands on quality of service (QoS) will enforce high demands on the available capacity. This observation motivates the development of schedulers that can deliver the required QoS as well as being resource efficient. In this paper, we provide expressions of the worst case delivery time for schedulers based in the first in first out (FIFO) and the earliest due-date (EDD) principles which are applied to the HiperAccess point-to-multipoint radio communication system. Further, we propose modifications of the schedulers, which are more resource efficient at the expense of rare deadline misses. Despite the deadline misses, the modified scheduling algorithms can still provide an average delivery time well within the required deadline


  • Communication Systems
  • Electrical Engineering, Electronic Engineering, Information Engineering
  • QoS
  • quality of service
  • system capacity
  • worst case delivery time
  • first in first out
  • FIFO scheduling
  • deadline misses
  • resource efficiency
  • earliest due-date
  • point-to-multipoint radio communication system
  • HiperAccess
  • scheduling deadline driven packet flows
  • wireless communication systems


ISCC 2003 - International Symposium on Computers and Communications
  • ISBN: 0-7695-1961-X

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