A matrix continued fraction algorithm for the multiserver repeated order queue

Mathematical and Computer Modelling

Volumn 30, Issue 3-4, 1999, Pages 159-170

  Hanschke, T ^a,b  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

^b IBM   (United States)

Author keywords

Quasi birth and death process; Repeated order queueing systems; Subdominant solutions of linear difference equations; Truncation procedures for infinite matrices

Indexed keywords

EID: 0033179632     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(99)00139-9     Document Type: Article

References (34)

1. J.W. Cohen, Basic problems of telephone traffic theory and the influence of repeated calls, Philips Telecommun. Rev. 18, 49-100 (1957).
2. A. Elldin, Approach to the theoretical description of repeated call attempts, Ericsson Technics 23, 345-407 (1967).
3. G.I. Falin, A survey of retrial queues, Queueing Systems 7, 127-168 (1990).
4. T. Yaug and J.G.C. Templeton, A survey on retrial queues, Queueing Systems 2, 201-233 (1987).
5. A.M. Zelinskij and Y.N. Kornyshev, Two models of a system with repeated calls, Elektrosviaz., 60-63 (1978).
6. J. Keilson, J. Cozzolino and H. Young, A service system with unfilled request repeated, Oper. Res. 16, 1126-1137 (1968).
7. th Internat. Teletraffic Congr., Munich, pp. 435/1-435/5, (1970).
8. G.I. Falin, Double-channel Queueing System with Repeated Calls (in Russian). The paper is deposited with the All-Union Institute for Scientific and Technical Information, Moscow, USSR, No. 4221-84, June 21 (1984).
9. Th. Hanschke, A model for planning switching networks, Operations Research Proceedings 1984, pp. 555-562, Springer-Verlag, Berlin, (1985).
10. Th. Hanschke, Explicit formulae for the characteristics of the M/M/2/2 queue with repeated attempts, J. Appl. Prob. 24, 486-494 (1987).
11. G.I. Falin, Multichannel queueing systems with repeated calls under high intensity of repetition, J. Inf. Process. Cybern. EIK 23, 37-47 (1987).
12. M.F. Neuts and B.M. Rao, Numerical investigation of a multiserver retrial model, Queueing Systems 7, 169-190 (1990).
13. S.N. Stepanov, Algorithms of approximate design of systems with repeated calls, Automation and Remote Control 44, 63-71 (1983).
14. S.N. Stepanov, Asymptotic formulae and estimates for probabilistic characteristics of full-available group with absolutely persistent subscriber, Probl. Upravlenija i Teorii Informatsii 12, 361 (1983).
15. S.N. Stepanov, Numerical calculation accuracy of communication models with repeated calls, Problems of Control and Information Theory 13, 371-381 (1984).
16. Th. Hanschke, Die von Bretschneider, Cohen und Schwartzbart/Puri Entwickelten Warteschlangenmodelle mit Wiederholten Versuchen: Eine Methode zur Berechnung der Ergodischen Projektion ihrer Markovschen Warteprozesse und die Simulation der Wartezeiten, Thesis, Karlsruhe, (1978).
17. Th. Hanschke, Bestimmung von grenzwahrscheinlichkeiten bei warteschlangenmodellen mit hilfe des Jacobi-Perron-Algorithmus, Berichte der Math.-statist. Sektion im Forschungszentrum Graz (126) (1979).
18. C.E.M. Pearce, Extended continued fractions, recurrence relations and two-dimensional Markov processes, Adv. Appl. Prob. 21, 357-375 (1989).
19. Th. Hanschke, Markov chains and generalized continued fractions, J. Appl. Prob. 29, 838-849 (1992).
20. L. Bright and P.G. Taylor, Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes, Commun. Statist.-Stochastic Models 11 (3), 497-525 (1995).
21. P. Pfluger, Matrizenkettenbrüche. Dissertation Nr. 3862, Eidgenössische TH Zürich, (1966).
22. P. Levrie and A. Bultheel, Matrix continued fractions related to first-order linear recurrence systems, Electronic Transactions on Numerical Analysis 4, 46-63 (1996).
23. R.G. Miller, Jr., Stationarity equations in continuous time Markov chains, Trans. Amer. Math. Soc. 109, 35-44 (1963).
24. R.L. Tweedie, Sufficient conditions for regularity, recurrence and ergodicity of Markov processes, Math. Proc. Cambridge Phil. Soc. 78, 125-136 (1975).
25. J.-F. Mertens, E. Samuel-Cahn and S. Zamir, Necessary and sufficient conditions for recurrence and transience of Markov chains, in terms of inequalities, J. Appl. Prob. 15, 848-851 (1978).
26. N. Deul, Stationary conditions for multi-server queueing systems with repeated calls, Elektronische Informationsverarbeitung und Kybernetik. 10-12 (16), 607-613 (1980).
27. G.I. Falin, On ergodicity of multichannel queueing system with repeated calls, Sov. J. Comput. Syst. Sci. 25 (1), 60-65 (1987).
28. M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models, The John Hopkins University Press, Baltimore, MD, (1981).
29. R.L. Tweedie, The calculation of limit probabilities for denumerable Markov processes from infinitesimal properties, J. Appl. Prob. 10, 84-99 (1973).
30. E. Seneta, Finite approximations to infinite nonnegative matrices II, Proc. Camb. Phil. Soc. 64, 465-470 (1968).
31. K.S. Miller, Linear Difference Equations, W.A. Benjamin, New York, (1968).
32. J. Wimp, Computation with Recurrence Relations, Pitman, Boston, MA, (1984).
33. W. Gautschi, Zur numerik rekurrenter relationen, Computing 9, 107-126 (1972).
34. O. Perron, Die Lehre von den Kettenbrüchen, Band I. Third edition, Teubner-Verlag, Stuttgart, (1954).