A Hysteretic Source Rate Control Scheme for a Finite Buffer in a Wireless Environment

In this paper, we consider a source rate control scheme for a finite buffer of size C in a medium access control layer of a wireless system over a Markovian channel. Our rate control scheme can reduce the mean number of packets produced by a source when the queue length exceed K (K<C), and increase again (by recovering the original source rate) when the queue length drops below L (L<K). In order to obtain the stationary state probability vector of the system which is no longer a typical M/G/1 type queue, we propose an algorithm consisting of two phases. During the backward reduction phase, we obtain a minimal finite M/G/1 queue with an invariant probability vector called the minimal solution vector. This is followed by a forward expansion phase on the minimal solution vector. Numerical results are presented in terms of cumulative queue length distribution, by varying source and channel parameters and the hysteresis levels, L and K.

[1]  Julian Keilson,et al.  Multi-Server Threshold Queues with Hysteresis , 1995, Perform. Evaluation.

[2]  Weibo Gong,et al.  The m/g/l queue with queue-length dependent arrival rate , 1992 .

[3]  Alexander N. Dudin,et al.  Optimal hysteretic control for a BMAP/SM/1/N queue with two operation modes , 2000 .

[4]  San-Qi Li,et al.  Overload control in a finite message storage buffer , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[5]  Hong Shen Wang,et al.  Finite-state Markov channel-a useful model for radio communication channels , 1995 .

[6]  San-qi Li,et al.  Folding algorithm: a computational method for finite QBD processes with level-dependent transitions , 1994, IEEE Trans. Commun..

[7]  Taesoo Kwon,et al.  An enhanced uplink scheduling algorithm based on voice activity for VoIP services in IEEE 802.16d/e system , 2005, IEEE Communications Letters.

[8]  Shu Lin,et al.  Error Control Coding , 2004 .

[9]  Theodore J. Sheskin,et al.  Technical Note - A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities , 1985, Oper. Res..

[10]  Dianne P. O'Leary,et al.  A Block-GTH Algorithm for Finding the Stationary Vector of a Markov Chain , 1996, SIAM J. Matrix Anal. Appl..

[11]  Chul Geun Park,et al.  Queueing analysis of dynamic bandwidth allocation scheme for IP traffic on ATM networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[12]  Christoph Herrmann.  The complete analysis of the discrete time finite DBMAP/G/1/N queue , 2001, Perform. Evaluation.

[13]  John C. S. Lui,et al.  Stochastic Complement Analysis of Multi-Server Threshold Queues with Histeresis , 1999, Perform. Evaluation.

[14]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[15]  David M. Lucantoni,et al.  Traffic smoothing effects of bit dropping in a packet voice multiplexer , 1989, IEEE Trans. Commun..

[16]  Srinivas R. Chakravarthy,et al.  Optimal Hysteretic Control for the BMAP/G/1 System with Single and Group Service Modes , 2002, Ann. Oper. Res..

[17]  Diane Valérie Ouellette.  Schur complements and statistics , 1981 .

[18]  Sung Ho Choi,et al.  On Matrix-Geometric Solution of Nested QBD Chains , 2003, Queueing Syst. Theory Appl..

[19]  A. Alfa.  Matrix‐geometric solution of discrete time MAP/PH/1 priority queue , 1998 .

[20]  Daniel J. Costello,et al.  Error Control Coding, Second Edition , 2004 .

[21]  Mostafa Hashem Sherif,et al.  Voice Packetization and Compression in Broadband ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[22]  Chris Blondia,et al.  Performance analysis of statistical multiplexing of VBR sources , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[23]  C. Blondia.  The n/g/l finite capacity queue , 1989 .

[24]  Winfried K. Grassmann,et al.  Equilibrium distribution of block-structured Markov chains with repeating rows , 1990, Journal of Applied Probability.

[25]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[26]  Marcel F. Neuts.  A Queueing Model for a Storage Buffer in Which the Arrival Rate is Controlled by a Switch with a Random Delay , 1985, Perform. Evaluation.

[27]  Kalyan Basu,et al.  Overload control in finite buffer message system with general distributed service time , 1996, Proceedings of International Conference on Communication Technology. ICCT '96.

[28]  David M. Lucantoni,et al.  A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance , 1986, IEEE J. Sel. Areas Commun..

[29]  Hyong-Woo Lee,et al.  Performance Analysis of a Type-II Hybrid-ARQ in a TDMA System with Correlated Arrival over a Non-Stationary Channel , 2005, 2005 2nd International Symposium on Wireless Communication Systems.