Name
Abstract | ||
|---|---|---|
Proportional Fair (PF) is a frequently used channel aware scheduling algorithm in 3G wireless networks. However, recent work by us and others has shown that, in practice, PF suffers from significant robustness issues that call unnecessarily starve "well behaved" users. In this paper, we analyze these issues with the goal of developing an alternative scheduling algorithm more robust than PF. We start by identifying two scenarios in which PF can cause starvation. We analyze both scenarios and develop mechanisms that prevent such starvation. Then, we combine these mechanisms to propose our Parallel Adaptive Quantile based (PAQ) scheduling algorithm. We use simulation experiments with synthetic and measurement based traces of wireless channel conditions to show that PAQ is not only robust but also achieves comparable or better throughput and fairness than PF. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ICC.2008.567 | 2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13 |
Keywords | Field | DocType |
proportional fair, quantile based scheduler, starvation, robust scheduler | Wireless network,Algorithm design,Wireless,Scheduling (computing),Computer science,Communication channel,Computer network,Real-time computing,Robustness (computer science),Throughput,Proportionally fair,Distributed computing | Conference |
ISSN | Citations | PageRank |
1550-3607 | 0 | 0.34 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Soshant Bali | 1 | 30 | 3.77 |
| Sridhar Machiraju | 2 | 435 | 37.08 |
| Hui Zang | 3 | 1052 | 77.25 |