Quantifying the throughput guarantees offered in wireless networks

Offering throughput guarantees for cellular wireless networks, carrying real-time traffic, is of interest to both the network operators and the customers. Furthermore, to be able to quantify the soft throughput guarantees for a certain scheduling algorithm without conducting experimental investigations, is valuable for network providers. In this paper, we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks with the given cumulants of the distribution of the bit-rate, and a given distribution for the number of time-slots allocated within a time-window. Through simulations, it is shown that this TGVP approximation is tight for a realistic wireless network with moving users and correlated channels.

[1]  Gerardo Rubino,et al.  Introduction to Rare Event Simulation , 2009, Rare Event Simulation using Monte Carlo Methods.

[2]  A. Goldsmith,et al.  Capacity of Rayleigh fading channels under different adaptive transmission and diversity-combining techniques , 1999, IEEE Transactions on Vehicular Technology.

[3]  Alexander L. Stolyar,et al.  Optimal utility based multi-user throughput allocation subject to throughput constraints , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  David Gesbert,et al.  Throughput guarantees for wireless networks with opportunistic scheduling: a comparative study , 2007, IEEE Transactions on Wireless Communications.

[5]  Jack M. Holtzman,et al.  Asymptotic analysis of proportional fair algorithm , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).

[6]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[7]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[8]  Deepak Kumar,et al.  Long Term Evolution Protocol: An Overview , 2013 .

[9]  Mohamed-Slim Alouini,et al.  Performance analysis of multiuser selection diversity , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[10]  Sem C. Borst,et al.  Dynamic channel-sensitive scheduling algorithms for wireless data throughput optimization , 2003, IEEE Trans. Veh. Technol..

[11]  Na Chen,et al.  Downlink scheduling with guarantees on the probability of short-term throughput , 2009, IEEE Transactions on Wireless Communications.

[12]  G.E. Oien,et al.  Scheduling Algorithms for Increased Throughput Guarantees in Wireless Networks , 2007, 2007 4th International Symposium on Wireless Communication Systems.

[13]  Pratibha Mishra,et al.  Advanced Engineering Mathematics , 2013 .

[14]  Laurence B. Milstein,et al.  Comparison of diversity combining techniques for Rayleigh-fading channels , 1996, IEEE Trans. Commun..

[15]  Simone Redana,et al.  Quality of service scheduling based on utility prediction , 2008, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications.