Decomposition of general tandem queueing networks with MMPP input
Performance Evaluation
A Tandem Queue with Blocking and Markovian Arrival Process
Queueing Systems: Theory and Applications
A Two-Phase BMAP|G|1|N → PH|1|M – 1 System with Blocking
Automation and Remote Control
TWO QUEUES IN TANDEM WITH RETRIAL CUSTOMERS
Probability in the Engineering and Informational Sciences
The BMAP/G/1/N -- · /PH/1/M tandem queue with losses
Performance Evaluation
Performance of two-stage tandem queues with blocking: the impact of several flows of signals
Performance Evaluation
Queueing Systems: Theory and Applications
The BMAP/G/1--·/PH/1/M tandem queue with feedback and losses
Performance Evaluation
A matrix-geometric approximation for tandem queues with blocking and repeated attempts
Operations Research Letters
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
A new computational algorithm for retrial queues to cellular mobile systems with guard channels
Computers and Industrial Engineering
Help desk center operating model as a two-phase queueing system
Problems of Information Transmission
| Hi-index | 0.01 |
We consider a tandem queueing system with single-server first station and multi-server second station. The input flow at Station 1 is described by the BMAP (batch Markovian arrival process). Customers from this flow are considered as non-priority customers. Customers of an arriving group, which meet a busy server, go to the orbit of infinite size. From the orbit, they try their luck in exponentially distributed random time. Service times at Station 1 are independent identically distributed random variables having an arbitrary distribution. After service at Station 1 a non-priority customer proceeds to Station 2. The service time by a server of Station 2 is exponentially distributed. Besides customers proceeding from Station 1, an additional MAP flow of priority customers arrives at Station 2 directly, not entering Station 1. If a priority customer meets a free server upon arrival, it starts service immediately. Else, it leaves the system forever. It is assumed that a few servers of Station 2 are reserved to serve the priority customers only. We calculate the stationary distribution and the main performance measures of the system. The problem of optimal design is numerically investigated.