ANALYSIS OF THE DISCRETE-TIME GI/G/1/K USING THE REMAINING TIME APPROACH

  • Liu, Qiaohua (Department of Mathematics, Shanghai University) ;
  • Alfa, Attahiru Sule (Department of Electronic & Computer Engineering, University of Manitoba) ;
  • Xue, Jungong (School of Mathematics Sciences, Fudan University)
  • Published : 2010.01.30

Abstract

The finite buffer GI/G/1/K system is set up by using an unconventional arrangement of the state space, in which the remaining interarrival time or service time is chosen as the level. The stationary distributions of resulting Markov chain can be explicitly determined, and the chain is positive recurrent without any restriction. This is an advantage of this method, compared with that using the elapsed time approach [2].

Keywords

References

  1. A.S. Alfa, Discrete time queues and matrix-analytic methods, TOP, 10(2) (2002), 147-210. https://doi.org/10.1007/BF02579008
  2. A.S. Alfa, An alterative approach for analyzing finite buffer queues in discrete time, Perfomance Evaluation, 53 (2003), 75-92. https://doi.org/10.1016/S0166-5316(02)00225-0
  3. G.H. Golub, C.F. Van Loan, Matrix Computations, Hohns Hopkins University Press, Baltimore, MD, 1989.
  4. B. Hajek, Birth-and-death processes on the integers with phases and general boundaries, J. Appl. Prob., 19 (1982), 488-499. https://doi.org/10.2307/3213508
  5. G. Latouche, V. Ramaswami, Introduction to matrix analytic methods in stochastic modeling. ASA-SIAM Series on Applied Probability, 1999.
  6. V. Naumov, Matrix-multiplicative approach to quasi-birth-and-death processes anslysis , in: S. Chakravarthy, A.S. Alfa(Eds.), Matrix-analytic methods in stochastic models, Marcel Dekker, New York, 1996, 87-106.
  7. M.F. Neuts, Matrix-geometric solutions in stochastic models, Johns Hopkins University Press, Baltimore, MD, 1981.
  8. V. Ramaswami, A stable recursion for the steady state vector in Markov chains of M/G/1type, Commun. Statist. -Stochastic Models, 4(1) (1988), 183-188. https://doi.org/10.1080/15326348808807077