Quasi-Offline Fair Scheduling in Third Generation Wireless Data Networks
DOI:
https://doi.org/10.26636/jtit.2013.3.1231Keywords:
Birkhoff-von Neumann, max-min fairness, statistical optimization, wireless schedulingAbstract
In 3G wireless data networks, network operators would like to balance system throughput while serving users fairly. This is achieved through the use of fair scheduling. However, this approach provides non-Pareto optimal bandwidth allocation when considering a network as a whole. In this paper an optimal offline algorithm that is based on the decomposition result for a double stochastic matrix by Birkhoff and von Neumann is proposed. A utility max-min fairness is suggested for the derivation of a double stochastic matrix. Using a numerical experiment, new approach improves the fairness objective and is close to the optimal solution.
Downloads
References
[1] „Mobile Station-base Station Compatibility Standard for Dual-mode Wideband Spread Spectrum Cellular Systems”, EIA/TIA Interim Standard, Washington: Telecommunication Industry Association, 1999.
View in Google Scholar
[2] „UMTS, Release 11. 3G Partnership Project”, 2013 [Online]. Available: http://www.3gpp.org/Release-11
View in Google Scholar
[3] A. Jalali, R. Padovani, and R. Pankaj, „Data throughput of CDMA/HDR a high efficiency - high data rate personal communication wireless system”, in Proc. IEEE Veh. Technol. Conf. VTC 2000-Spring, Tokyo, Japan, 2000, pp. 1854-1858.
View in Google Scholar
[4] S. Borst and P. Whiting, „Dynamic rate control algorithms for HDR throughput optimization”, in Proc. IEEE INFOCOM 2001, Anchorage, Alaska, USA, 2001, pp. 976-985.
View in Google Scholar
[5] 1xEV: 1x EVolution IS-856 TIA/EIA Standard - Airlink Overview, QUALCOMM Inc., White Paper, Nov. 2001.
View in Google Scholar
[6] R. Fantacci and D. Tarchi, „Efficient scheduling techniques for high data-rate wireless personal area networks”, Int. J. Sensor Netw., vol. 2, no. 1-2, pp. 128-134, 2007.
View in Google Scholar
[7] G. Yang, H. Hu, and L. Rong, and Y. Du, „Performance of an efficient heuristic scheduling algorithm for MPEG-4 traffic in high data rate wireless personal area network”, IET Commun., vol. 5, no. 8, pp. 1090-1095, 2011.
View in Google Scholar
[8] G. Birkhoff, „Tres observaciones sobre el álgebra lineal”, Univ. Nac. Tucumán Rev. Ser. A, vol. 5, pp. 147-151, 1946.
View in Google Scholar
[9] J. von Neumann, „A certain zero-sum two-person game equivalent to the optimal assignment problem”, in Contributions to the Theory of Games, vol. 2. Princeton, NJ: Princeton University Press, 1953, pp. 5-12.
View in Google Scholar
[10] A. Demers, S. Keshav, and S. Shenker, „Analysis and simulation of a fair queueing algorithm”, in Proc. ACM Symp. Commun. Arch. Prot. SIGCOMM ’89, Austin, TX, USA, 1989, pp. 1-12.
View in Google Scholar
[11] L. Tassiulas and S. Sarkar, „Maxmin fair scheduling in wireless networks”, in Proc. IEEE INFOCOM 2002, New York, NY, USA, 2002, pp. 763-772.
View in Google Scholar
[12] Z. Cao and E. W. Zegura, „Utility max-min an application-oriented bandwidth allocation scheme”, in Proc. IEEE INFOCOM 1999, New York, NY, USA, 1999, vol. 2, pp. 793-801.
View in Google Scholar
[13] S. Sarkar and L. Tassiulas, „Bandwidth layers in multicast networks”, in Proc. IEEE INFOCOM 2000, Tel-Aviv, Israel, 2000, vol. 3, pp. 1491-1500.
View in Google Scholar
[14] R. Maheshwari et al., „Adaptive channelization for high data rate wireless networks”, Tech. Rep., Stony Brook University, Stony Brook, New York, USA, 2009.
View in Google Scholar
Downloads
Submitted
Published
Issue
Section
License
Copyright (c) 2013 Journal of Telecommunications and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
