Computation of the quasi-stationary distributions in M(n)/GI/1/K and GI/M(n)/1/K queues
Queueing Systems: Theory and Applications
Computing steady state probabilities in &lgr;(n)/G/1/K queue
Performance Evaluation
Analysis of the MAP/Ga,b/1/N Queue
Queueing Systems: Theory and Applications
The Stationary Characteristics of the G/MSP/1/r Queueing System
Automation and Remote Control
Queues with Workload-Dependent Arrival and Service Rates
Queueing Systems: Theory and Applications
Complete analysis of finite and infinite buffer GI/MSP/ 1 queue-A computational approach
Operations Research Letters
| Hi-index | 0.98 |
We consider an infinite-buffer single-server queue with renewal input. The service to the queueing system is provided in batches of random size, according to a batch Markovian service process (BMSP). The queue length distribution of the number of customers in the system at pre-arrival and arbitrary epochs has been obtained along with some important performance measures, such as the mean number of customers in the system and the mean system sojourn time of a customer. Secondly, we study a similar queueing system with queue-length-dependent inter-arrival times and obtain the above-mentioned state probabilities and performance measures. These queueing models have potential applications in the areas of computer networks, telecommunication systems, manufacturing systems, etc.