An introduction to queueing theory and matrix-analytic methods

An Introduction to Queueing Theory and Matrix-Analytic Methods

Volumn , Issue , 2005, Pages 1-271

  Breuer, L ^a   Baum, D ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892293950     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/1-4020-3631-0     Document Type: Book

References (83)

1. A. S. Alfa. Discrete Time Queues and Matrix-analytic Methods. Top, 10(2):147-210, 2002.
2. A. S. Alfa. Combined Elapsed Time and Matrix-Analytic Method for the Discrete Time GI/G/1 and GIX/G/1 Systems. Queueing Systems, 45(1):5-25, 2003.
3. A. S. Alfa and W. Li. Matrix-geometric analysis of the discrete time GI/G/1 system. Stoch. Models, 17(4):541-554, 2001.
4. A. S. Alfa and M. F. Neuts. Modelling vehicular traffic using the discrete time Markovian arrival process. Transp. Sci., 29(2):109-117, 1995.
5. S. Asmussen. Applied Probability and Queues. New York etc.: Springer, 2003.
6. S. Asmussen and G. Koole. Marked point processes as limits of Markovian arrival streams. J. Appl. Probab., 30(2):365-372, 1993.
7. S. Asmussen, O. Nerman, and M. Olsson. Fitting phase-type distributions via the EM algorithm. Scand. J. Stat., 23(4):419-441, 1996.
8. F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios. Open, closed, and mixed networks of queues with different classes of customers. Journal of the ACM, 22:248-260, 1975.
9. D. Baum. A BMAP|G|1-analysis based on convolution calculus. J. Math. Sci., New York, 92(4):3990-4002, 1998.
10. D. Baum. On markovian spatial arrival processes for the performance analysis of mobile communication networks. Technical Report 98-07, University of Trier, Subdept. of Computer Science, 1998.
11. D. Baum and V. Kalashnikov. Spatial generalization of BMAPs with finite state space. J. Math. Sci., New York, 105(6):2504-2514, 2001.
12. D. Baum and V. V. Kalashnikov. Stochastic models for communication networks with moving customers. Information Processes, 1:1-23, 2001.
13. D. Baum and V. Kalashnikov. Spatial No. Waiting Stations with Moving Customers. Queueing Systems, 46:231.247, 2004.
14. D. Baum and J. Sztrik. Customer motion in queueing models: The use of tangent vector fields. International Journal on Pure and Applied Mathematics, 2002. To appear.
15. G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi. Queueing networks and Markov chains. John Wiley & Sons, New York, Chichester, Weinheim, Brisbane, Singapore, Toronto, 1998.
16. L. Breiman. Probability. Philadelphia, PA: SIAM, 1968.
17. L. Breuer. The Periodic BMAP/PH/c Queue. Queueing Systems, 38(1):67.76, 2001.
18. L. Breuer. An EM Algorithm for Batch Markovian Arrival Processes and its Comparison to a Simpler Estimation Procedure. Annals of Operations Research, 112:123.138, 2002.
19. L. Breuer. On Markov. Additive Jump Processes. Queueing Systems, 40(1):75.91, 2002.
20. L. Breuer. On the MAP/G/1 Queue with Lebesgue.dominated Service Time Distribution and LCFS Preemptive Repeat Service Discipline. Stochastic Models, 18(4):589.595, 2002.
21. L. Breuer. From Markov Jump Processes to Spatial Queues. Kluwer, Dordrecht (Netherlands), 2003.
22. L. Breuer. Two Examples for Computationally Tractable Periodic Queues. International Journal of Simulation, 3 (3. 4):15.24, 2003.
23. L. Breuer, A. Dudin, V. Klimenok, and G. Tsarenkov. A Two. Phase BMAP/G/1/N→PH/1/M-1 System with Blocking. Automation and Remote Control, 65(1):104.115, 2004.
24. J. P. Buzen. Computational algorithms for closed queueing networks with exponential servers. Commun. ACM, 16:527.531, 1973.
25. E. Çinlar. Introduction to stochastic processes. Englewood Cliffs, N. J.: Prentice-Hall, 1975.
26. K. M. Chandy, J. H. Howard, and D. F. Towsley. Product form and local balance in queueing networks. Journal of the ACM, 24:250.263, 1977.
27. K. Chung. Markov chains with stationary transition probabilities. Springer-Verlag, Berlin etc., 1960.
28. J. Cohen. The Single Server Queue. North. Holland, Amsterdam etc., 1969.
29. H. Daduna. Queueing networks with discrete time scale. Springer, Berlin, Heidelberg, New York, 2001.
30. N. M. Van Dijk. Queueing Networks and Product Forms. JohnWiley & Sons, Chichester, New York, Brisbane, Toronto, Singapore, 1993.
31. J. Doob. Stochastic processes. New York: Wiley, 1953.
32. T. Engset. Emploi du calcul des probabilités pour la détermination du nombre de sélecteurs dans les Bureaux Téléphoniques Centraux. Rev. gén. elect., 9:138-140, 1921.
33. A. Erlang. Solution of Some Probability Problems of Significance for Automatic Telephone Exchanges. Electroteknikeren, 13:5-13, 1917.
34. W. Feller. An introduction to probability theory and its applications. Vol. I. New York etc.: John Wiley and Sons, 1950.
35. W. Feller. An introduction to probability theory and its applications. Vol. II. 2nd ed. New York etc.: John Wiley and Sons, 1971.
36. E. Gelenbe and G. Pujolle. Introduction to queueing networks. John Wiley & Sons, hichester, New York, Brisbane, Toronto, Singapore, 1987.
37. I. Gihman and A. Skorohod. The theory of stochastic processes I. Berlin etc.: Springer, 1974.
38. I. Gihman and A. Skorohod. The theory of stochastic processes II. Berlin etc.: Springer-Verlag, 1975.
39. I. Gikhman and A. Skorokhod. Introduction to the theory of random processes. Saunders, 1969.
40. W. Gordon and G. Newell. Closed queuing systems with exponential servers. Oper. Res., 15:254-265, 1967.
41. P. G. Harrison and N. M. Patel. Performance Modelling of Communication Networks and Computer Architectures. Addison-Wesley, Reading, Massachusetts, 1993.
42. J. R. Jackson. Jobshop-like queueing systems. Management Science, 10:131-142, 1963.
43. E. Juri. Theory and Application of the z-Transform Method. Wiley, New York, 1964.
44. V. Kalashnikov. Topics on Regenerative Processes. CRC Press, 1994.
45. K. Kant. Introduction to computer system performance evaluation. McGraw-Hill, Inc., New York, London, 1992.
46. S. Karlin and H. M. Taylor. A first course in stochastic processes. 2nd ed. New York etc.: Academic Press, 1975.
47. S. Karlin and H. M. Taylor. A second course in stochastic processes. New York etc.: Academic Press, 1981.
48. F. Kelly. Reversibility and Stochastic Networks. Wiley, 1979.
49. D. Kendall. Stochastic Processes Occuring in the Theory of Queues and Their Analysis by the Method of the Embedded Markov Chain. Annals of Mathematical Statistics, 24:338-354, 1953.
50. L. Kleinrock. Queueing systems. Vol. I: Theory. New York etc.: John Wiley & Sons, 1975.
51. Y. Lam. A Note on the Optimal Replacement Problem. Adv. Appl. Prob., 20:479-482, 1988.
52. G. Latouche and V. Ramaswami. Introduction to matrix analytic methods in stochastic modeling. Philadelphia, PA: SIAM, 1999.
53. J. Little. A Proof for the Queueing Formula L = λW. Operations Research, 9, 1961.
54. D. M. Lucantoni. New results on the single server queue with a batch Markovian arrival process. Commun. Stat., Stochastic Models, 7(1):1-46, 1991.
55. D. M. Lucantoni. The BMAP/G/1 Queue: A Tutorial. In L. Donatiello and R. Nelson, editor, Models and Techniques for Performance Evaluation of Computer and Communication Systems, pages 330-358. Springer, 1993.
56. D. M. Lucantoni, K. S. Meier-Hellstern, and M. F. Neuts. A single-server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Probab., 22(3):676-705, 1990.
57. D. M. Lucantoni and M. F. Neuts. Simpler proofs of some properties of the fundamental period of the MAP/G/1 queue. J. Appl. Probab., 31(1):235-243, 1994.
58. F. Machihara. A New Approach to the Fundamental Period of a Queue with Phase-type Markov Renewal Arrivals. Stochastic Models, 6(3):551-560, 1990.
59. S. Meyn and R. Tweedie. Markov chains and stochastic stability. Berlin: Springer-Verlag, 1993.
60. I. Mitrani. Modelling of computer and communication systems. Cambridge University Press, Cambridge etc., 1987.
61. R. Nelson. Probability, stochastic processes, and queueing theory. New York, NY: Springer-Verlag, 1995.
62. M. F. Neuts. Probability distributions of phase type. In Liber Amicorum Prof. Emeritus H. Florin, pages 173-206. Department of Mathematics, University of Louvain, Belgium, 1975.
63. M. F. Neuts. Markov chains with applications in queueing theory, which have a matrixgeometric invariant probability vector. Adv. Appl. Probab., 10:185-212, 1978.
64. M. F. Neuts. A versatile Markovian point process. J. Appl. Probab., 16:764-774, 1979.
65. M. F. Neuts. Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins University Press, Baltimore, 1981.
66. M. F. Neuts. Structured stochastic matrices of M/G/1 type and their applications. New York etc.: Marcel Dekker, 1989.
67. M. F. Neuts and J.-M. Li. An algorithm for the P (n, t) matrices of a continuous BMAP. In Matrix-analytic methods in stochastic models (Flint, MI), volume 183 of Lecture Notes in Pure and Appl. Math., pages 7-19. Dekker, New York, 1997.
68. A. Pacheco and N. Prabhu. Markov-additive processes of arrivals. In J. H. Dshalalow, editor, Advances in queueing, pages 167-194. CRC Press, Boca Raton, FL, 1995.
69. R. Pyke. Markov Renewal Processes: Definitions and Preliminary Properties. Annals of Mathematical Statistics, 32:1231-1242, 1961.
70. R. Pyke. Markov Renewal Processes with Finitely Many States. Annals of Mathematical Statistics, 32:1243-1259, 1961.
71. V. Ramaswami. The N/G/1 queue and its detailed analysis. Adv. in Appl. Probab., 12(1):222-261, 1980.
72. V. Ramaswami. A stable recursion for the steady state vector in Markov chains of M/G/1 type. Commun. Stat., Stochastic Models, 4(1):183-188, 1988.
73. M. Reiser and S. Lavenberg. Mean-value analysis of closed multichain queuing networks. J. Assoc. Comput. Mach., 27:313-332, 1980.
74. S. Ross. Applied Probability Models with Optimization Applications. Holden-Day, San Francisco, 1970.
75. S. Ross. Stochastic Processes. John Wiley & Sons, New York etc., 1983.
76. T. Ryden. An EM algorithm for estimation in Markov-modulated Poisson processes. Comput. Stat. Data Anal., 21(4):431-447, 1996.
77. R. Serfozo. Introduction to stochastic networks. Springer-Verlag, New York, 1999.
78. D. Shi, J. Guo, and L. Liu. SPH-Distributions and the Rectangle-Iterative Algorithm. In S. R. Chakravarthy and A. S. Alfa, editors, Matrix-Analytic Methods in Stochastic Models, pages 207-224, New York etc., 1997. Marcel Dekker.
79. D. Shi and L. Liu. Markovian Models for Non-negative Random Variables. In A. S. Alfa and S. R. Chakravarthy, editors, Advances in Matrix Analytic Methods for Stochastic Models, pages 403-427. Notable Publications, 1998.
80. W. Smith. Regenerative Stochastic Processes. Proceedings Royal Society, Series A, 232:6-31, 1955.
81. W. Smith. Renewal Theory and Its Ramifications. Journal of the Royal Statistical Society, Series B, 20:243-302, 1958.
82. T. Takine. A new recursion for the queue length distribution in the stationary BMAP/G/1 queue. Stochastic Models, 16(2):335-341, 2000.
83. R. Tweedie. Operator-geometric stationary distributions for Markov chains, with application to queueing models. Adv. Appl. Probab., 14:368-391, 1982.