×

You are using an outdated browser Internet Explorer. It does not support some functions of the site.

Recommend that you install one of the following browsers: Firefox, Opera or Chrome.

Contacts:

+7 961 270-60-01
ivdon3@bk.ru

Heuristic algorithm for solving the problem of optimal allocation of information resources .

Abstract

Heuristic algorithm for solving the problem of optimal allocation of information resources .

Scoba A.N., Achmed Ayesh Nafea Ayesh,Michailov V.K.

Incoming article date: 28.02.2018

In this article to solve the problem of optimal distribution of information resources over the nodes of distributed inorganic system according to the criterion of minimum of the medium time, the response of the system to the requests of the users an original heuristic algorithm is proposed that uses the notion of databases as points of a mulltidimensional space, but about nodes in which these bases are placed as clasters. The resuts of numerical experiments are presennted depending on the architecture of the distributed system used and on the method of ensuring data integrity. Numerical experiments showed rather high efficiency of the proposed algorithm.

Keywords: Distributed information system, distributed data base, local computing system, mass service network, non-lineare combinatorial optimization, query generation, a matrix of probabilities for generating queries by users, a matrix for distributing relations a