Determination of probabilistic-time characteristics when studying load properties in computer networks

Abstract

The article is devoted to the determination of probabilistic-time characteristics when studying the properties of load in computer networks. The proposed approach to determining these characteristics is based on consideration of the probabilistic-time characteristics of a single-line queuing system with a geometric input flow and an exponential distribution of service time with a limited queue (g/M/1/N). The work takes into account that the flow of messages at the input of a subscriber station, hub or net-work controller serving a multipoint network with a “ring” or “tree” structure differs from Poisson. The proposed analysis method (G/M/1/N type system), called the parameter method, is illustrated with examples of various types of queuing systems.