A law of iterated logarithm for multiclass queues with preemptive priority service discipline
From MaRDI portal
Publication:2339928
DOI10.1007/S11134-014-9419-5zbMath1310.60131OpenAlexW2024334160WikidataQ57438070 ScholiaQ57438070MaRDI QIDQ2339928
Publication date: 14 April 2015
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-014-9419-5
law of iterated logarithmstrong approximationpriority queuesnon-Markovian queuespreemptive-resume disciplinemulticlass queues
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Strong limit theorems (60F15) Brownian motion (60J65)
Related Items (10)
Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback ⋮ Asymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithm ⋮ Asymptotic variability analysis for a two-stage tandem queue. II: The 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 ⋮ 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 ⋮ Variability Analysis for a Two-station Queueing Network in Heavy Traffic with Arrival Processes Driven by Queues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong approximation of renewal processes
- Strong approximation of extended renewal processes
- A central-limit-theorem version of \(L=\lambda W\)
- Departures from many queues in series
- Strong approximations for priority queues; head-to-the-line-first discipline
- How big are the increments of a Wiener process?
- Strong approximation for Markovian service networks
- A law of the iterated logarithm for global values of waiting time in multiphase queues.
- A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines
- On the law of the iterated logarithm in open queueing networks
- Sufficient conditions for functional-limit-theorem versions of \(L=\lambda W\)
- Heavy traffic limits for some queueing networks
- Strong approximations for multiclass feedforward queueing networks.
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Fluid approximations and stability of multiclass queueing networks: Work-conserving disciplines
- Stochastic-Process Limits
- On the law of the iterated logarithm in multiserver open queueing networks
- Strong approximations for multiple channel queues in heavy traffic
- A new view of the heavy-traffic limit theorem for infinite-server queues
- A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
- An approximation of stopped sums with applications in queueing theory
- An LIL Version of L = λW
- Strong Approximations of Open Queueing Networks
- Strong Approximations of Irreducible Closed Queueing Networks
- Rate of convergence of the fluid approximation for generalized Jackson networks
- A limit theorem for priority queues in heavy traffic
- Strong Approximations for Time-Dependent Queues
- An invariance principle for the law of the iterated logarithm
- Multiple channel queues in heavy traffic
- Weak convergence theorems for priority queues: preemptive-resume discipline
This page was built for publication: A law of iterated logarithm for multiclass queues with preemptive priority service discipline
