ON TIME-TO-BUFFER OVERFLOW DISTRIBUTION IN A SINGLE-MACHINE DISCRETE-TIME SYSTEM WITH FINITE CAPACITY

DOI10.3846/mma.2020.10433zbMath1485.60084OpenAlexW3011372746MaRDI QIDQ5016248

Wojciech M. Kempa

Publication date: 13 December 2021

Published in: Mathematical Modelling and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3846/mma.2020.10433

zbMATH Keywords

queueing modelgeometric distributiontransient analysisproduction linebuffer overflow

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cites Work

• Unnamed Item
• Unnamed Item
• Busy period analysis of the level dependent \(PH/PH/1/K\) queue
• First-passage-time and busy-period distributions of discrete-time Markovian queues: \(\text{Geom}(n)/\text{Geom}(n)/1/N\)
• Exact buffer overflow calculations for queues via martingales
• The expected wet period of finite dam with exponential inputs.
• DIFFUSION APPROXIMATION FOR GI/G/1 QUEUING SYSTEMS WITH FINITE CAPACITY : I-THE FIRST OVERFLOW TIME
• FIRST PASSAGE TIMES OF PH/PH/1/K AND PH/PH/1 QUEUES
• Hitting time in an M/G/1 queue
• Time to Start a Crowded Period in a Finite-Buffer Queue with Poisson Input Flow and General Processing Times
• Time to Reach Buffer Capacity in aBMAPQueue

This page was built for publication: ON TIME-TO-BUFFER OVERFLOW DISTRIBUTION IN A SINGLE-MACHINE DISCRETE-TIME SYSTEM WITH FINITE CAPACITY