Strong Approximations of Irreducible Closed Queueing Networks
From MaRDI portal
Publication:4374018
DOI10.2307/1428014zbMath0905.60069OpenAlexW2314721156MaRDI QIDQ4374018
Publication date: 3 March 1998
Published in: Unnamed Author (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1428014
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Sample path properties (60G17) Functional limit theorems; invariance principles (60F17) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)
Related Items (10)
Strong approximations for multiclass feedforward queueing networks. ⋮ Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback ⋮ Strong approximations for a Kumar-Seidman network under a priority service discipline ⋮ 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 ⋮ 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 ⋮ 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 ⋮ A law of iterated logarithm for multiclass queues with preemptive priority service discipline
This page was built for publication: Strong Approximations of Irreducible Closed Queueing Networks