DIFFUSION APPROXIMATION FOR STATIONARY ANALYSIS OF QUEUES AND THEIR NETWORKS: A REVIEW

DOI10.15807/JORSJ.58.104MaRDI QIDQ5500267zbMATH OpenOpenAlexFDO

Authors Masakiyo Miyazawa

Publication date 5 August 2015

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.4187

zbMATH Keywords

applied probabilitydiffusion approximationgeneralized Jackson etworkheavy trafficKingman's approximationmulti-classqueuesemi-martingale reflecting Brownian motionsingle-classstationary distributiontail asymptotics

Mathematics Subject Classification ID

Functional limit theorems; invariance principles (60F17) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Abstract: Diffusion processes have been widely used for approximations in the queueing theory. There are different types of diffusion approximations. Among them, we are interested in those obtained through limits of a sequence of models which describe queueing networks. Such a limit is typically obtained by the weak convergence of either stochastic processes or stationary distributions. We already have nice reviews and text books for them. However, this area is still actively studied, and it seems getting hard to have a comprehensive overview because mathematical results are highly technical. We try to fill this gap presenting technical background. Although those diffusion approximations have been well developed, there remains a big problem, which is difficulty to get useful information from the limiting diffusion processes. Their state spaces are multidimensional, whose dimension corresponds to the number of nodes for a single-class case and the number of customer types for a multi-class case. We now have a better view for the two dimensional case, but still know very little about the higher dimensional case. This intractability is somehow against a spirit of diffusion approximation. This motivates us to reconsider diffusion approximation from scratch. For this, we highlight the stationary distributions, and make clear a mechanism to produce diffusion approximations.

Recommendations

• Diffusion approximations of queueing networks
• scientific article; zbMATH DE number 671808
• scientific article; zbMATH DE number 1096972
• Analysis and calculation of queueing networks using the two-dimensional diffusion approximation
• On some diffusion approximations to queueing systems
• Diffusion approximation of queuing networks of open type
• Diffusion approximation of queuing networks of open type
• scientific article; zbMATH DE number 2100922
• scientific article; zbMATH DE number 1583967
• scientific article; zbMATH DE number 3854771

Cited in

(10)

• Ergodic optimization of stochastic differential systems in wireless networks
• Tandem fluid queue with long-range dependent inputs: sticky behaviour and heavy traffic approximation
• A load balancing system in the many-server heavy-traffic asymptotics
• scientific article; zbMATH DE number 702919 (Why is no real title available?)
• Fluid and Diffusion Approximations of a Two-Station Mixed Queueing Network
• A superharmonic vector for a nonnegative matrix with QBD block structure and its application to a Markov-modulated two-dimensional reflecting process
• Diffusion approximation analysis of multihopwireless networks: quality-of-service and convergence of stationary distribution
• Derivation of Kolmogorov-Chapman type equations with Fokker-Planck operator
• A unified approach for large queue asymptotics in a heterogeneous multiserver queue
• High-order steady-state diffusion approximations

This page was built for publication: DIFFUSION APPROXIMATION FOR STATIONARY ANALYSIS OF QUEUES AND THEIR NETWORKS: A REVIEW

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