UTRA-TDD is one of the adopted air interfaces for third-generation mobile communication systems (UMTS). In UTRA-TDD, information packets are transmitted organized into radio frames. A radio frame is divided into a fixed number of time slots and different packets can be sent on the same time slot by means of the Code Division Multiple Access technique. Packets belong to different traffic classes and have different formats and Quality of Service (QoS) requirements in terms of delay, transmission error probability and priority level. In this paper, we address the problem of scheduling packets for downlink transmissions in the time slots of a frame, in such a way that QoS requirements are fulfilled. In particular, exact pseudo-polynomial and heuristic scheduling algorithms are compared in terms of typical performance parameters. Computational results for three traffic classes show that the proposed algorithms are suitable for UTRA-TDD implementation, both for solution quality and computational time.
Ciaschetti, G., Corsini, L., Detti, P., Giambene, G. (2007). Packet scheduling in third generation mobile systems with UTRA-TDD air interface. ANNALS OF OPERATIONS RESEARCH, 150(1), 93-114 [10.1007/s10479-006-0160-2].
Packet scheduling in third generation mobile systems with UTRA-TDD air interface
CIASCHETTI, GIANFRANCO;DETTI, PAOLO;GIAMBENE, GIOVANNI
2007-01-01
Abstract
UTRA-TDD is one of the adopted air interfaces for third-generation mobile communication systems (UMTS). In UTRA-TDD, information packets are transmitted organized into radio frames. A radio frame is divided into a fixed number of time slots and different packets can be sent on the same time slot by means of the Code Division Multiple Access technique. Packets belong to different traffic classes and have different formats and Quality of Service (QoS) requirements in terms of delay, transmission error probability and priority level. In this paper, we address the problem of scheduling packets for downlink transmissions in the time slots of a frame, in such a way that QoS requirements are fulfilled. In particular, exact pseudo-polynomial and heuristic scheduling algorithms are compared in terms of typical performance parameters. Computational results for three traffic classes show that the proposed algorithms are suitable for UTRA-TDD implementation, both for solution quality and computational time.File | Dimensione | Formato | |
---|---|---|---|
CiasDetGiampublished.pdf
non disponibili
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
807.99 kB
Formato
Adobe PDF
|
807.99 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/21979
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo