Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
The discrete-time Geo/Geo/1 queue with negative customers and disasters
Computers and Operations Research
A Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times
Queueing Systems: Theory and Applications
A single-server G-queue in discrete-time with geometrical arrival and service process
Performance Evaluation
Accessible bibliography on retrial queues
Mathematical and Computer Modelling: An International Journal
An M/G/1 retrial queue with an unreliable server and general repair times
Performance Evaluation
The variant vacation policy Geo/G/1 queue with server breakdowns
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
A discrete-time Geo/G/1 retrial queue with starting failures and impatient customers
Transactions on computational science VII
An initiative for a classified bibliography on G-networks
Performance Evaluation
A discrete-time on-off source queueing system with negative customers
Computers and Industrial Engineering
Bibliography on G-networks, negative customers and applications
Mathematical and Computer Modelling: An International Journal
An M/Ek/1 queueing system with no damage service interruptions
Mathematical and Computer Modelling: An International Journal
M/M/1 retrial queue with working vacations and negative customer arrivals
International Journal of Advanced Intelligence Paradigms
An improved truncation technique to analyze a Geo/PH/1 retrial queue with impatient customers
Computers and Operations Research
Hi-index | 0.00 |
This paper treats a discrete-time single-server retrial queue with geometrical arrivals of both positive and negative customers in which the server is subject to breakdowns and repairs. Positive customers who find sever busy or down are obliged to leave the service area and join the retrial orbit. They request service again after some random time. If the server is found idle or busy, the arrival of a negative customer will break the server down and simultaneously kill the positive customer under service if any. But the negative customer has no effect on the system if the server is down. The failed server is sent to repair immediately and after repair it is assumed as good as new. We analyze the Markov chain underlying the queueing system and obtain its ergodicity condition. The generating functions of the number of customers in the orbit and in the system are also obtained along with the marginal distributions of the orbit size when the server is idle, busy or down. Finally, some numerical examples show the influence of the parameters on some crucial performance characteristics of the system.