|
Home
|
Back to issue
|
ISSN 0474-8662. Information Extraction and Processing. 2018. Issue 46 (122)
Modeling of the optimal databases allocation of information systems by the availability of intermediate servers
Krasniuk R. P.
Ivan Franko National University of Lviv
Tsegelyk G. G.
Ivan Franko National University of Lviv
https://doi.org/10.15407/vidbir2018.46.054
Keywords: optimization, mathematical modeling, distributed information systems, dynamic
programming, Bellman recursive equations, ant colony algorithm
Cite as: Krasniuk R. P., Tsegelyk G. G. Modeling of the optimal databases allocation of information systems by the availability of intermediate servers. Information Extraction and Processing. 2018, 46(122), 54-60. DOI:https://doi.org/10.15407/vidbir2018.46.054
Abstract
The problems of optimization of database placement in the modeling of distributed information systems is considered in the presence of intermediate storage servers as servers of data catching that play the role of data accumulation centers when using the batch mechanism data transfer placement. The mathematical formulated problems of optimal replication bases in the distributed information system is in the condition of minimizing the time of synchronization and minimizing the average time needed to find information. The precise solutions of the formulated problems using dynamic programming methods are obtained (in Bellman recursive equations).
The adaptation of the ant colony algorithm is carried out to construct solutions to the problems f optimal placement of replication databases. A series of numerical experiments are conducted and a conclusion is made as to the computational efficiency of the application of this approximate method in the case of increasing the number of nodes of the distributed information system.
References
1. Tsegelyk, G. G. The distributed database systems. Svit: Lviv, 1990; p 168.
2. Beskorovaynyi, V. V.; Ul'ianova, O. S. The mathematical models of multicriteria synthesis of physical structures of distributed databases. Eastern European J. of Adv. Techn. 2010 4, 44-48.
3. Yakovlev, Yu. S. On the concept of construction and selection of distributed databases of information retrieval systems. Mathematical Machines and Systems. 2013; 2, 35-53.
4. Chumachenko, Ye. I.; Zakharov, S. S. The Algorithmic support of distributed databases. Artificial Intelligence. 2013; 1, 49-54.
5. Tsegelyk, G. G. The mathematical programming. Ivan Franko National University of Lviv: Lviv, 2011; p 168.
6. Dorigo, M.; Gambardella, L. M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transact. on Evolutionary Computation. 1997; 1, 53-66.
https://doi.org/10.1109/4235.585892
7. Stützle, T.; Hoos, H. H. Max-Min Ant System. Future Generation Computer Systems. 2000; 16(8), 889-914.
https://doi.org/10.1016/S0167-739X(00)00043-1