Placement of Data Array Replicas in a Distributed System With Unreliable Communication Channels-Reference-Cited by-同舟云学术

Placement of Data Array Replicas in a Distributed System With Unreliable Communication Channels

Published:2019-05-01 Issue:1 Volume:24 Page:69-74
ISSN:2255-8691
Container-title:Applied Computer Systems
language:en
Short-container-title:

Author:

Kulba Vladimir¹,Somov Sergey¹,Merkuryev Yuri²

Affiliation:

1. Institute of Control Sciences of Russian Academy of Science , Moscow , Russia

2. Riga Technical University , Riga , Latvia

Abstract

Abstract The paper proposes an approach to solving the problem of optimal placement of data array replicas in a distributed system. It presents a formal model of a distributed system with unreliable communication channels. A system is represented as a graph with coloured arcs. The formulation of the problem of finding the optimal placement of replicas is given. As a criterion for optimization, the minimum response time to a data request is considered. The task solution heuristic algorithm is also proposed in the paper.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/acss-2019-0009

Reference8 articles.

1. [1] G. A. Chernyshev, “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, vol. 24, pp. 222–275, 2013. https://doi.org/10.15622/sp.24.1510.15622/sp.24.15

2. [2] A. Sleit, et al., “A Dynamic Object Fragmentation and Replication Algorithm in Distributed Database Systems,” American Journal of Applied Sciences, vol. 4, no. 8, pp. 613–618, 2007. https://doi.org/10.3844/ajassp.2007.613.61810.3844/ajassp.2007.613.618

3. [3] T. Loukopoulos, I. Ahmad, and D. Papadias, “An Overview of Data Replication on the Internet,” Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN.02), 6p. 2002.

4. [4] J. Sahoo, M. A. Salahuddin, and R. Glitho, “A Survey on Replica Server Placement Algorithms for Content Delivery Networks”, IEEE Communications Surveys & Tutorials, 2016, p. 30. [Online]. Available https://arxiv.org/ftp/arxiv/papers/1611/1611.01729.pdf [Accessed: July 07, 2017].

5. [5] N. Mansouri, “Adaptive data replication strategy in cloud computing for performance improvement,” Frontiers of Computer Science, vol. 10, no. 5, pp. 925–935, 2016. https://doi.org/10.1007/s11704-016-5182-610.1007/s11704-016-5182-6

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Methods for Reducing the Computational Complexity of Problems of Optimizing Data Allocation in Distributed Systems;2023 16th International Conference Management of large-scale system development (MLSD);2023-09-26