A unified method of analysis for queues with Markovian arrivals
From MaRDI portal
Publication:1955244
DOI10.1155/2012/831956zbMath1264.90052OpenAlexW2015683326WikidataQ58912141 ScholiaQ58912141MaRDI QIDQ1955244
Publication date: 11 June 2013
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/831956
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An EM algorithm for estimation in Markov-modulated Poisson processes
- A storage model with self-similar input
- Exact buffer overflow calculations for queues via martingales
- An application of deterministic chaotic maps to model packet traffic
- New results on the single server queue with a batch markovian arrival process
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- The n/g/l finite capacity queue
- A versatile Markovian point process
- The transient BMAP/G/l queue
- Solving m/g/l type markov chains: recent advances and applications
- A multifractal wavelet model with application to network traffic
- Computer Performance Evaluation. Modelling Techniques and Tools
- Time to Reach Buffer Capacity in aBMAPQueue
This page was built for publication: A unified method of analysis for queues with Markovian arrivals