Strong Approximations of Open Queueing Networks

DOI10.1287/moor.17.2.487zbMath0758.60099OpenAlexW2133715651MaRDI QIDQ4016705

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)

Related Items (12)

Strong approximations for multiclass feedforward queueing networks. ⋮ Diffusion approximations for open queueing networks with service interruptions ⋮ Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback ⋮ Heavy-traffic extreme-value limits for queues ⋮ Asymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithm ⋮ The (functional) law of the iterated logarithm of the sojourn time for a multiclass queue ⋮ Strong approximation method and the (functional) law of iterated logarithm for \(GI/G/1\) queue ⋮ Functional Law of the Iterated Logarithm for Multiclass Queues with Preemptive Priority Service Discipline: The Overloaded Case ⋮ 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 ⋮ Validity of heavy traffic steady-state approximations in generalized Jackson networks ⋮ A law of iterated logarithm for multiclass queues with preemptive priority service discipline

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