On time-to-buffer overflow distribution in a single-machine discrete-time system with finite capacity

DOI10.3846/MMA.2020.10433MaRDI QIDQ5016248zbMATH OpenOpenAlexFDO

Authors Wojciech M. Kempa

Publication date 13 December 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

buffer overflowgeometric distributionproduction linequeueing modeltransient analysis

Mathematics Subject Classification ID

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

Recommendations

• Distribution of the time to buffer overflow in the single-server queueing model with multiple vacation policy
• Time to Reach Buffer Capacity in aBMAPQueue
• On the Overflow Process from a Finite Markovian Queue
• Patterns of buffer overflow in a class of queues with long memory in the input stream
• scientific article; zbMATH DE number 1873273

Cites work

• Busy period analysis of the level dependent \(PH/PH/1/K\) queue
• DIFFUSION APPROXIMATION FOR GI/G/1 QUEUING SYSTEMS WITH FINITE CAPACITY : I-THE FIRST OVERFLOW TIME
• Exact buffer overflow calculations for queues via martingales
• FIRST PASSAGE TIMES OF PH/PH/1/K AND PH/PH/1 QUEUES
• First-passage-time and busy-period distributions of discrete-time Markovian queues: \(\text{Geom}(n)/\text{Geom}(n)/1/N\)
• Hitting time in an M/G/1 queue
• scientific article; zbMATH DE number 3858110 (Why is no real title available?)
• scientific article; zbMATH DE number 1424149 (Why is no real title available?)
• The expected wet period of finite dam with exponential inputs.
• Time to Reach Buffer Capacity in aBMAPQueue
• Time to start a crowded period in a finite-buffer queue with Poisson input flow and general processing times

Cited in

(4)

• Buffer-overflows: joint limit laws of undershoots and overshoots of reflected processes
• Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach
• Distribution of the time to buffer overflow in the single-server queueing model with multiple vacation policy
• Time to start a crowded period in a finite-buffer queue with Poisson input flow and general processing times

This page was built for publication: On time-to-buffer overflow distribution in a single-machine discrete-time system with finite capacity

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