Mathematical model of optimal placing distributed data base onto Local Computing Network knots on the basis of file-server architecture
Abstract
Mathematical model of optimal placing distributed data base onto Local Computing Network knots on the basis of file-server architecture
Incoming article date: 26.03.2015Using a device for close exponential networks of mass service a mathematical model for solving the problem of getting integral indexes of distributed information system on the basis of local computing network using file-server architecture was worked out. The heuristic algorithm of optimal placing the distributed data base onto local computing network knots according to the criterion of minimal average time of system reaction for users’ requests is represented. This algorithm uses the understanding of data bases as the points of multidimensional space and the knots in which those data bases are placed as clusters or classes. The results of numerical experiments are given.
Keywords: Distributed information system, distributed data base, local computing system, mass service network, conceptual model, exponential law of distributing the random value, stationary probability, mark process, the global balance equation, system reaction tim