Quasi-offline fair scheduling in third generation wireless data networks

• Autorzy: Martyna J.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

Birkhoff-von Neumann; max-min fairness; statistical optimization; wireless scheduling

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2013
• Tom: nr 3
• Strony: 112--114
• Opis fizyczny: Bibliogr. 14 poz.

Twórcy

autor

Martyna J.

• Institute of Computer Science, Faculty of Mathematics and Computer Science, Jagiellonian University, Prof. S. Łojasiewicza st 6, 30-348 Krakow, Poland

Bibliografia

• [1] “Mobile Station-base Station Compatibility Standard for Dual-mode Wideband Spread Spectrum Cellular Systems”, EIA/TIA Interim Standard, Washington: Telecommunication Industry Association, 1999.
• [2] “UMTS, Release 11. 3G Partnership Project”, 2013 [Online]. Available: http://www.3gpp.org/Release-11
• [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. Proc. VTC 2000 (Spring), Tokyo, Japan, 2000, pp. 1854–1858.
• [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.
• [5] 1xEV: 1x EVolution IS-856 TIA/EIA Standard – Airlink Overview, QUALCOMM Inc., White Paper, Nov. 2001.
• [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.
• [7] G. Yang, H. Hu, and L. Rong, 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.
• [8] G. Birkhoff, “Tres observations sobre el algebra lineal”, Univ. Nac.Tucum´an Revue. Ser. A 5 pp. 147–151, 1946.
• [9] J. von Neumann, A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem, Contributions to the Theory of Games, vol. 2. Princeton, NJ: Princeton University Press, 1953, pp. 5–12.
• [10] A. Demers, S. Keshav, and S. Shenkar, “Analysis and simulation of a fair queueing algorithm”, in Proc. ACM Symp. Commun. Arch. Prot. SIGCOMM ’89, Austin, TX, USA, pp. 1–12.
• [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.
• [12] Z. Cao and E. W. Zegara, “Utility max-min an application-oriented bandwidth allocation scheme”, in Proc. IEEE INFOCOM 1999, New York, NY, USA, 1999, vol. 2, pp. 793–801.
• [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.
• [14] R. Maheshwari et al., “Adaptive channelization for high data rate wireless networks”, Tech. Rep, Stony Brook University, Stony Brook, New York, USA, 2009.