Note on the GI/GI/1 queue with LCFS-PR observed at arbitrary times

DOI10.1017/S0269964801152034MaRDI QIDQ2731304zbMATH OpenOpenAlexFDO

Authors Rudesindo Núñez-Queija

Publication date 25 March 2002

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

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

zbMATH Keywords

arbitrary time point distributionGI/GI/1 queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

The present paper deals with the steady-state distribution of queue length and residual service times at arbitrary times in the \(GI/GI/1\) queue with Last-Come-First-Served Preemptive-Resume (LCFS-PR) discipline. In the standard treatment in queueing literature, these distributions have been given either via the stationary distributions at arrival and departure epochs or by the help of balance equations. The author's arguments apply directly to the system in continuous time, thus explaining the geometric nature of the queue length distribution as well as the fact that the remaining service times are indpendent and all but one are identically distributed. The proposed analysis can be extended to the case where the requests arrive in geometrically distributed batch sizes. Another possible extension is to the batch service with generally distributed batch sizes.

Recommendations

• scientific article; zbMATH DE number 522744
• scientific article; zbMATH DE number 4060489
• A large-deviations analysis of the GI/GI/1 SRPT queue
• Approximations for the GI/G/c queue
• Perturbation analysis of the \(GI/GI/1\) queue
• The queue-length in GI/G/s queues
• Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation
• \( GI / G / 1\) lakatos-type queueing system with \(T\)-retrials
• On a GI/M/c Queue with Bounded Waiting Times

Cited in

(17)

• Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline
• Note on batch arrival LCFS and related symmetric queues
• The equivalence between processor sharing and service in random order.
• A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues
• A rate balance principle and its application to queueing models
• Scaling limit of a limit order book model via the regenerative characterization of Lévy trees
• Invariance relations in single server queues with LCFS service discipline
• Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation
• On the single-server queue with the preemptive-resume last-come–first-served queue discipline
• INVARIANCE RELATIONS OF GI/G/1 QUEUEING SYSTEMS WITH PREEMPTIVE-RESUME LAST-COME-FIRST-SERVED QUEUE DISCIPLINE
• The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline
• scientific article; zbMATH DE number 4060489 (Why is no real title available?)
• On the system queue length distributions of LCFS-P queues with arbitrary acceptance and restarting policies
• On the stationary LCFS-PR single-server queue: a characterization via stochastic intensity
• Time-dependent properties of symmetric queues
• The age of the arrival process in the G/M/1 and M/G/1 queues
• The G/M/1 queue revisited

This page was built for publication: Note on the GI/GI/1 queue with LCFS-PR observed at arbitrary times

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