Connection-wise end-to-end performance analysis of queuing networks with MMPP inputs
Performance Evaluation
Decomposition of general tandem queueing networks with MMPP input
Performance Evaluation
Departure Processes of BMAP/G/1 Queues
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
A Tandem Queue with Blocking and Markovian Arrival Process
Queueing Systems: Theory and Applications
Decomposition of general queueing networks with MMPP inputs and customer losses
Performance Evaluation
Departure Process of the MAP/SM/1 Queue
Queueing Systems: Theory and Applications
Modeling IP traffic using the batch Markovian arrival process
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Performance of two-stage tandem queues with blocking: the impact of several flows of signals
Performance Evaluation
The BMAP/G/1--·/PH/1/M tandem queue with feedback and losses
Performance Evaluation
A tandem retrial queueing system with two Markovian flows and reservation of channels
Computers and Operations Research
Tandem service system with batch Markov flow and repeated calls
Automation and Remote Control
A dual tandem queueing system with a finite intermediate buffer and cross traffic
Proceedings of the 5th International Conference on Queueing Theory and Network Applications
Priority tandem queueing model with admission control
Computers and Industrial Engineering
A two-phase GI/PH/1 → ·/PH/1/0 system with losses
Automation and Remote Control
Hi-index | 0.00 |
Tandem queues of the BMAP/G/1/N@?-@?/PH/1/M type are good models for different fragments of communication systems and networks, so their investigation is interesting for theory and applications. These queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. Exact analytic analysis of this kind of queues for the cases of infinite and finite input buffers is implemented. Possible correlation and group arrivals are taken into account by means of considering the Batch Markovian Arrival Process (BMAP) as input stream to the system. The Markov chain embedded at service completion epochs at the first service stage and the process of system states at arbitrary time are investigated. Loss probabilities at the first and second stages are calculated. Numerical results are presented to demonstrate the feasibility of the presented algorithms and describe the performance of the queueing model under study. The necessity of taking the input correlation into account is illustrated.