Workload and busy period for M/GI/1 with a general impatience mechanism

DOI10.1007/S11134-013-9373-7MaRDI QIDQ386348zbMATH OpenOpenAlexFDO

Authors Andreas Brandt, Manfred Brandt

Publication date 9 December 2013

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11134-013-9373-7

zbMATH Keywords

\(\mathrm{M}/\mathrm{GI}/1 + \mathrm{GI}\)\(\mathrm{M}/\mathrm{GI}/1 + \mathrm{PH}\)busy periodfirst come first serve policyimpatient customersphase-type distributionssteady state analysiswaiting time dependent serviceworkload

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Review text

An \(\mathrm{M}/\mathrm{GI}/1\) system under FCFS with impatient customers is investigated, where the behaviour of the customers is rather unrestricted with respect to their decision to stay-on or to leave the system premature to the regular end of service. Customers may leave after a maximal waiting time which is generally distributed, or even during the service where the maximal service time is generally distributed, and this distribution may depend on the experienced waiting time. This general impatient mechanism covers many special (partly: classical) cases evaluated in previous research, as the authors point out. The investigation is focused on the workload process and busy period distributions under ergodicity and in stationary state. The main result is an explicit expression of the density of the two-dimensional (workload, busy period) process in terms of von Neumann series. Some special cases are evaluated.

Recommendations

• The busy period of the M/GI/\(\infty\) queue
• The Busy Period of an M/G/1 Queue with Customer Impatience
• On the exact asymptotics of the busy period in GI/G/1 queues
• The stationary workload of the G/M/1 queue with impatient customers
• scientific article; zbMATH DE number 3868391
• On the Busy Period of an M/G/1/K Queue
• Busy period analysis for the n-policy GI/M/c queue
• scientific article; zbMATH DE number 994723
• Excursions of the workload process in \(G/GI/1\) queues

Cites work

• Busy periods of Poisson arrival queues with loss
• Characterization of phase-type distributions
• Control limit policies in a replacement model with additive phase-type distributed damage and linear restoration
• General customer impatience in the queue GI/G/1
• scientific article; zbMATH DE number 4013703 (Why is no real title available?)
• Queues with waiting time dependent service
• Queuing with balking and reneging in \(M/G/1\) systems
• Reneging Phenomena in Single Channel Queues
• Single-server queues with impatient customers
• Some Queuing Problems with Restrictions
• The \(M/G/1+G\) queue revisited
• The Busy Period of an M/G/1 Queue with Customer Impatience

Cited in

(7)

• Server assignment policies in queues with customer abandonments
• Customers' abandonment strategy in an \(M / G / 1\) queue
• On first-come, first-served queues with two classes of impatient customers
• Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue
• A computational algorithm for the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{PH}\) queue
• Comparison results for \(M/G/1\) queues with waiting and sojourn time deadlines
• Analysis of \(M^{ X}/ G/1\) queues with impatient customers

This page was built for publication: Workload and busy period for \(\mathrm{M}/\mathrm{GI}/1\) with a general impatience mechanism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386348)