Abstract | ||
---|---|---|
Proportional Fair (PF), a frequently used scheduling algorithm in 3G wireless networks, can unnecessarily starve "well-behaved" users in practice. One of the main causes behind PF-induced starvation is its inability to distinguish between users who are backlogged and users who are not. In this paper, we describe how a simple parallel PF instance can mitigate such starvation. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1007/978-3-540-72606-7_103 | Networking |
Keywords | Field | DocType |
robust wireless schedulers,wireless network,proportional fair,main cause,pf-induced starvation,simple parallel pf instance | Wireless network,Wireless,Computer science,Scheduling (computing),Computer network,Proportionally fair,Distributed computing | Conference |
Volume | ISSN | Citations |
4479 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Soshant Bali | 1 | 30 | 3.77 |
Sridhar Machiraju | 2 | 435 | 37.08 |
Hui Zang | 3 | 1052 | 77.25 |