Comparison results for M/G/1 queues with waiting and sojourn time deadlines

DOI10.1017/JPR.2019.25zbMath1415.60110OpenAlexW2964381140MaRDI QIDQ5226255

Inoue Yoshiaki

Publication date: 31 July 2019

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jpr.2019.25

zbMATH Keywords

\(M/G/1\) queuestochastic orderimpatient customervirtual waiting timeloss probability

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Workload and busy period for \(\mathrm{M}/\mathrm{GI}/1\) with a general impatience mechanism
• The \(M/G/1+G\) queue revisited
• Queues with workload-dependent arrival and service rates
• Delay distribution of (im)patient customers in a discrete time D-MAP/PH/1 queue with age-dependent service times
• The $M/D/1+D$ queue has the minimum loss probability among $M/G/1+G$ queues
• Rejection rules in the \(M/G/1\) queue
• On the probability of abandonment in queues with limited sojourn and waiting times
• Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue
• Single-server queues with impatient customers
• Work-modulated queues with applications to storage processes
• On up- and downcrossings
• Level Crossings in Point Processes Applied to Queues: Single-Server Case
• Reneging Phenomena in Single Channel Queues
• Some Queuing Problems with Restrictions
• Two Variability Orders
• General customer impatience in the queue GI/G/1
• Response Time Distribution in a D-MAP/PH/1 Queue with General Customer Impatience

This page was built for publication: Comparison results for M/G/1 queues with waiting and sojourn time deadlines