Abstract.

The problem of improving the reliability of distributed data processing systems is considered. A method for replicating data sets is presented as an effective tool for ensuring a high level of data safety in distributed systems. Examples of methods of static and dynamic replication are given. The formulation and algorithm of the problem of finding the optimal distribution of replicas over nodes of a computer network is given. An example of operation of the proposed algorithm for solving the formulated problem is presented. The analysis of the results obtained by the algorithm are analyzed.

Keywords:

distributed data processing systems, data replication

PP. 69-79.

DOI 10.14357/20718632180307 

References

1. Vosstanovlenie dannyh [Data recovery]. 2018. Available at: http://www.datarecovery.ru/datarecovery.htm (Accessed January
22, 2018).
2. Frolov A., Frolov G. 2001. Sohrannost' i vosstanovlenie komp'juternyh dannyh: teorija i praktika [Safety and recovery of computer data: theory and practice]. Byte. Russia. 1(30). Available at: https://www.bytemag.ru/articles/detail.php?ID=9020
[Accessed November 01, 2017].
3. The Value of Availability. Sombers Assosiates, Inc. and W.H. Highleyman. 2011. Available at:
http://www.availabilitydigest.com/public_articles/0606/value_of_availability.pdf (Accessed January 23, 2018).
4. Mikrin E.A., Somov S.K. 2017. Obzor modelej i metodov obespechenija sohrannosti dannyh v raspredelennyh sistemah obrabotki dannyh [Overview of models and methods to ensure information integrity in a distributed data processing systems]. Journal of information technologies and computing systems, 4/2017. p. 5-28.
5. Kulba V.V., Somov S.K. Problem of optimal placement of data files in large-scale unreliable distributed systems. 2017 Tenth International Conference Management of Large-Scale System Development (MLSD), Moscow, Russia, 2017, pp. 1-5. Available
at: URL: http://ieeexplore.ieee.org/document/8109649/ (Accessed January 10, 2018).
6. Tanenbaum A.S., M. van Steen. 2003. Distributed Systems: Principles and Paradigms. St. Petersburg.: Piter. 877 p.
7. Chernyshev G.A. 2013. Obzor podhodov k organizacii fizicheskogo urovnja v SUBD [Overview of approaches to the organization of the physical layer in the DBMS]. Proceedings of SPIIRAS. St. Petersburg. 1(24):222 – 275.
8. Chu W.W. 1969. File Allocation in a Multiple Computer System. IEEE Transactions on Computers. C-18(10):885-889.
9. Azzam Sleit and oth. 2007. A Dynamic Object Fragmentation and Replication Algorithm In Distributed Database Systems. American Journal of Applied Sciences 4 (8):613-618.
10. Szymaniak M., Pierre G., Steen V. 2006. Latency-Driven Replica Placement. IPSJ Digital Courier. 2:12.
11. Rabinovich, M., Rabinovich, I., Rajaraman, R., and Aggarwal A. 1999. A Dynamic Object Replication and Migration Protocol
for an Internet Hosting Service. Proc. 19th Int'l Conf. on Distributed Computing Systems. ACM. 101-113.
12. Singh. A., Kahlon S.K., Virk R.S. 2014. Nonreplicated Static Data Allocation in Distributed Databases Using Biogeography-Based Optimization. Chinese Journal of Engineering. 9p.
13. Christofides N. Graph Theory: An Algorithmic Approach. Academic Press. 1975.
14. Reese. J. Methods for Solving the p–Median Problem: An Annotated Bibliography. 2006. Networks. 48(3):125–142.
15. Daskin M.S., Maass K.L. 2015. The p–Median Problem. Location Science. Springer. 21–45. Available at:
https://link.springer.com/chapter/10.1007/978-3-319-13111-5_2 (Accessed January 10, 2017).
16. Mladenovic N., Brimberg J., Hansen P. 2007. The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research. 179(3):927–939.
17. Teitz M. B., Bart P. 1968. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research. 16:955-961.
18. Hauglid J. O., Ryeng N. H., Norvag K. 2010. Dyfram: dynamic fragmentation and replica management in distributed database systems. Distrib. Parallel Databases. 28:157–185.
19. Loukopoulos T., Ahmad I., Papadias D. 2002. An Overview of Data Replication on the Internet. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN.02). 6 p.