Scheduling algorithms for HS-DSCH in a WCDMA mixed traffic scenario

Kazmi, M.; Wiberg, N.

doi:10.1109/pimrc.2003.1260360

Cited by 32 publications

(16 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For resource allocation to the mobile users in a class P c , c 2 f0; 1; 2g, we successively select the user with maximum scheduling function u [33], where, u ¼ max f u u g, u is current bit rate of the user u (based on its channel conditions), u is the user throughput to ensure fairness. To maximize throughput, u will ensure that the users with best channel conditions is selected while u will ensure that no user experiences starvation.…”

Section: Class-based Shared Resource Allocationmentioning

confidence: 99%

Class-Based Shared Resource Allocation for Cell-Edge Users in OFDMA Networks

Singhal

Kumar²,

et al. 2014

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-In this paper, we present a new resource allocation scheme for cell-edge active users to achieve improved performance in terms of a higher system capacity and better quality-of-service (QoS) guarantee of the users, where we utilize the two-dimensional resource allocation flexibility of orthogonal frequency division multiple access (OFDMA) networks. Here, the mobile stations (MSs) at the cell-edge can maintain parallel connections with more than one base station (BS) when it is in their coverage area. A MS, before handoff to a new BS, seeks to utilize additional resources from the other BSs if the BS through which its current session is registered is not able to satisfy its requirements. The handoff procedure is termed as split handoff. The BSs participate in split handoff operation while guaranteeing that they are able to maintain QoS of the existing connections associated with them. In this study, first, we present the proposed shared resource allocation architecture and protocol functionalities in split handoff, and give a theoretical proof of concept of system capacity gain associated with the shared resource allocation approach. Then, we provide a differentiated QoS provisioning approach that accounts for the MS speed, its channel quality, as well as the loads at different BSs. Via extensive simulations in Qualnet, the benefits of the proposed class-based split handoff approach is demonstrated. The results also indicate traffic load balancing property of the proposed scheme in heavy traffic conditions.

show abstract

Section: Class-based Shared Resource Allocationmentioning

confidence: 99%

Class-Based Shared Resource Allocation for Cell-Edge Users in OFDMA Networks

Singhal

Kumar²,

et al. 2014

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…PF tries to increase the degree of fairness among connections by selecting those with the largest relative channel quality where the relative channel quality is the ratio between the connection's current supportable data rate (which depends on its channel quality conditions) and its average throughput. However, a recent study shows that the PF scheme gives more priority to connections with high variance in their channel conditions [28]. Therefore, we pay our attention focusing on the PF scheme for illustration here.…”

Section: Proportional Fair (Pf) Algorithmmentioning

confidence: 99%

Introduction to Packet Scheduling Algorithms for Communication Networks

Tsai¹,

Chung²,

Tsai³

2010

Communications and Networking

View full text Add to dashboard Cite

“…Scheduling multiple services amounts to managing priority between these services according to their quality-of-service (QoS) requirements. These issues have already been extensively developed in literature, e.g., [12][13][14]. This paper is organized as follows: In Section 2, the system model and assumptions are given.…”

Section: Paper Scope and Outlinementioning

confidence: 99%

Analytical evaluation of multicast packet delivery and user-clustering schemes in high-speed cellular networks

Heni

Lagrange

2009

Ann. Telecommun.

View full text Add to dashboard Cite

Transmission on data-oriented radio interfaces of cellular networks has been primarily designed for unicast applications. Nevertheless, unicast may not optimize the resource usage when the same content has to be transmitted to several users in the same cell. In this context, multicast seems to be an efficient means to convey data. In this paper, we develop an analytical model that allows the computation of the mean bitrate for both multicast and multiple-unicast transmission schemes. Furthermore, we propose a multicast transmission scheme called the equal-bitrate (EB) algorithm that allocates bandwidth to mobiles according to their instantaneous channel quality. We compare it to adaptations of the well-known max-signal-to-noise ratio and round robin to multicast. We propose to group users into clusters. The clustering method combines multicast and unicast transmission schemes according to the user's average channel conditions. We use the analytical model to evaluate the proposed solutions. We compare the resulting performance against pure multicast and multiple-unicast approaches. We show that the EB algorithm offers a good trade-off between throughput and fairness. Also, we show that mixed clustering achieves good performance compared to conventional clustering methods.

show abstract

Scheduling algorithms for HS-DSCH in a WCDMA mixed traffic scenario

Cited by 32 publications

References 5 publications

Class-Based Shared Resource Allocation for Cell-Edge Users in OFDMA Networks

Class-Based Shared Resource Allocation for Cell-Edge Users in OFDMA Networks

Introduction to Packet Scheduling Algorithms for Communication Networks

Analytical evaluation of multicast packet delivery and user-clustering schemes in high-speed cellular networks

Contact Info

Product

Resources

About