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

DOI10.1007/S11134-013-9373-7zbMATH Open1304.60103OpenAlexW2111304714MaRDI QIDQ386348FDOQ386348

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

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

zbMATH Keywords

busy periodimpatient customersphase-type distributionsworkload\(\mathrm{M}/\mathrm{GI}/1 + \mathrm{GI}\)\(\mathrm{M}/\mathrm{GI}/1 + \mathrm{PH}\)first come first serve policysteady state analysiswaiting time dependent service

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

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

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)