|
Problemy Peredachi Informatsii, 1986, Volume 22, Issue 1, Pages 49–65
(Mi ppi842)
|
|
|
|
This article is cited in 3 scientific papers (total in 4 papers)
Communication Network Theory
Gaussian Diffusion Approximation of Closed Markov Models of Computer Networks
A. Ya. Kogan, R. Sh. Liptser, A. V. Smorodinskii
Abstract:
The authors consider a model of a computer network in which (because of the flow control mechanism that is selected) there are always $N$ messages. The model is described by a closed network of queues that form a multivariate birth and death process. Under conditions of heavy traffic, it is shown that as $N\to\infty$, the queue length vector, normed by the number $N$, converges uniformly in probability to the solution of a system of differential equations, while deviations of the queue lengths of order $\sqrt{N}$ from a deterministic limit converge weakly to a Gaussian diffusion process. The martingale methods of proof that are employed yield results under very natural constraints.
Received: 21.11.1983
Citation:
A. Ya. Kogan, R. Sh. Liptser, A. V. Smorodinskii, “Gaussian Diffusion Approximation of Closed Markov Models of Computer Networks”, Probl. Peredachi Inf., 22:1 (1986), 49–65; Problems Inform. Transmission, 22:1 (1986), 38–51
Linking options:
https://www.mathnet.ru/eng/ppi842 https://www.mathnet.ru/eng/ppi/v22/i1/p49
|
Statistics & downloads: |
Abstract page: | 419 | Full-text PDF : | 166 | First page: | 2 |
|