Оценка эффективности метода синтеза мультисервисной сети связи

Abstract

The article proposes directions for evaluating the efficiency of the multiservice communication network structure variant, and on the basis of euclidean heuristics, an approach to evaluating the efficiency of the method of synthesizing a multiservice packet-switched communication network consisting in searching for a structure on a limited set of vertices connected by minimum edges by weight, which is a set of independent spanning trees on a limited subset of minimum connections. It is proposed to assess the effectiveness of the method of synthesizing a multiservice communication network for connected saturated graphs, since an accurate analysis of the effectiveness of euclidean heuristics is a difficult analytical task and very significantly depends on both the number and location of vertices and the number of edges incident by it. The given version of estimation of efficiency of method of synthesis of multiservice communication network is based on results of multivariate computational experiment for random saturated graphs, upper limits of characteristics of which are obtained from normative and technical documentation by evaluation analysis of values of parameters of promising multiservice communication networks. Assessment of the set of main and additional actions when searching for the required number of independent spanning trees, the structure of the multiservice communication network in comparison with the Prima algorithm allows us to conclude that, that the synthesis method under consideration enables to obtain a rational solution to the structure synthesis problem, constituting a multiservice communication network in an acceptable time compared to known synthesis methods; which, according to the results of statistical tests for the considered practically important subset of implementation options for promising multiservice communication networks, is two to three times less than the estimate of the time for performing a search on a set of all vertices.