2005
DOI: 10.1109/tnet.2005.850215
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a PNA Probability, Networks and Algorithms Probability, Networks and AlgorithmsUser-level performance of channel-aware scheduling algorithms in wireless data networks Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in wireless data networks by exploiting channel fluctuations. The performance of channel-aware scheduling algor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
331
0
6

Year Published

2005
2005
2017
2017

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 295 publications
(338 citation statements)
references
References 21 publications
1
331
0
6
Order By: Relevance
“…around the mean rate [11]. A similar expression can be found for the high mobility system, by replacing the harmonic average by an arithmetic one in the load expression.…”
Section: Introducing Opportunistic Scheduling Gainmentioning
confidence: 77%
See 1 more Smart Citation
“…around the mean rate [11]. A similar expression can be found for the high mobility system, by replacing the harmonic average by an arithmetic one in the load expression.…”
Section: Introducing Opportunistic Scheduling Gainmentioning
confidence: 77%
“…It has been shown in [10] that the embedded Markov chain in such a system is reversible and the system has a product-form solution for the steady-state probabilities. These latter can thus be shown, after some calculations, to be equal to that of expression (11).…”
Section: B No Mobility Modelmentioning
confidence: 84%
“…The mean delays E[T FB ] and E[T FB r ] are calculated from this conditional mean delay E[T FB (t)] similarly as for the PS discipline, see (3) and (4).…”
Section: Psmentioning
confidence: 99%
“…An example is the Proportionally Fair (PF) discipline implemented in HSPDA/HDR systems, where the time slot is scheduled to the terminal with the highest momentary receiving rate proportionally to its average receiving rate. This will lead to the PS discipline in the limit as the time slot shrinks down to zero, however, with a higher cell capacity compared to the limit of the RR discipline [8,2,4]. The improvement in the cell capacity has been studied in [2] with the number of flows fixed and in [3] assuming a randomly varying number of flows.…”
Section: Introductionmentioning
confidence: 99%
“…Obviously, the performance of the considered system not only depends on node cooperation, it also depends on the metric used to select the (m, r) pair. Originally from Kelly's work [15], the proportionally fair scheduling (PFS) algorithm [16][17][18][19][20][21] has spurred the development of a large number of network utility maximization (NUM) algorithms since 1997 [22][23][24][25][26], and is implemented in current 3G networks [27] as the most-cited NUM method. Being a promising scheme for fair resource allocation, PFS has shown excellent balance between throughput and fairness via multi-user diversity and game-theoretic equilibrium.…”
Section: Introductionmentioning
confidence: 99%