Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline
We give a detailed sample-average analysis of GI/G/1 queues with the preemptive-resume LIFO (last-in-first-out) queue discipline: we study the long-run ``state behavior of the system by averaging over arrival epochs, departure epochs, as well as time, and obtain relations that express the resulting averages in terms of basic characteristics within busy cycles. These relations, together with the fact that the preemptive- resume LIFO queue discipline is work-conserving, imply new representations for both ``actual and ``virtual delays in standard GI/G/1 queues with the FIFO (first-in-first-out) queue discipline. The arguments by which our results are obtained unveil the underlying structural ``explanations for many classical and somewhat mysterious results relating to queue lengths and/or delays in standard GI/G/1 queues, including the well-known Beneš's formula for the delay distribution in M/G/1. We also discuss how to extend our results to settings more general then GI/G/1.
- Stationary workload and service times for some nonwork-conserving M/G/1 preemptive LIFO queues
- Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO
- Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation
- On the behavior of LIFO preemptive resume queues in heavy traffic
- Note on the GI/GI/1 queue with LCFS-PR observed at arbitrary times
- A new proof of finite moment conditions for GI/G/1 busy periods
- Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO
- scientific article; zbMATH DE number 3740516 (Why is no real title available?)
- scientific article; zbMATH DE number 3764811 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 3211251 (Why is no real title available?)
- scientific article; zbMATH DE number 3313523 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- Inequalities between Arrival Averages and Time Averages in Stochastic Processes Arising from Queueing Theory
- ON G/G/1 QUEUES WITH LIFO-P SERVICE DISCIPLINE
- On Queues with Poisson Arrivals
- On the relation between customer and time averages in queues
- On the single-server queue with the preemptive-resume last-come–first-served queue discipline
- On the virtual and actual waiting time distributions of a GI/G/1 queue
- On up- and downcrossings
- Poisson Arrivals See Time Averages
- Technical Note—A Last Word on L = λW
- The departure process from a queueing system
- The GI/G/1 queue with last-come-first-served
- The Relation between Customer and Time Averages in Queues
- The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline
- Duality relations for certain single server queues
- Note on batch arrival LCFS and related symmetric queues
- On preemptive-repeat LIFO queues
- On the behavior of LIFO preemptive resume queues in heavy traffic
- A duality relation for busy cycles in GI/G/1 queues
- Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation
- The Waiting-Time Distribution for the GI/G/1 Queue under the D-Policy
- Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO
- ON G/G/1 QUEUES WITH LIFO-P SERVICE DISCIPLINE
- Stationary workload and service times for some nonwork-conserving M/G/1 preemptive LIFO queues
- A Note on Negative Customers, GI/G/1 Workload, and Risk Processes
This page was built for publication: Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107224)
