Asymptotics and scalings for large product-form networks via the Central Limit Theorem

MaRDI QIDQ3840960zbMATH OpenFDO

Authors Guy Fayolle, Jean-Marc Lasgouttes

Publication date 17 August 1998

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

zbMATH Keywords

thermodynamical limitBerry-Esseen type approximations

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Abstract: The asymptotic behaviour of a closed BCMP network, with $n$ queues and $m_n$ clients, is analyzed when $n$ and $m_n$ become simultaneously large. Our method relies on Berry-Esseen type approximations coming in the Central Limit Theorem. We construct critical sequences $m_n^0$, which are necessary and sufficient to distinguish between saturated and non-saturated regimes for the network. Several applications of these results are presented. It is shown that some queues can act as bottlenecks, limiting thus the global efficiency of the system.

Recommendations

• Asymptotic expansion for large closed queuing networks
• Exact-order asymptotic analysis for closed queueing networks
• Asymptotic analysis for closed multiclass queueing networks in critical usage
• Asymptotic methods for the analysis of closed queueing networks with heavy traffic
• Asymptotic expansions for large closed and loss queueing networks

Cited in

(4)

• Two-choice regulation in heterogeneous closed networks
• An incentive algorithm for a closed stochastic network: data and mean-field analysis
• One-dimensional particle processes with acceleration/braking asymmetry
• A Stochastic Model of the Production of Multiple Proteins in Cells

This page was built for publication: Asymptotics and scalings for large product-form networks via the Central Limit Theorem

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