Time to Reach Buffer Capacity in aBMAPQueue
From MaRDI portal
Publication:5423128
DOI10.1080/15326340701300746zbMath1127.68011OpenAlexW2042382258MaRDI QIDQ5423128
Publication date: 31 October 2007
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326340701300746
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)
Related Items (13)
Analysis of discrete-time buffers with heterogeneous session-based arrivals and general session lengths ⋮ Per-flow structure of losses in a finite-buffer queue ⋮ Transient and stationary losses in a finite-buffer queue with batch arrivals ⋮ A unified method of analysis for queues with Markovian arrivals ⋮ Analysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal control ⋮ Buffer overflow period in a MAP queue ⋮ On the structure of data losses induced by an overflowed buffer ⋮ Transient and stationary characteristics of a packet buffer modelled as an \(\mathrm{MAP}/\mathrm{SM}/1/b\) system ⋮ Performance analysis of buffers with train arrivals and correlated output interruptions ⋮ Lévy Processes with Two-Sided Reflection ⋮ Burst ratio in the finite-buffer queue with batch Poisson arrivals ⋮ ON TIME-TO-BUFFER OVERFLOW DISTRIBUTION IN A SINGLE-MACHINE DISCRETE-TIME SYSTEM WITH FINITE CAPACITY ⋮ Buffer-overflows: joint limit laws of undershoots and overshoots of reflected processes
Cites Work
- The Fourier-series method for inverting transforms of probability distributions
- 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
- Modeling IP traffic: joint characterization of packet arrivals and packet sizes using BMAPs
- Limits of first passage times to rare sets in regenerative processes
- New results on the single server queue with a batch markovian arrival process
- The n/g/l finite capacity queue
- A versatile Markovian point process
- The N/G/1 queue and its detailed analysis
- The Markov-modulated Poisson process (MMPP) cookbook
- The transient BMAP/G/l queue
- Further transient analysis of theBMAP/G/1 Queue
- Calculating the loss probability in aBMAP/G/l/N+1 queue
- A two-time-scale model for hospital patient flow
This page was built for publication: Time to Reach Buffer Capacity in aBMAPQueue