On some properties of the proportional fair scheduling policy
| Autor: | Avidor, D., Mukherjee, S., Ling, J., Constantinos Papadias |
|---|---|
| Rok vydání: | 2005 |
| Předmět: |
business.industry
Network packet Computer science ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Throughput Data_CODINGANDINFORMATIONTHEORY Proportionally fair Scheduling (computing) Base station Diversity gain Wireless Fading Maximum throughput scheduling business Computer network Communication channel |
| Zdroj: | PIMRC Scopus-Elsevier |
| DOI: | 10.1109/pimrc.2004.1373820 |
| Popis: | The proportional fair (PF) scheduling algorithm has been proposed as a technique to improve the throughput of multiple packet-data users sharing a wireless downlink channel while preserving fairness. It exploits the fact that the propagation channels between the base station (BS) and the mobile stations (MS) fade independently giving rise to "multi-user diversity". The gain offered is significant when the allowed packet delay exceeds the de-correlation time of the fading channels and the number of users is high. We analytically investigate the "time allocation" property and the multi-user diversity gain of the PF algorithm under certain conditions in the context of the HSDPA standard. Since in practical systems a certain latency is unavoidable, we have studied the use of a "backoff' factor to reduce the probability that when the transmission takes place, the channel cannot support it. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|