Paper Info
Title
Throughput analysis of the proportional fair scheduler in HSDPA
Abstract
High speed downlink packet access (HSDPA) provides increased user data rate by introducing additional functionalities at the Node B, such as fast packet scheduling based on the instantaneous radio link quality. One of the algorithms that is able to provide this capability is the proportional fair (P-FR) scheduler. In this paper we describe an approximate analysis method for the mean throughput of the proportional fair scheduler with two traffic classes. We extend the existing results that are based on the assumption of continuous rate distributions to the more realistic discrete distributions. The analysis with discrete distributions entails two problems that do not appear in the continuous case, namely that the priority of several users can be equal with a non-zero probability and that the sample path of throughputs does not always converge to a mean throughput. The proposed approximate method is evaluated with NS2 simulations.
Year
DOI
Venue
2008
10.1109/EW.2008.4623914
Prague
Keywords
Field
DocType
3G mobile communication,code division multiple access,radio links,scheduling,telecommunication traffic,HSDPA,fast packet scheduling,high speed downlink packet access,instantaneous radio link quality,nonzero probability,proportional fair scheduler,realistic discrete distributions,throughput analysis,traffic classes,3.5G,HSDPA,Proportional Fair Scheduling
Computer science,Scheduling (computing),Network packet,Algorithm,Real-time computing,Automatic repeat request,Throughput,Code division multiple access,Radio Link Protocol,Proportionally fair,Telecommunications link
Conference
ISBN
Citations 
PageRank 
978-3-8007-3102-2
1
0.52
References 
Authors
0
2
Name
Order
Citations
PageRank
Gábor Horváth121035.47
Csaba Vulkán2116.61