Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
Stability of the random neural network model
Neural Computation
G-networks with multiple classes of negative and positive customers
Theoretical Computer Science
M/M/1 queues with working vacations (M/M/1/WV)
Performance Evaluation
Performance Evaluation
Role of oxidizer in the chemical mechanical planarization of the Ti/TiN barrier layer
Microelectronic Engineering
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Finite-source M/M/S retrial queue with search for balking and impatient customers from the orbit
Computer Networks: The International Journal of Computer and Telecommunications Networking
A discrete-time retrial queue with negative customers and unreliable server
Computers and Industrial Engineering
M/M/1 retrial queue with working vacations
Acta Informatica
Analysis and Synthesis of Computer Systems: Texts)
Analysis and Synthesis of Computer Systems: Texts)
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
Modeling wireless sensor networks using finite-source retrial queues with unreliable orbit
PERFORM'10 Proceedings of the 2010 IFIP WG 6.3/7.3 international conference on Performance Evaluation of Computer and Communication Systems: milestones and future challenges
Stochastic decompositions in the M/M/1 queue with working vacations
Operations Research Letters
Hi-index | 0.00 |
The M/M/1 retrial queue with working vacations and negative customers is introduced. The arrival processes of positive customers and negative customers are Poisson. Upon the arrival of a positive customer, if the server is busy the customer would enter an orbit of infinite size and the orbital customers send their requests for service with a constant retrial rate. The single server takes an exponential working vacation once customers being served depart from the system and no customers are in the orbit. Arriving negative customers kill a batch of the positive customers waiting in the orbit randomly. Efficient methodology to compute the stationary distribution for this new queue is developed and presented.