Strong approximations for priority queues; head-to-the-line-first discipline
From MaRDI portal
Publication:1183684
DOI10.1007/BF01159207zbMath0743.60106OpenAlexW2019160910MaRDI QIDQ1183684
Publication date: 28 June 1992
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01159207
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
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, 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, A law of iterated logarithm for multiclass queues with preemptive priority service discipline
Cites Work
- Invariance principles for renewal processes
- Strong approximations for multiple channel queues in heavy traffic
- An approximation of stopped sums with applications in queueing theory
- An approximation of partial sums of independent RV's, and the sample DF. II
- An approximation of partial sums of independent RV'-s, and the sample DF. I
- Weak convergence theorems for priority queues: preemptive-resume discipline