scientific article; zbMATH DE number 1203371
[For part I see Lith. Math. J. 35, No. 3, 284-288 (1995) and Liet. Mat. Rink. 35, No. 3, 360-366 (1995; Zbl 0868.60074).] A linear network of \(k\geq 1\) non-exponential single server queues (tandem network) fed by a renewal process is considered, where the servers operate according to first-come-first-served. Let \(\beta_0\) denote the arrival rate, \(\beta_j\) the service rate at node \(j= 1,\dots, k\), and \(\alpha_j= \beta_0- \beta_j\). Suppose the heavy traffic condition \(\alpha_k> \alpha_{k-1}>\cdots> \alpha_1>0\) holds. Then for various rescaled performance indices of the network a law of iterated logarithm is proved: queue length at the nodes, sum of the queue lengths over the first nodes, virtual waiting times at the successive nodes.
- On the law of the iterated logarithm in multiphase queueing systems
- On the law of the iterated logarithm in open queueing networks
- Approximations for departure processes in multiphase queueing systems
- Modelling the law of the iterated logarithm in open queueing networks
- A law of the iterated logarithm for extreme queue length in multiphase queues
- On the analysis of the virtual waiting time in open queueing networks
- 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
- On the law of the iterated logarithm in multiphase queueing systems
- A law of iterated logarithm for multiclass queues with preemptive priority service discipline
- A law of the iterated logarithm for extreme queue length in multiphase queues
- 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
- A law of the iterated logarithm for the sojourn time process in queues in series
- On the law of the iterated logarithm in multiserver open queueing networks
- Modelling the law of the iterated logarithm in open queueing networks
- 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
- Functional law of iterated logarithm for single server queue with Bernoulli feedback
- Approximations for departure processes in multiphase queueing systems
- Variability Analysis for a Two-station Queueing Network in Heavy Traffic with Arrival Processes Driven by Queues
- On extreme values in open queueing networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209595)
