Closed-form formulae for moment, tail probability, and blocking probability of waiting time in a buffer-sharing deterministic system

DOI10.1016/J.ORL.2017.06.004zbMath1409.90070OpenAlexW2731079719MaRDI QIDQ1728292

Daegyu Yang, Dong-Won Seo

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.06.004

zbMATH Keywords

tail probabilitytandem queuemax-plus algebrablocking probabilityhigher momentscomplete buffer-sharing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• An approximate analysis of open tandem queueing networks with blocking and general service times
• Approximate analysis for queueing networks with finite capacity and customer loss
• Explicit expressions for moments of waiting times in Poisson driven deterministic two-node tandem queues with blocking
• Taylor series expansions for Poisson-driven (max,+)-linear systems
• Analytical solution of finite capacity M/D/1 queues
• Expansions for steady-state characteristics of (max, +)-linear systems
• An Approximation Method for Blocking Probabilities in M/D/1/K₁→ ⋅/D/1/K₂Queues
• Tail probability of transient and stationary waiting times in (max,+)-linear systems
• Laplace transform and moments of waiting times in Poisson driven (max,+) linear systems

This page was built for publication: Closed-form formulae for moment, tail probability, and blocking probability of waiting time in a buffer-sharing deterministic system