# zbMATH — the first resource for mathematics

Markov-renewal fluid queues. (English) Zbl 1063.60127
Summary: We consider a fluid queue controlled by a semi-Markov process and we apply the Markov-renewal approach developed earlier in the context of quasi-birth-and-death processes and of Markovian fluid queues. We analyze two subfamilies of semi-Markov processes. In the first family, we assume that the intervals during which the input rate is negative have an exponential distribution. In the second family, we take the complementary case and assume that the intervals during which the input rate is positive have an exponential distribution. We thoroughly characterize the structure of the stationary distribution in both cases.

##### MSC:
 60K15 Markov renewal processes, semi-Markov processes 60K37 Processes in random environments 60K25 Queueing theory (aspects of probability theory)
Full Text:
##### References:
 [1] Agrawal, R. Makowski, A. M. and Nain, P. (1999). On a reduced load equivalence for fluid queues under subexponentiality. Queueing Systems 33 , 5–41. · Zbl 0997.60114 · doi:10.1023/A:1019111809660 [2] Asmussen, S. (1995). Stationary distributions for fluid flow models with or without Brownian noise. Commun. Statist. Stoch. Models 11 , 21–49. · Zbl 0817.60086 · doi:10.1080/15326349508807330 [3] Boxma, O. J. and Dumas, V. (1998). Fluid queues with long-tailed activity period distributions. Comput. Commun. 21 , 1509–1529. [4] Da Silva Soares, A. and Latouche, G. (2002). Further results on the similarity between fluid queues and QBDs. In Matrix-Analytic Methods: Theory and Applications , eds G. Latouche and P. Taylor, World Scientific, River Edge, NJ, pp. 89–106. · Zbl 1162.90407 [5] Kulkarni, V. G. (1997). Fluid models for single buffer systems. In Frontiers in Queueing: Models and Applications in Science and Engineering , ed. J. H. Dshalalow, CRC Press, Boca Raton, FL, pp. 321–338. · Zbl 0871.60079 [6] Latouche, G. and Ramaswami, V. (1999). Introduction to Matrix Analytic Methods in Stochastic Modeling . SIAM, Philadelphia, PA. · Zbl 0922.60001 · doi:10.1137/1.9780898719734 [7] Miyazawa, M. and Takada, H. (2002). A matrix exponential form for hitting probabilities and its application to a Markov modulated fluid queue with downward jumps. J. Appl. Prob. 39 , 604–618. · Zbl 1037.60084 · doi:10.1239/jap/1034082131 [8] Ramaswami, V. (1996). Matrix analytic methods: a tutorial overview with some extensions and new results. In Matrix-Analytic Methods in Stochastic Models , eds S. R. Chakravarthy and A. S. Alfa, Marcel Dekker, New York, pp. 261–295. · Zbl 0872.60067 [9] Ramaswami, V. (1999). Matrix analytic methods for stochastic fluid flows. In Teletraffic Engineering in a Competitive World , eds D. Smith and P. Hey, Elsevier, Amsterdam, pp. 1019–1030. [10] Resnick, S. and Samorodnitsky, G. (2001). Steady-state distribution of the buffer content for M/G/$$\infty$$ input fluid queues. Bernoulli 7 , 191–210. · Zbl 0994.60085 · doi:10.2307/3318735 [11] Rogers, L. C. G. (1994). Fluid models in queueing theory and Wiener–Hopf factorization of Markov chains. Ann. Appl. Prob. 4 , 390–413. JSTOR: · Zbl 0806.60052 · doi:10.1214/aoap/1177005065 · links.jstor.org [12] Sengupta, B. (1989). Markov processes whose steady-state distribution is matrix-exponential with an application to the GI/G/1 queue. Adv. Appl. Prob. 21 , 159–180. · Zbl 0672.60090 · doi:10.2307/1427202 [13] Takada, H. (2001). Markov modulated fluid queues with batch fluid arrivals. J. Operat. Res. Soc. Japan 44 , 344–365. · Zbl 1027.90018 [14] Takine, T. and Hasegawa, T. (1994). The workload in the MAP/G/1 queue with state-dependent services: its application to a queue with preemptive resume priority. Commun. Statist. Stoch. Models 10 , 183–204. · Zbl 0791.60088 · doi:10.1080/15326349408807292
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.