|
Problemy Peredachi Informatsii, 1999, Volume 35, Issue 2, Pages 100–106
(Mi ppi447)
|
|
|
|
Communication Network Theory
Variance of the Number of Departed Messages in a Simple Queueing System
A. I. Ovseevich
Abstract:
We study a simple queueing facility consisting of two servers in tandem, separated by a finite buffer. The servers are independent and their sequences of up/down modes are Bernoullian. The input flow is deterministic (one new message per time unit). We compute explicitly the coefficient $A$ in the asymptotics $\mathbf D(T)\sim AT$ of the covariance of the number of departed messages per interval $[0,T]$.
Received: 09.12.1998
Citation:
A. I. Ovseevich, “Variance of the Number of Departed Messages in a Simple Queueing System”, Probl. Peredachi Inf., 35:2 (1999), 100–106; Problems Inform. Transmission, 35:2 (1999), 180–185
Linking options:
https://www.mathnet.ru/eng/ppi447 https://www.mathnet.ru/eng/ppi/v35/i2/p100
|
|