Transient and stationary characteristics of a packet buffer modelled as an \(\mathrm{MAP}/\mathrm{SM}/1/b\) system
DOI10.2478/amcs-2014-0033zbMath1293.60070OpenAlexW1997510322MaRDI QIDQ2511778
Krzysztof Rusek, Zdzisław Papir, Lucjan Janowski
Publication date: 6 August 2014
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/amcs-2014-0033
hidden Markov modelfirst passage timeMarkovian arrival processfinite-buffer queuepacket lossrouter interfacesemi-Markov service time
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (3)
Cites Work
- A single-server queueing system with batch Markov arrivals, semi-Markov service, and finite buffer: its characteristics
- Modeling IP traffic: joint characterization of packet arrivals and packet sizes using BMAPs
- Analysis of AQM queues with queue size based packet dropping
- On a Markov modulated chain exhibiting self-similarities over finite timescale
- New results on the single server queue with a batch markovian arrival process
- The Markov-modulated Poisson process (MMPP) cookbook
- The transient BMAP/G/l queue
- Time to Reach Buffer Capacity in aBMAPQueue
- The single server queue with Poisson input and semi-Markov service times
- Applied Semi-Markov Processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Transient and stationary characteristics of a packet buffer modelled as an \(\mathrm{MAP}/\mathrm{SM}/1/b\) system