zbMATH — the first resource for mathematics

Steady state analysis of finite fluid flow models using finite QBDs. (English) Zbl 1080.90023
Summary: The Markov modulated fluid model with finite buffer of size $$\beta$$ is analyzed using a stochastic discretization yielding a sequence of finite waiting room queueing models with iid amounts of work distributed as $$\exp(n \lambda)$$. The $$n$$-th approximating queue’s system size is bounded at a value $$q_{n}$$ such that the corresponding expected amount of work $$q_{n}/(n \lambda) \rightarrow \beta$$ as $$n \rightarrow \infty$$. We demonstrate that as $$n \rightarrow \infty$$, we obtain the exact performance results for the finite buffer fluid model from the processes of work in the system for these queues. The necessary (strong) limit theorems are proven for both transient and steady state results. Algorithms for steady state results are developed fully and illustrated with numerical examples.

MSC:
 90B22 Queues and service in operations research
Full Text:
References:
 [1] S. Ahn and V. Ramaswami,Fluid flow models & queues–A connection by stochastic coupling, Stochastic Models 19(3) (2003) 325–348. · Zbl 1021.60073 · doi:10.1081/STM-120023564 [2] S. Ahn and V. Ramaswami, Transient analysis of fluid flow models via stochastic coupling to a queue, 2003, Stochastic Models 20(1) (2004) 71–101. · Zbl 1038.60086 · doi:10.1081/STM-120028392 [3] D. Anick, D. Mitra and M.M. Sondhi, Stochastic theory of a data handling system with multiple sources, Bell Syst. Tech. J. 61 (1982) 1871–1894. [4] E. Çinlar, Introduction to Stochastic Processes (Prentice Hall, Englewood Cliffs, New Jersey, 1975). · Zbl 0341.60019 [5] E.A. Coddington and N. Levinson, Theory of Ordinary Differential Equations (Mc-Graw Hill, New York, 1955). · Zbl 0064.33002 [6] B. Hajek, Birth-and-Death processes on the integers with phases and general boundaries, J. Appl. Prob. 19 (1982) 488–499. · Zbl 0502.60053 · doi:10.2307/3213508 [7] S. Halfin and W. Whitt, Heavy-traffic limits for queues with many exponential servers, Operations Research 29 (1981) 567–588. · Zbl 0455.60079 · doi:10.1287/opre.29.3.567 [8] G. Latouche and V. Ramaswami, Introduction to Matrix Analytic Methods in Stochastic Modeling (SIAM & ASA, Philadelphia, 1999). · Zbl 0922.60001 [9] M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models, An Algorithmic Approach (The Johns Hopkins University Press, Baltimore, MD, 1981). · Zbl 0469.60002 [10] B.F. Nielsen and V. Ramaswami, A computational framework for quasi birth and death processes with a continuous phase variable, in: Teletraffic Contributions for the Information Age: Proc. of the 15th International Teletraffic Congress, eds, V. Ramaswami and P.E. Wirth (Elsevier, 1997) pp. 477–486. [11] V. Ramaswami, Matrix analytic methods for stochastic fluid flows, in Teletraffic Engineering in a Competitive World–Proc. of the 16th International Teletraffic Congress, eds. D. Smith and P. Key (Elsevier, 1999) pp. 1019–1030. [12] A.V. Skorohod, Limit theorems for stochastic processes, Theor. of Probability Appl. 1 (1956) 261–290. (Republished also in Skorohod’s Ideas in Probability Theory, eds. V. Korolyuk, N. Portenko and H. Syta (Institute of Mathematics of the National Academy of Sciences of the Ukraine, Kyiv, Ukraine, 2000) pp. 23–52. · doi:10.1137/1101022 [13] A. da Silva Soares and G. Latouche, Matrix-analytic methods for fluid queues with finite buffers, Technical Report TR-509, Universite Libre de Bruxelles, Belgium, 2003. [14] R.L. Tweedie, Operator-geometric stationary distributions for Markov chains with application to queueing models, Adv. Appl. Prob. 14 (1982) 369–391. · Zbl 0484.60072 · doi:10.2307/1426527 [15] W. Whitt, Stochastic Process Limits–An Introduction to Stochastic-Process Limits and their Application to Queues (Springer, 2002). · Zbl 0993.60001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.