Opportunistic scheduling for streaming users in high-speed downlink packet access (HSDPA)

TitleOpportunistic scheduling for streaming users in high-speed downlink packet access (HSDPA)
Publication TypeConference Paper
Year of Publication2004
AuthorsFarrokh, A., and V. Krishnamurthy
Conference NameGlobal Telecommunications Conference, 2004. GLOBECOM '04. IEEE
Pagination4043 - 4047 Vol.6
Date Publishednov.
Keywords3G mobile communication, adaptive codes, adaptive modulation, adaptive modulation and coding schemes, channel variations, coding schemes, data rates, discrete event simulation, feasibility problem, high-speed downlink packet access, HSDPA, long term quality of service constraints, modulation schemes, multi-code CDMA operation, multimedia communication, opportunistic algorithms, opportunistic scheduling, packet radio networks, quality of service, scheduling, scheduling policy, short term QoS constraints, spectral efficiency, stable algorithm, stochastic approximation algorithms, stochastic processes, streaming users, telecommunication congestion control, uninterrupted media play-out probability, video streaming
Abstract

High-speed downlink packet access (HSDPA) achieves high data rates and high spectral efficiency by using adaptive modulation and coding (AMC) schemes and employing multi-code operation of CDMA. In this paper we present opportunistic algorithms for scheduling HSDPA users and selecting modulation and coding schemes that exploit channel variations to increase the probability of an uninterrupted media play-out. First we introduce a discrete event model for HSDPA system to transform the scheduling problem for providing an uninterrupted play-out to a feasibility problem that considers short term and long term quality of service (QoS) constraints. A methodology for obtaining a feasible solution is then proposed by starting with a so called stable algorithm that satisfies the long term QoS constraints (if possible with any scheduling policy). Next, we present stochastic approximation algorithms that adapt the parameters of the stable algorithm in a way that a feasible point for the short term QoS is reached within the feasibility region of the long term QoS.

URLhttp://dx.doi.org/10.1109/GLOCOM.2004.1379126
DOI10.1109/GLOCOM.2004.1379126

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia