Introduction to queueing networks
Introduction to queueing networks
Numerical investigation of a multiserver retrial model
Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
A retrial BMAP/SM/1 system with linear repeated requests
Queueing Systems: Theory and Applications
Averaging methods for transient regimes in overloading retrial queueing systems
Mathematical and Computer Modelling: An International Journal
Diffusion Approximation in Overloaded Switching Queueing Models
Queueing Systems: Theory and Applications
A MAP/G/1 Queue with Negative Customers
Queueing Systems: Theory and Applications
Monotonicity properties in various retrial queues and their applications
Queueing Systems: Theory and Applications
Multi-server retrial queue with negative customers and disasters
Queueing Systems: Theory and Applications
An initiative for a classified bibliography on G-networks
Performance Evaluation
Network performance engineering
Study of multi server retrial queueing system under vacation policies by direct truncation method
Proceedings of the 6th International Conference on Queueing Theory and Network Applications
A multi-server perishable inventory system with negative customer
Computers and Industrial Engineering
Phase-type models for cellular networks supporting voice, video and data traffic
Mathematical and Computer Modelling: An International Journal
Bibliography on G-networks, negative customers and applications
Mathematical and Computer Modelling: An International Journal
A finite source multi-server inventory system with service facility
Computers and Industrial Engineering
| Hi-index | 0.00 |
Negative arrivals are used as a control mechanism in many telecommunication and computer networks. In the paper we analyze multiserver retrial queues; i.e., any customer finding all servers busy upon arrival must leave the service area and re-apply for service after some random time. The control mechanism is such that, whenever the service facility is full occupied, an exponential timer is activated. If the timer expires and the service facility remains full, then a random batch of customers, which are stored at the retrial pool, are automatically removed. This model extends the existing literature, which only deals with a single server case and individual removals. Two different approaches are considered. For the stable case, the matrix–analytic formalism is used to study the joint distribution of the service facility and the retrial pool. The approximation by more simple infinite retrial model is also proved. In the overloading case we study the transient behaviour of the trajectory of the suitably normalized retrial queue and the long-run behaviour of the number of busy servers. The method of investigation in this case is based on the averaging principle for switching processes.