Strong Approximations of Open Queueing Networks

DOI10.1287/MOOR.17.2.487MaRDI QIDQ4016705zbMATH OpenOpenAlexFDO

Authors Lajos Horváth

Publication date 16 January 1993

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.17.2.487

zbMATH Keywords

rate of convergenceBrownian motionstrong approximationqueueing systemsreflected Brownian motioninfinite capacity waiting roomnetworks with two stations

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Functional limit theorems; invariance principles (60F17) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Strong Approximations of Irreducible Closed Queueing Networks
• scientific article; zbMATH DE number 1336730
• Strong approximations for multiple channel queues in heavy traffic
• Strong approximations for the open queueing network in heavy traffic
• scientific article; zbMATH DE number 1159047

Cited in

(25)

• Heavy-traffic extreme-value limits for queues
• Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback
• Strong approximations for multiple channel queues in heavy traffic
• Jackson network in a random environment: strong approximation
• scientific article; zbMATH DE number 1445587 (Why is no real title available?)
• Accuracy of Estimation of the Vector of Queue Lengths for Open Jackson Networks
• scientific article; zbMATH DE number 1159047 (Why is no real title available?)
• Strong Approximations for Time-Dependent Queues
• Strong approximation method and the (functional) law of iterated logarithm for \(GI/G/1\) queue
• scientific article; zbMATH DE number 3870374 (Why is no real title available?)
• The (functional) law of the iterated logarithm of the sojourn time for a multiclass queue
• Variability Analysis for a Two-station Queueing Network in Heavy Traffic with Arrival Processes Driven by Queues
• Strong approximations for the open queueing network in heavy traffic
• 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
• Validity of heavy traffic steady-state approximations in generalized Jackson networks
• Strong approximations for multiclass feedforward queueing networks.
• Diffusion approximations for open queueing networks with service interruptions
• Strong embeddings for transitory queueing models
• A functional law of the iterated logarithm for multi-class queues with batch arrivals
• Asymptotic variability analysis for multi-server generalized Jackson network in overloaded
• Strong Approximations of Irreducible Closed Queueing Networks
• On the strong approximation for a simple reentrant line in light traffic under first-buffer first-served service discipline
• Strong approximations for a Kumar-Seidman network under a priority service discipline

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

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