Abstract
Tandem queues are good mathematical models for description of information transmission in various communication systems and networks. These queues play also an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, their investigation is interesting for theory and applications. In this paper, we consider tandem queue suitable for modeling the systems and networks where information flows are correlated and bursty what is typical for many modern telecommunication networks. Possible correlation of customers inter-arrival times and batch arrivals are taken into account via of consideration of the Batch Markovian Arrival Process (BMAP) as input stream to the system. The system consists of two stations. The service time at the station 1 is assumed to be generally distributed. There is no buffer at this station, and customers who meet the busy server repeat attempts to enter the system in random time intervals. The service process at the station 2 is assumed to be described by the continuous time Markov chain with a finite state space. This assumption holds good, e.g., if the station 2 has a finite buffer, consists of a finite number of identical or heterogeneous servers where the service time distribution is assumed to be of PH (PHase) type. Markov chain embedded at service completion epochs at the station 1 and the process of system states at arbitrary time are under study. Ergodicity condition and algorithms for computing the steady state probabilities are presented.
This is a preview of subscription content, log in via an institution to check access.
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
Balsamo, S., Persone, V.D.N., Inverardi, P.: A review on queueing network models with finite capacity queues for software architectures performance prediction. Performance Evaluation 51, 269–288 (2003)
Gnedenko, B.W., Konig, D.: Handbuch der Bedienungstheorie. Akademie Verlag, Berlin (1983)
Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44, 510–525 (1996)
Perros, H.G.: A bibliography of papers on queueing networks with finite capacity queues. Performance Evaluation 10, 255–260 (1989)
Heindl, A.: Decomposition of general queue networks with MMPP inputs and customer losses. Performance Evaluation 1, 117–136 (2003)
Klemm, A., Lindermann, C., Lohmann, M.: Modelling IP traffic using the batch Markovian arrival process. Performance Evaluation 54, 149–173 (2003)
Neuts, M.F.: A versatile Markovian point process. Journal of Applied Probability 16, 764–779 (1979)
Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Communications in Statistics – Stochastic Models 7, 1–46 (1991)
Breuer, L., Dudin, A.N., Klimenok, V.I., Tsarenkov, G.V.: A two-phase BMAP/G/1/N → PH/1/M − 1 system with blocking. Automation and Remote Control 65, 117–130 (2004)
Dudin, A.N., Kim, C.S., Klimenok, V.I., Taramin, O.S.: A dual tandem queueing system with a finite intermediate buffer and cross traffic. In: Proceedings of the 5th international Conference “Queueing Theory and Network Applications”, pp. 93–100 (2010)
Gomez-Corral, A.: A tandem queue with blocking and Markovian arrival process. Queueing Systems 41, 343–370 (2002)
Gomez-Corral, A.: On a tandem G-network with blocking. Advances in Applied Probability 34(3), 626–661 (2002)
Gomez-Corral, A.: A matrix-geometric approximations for tandem queues with blocking and repeated attempts. Operations Research Letters 30, 360–374 (2002)
Heindl, A.: Decomposition of general tandem networks with MMPP input. Performance Evaluation 44, 5–23 (2001)
Kim, C.S., Dudin, A.N., Klimenok, V.I., Taramin, O.S.: A tandem BMAP/G/1 → M/N/0 queue with group occupation of servers at the second station. Mathematical Problems in Engineering ID 324604 (2012), doi:10.1155/2012/324604
Kim, C.S., Dudin, S.: Priority Tandem Queueing Model with Admission Control. Computers and Industrial Engineering 60, 131–140 (2011)
Kim, C.S., Klimenok, V.I., Tsarenkov, G.V., Breuer, L., Dudin, A.N.: The BMAP/G/1 → PH/1/M tandem queue with feedback and losses. Performance Evaluation 64, 802–818 (2007)
Klimenok, V.I., Breuer, L., Tsarenkov, G.V., Dudin, A.N.: The BMAP/G/1/N → PH/1/M − 1 tandem queue with losses. Performance Evaluation 61, 17–60 (2005)
Lian, Z., Liu, L.: A tandem network with MAP inputs. Operations Research Letters 36, 189–195 (2008)
Dudin, A.N., Klimenok, V.I.: Queueing system BMAP/G/1 with repeated calls. Mathematical and Computer Modelling 34, 115–128 (1999)
Dudin, A.N., Klimenok, V.I.: A retrial BMAP/SM/1 system with linear repeated requests. Queueing Systems 34, 47–66 (2000)
Kim, C.S., Klimenok, V.I., Taramin, O.S.: A tandem retrial queueing system with two Markovian flows and reservation of channels. Computers and Operations Research 37(7), 1238–1246 (2010)
Kim, C.S., Park, S.H., Dudin, A., Klimenok, V., Tsarenkov, G.: Investigaton of the \(BMAP/G/1\to \dot/PH/1/M\) tandem queue with retrials and losses. Applied Mathematical Modelling 34, 2926–2940 (2010)
Klimenok, V.I., Taramin, O.S.: Tandem service system with batch Markov flow and repeated calls. Automation and Remote Control 71, 1–13 (2010)
Chakravarthy, S.R.: 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, NJ (2001)
Klimenok, V.I., Dudin, A.N.: Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Systems 54, 245–259 (2006)
Kemeni, J., Shell, J., Knapp, A.: Denumerable Markov Chains. Van Nostrand, New York (1966)
Cinlar, E.: Introduction to stochastic processes. Prentice-Hall, NJ (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, C., Dudin, A., Klimenok, V. (2012). Tandem Retrial Queueing System with Correlated Arrival Flow and Operation of the Second Station Described by a Markov Chain. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2012. Communications in Computer and Information Science, vol 291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31217-5_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-31217-5_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31216-8
Online ISBN: 978-3-642-31217-5
eBook Packages: Computer ScienceComputer Science (R0)