Strong approximation method and the (functional) law of iterated logarithm for \(GI/G/1\) queue
From MaRDI portal
Publication:1697672
DOI10.1007/S11424-017-5226-5zbMath1394.60091OpenAlexW2603376058MaRDI QIDQ1697672
Publication date: 20 February 2018
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-017-5226-5
law of the iterated logarithmrenewal process\(GI/G/1\) queuefunctional LILstrong approximation method
Queueing theory (aspects of probability theory) (60K25) Traffic problems in operations research (90B20) Functional limit theorems; invariance principles (60F17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong approximation of renewal processes
- Strong approximations for priority queues; head-to-the-line-first discipline
- 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
- Strong approximations for multiclass feedforward queueing networks.
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- A law of iterated logarithm for multiclass queues with preemptive priority service discipline
- An approximation of stopped sums with applications in queueing theory
- Strong Approximations of Open Queueing Networks
- An invariance principle for the law of the iterated logarithm
- Networks of Waiting Lines
- Multiple channel queues in heavy traffic
This page was built for publication: Strong approximation method and the (functional) law of iterated logarithm for \(GI/G/1\) queue