The M/G/1+G queue revisited

Authors:
Onno Boxma;David Perry;Wolfgang Stadje
Affiliations:
EURANDOM and Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB;Department of Statistics, University of Haifa, Haifa, Israel 31909;Department of Mathematics and Computer Science, University of Osnabrück, Osnabrück, Germany 49069
Venue:
Queueing Systems: Theory and Applications
Year:
2011

Citing 2
Cited 3

The Virtual Waiting Time of the M/G/1 Queue with Impatient Customers

Queueing Systems: Theory and Applications
Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility

Operations Research Letters

Loss ratio of the EDF scheduling policy with early discarding technique

Information Processing Letters
Workload and busy period for $$M/GI/1$$M/GI/1 with a general impatience mechanism

Queueing Systems: Theory and Applications
Analysis of an $$M/M/1+G$$M/M/1+G queue operated under the FCFS policy with exact admission control

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balks or reneges when its virtual waiting time, i.e., the amount of work seen upon arrival, is larger than a certain random patience time. We consider the number of customers in the system, the maximum workload during a busy period, and the length of a busy period. We also briefly treat the analogous model in which any customer enters the system and leaves at the end of his patience time or at the end of his virtual sojourn time, whichever occurs first.