Heavy traffic analysis of M/G/1 type queueing systems with Markov-modulated arrivals

DOI10.1007/BF02564727MaRDI QIDQ1969166zbMATH OpenOpenAlexFDO

Authors Anatoli Falin, G. I. Falin

Publication date 29 January 2001

Published in Top (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02564727

zbMATH Keywords

asymptotic behaviorheavy trafficstationary characteristics

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Review text

The authors consider M/G/1 type queueing systems whose arrival rate is a function of an independent continuous time Markov chain. They suggest a simple analytical approach which allows rigorous mathematical analysis of the stationary characteristics under heavy traffic. The analysis is based on certain ``semi-explicit formulas for the performance characteristics. Their asymptotic behavior is described in terms of characteristics of the modulating process (defined as a solution of a set of linear algebraic equations).

Recommendations

• Heavy Traffic Analysis of a Markov-Modulated Queue with Finite Capacity and General Service Times
• An Asymptotic Analysis of a Queueing System with Markov-Modulated Arrivals
• A Markov-modulated M/G/1 queue. I: Stationary distribution
• The Queue M|G|1 with Markov Modulated Arrivals and Services
• Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines

Cites work

• An Asymptotic Analysis of a Queueing System with Markov-Modulated Arrivals
• scientific article; zbMATH DE number 3866333 (Why is no real title available?)
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 194776 (Why is no real title available?)

Cited in

(6)

• Heavy-traffic asymptotics for networks of parallel queues with Markov-modulated service speeds
• A heavy-traffic-limit formula for the moments of the stationary distribution in GI/G/1-type Markov chains
• Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines
• Computational analysis of a Markovian queueing system with geometric mean-reverting arrival process
• An Asymptotic Analysis of a Queueing System with Markov-Modulated Arrivals
• Heavy Traffic Analysis of a Markov-Modulated Queue with Finite Capacity and General Service Times

This page was built for publication: Heavy traffic analysis of \(\text{M/G/}1\) type queueing systems with Markov-modulated arrivals

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