Abstract
We consider the MAP/PH/N queueing system with propagated breakdowns. Breakdowns arrive in bunches (we call them attacks) according to the MAP. The process of further arrival of different types of server failures within an attack is governed by phase type Markov process. Recovering of the server takes an exponentially distributed time with intensity depending on the type of the occurred failure. We describe the behavior of the system by the multi-dimensional continuous time Markov chain and analyze conditions for existence of its stationary behavior and compute its stationary distribution. Waiting time distribution and the key performance measures of the system are computed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chakravarthy, S.: The batch Markovian arrival process: A review and future work. In: Krishnamoorthy, A., et al. (eds.) Advances in Probability Theory and Stochastic Processes, pp. 21–49. Notable Publications, New Jersey (2001)
Heegaard, P.E., Trivedi, K.S.: Network survivability modeling. Computer Networks 53, 1215–1234 (2009)
Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood, Cichester (1981)
Kasten, H., Runnenburg, J.T.: Priority in waiting line problems. Mathematisch Centrum, Amsterdam, Holland (December 1956)
Klimenok, V.I., Orlovsky, D.S., Kim, C.S.: The BMAP/PH/N retrial queue with Markovian flow of breakdowns. European Journal of Operational Research 189(3), 1057–1072 (2008)
Latouche, G., Ramaswami, V.: Introduction to matrix methods in stochastic modeling. SIAM, Philadelphia (1999)
Lucantoni, D.: New results on the single server queue with a batch Markovian arrival process. Commun. Statist.-Stochastic Models 7, 1–46 (1991)
Neuts, M.: Structured stochastic matrices of M/G/1 type and their applications. Marcel Dekker, New York (1989)
van Danzig, D.: Chaines de Markof dans les ensembles abstraits et applications aux processus avec regions absorbantes et au probleme des boucles. Ann. de l’Inst. H. Poincare 14(fasc. 3), 145–199 (1955)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Al-Begain, K., Dudin, A., Klimenok, V. (2010). Queueing System MAP/PH/N with Propagated Failures. In: Al-Begain, K., Fiems, D., Knottenbelt, W.J. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2010. Lecture Notes in Computer Science, vol 6148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13568-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-13568-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13567-5
Online ISBN: 978-3-642-13568-2
eBook Packages: Computer ScienceComputer Science (R0)