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

Open access

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.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [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.15

  • [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.618

  • [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] 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] 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-6

  • [6] T. H. Cormen et al. Introduction to AlgorithmsThird Edition. The MIT Press 2009.

  • [7] L. Kleinrock Queueing systems Volume 2: Computer applications. New York: Wiley 1976.

  • [8] L. Kleinrock Communication Nets: Stochastic Message Flow and Design. McGraw-Hill 1964.

Search
Journal information
Metrics
All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 212 212 3
PDF Downloads 111 111 3