About cumulative idle time model of the message switching system (Q2864779)

For a tandem system of queues of the form \(\mathrm{GI}/\mathrm{GI}/1\) under first-come-first-served, a law of iterated logarithm is proved for the cumulative idle times of the \(n\)-th customer in the \(j\)-th queue. A precise definition of idle times of a customer is not provided. For the central pathwise recurrence relation, the author refers to a previous paper. The proof is performed under a fourth moment condition and a monotonicity property of the sequence of queues. In the proof, the author's arguments partly rely on a result in [\textit{S. Minkevičius}, Lith. Math. J. 45, No. 3, 299--314 (2005); translation from Liet. Mat. Rink. 45, No. 3, 367--386 (2005; Zbl 1102.60084)]. The results are applied to a message switching system.