Strong Approximations of Irreducible Closed Queueing Networks

DOI10.2307/1428014MaRDI QIDQ4374018zbMATH OpenOpenAlexFDO

Authors Hanqin Zhang

Publication date 3 March 1998

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1428014

zbMATH Keywords

Levy-Prokhorov distancerates of convergencereflected Brownian motion

Mathematics Subject Classification ID

Functional limit theorems; invariance principles (60F17) Sample path properties (60G17) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70) Queueing theory (aspects of probability theory) (60K25) Deterministic network models in operations research (90B10) Queues and service in operations research (90B22)

Recommendations

• Strong Approximations of Open Queueing Networks
• On a class of approximations for closed queueing networks
• scientific article; zbMATH DE number 1159047
• scientific article; zbMATH DE number 1301681
• scientific article; zbMATH DE number 1336730
• Strong approximations for the open queueing network in heavy traffic
• Approximate Analysis Of Bulk Closed Queueing Networks
• Simple bounds for closed queueing networks

Cited in

(21)

• On a class of approximations for closed queueing networks
• Strong approximation for Markovian service networks
• Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback
• Approximations of open queueing networks by reflection mappings
• Strong approximations for multiclass feedforward queueing networks.
• The (functional) law of the iterated logarithm of the sojourn time for a multiclass queue
• A functional law of the iterated logarithm for multi-class queues with batch arrivals
• A law of iterated logarithm for multiclass queues with preemptive priority service discipline
• Asymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithm
• Functional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Overloaded Case
• Functional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Underloaded and Critically Loaded Cases
• Strong Approximations of Open Queueing Networks
• Regenerative closed queueing networks
• scientific article; zbMATH DE number 1336730 (Why is no real title available?)
• scientific article; zbMATH DE number 1159047 (Why is no real title available?)
• Jackson network in a random environment: strong approximation
• Asymptotic variability analysis for multi-server generalized Jackson network in overloaded
• Strong approximations for a Kumar-Seidman network under a priority service discipline
• Variability Analysis for a Two-station Queueing Network in Heavy Traffic with Arrival Processes Driven by Queues
• On the strong approximation for a simple reentrant line in light traffic under first-buffer first-served service discipline
• Asymptotic variability analysis for tandem queues

This page was built for publication: Strong Approximations of Irreducible Closed Queueing Networks

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