A two-phase BMAP|G|1|N → PH|1|M - 1 system with blocking

Automation and Remote Control

Volumn 65, Issue 1, 2004, Pages 104-115

  Breuer, D ^a   Dudin, A N ^b   Klimenok, V I ^b   Tsarenkov, G V ^b  

^a University of Tier   (Germany)

^b BELARUSIAN STATE UNIVERSITY   (Belarus)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES; MATHEMATICAL MODELS; OPTICAL CORRELATION; POISSON DISTRIBUTION; QUEUEING THEORY; STOCHASTIC CONTROL SYSTEMS;

INTER-NODE CUSTOMER FLOWS; PHASE-TYPE DISTRIBUTION; POISSON FLOWS; QUEUEING SYSTEMS;

QUEUEING NETWORKS;

EID: 84904240091     PISSN: 00051179     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:AURC.0000011694.78809.a0     Document Type: Article

References (27)

1. Gnedenko, B.W. and Konig, D., Handbuch der Bedienungstheorie, Berlin: Academie Verlag, 1983.
2. Basharin, G.P., Bocharov, P.P., and Kogan, Ya.A., Analiz ocheredei v vychislitel'nykh setyakh. Teoriya i metody rascheta (Analysis of Queues in Computing Networks. Theory and Computation Methods), Moscow: Nauka, 1989.
3. Zhozhikashvili, V.A. and Vishnevskii, V.M., Seti massovogo obsluzhivaniya. Teoriya i primenenie k setyam EVM (Queueing Networks. Theory and Application to Computing Networks), Moscow: Radio i Svyaz', 1988.
4. Balsamo, S., Persone, V.D.N., and Inverardi, P., A Review on Queueing Network Models with Finite Capacity Queues for Software Architectures Performance Prediction, Perform. Eval., 2003, vol. 51, pp. 269-288.
5. Lucantoni, D.M., New Results on the Single-Server Queue with a Batch Markovian Arrival Process, Commun. Statist. Stochastic Models, 1991, vol. 7, pp. 1-46.
6. Neuts, M., Structured Stochastic Matrices of M/G/1 Type and Their Applications, New York: Marcel Dekker, 1989.
7. Ferng, H.W. and Chang, J.F., Departure Processes of BMAP|G|1 Queues, Queueing Syst., 2001, vol. 39, pp. 109-135.
8. Ferng, H.W. and Chang, J.F., Connection-wise End-to-End Performance Analysis of Queueing Networks with MMPP Inputs, Perform. Eval., 2001, vol. 43, pp. 39-62.
9. Heindl, A., Decomposition of General Tandem Networks with MMPP Input, Perform. Eval., 2001, vol. 44, pp. 5-23.
10. Heindl, A., Decomposition of General Queue Networks with MMPP Inputs and Customer Losses, Perform. Eval., 2003, vol. 51, pp. 117-136.
11. Kang, S.H., Kim, Y.H., Jung, D.K., and Choi, B.D., An Application of Markovian Arrival Process (MAP) to Modeling Superposed ATM Cell Streams, IEEE Trans. Commun., 2002, vol. 50, pp. 633-642.
12. Gomez-Corral, A., A Tandem Queue with Blocking and Markovian Arrival Process, Queueing Syst., 2002, vol. 41, pp. 343-370.
13. Gomez-Corral, A., On a Tandem G-Network with Blocking, Adv. Appl. Probab., 2002, vol. 34, no. 3, pp. 626-661.
14. Dudin, A.N. and Klimenok, V.I., Sistemy massovogo obsluzhivaniya s korrelirovannymi potokami (Queue Systems with Correlated flows), Minsk: Belarus. Gos. Univ., 2000.
15. Dudin, A.N. and Klimenok, V.I., Multidimensional Quasi-Toeplitz Markov Chains, J. Appl. Math. Stochast. Anal., 1999, vol. 12, no. 4, pp. 339-415.
16. Bocharov, P.P. and Pechinkin, A.V., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Ross. Univ. Druzhby Narodov, 1995.
17. Neuts, M.F., Matrix-Geometric Solutions in Stochastic Models, Baltimore: Johns Hopkins Univ. Press, 1981.
18. Neuts, M.F., A Versatile Markovian Point Process, J. Appl. Prob., 1979, vol. 16, pp. 764-770.
19. Chakravarthy, S.R., The Batch Markovian Arrival Process: A Review and Future Work, in Adv. Probab. Theory and Stochastic Process, Krishnamoorthy, A., et al., Eds., New Jersey: Notable Publications, 2000, pp. 21-49.
20. Bocharov, P.P., Pechinkin, A.V., and Phong, N.H., The Stationary State Probability Distribution of the MAP|G|1|r System with Retrials and Priority Service for Primary Customers, Avtom. Telemekh., 2000, no. 8, pp. 68-78.
21. Bocharov, P.P., Thirau, K., and Phong, N.H., Analysis of a Finite Queue with Markov Flow and Arbitrary Service Dependent on the Number of Customers in the System, Avtom. Telemekh., 1998, no. 10, pp. 64-75.
22. 2|1|r Queueing System with Absolute Priority, Avtom. Telemekh., 1997, no. 11, pp. 102-117.
23. Pechinkin, A.V., The Stationary State Probabilities of a System with Markov Input Flow, Relative Priority, and Separate Queues, Avtom. Telemekh., 1998, no. 1, pp. 107-119.
24. Pechinkin, A.V., A MAP|G|1∞ System with SRPT Discipline, Tear. Veroyatn. Primenen., 2000, no. 3, pp. 589-595.
25. Pechinkin, A.V., A Queueing System with Markov Input Flow and Random Selection of Customers from the Queue for Service, Avtom. Telemekh., 2000, no. 9, pp. 90-96.
26. Dudin, A.N., Klimenok, V.I, and Tsarenkov, G.V., Characteristics of a Single-Server Queueing System with Batch Markov Flow, Semi-Markovian Service, and Finite Buffer, Avtom. Telemekh., 2002, no. 8, pp. 87-101.
27. Cinlar, B., Introduction to Stochastic Processes, New Jersey: Prentice Hall, 1975.