An LCFS finite buffer model with finite source batch input

DOI10.2307/3214042MaRDI QIDQ3825899zbMATH OpenOpenAlexFDO

Authors Nico M. van Dijk

Publication date 1989

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

Full work available at URL https://research.vu.nl/en/publications/24cf552e-2ee7-4099-99db-0f89768a56d9

zbMATH Keywords

batch arrivalslast-come first-served disciplinenormalizing constantsteady-state queue length distribution

Mathematics Subject Classification ID

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

Recommendations

• A LCFS finite buffer model with batch input and non-exponential services
• Note on batch arrival LCFS and related symmetric queues
• scientific article; zbMATH DE number 5925017
• A queueing model of finite and infinite source interaction
• A non-exponential queueing system with independent arrivals and batch servicing

Cited in

(5)

• Exact solution of a simple finite infinite source interaction model
• Blocking of finite source inputs which require simultaneous servers with general think and holding times
• The BCD queue and its ramifications
• Note on batch arrival LCFS and related symmetric queues
• A LCFS finite buffer model with batch input and non-exponential services

This page was built for publication: An LCFS finite buffer model with finite source batch input

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