A law of iterated logarithm for multiclass queues with preemptive priority service discipline
From MaRDI portal
Publication:2339928
DOI10.1007/S11134-014-9419-5zbMATH Open1310.60131DBLPjournals/questa/GuoL15OpenAlexW2024334160WikidataQ57438070 ScholiaQ57438070MaRDI QIDQ2339928FDOQ2339928
Authors: Yunan Liu, Yong-Jiang Guo 
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
Recommendations
- 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
- On the law of the iterated logarithm in multiphase queueing systems
- scientific article; zbMATH DE number 1203371
- On the law of the iterated logarithm in multiserver open queueing networks
- The (functional) law of the iterated logarithm of the sojourn time for a multiclass queue
- A law of the iterated logarithm for extreme queue length in multiphase queues
- The law of the iterated logarithm for extreme waiting time in multiphase queueing systems
strong approximationlaw of iterated logarithmpriority queuesnon-Markovian queuespreemptive-resume disciplinemulticlass queues
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Brownian motion (60J65) Strong limit theorems (60F15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Stochastic-Process Limits
- A central-limit-theorem version of \(L=\lambda W\)
- A law of the iterated logarithm for global values of waiting time in multiphase queues.
- On the law of the iterated logarithm in open queueing networks
- Sufficient conditions for functional-limit-theorem versions of \(L=\lambda W\)
- Strong approximations for multiclass feedforward queueing networks.
- Fluid approximations and stability of multiclass queueing networks: Work-conserving disciplines
- Title not available (Why is that?)
- On the law of the iterated logarithm in multiserver open queueing networks
- An LIL Version of L = λW
- Title not available (Why is that?)
- Rate of convergence of the fluid approximation for generalized Jackson networks
- An invariance principle for the law of the iterated logarithm
- Title not available (Why is that?)
- Weak convergence theorems for priority queues: preemptive-resume discipline
- Departures from many queues in series
- Strong approximation for Markovian service networks
- Strong Approximations for Time-Dependent Queues
- How big are the increments of a Wiener process?
- A new view of the heavy-traffic limit theorem for infinite-server queues
- Strong approximations for priority queues; head-to-the-line-first discipline
- Strong approximations for multiple channel queues in heavy traffic
- An approximation of stopped sums with applications in queueing theory
- Strong Approximations of Open Queueing Networks
- Strong Approximations of Irreducible Closed Queueing Networks
- Multiple channel queues in heavy traffic
- Strong approximation of renewal processes
- Strong approximation of extended renewal processes
- Heavy traffic limits for some queueing networks
- A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines
- A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
- A limit theorem for priority queues in heavy traffic
Cited In (11)
- On the strong approximation for a simple reentrant line in light traffic under first-buffer first-served service discipline
- Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback
- 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
- 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
- Asymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithm
- Variability Analysis for a Two-station Queueing Network in Heavy Traffic with Arrival Processes Driven by Queues
- Strong approximation method and the (functional) law of iterated logarithm for \(GI/G/1\) queue
- Asymptotic variability analysis for a two-stage tandem queue. II: The law of the iterated logarithm
- Asymptotic variability analysis for multi-server generalized Jackson network in overloaded
This page was built for publication: A law of iterated logarithm for multiclass queues with preemptive priority service discipline
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339928)
