A unified method of analysis for queues with Markovian arrivals

DOI10.1155/2012/831956zbMath1264.90052WikidataQ58912141 ScholiaQ58912141MaRDI QIDQ1955244

Andrzej Chydzinski

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

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

Analysis of the scheduling mechanism for virtualization of links with partial isolation

Uses Software

• Kpc-toolbox

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