On the stationary LCFS-PR single-server queue: a characterization via stochastic intensity

DOI10.3934/NACO.2011.1.713MaRDI QIDQ429007zbMATH OpenOpenAlexFDO

Authors Naoto Miyoshi

Publication date 25 June 2012

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/naco.2011.1.713

zbMATH Keywords

queueing theorydistribution at arrival and arbitrary time instancesLCFS-PR single-server queuesPalm calculusqueue sizestochastic intensity, remaining service time

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Stationary stochastic processes (60G10) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• On the stationary workload distribution of work-conserving single-server queues: A general formula via stochastic intensity
• Note on the GI/GI/1 queue with LCFS-PR observed at arbitrary times
• Note on batch arrival LCFS and related symmetric queues
• Invariance relations in single server queues with LCFS service discipline
• ON THE MAP/G/1 QUEUE WITH LEBESGUE-DOMINATED SERVICE TIME DISTRIBUTION AND LCFS PREEMPTIVE REPEAT SERVICE DISCIPLINE

Cited in

(3)

• On the stationary workload distribution of work-conserving single-server queues: A general formula via stochastic intensity
• Matrix Product-Form Solutions for LCFs Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams
• ON THE MAP/G/1 QUEUE WITH LEBESGUE-DOMINATED SERVICE TIME DISTRIBUTION AND LCFS PREEMPTIVE REPEAT SERVICE DISCIPLINE

This page was built for publication: On the stationary LCFS-PR single-server queue: a characterization via stochastic intensity

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