RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1986 Volume 22, Issue 1, Pages 49–65 (Mi ppi842)

This article is cited in 3 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.

UDC: 621.394.74:519.2

Received: 21.11.1983


 English version:
Problems of Information Transmission, 1986, 22:1, 38–51

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024