Mathematical model of optimal placing distributed data base onto Local Computing Network knots on the basis of two-level client-server architecture
Abstract
Mathematical model of optimal placing distributed data base onto Local Computing Network knots on the basis of two-level client-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 two-level architecture “client-server” was worked out. The peculiarity of the model being worked out is in making a selective choice of information at the server and via the channel of communication not the full data base is transmitted but some separate parts of it, which satisfy the conditions of SQL-request search. Using the developed earlier heuristic algorithm the problem of optimal placing the distributed data base onto the local computing system knots according to the criterion of minimal average time of system reaction for users’ requests was solved. The results of numerical experiments are given.
Keywords: Distributed data base, selective information choice, SLQ-request, transaction, system conditions space, stationary probability, transitive probability, service intensity in network knots, information volume matrix, system reaction time