An M/G/1 queue with multiple types of feedback, gated vacations and FCFS policy

Authors:
Bong Dae Choi;Bara Kim;Sung Ho Choi
Affiliations:
Department of Mathematics, Telecommunication Mathematics Research Center, Korea University, 1, Anam-dong, Sungbuk-ku, Seoul, 136-701, South Korea;Department of Mathematics, Telecommunication Mathematics Research Center, Korea University, 1, Anam-dong, Sungbuk-ku, Seoul, 136-701, South Korea;Samsung Electronics CO. LTD., Samsung Plaza Bldg., Bundang-gu, Sungnam-si, Kyungki-do 463-050, South Korea
Venue:
Computers and Operations Research
Year:
2003

Citing 5
Cited 3

Flow time distributions in a K class M/G/1 priority feedback queue

Queueing Systems: Theory and Applications
The M/GI/1 Bernoulli feedback queue with vacations

Queueing Systems: Theory and Applications
Priority Queues with Feedback

Journal of the ACM (JACM)
On the M/G/1 Bernoulli feedback queue with multi-class customers

Computers and Operations Research
A solution to mean delay in the ΣMc/Gck/1 cyclic priority queue with cycle (k) and class ( c) dependent feedback and service times

Operations Research Letters

A discrete-time retrial queueing system with starting failures, Bernoulli feedback and general retrial times

Computers and Industrial Engineering
A discrete-time single-server queueing system with an N-policy, an early setup and a generalization of the Bernoulli feedback

Mathematical and Computer Modelling: An International Journal
Discrete-time Geo1,GeoX2/G1,G2/1 retrial queue with two classes of customers and feedback

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider an M/G/1 queueing system with multiple types of feedback, gated vacations and FCFS policy where the first service of a new customer is either successful (and then the customer leaves the system) or unsuccessful (and then the customer joins to the end of the queue for another service as old customer with different Bernoulli feedback parameter and different service distribution), and customers are served in the order of joining the tail of the queue. By applying a new method developed by authors (Queueing system with fixed feedback policy, J. Aust. Math. Soc. B, to appear, Comput. Oper. Res. 27 (2000) 269) we obtain joint probability generating function of system sizes of new and old customers at steady state and Laplace Stieltjes transform of total response time. We also give algorithms for calculation of moments of system size and total response time.