Skip to main content
SpringerLink
Log in

Transient solutions for multidimensional denumerable state Markov processes

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The computational problem of transient solutions for denumerable state Markov Processes (MP's) has been solved by Hsu and Yuan [12], who derived an efficient algorithm with uniform error. However, when the state space of an MP is of two or more dimensions, even for computational methods dealing with stationary solutions, only the case where one of the dimensions is infinite and all the others are finite has been studied. In this paper, we study transient solutions for multidimensional denumerable state MP's and give an algorithm with uniform error. Some numerical results are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N.T.J. Bailey, A continuous time treatment of a simple queue using generating functions,J. Roy. Statist. Soc. B16 (1954) 288–291.

    Google Scholar 

  2. U.N. Bhat, Transient behavior of multiserver queues with recurrent input and exponential service times,J. Appl. Probab. 5 (1968) 158–168.

    Google Scholar 

  3. B.W. Conolly, A difference equation technique applied to the simple queue,J. Roy. Statist. Soc. B20 (1958) 165–167.

    Google Scholar 

  4. B.W. Conolly, A difference equation technique applied to the simple queue with arbitrary arrival interval distribution,J. Roy. Statist. Soc. B20 (1958) 168–175.

    Google Scholar 

  5. D.R. Cox and W.L. Smith,Queues (Methuen, London, 1961).

    Google Scholar 

  6. W.K. Grassmann, Transient solutions in Markovian queueing systems,Comput. Oper. Res. 4 (1977) 47–53.

    Google Scholar 

  7. W.K. Grassmann, Transient solutions in Markovian queues,European J. Oper. Res. 1 (1977) 396–402.

    Google Scholar 

  8. D. Gross and D.R. Miller, The randomization technique as a modelling tool and solution procedure for transient Markov processes,Oper. Res. 32 (1984) 343–361.

    Google Scholar 

  9. J.M. Harrison, Assembly-like queues,J. Appl. Probab. 10 (1973) 354–367.

    Google Scholar 

  10. G.H. Hsu, The transient behavior of the queueing processGI/M/n, Chinese Math. 6 (1965) 393–421.

    Google Scholar 

  11. G.H. Hsu, Q.M. He and X.S. Liu, The matched queueing system with a double input,Acta Math. Appl. Sinica 13 (1990) 39–48 (in Chinese).

    Google Scholar 

  12. G.H. Hsu and X.M. Yuan, Transient solutions for denumerable-state Markov processes,J. Appl Probab. 31 (1994) 635–645.

    Google Scholar 

  13. S. Karlin and J. McGregor, Many-server queueing process with Poisson input and exponential service times,Pacific J. Math. 8 (1958) 87–118.

    Google Scholar 

  14. J. Kohlas,Stochastic Methods of Operations Research (Cambridge Univ. Press, London, 1982).

    Google Scholar 

  15. M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models (Johns Hopkins Univ. Press, Baltimore, 1981).

    Google Scholar 

  16. M.F. Neuts,Structured Stochastic Matrices of M/G/1 Type and Their Applications (Dekker, New York, 1989).

    Google Scholar 

  17. A. Reibman and K. Trivedi, Numerical transient analysis of Markov models,Comput. Oper. Res. 15 (1988) 19–36.

    Google Scholar 

  18. T.L. Saaty, Time-dependent solution of the many-server Poisson queue,Oper. Res. 8 (1960) 755–772.

    Google Scholar 

  19. D.H. Shi, J. Guo and L. Liu, SPH-distributions and the rectangle-iterative algorithm, in:First Int. Conf. on Matrix-Analytic Methods in Stoc. Models (1995) pp. 209–226.

  20. J.H.A. de Smit, On the many-server queue with exponential service times,Adv. Appl. Probab. 5 (1973) 170–182.

    Google Scholar 

  21. L. Takacs, Transient behavior of single-server queueing processes with recurrent input and exponential distributed service times,Oper. Res. 8 (1960) 231–245.

    Google Scholar 

  22. L. Takacs, The transient behavior of a single server queueing process with a Poisson input, in:Proc. Fourth Berkeley Symp. on Math. Statist, and Probab. 2 (Univ. of California Press, Berkeley, 1961) pp. 535–567.

    Google Scholar 

  23. H.C. Tijms,Stochastic Models: An Algorithmic Approach (Wiley, New York, 1994).

    Google Scholar 

  24. F. Wu, On theGI/M/n queueing process,Acta Math. Sinica 11 (1961) 295–305 (in Chinese).

    Google Scholar 

  25. M.I. Yue, On the problemM/M/s in the theory of queues,Acta Math. Sinica 9 (1959) 494–502 (in Chinese).

    Google Scholar 

  26. J. Zhang and E.J. Coyle, Transient analysis of quasi-birth-death processes,Stochastic Models 5 (1989) 459–496.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Chinese Academy of Sciences, 100080, Beijing, PR China

    Guang-Hui Hsu & De-Ju Xu

  2. Asian-Pacific Operations Research Center within CAS and APORS, PR China

    Guang-Hui Hsu & De-Ju Xu

Authors
  1. Guang-Hui Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. De-Ju Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hsu, GH., Xu, DJ. Transient solutions for multidimensional denumerable state Markov processes. Queueing Syst 23, 317–329 (1996). https://doi.org/10.1007/BF01206564

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01206564

Keywords

Search

Navigation