The (functional) law of the iterated logarithm of the sojourn time for a multiclass queue
From MaRDI portal
Publication:2190252
strong approximationfunctional law of iterated logarithmmulticlass queuethe law of iterated logarithmsojourn time process
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Functional limit theorems; invariance principles (60F17) Stochastic scheduling theory in operations research (90B36)
Recommendations
- 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
- Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback
- A law of the iterated logarithm for the sojourn time process in queues in series
- Asymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithm
Cites work
- scientific article; zbMATH DE number 1631026 (Why is no real title available?)
- scientific article; zbMATH DE number 996999 (Why is no real title available?)
- scientific article; zbMATH DE number 3858075 (Why is no real title available?)
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 4078444 (Why is no real title available?)
- scientific article; zbMATH DE number 3052578 (Why is no real title available?)
- A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
- A central-limit-theorem version of L= W
- A law of iterated logarithm for multiclass queues with preemptive priority service discipline
- A law of the iterated logarithm for global values of waiting time in multiphase queues.
- A law of the iterated logarithm for the sojourn time process in queues in series
- A new view of the heavy-traffic limit theorem for infinite-server queues
- A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines
- An LIL Version of L = λW
- An approximation of stopped sums with applications in queueing theory
- An invariance principle for the law of the iterated logarithm
- 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
- Departures from many queues in series
- Empirical law of the iterated logarithm for Markov chains with a countable state space.
- Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback
- Heavy traffic limits for some queueing networks
- Law of the iterated logarithm for the periodogram
- Multiple channel queues in heavy traffic
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- On the law of the iterated logarithm in multiserver open queueing networks
- On the law of the iterated logarithm in open queueing networks
- Strassen's law of the iterated logarithm for diffusion processes for small time
- Strassen-type law of the iterated logarithm for self-normalized increments of sums
- Strong Approximations for Time-Dependent Queues
- Strong Approximations of Irreducible Closed Queueing Networks
- Strong Approximations of Open Queueing Networks
- Strong approximation for Markovian service networks
- Strong approximation of extended renewal processes
- Strong approximation of renewal processes
- Strong approximations for multiclass feedforward queueing networks.
- Strong approximations for multiple channel queues in heavy traffic
- Strong approximations for priority queues; head-to-the-line-first discipline
- Sufficient conditions for functional-limit-theorem versions of \(L=\lambda W\)
- The law of iterated logarithm for additive functionals and martingale additive functionals of Harris recurrent Markov processes
- The law of the iterated logarithm in game-theoretic probability with quadratic and stronger hedges
- Weak convergence theorems for priority queues: preemptive-resume discipline
Cited in
(14)- Functional law of iterated logarithm for single server queue with Bernoulli feedback
- On the strong approximation for a simple reentrant line in light traffic under first-buffer first-served service discipline
- A law of the iterated logarithm for the sojourn time process in queues in series
- Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback
- A law of iterated logarithm for multiclass queues with preemptive priority service discipline
- A law of the iterated logarithm for global values of waiting time in multiphase queues.
- 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 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
- An LIL Version of L = λW
This page was built for publication: The (functional) law of the iterated logarithm of the sojourn time for a multiclass queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190252)
