Joint distribution of sojourn time and queue length in the M/G/1 queue with (in)finite capacity

DOI10.1016/0377-2217(84)90078-XMaRDI QIDQ787597zbMATH OpenOpenAlexFDO

Authors Onno Boxma

Publication date 1984

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(84)90078-x

zbMATH Keywords

joint distributioncycle time distributionresidual service timetwo- stage cyclic queue

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

• scientific article; zbMATH DE number 4043001 (Why is no real title available?)
• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• scientific article; zbMATH DE number 52512 (Why is no real title available?)
• Approximations in finite-capacity multi-server queues by Poisson arrivals
• Equilibrium properties of the M/G/1 queue
• Inequalities: theory of majorization and its applications
• On response time and cycle time distributions in a two-stage cyclic queue
• Properties of Probability Distributions with Monotone Hazard Rate
• Queuing Systems in Which the Discipline is “Last-Come, First-Served”
• Technical Note—The Expected Remaining Service Time in a Single Server Queue
• The Steady-State Queueing Time Distribution for the M/G/1 Finite Capacity Queue

Cited in

(9)

• The \(M_n/G_n/1\) queue with vacations and exhaustive service
• Social and monopoly optimization in observable queues
• Equilibrium joining probabilities for an M/G/1 queue
• The Conditional Distribution of the Residual Service Time in theM_n/G/1 Queue
• Exact results and bounds for the joint tail and moments of the recurrence times in a renewal process
• M/G/\(1\) queue with event-dependent arrival rates
• Conditional Ages and Residual Service Times in the M/G/1 Queue
• A queueing approach to a multi class $M / G / 1$ make-to-stock with backlog
• The cyclic queue and the tandem queue

This page was built for publication: Joint distribution of sojourn time and queue length in the M/G/1 queue with (in)finite capacity

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