A heavy traffic limit theorem for a class of open queueing networks with finite buffers

DOI10.1023/A:1019178802391zbMath0997.90030OpenAlexW2128479518MaRDI QIDQ1809723

Publication date: 10 September 2000

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019178802391

zbMATH Keywords

heavy traffic queueing network blocking probabilities heavy traffic limit theorem loss network finite capacity network oscillation estimates

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (18)

Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality. ⋮ Reflecting time-Space Gaussian random field on compact Riemannian manifold and excursion probability ⋮ A two-queue polling model with priority on one queue and heavy-tailed on/off sources: a heavy-traffic limit ⋮ A Fair Policy for the G/GI/N Queue with Multiple Server Pools ⋮ A Unified Approach to Diffusion Analysis of Queues with General Patience-Time Distributions ⋮ Comparisons of ticket and standard queues ⋮ An asymptotic optimality result for the multiclass queue with finite buffers in heavy traffic ⋮ Estimating intensity functions of spatial inhomogeneous Poisson point processes via a Stein estimator ⋮ \(n\)-qubit operations on sphere and queueing scaling limits for programmable quantum computer ⋮ Product-form solutions for integrated services packet networks and cloud computing systems ⋮ An invariance principle for semimartingale reflecting Brownian motions in domains with piecewise smooth boundaries ⋮ Diffusion approximations for multiclass queueing networks under preemptive priority service discipline ⋮ Heavy traffic limit theorems for a queue with Poisson ON/OFF long-range dependent sources and general service time distribution ⋮ Optimal control with monotonicity constraints for a parallel-server loss channel serving multi-class jobs ⋮ Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks ⋮ Platform modelling and scheduling game with multiple intelligent cloud-computing pools for big data ⋮ General hazard-type scaling of abandonment time distribution for a \(\mathrm{G}/\mathrm{Ph}/n+\mathrm{GI}\) queue in the Halfin-Whitt heavy-traffic regime ⋮ A Brownian model for multiclass queueing networks with finite buffers

This page was built for publication: A heavy traffic limit theorem for a class of open queueing networks with finite buffers