Analysis of stationary discrete-time GI/D-MSP/1 queue with finite and infinite buffers

This paper considers a single-server queueing model with finite and infinite buffers in which customers arrive according to a discrete-time renewal process. The customers are served one at a time under discrete-time Markovian service process (D-MSP). This service process is similar to the discrete-time Markovian arrival process (D-MAP), where arrivals are replaced with service completions. Using the imbedded Markov chain technique and the matrix-geometric method, we obtain the system-length distribution at a prearrival epoch. We also provide the steady-state system-length distribution at an arbitrary epoch by using the supplementary variable technique and the classical argument based on renewal-theory. The analysis of actual-waiting-time (in the queue) distribution (measured in slots) has also been investigated. Further, we derive the coefficient of correlation of the lagged interdeparture intervals. Moreover, computational experiences with a variety of numerical results in the form of tables and graphs are discussed.

[1]  Shigeo Shioda.  Departure Process of the MAP/SM/1 Queue , 2003, Queueing Syst. Theory Appl..

[2]  M. L. Chaudhry,et al.  Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N , 2003 .

[3]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[4]  U. C. Gupta,et al.  Complete analysis of finite and infinite buffer GI/MSP/1 queue - A computational approach , 2007, Oper. Res. Lett..

[5]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .

[6]  A. V. Pechinkin,et al.  An SM2/MSP/n/r System with Random-Service Discipline and a Common Buffer , 2003 .

[7]  Marcel F. Neuts,et al.  Some steady-state distributions for the MAP /SM /1 queue , 1994 .

[8]  Mohan L. Chaudhry,et al.  Performance analysis of the discrete-time GI / Geom /1/ N queue , 1996 .

[9]  A. V. Pechinknin,et al.  Stationary Characteristics of the SM/MSP/n/r Queuing System , 2004 .

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

[11]  Evgenia Smirni,et al.  Characterizing the BMAP/MAP/1 Departure Process via the ETAQA Truncation , 2005 .

[12]  Attahiru Sule Alfa,et al.  Discrete time queues and matrix-analytic methods , 2002 .

[13]  P. P. Bocharov,et al.  The Stationary Characteristics of the G/MSP/1/r Queueing System , 2003 .

[14]  Attahiru Sule Alfa,et al.  Perturbation Theory for the Asymptotic Decay Rates in the Queues with Markovian Arrival Process and/or Markovian Service Process – Correction , 2001, Queueing Syst. Theory Appl..

[15]  Winfried K. Grassmann,et al.  Regenerative Analysis and Steady State Distributions for Markov Chains , 1985, Oper. Res..

[16]  Tetsuya Takine,et al.  A NEW ALGORITHM FOR COMPUTING THE RATE MATRIX OF GI/M/1 TYPE MARKOV CHAINS , 2002 .

[17]  M. E. Woodward,et al.  Communication and computer networks - modelling with discrete-time queues , 1993 .

[18]  Jeffrey J. Hunter,et al.  Mathematical Techniques of Applied Probability Volume 2 Discrete Time Models: Techniques and Applications , 2008 .

[19]  Mohan L. Chaudhry,et al.  On Numerical Computations of Some Discrete-Time Queues , 2000 .

[20]  Mohan L. Chaudhry,et al.  On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues , 1996, Oper. Res. Lett..

[21]  Marcel F. Neuts,et al.  A queueing model for an ATM rate control scheme , 1993, Telecommun. Syst..

[22]  Toshihisa Ozawa,et al.  Sojourn time distributions in the queue defined by a general QBD process , 2006, Queueing Syst. Theory Appl..