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

Brownian motioninfinite capacity waiting roomnetworks with two stationsqueueing systemsrate of convergencereflected Brownian motionstrong approximation

Mathematics Subject Classification ID

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

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

(29)

• Strong approximations for the open queueing network in heavy traffic
• Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback
• Strong approximation method and the (functional) law of iterated logarithm for \(GI/G/1\) queue
• Approximations of open queueing networks by reflection mappings
• Strong approximations for multiclass feedforward queueing networks.
• Heavy-traffic extreme-value limits for queues
• 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
• Diffusion approximations for open queueing networks with service interruptions
• Asymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithm
• Validity of heavy traffic steady-state approximations in generalized Jackson networks
• Strong approximations for multiple channel queues in heavy traffic
• Functional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Overloaded Case
• scientific article; zbMATH DE number 3870374 (Why is no real title available?)
• scientific article; zbMATH DE number 1301681 (Why is no real title available?)
• scientific article; zbMATH DE number 1336730 (Why is no real title available?)
• Strong Approximations of Irreducible Closed Queueing Networks
• scientific article; zbMATH DE number 1159047 (Why is no real title available?)
• Strong Approximations for Time-Dependent Queues
• scientific article; zbMATH DE number 1445587 (Why is no real title available?)
• Strong embeddings for transitory queueing models
• Jackson network in a random environment: strong approximation
• Asymptotic variability analysis for multi-server generalized Jackson network in overloaded
• Accuracy of Estimation of the Vector of Queue Lengths for Open Jackson Networks
• 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 Open Queueing Networks

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