QoS control for WCDMA high speed packet data

Hosein, Patrick

doi:10.1109/mwcn.2002.1045716

Cited by 71 publications

(40 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is relevant to mention that the optimal solution of objective (11) changes over time because both the channel capacity and the set of active users M vary with time [36]. In fact, the scheduling decisions determine the user departure process, which ultimately influences the set of active users M. Therefore, it is questionable if the optimal solution to the objective (11) over a long observation period is to continuously target at the "present" optimal solution by moving in the direction of the gradient as in (12).…”

Section: Packet Scheduling Based On Utility Theorymentioning

confidence: 99%

“…Once the data transmission is finished, the session is also finished and the user is removed from the system. For simplicity purposes, the session is typically composed of a single data payload of a given size [36], and for the same reason, the effects of higher layer protocols such as TCP, HTTP, are not considered. The model includes a process of user arrivals of a given rate λ that provides the instants when the users arrive in the system and start their data transmission or reception.…”

Section: Finite Buffer Traffic Modelmentioning

confidence: 99%

See 1 more Smart Citation

Traffic models impact on OFDMA scheduling design

Ameigeiras

Wang

Navarro-Ortiz

et al. 2012

J Wireless Com Network

View full text Add to dashboard Cite

This article studies the impact on the design of scheduling algorithms for Orthogonal Frequency Division Multiple Access (OFDMA) systems of two traffic models described in the evaluation methodology proposals from standardization bodies: the full buffer and the finite buffer traffic models. The analysis concentrates on utility-based scheduling with an α-fair utility function for Non-Real Time (NRT) services. The results show that a gradient scheduling algorithm is able to maximize the aggregate utility over all the users when the less realistic full buffer model is adopted; but not when the finite buffer model is applied. The results also show that with the full buffer model a gradient scheduler exhibits a trade-off between average user throughput and the user throughput at 5% outage, but it does not when the more realistic finite buffer is used. Therefore, it is concluded that designs of scheduling algorithms for NRT services for OFDMA systems carried out under the full buffer model assumption may fail to provide the desired performance benefits in realistic scenarios. Based on the results presented, a recommendation on scheduling design is provided.

show abstract

Section: Packet Scheduling Based On Utility Theorymentioning

confidence: 99%

Section: Finite Buffer Traffic Modelmentioning

confidence: 99%

Traffic models impact on OFDMA scheduling design

Ameigeiras

Wang

Navarro-Ortiz

et al. 2012

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Some alternative approaches include scheduling schemes that consider inter-cell transmission [4] and multi-user transmission in one slot [5]. [6] proposes an algorithm that provides QoS guarantees using barrier functions. However none of the existing schemes provide policy driven QoS guarantee.…”

Section: Introductionmentioning

confidence: 99%

Scheduling Algorithms For Policy Driven QoS Support in HSDPA Networks

Gomes

Yun

Choi

et al. 2007

2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring

View full text Add to dashboard Cite

Abstract-Increasing demand for high data-rate multimedia services has led to the emergence of high-speed data transfer features such as High-Speed Downlink Packet Access (HSDPA) for WCDMA networks. The role of the MAC-hs scheduler is vital in HSDPA in improving overall system performance. Using Opportunistic scheduling to exploit multi-user diversity for efficient transmission of best effort services or considering user fairness constraints has been the main focus of most scheduling algorithms. However the need for strict QoS support for services such as streaming, gaming, and VoIP is growing. Service operators can enforce their own policies in meeting these QoS requirements. In this paper we introduce two QoS-aware policy driven scheduling algorithms. We developed an HSDPA system in OPNET, and implemented our scheduling algorithms along with other well-known algorithms. OPNET simulations show that unlike other schedulers, our Strict and Loose Policy Scheduling (SPS and LPS) algorithms comply with the policy constraints if allowed by radio conditions and cell capacity.

show abstract

“…At higher loads, service differentiation is however needed to protect the quality of service of the streaming users. Service differentiation was provided by a scheduler giving strict priority to the streaming flows and a Proportional Fair (PF) scheduler with the barrier function from [8]. The barrier function induces a penalty when the user receives less than the desired minimum bit rate.…”

Section: Introductionmentioning

confidence: 99%

Scheduling Support for Mixed VoIP and Web Traffic over HSDPA

Folke

Landström

Bodin

et al. 2007

2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring

View full text Add to dashboard Cite

Abstract-HSDPA (High-Speed Downlink Packet Access), introduced in WCDMA release 5, provides a high-bandwidth shared channel with short transmission time interval (TTI). The short TTI together with appropriate scheduling enable HSDPA to support efficient multiplexing of traffic.We explain the performance of four scheduling algorithms when transmitting a traffic mix consisting of both conversational (VoIP) traffic and background (web) traffic over the high-speed downlink shared channel (HS-DSCH) of HSDPA. We consider both cell throughput and user satisfaction. The proportional fair (PF), the maximum rate (MR) scheduler and two extended versions of MR, are tested for different VoIP scheduling delay budgets and varying load.To understand the behaviour of the schedulers, we use the ns-2 simulator extended with a model of HS-DSCH to simulate a mixed traffic scenario. Our results show that a scheduler that gradually increases the VoIP priority and considers the user's current possible rate, performs well. A more drastic increase in VoIP priority is however needed when the delay budget is short. Furthermore, attempting to uphold quality for both VoIP and web traffic makes the system sensitive to overload situations.

show abstract

QoS control for WCDMA high speed packet data

Cited by 71 publications

References 2 publications

Traffic models impact on OFDMA scheduling design

Traffic models impact on OFDMA scheduling design

Scheduling Algorithms For Policy Driven QoS Support in HSDPA Networks

Scheduling Support for Mixed VoIP and Web Traffic over HSDPA

Contact Info

Product

Resources

About