ABSTRACT
To this day, traffic in cellular networks is still mainly real-time. However, with the deployment of new technologies, such as HDR (High Date Rate) and HSDPA (High Speed Downlink Packet Access), this situation is bound to evolve rapidly and elastic traffic will significantly increase. These novel technologies implement opportunistic scheduling, taking advantage of the delay-tolerance of elastic traffic, to augment the global capacity of the system. Previous work has shown that "Proportional Fair" (PF) is an opportunistic scheduler that provides a good compromise between fairness and efficiency. Nevertheless, the hypotheses according to which these results are obtained are not always valid in real environments. In this paper, we propose a modified version of PF that not only introduces flexibility in sharing resources between active users but also allows for a fair allocation of resources in realistic environments.
- P. Bender. Cdma/hdr: A bandwidth-efficient high-speed wireless data service for nomadic users. IEEE Communications Magazine, 38(7):70--77, July 2000. Google ScholarDigital Library
- T. Bonald. Wireless downlink data channels: User performance and cell dimensioning. MobiCom '03, 2003. Google ScholarDigital Library
- J. W. Cohen. The multiple phase service network with generalized processor sharing. Acta Informatica, 12:245--284, 1979.Google ScholarDigital Library
- J. Holtzman. Asymptotic analysis of proportional fair algorithm. Proceedings of IEEE, 2001.Google ScholarCross Ref
- H. Kushner. Convergence of proportional-fair sharing algorithms under general conditions. IEEE Communications Magazine, 3(4): 1250--1259, July 2004. Google ScholarDigital Library
- R. Love. High-speed downlink packet access performance. Proceedings of IEEE VTC Spring, 2001.Google ScholarCross Ref
- A. Viterbi. CDMA: Principles of Spread Spectrum Communication. Addison-Wesley, 1995. Google ScholarDigital Library
- Y. Zhao. Standardization of mobile phone positioning for 3g systems. IEEE Communications Magazine, 40(7): 108--116, July 2002. Google ScholarDigital Library
Index Terms
- The weighted proportional fair scheduler
Recommendations
Proportional fair throughput allocation in multirate IEEE 802.11e wireless LANs
Under heterogeneous radio conditions, Wireless LAN stations may use different modulation schemes, leading to a heterogeneity of bit rates. In such a situation, 802.11 DCF allocates the same throughput to all stations independently of their transmitting ...
A high-performance QoS-enhanced proportional fair scheduling algorithm over downlink OFDMA-based networks
OFDMA-based networks have been considered to be a promising solution to wireless networks especially for broadband multimedia mobile services. The major challenges pertaining to such OFDMA-based networks are to design a medium access control scheme that ...
Ultra-Dense Networks: A New Look at the Proportional Fair Scheduler
GLOBECOM 2017 - 2017 IEEE Global Communications ConferenceIn this paper, we theoretically study the proportional fair (PF) scheduler in the context of ultra-dense networks (UDNs). Analytical results are obtained for the coverage probability and the area spectral efficiency (ASE) performance of dense small cell ...
Comments