Advertisement

Automation and Remote Control

, Volume 80, Issue 6, pp 1123–1133 | Cite as

The Problem of the Optimal Placing of the Information-Technological Reserve in Distributed Data Processing Systems

  • S. K. SomovEmail author
Control Sciences
  • 3 Downloads

Abstract

It is noted, that information-technological reserve is a new type of information redundancy, the use of which in distributed automated informational control systems allows to increase the efficiency of their performance while processing the typical user requests. The task of optimal allocation of identical copies of information-technological reserve throughout the nodes of the distributed system is formulated in the form of a minisum problem of finding the p-median of a graph. The algorithm is proposed for solving this problem and the example of the solution is given. The brief analysis of the solution algorithm results is performed.

Keywords

distributed data processing system computer network information-technological backup (information technology reserve) 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Somov, S.K., Creation of Information-Technological Reserve in Distributed Data Processing Systems. Autom. Remote Control, 2019, vol. 80, no. 4, pp. 781–790.CrossRefGoogle Scholar
  2. 2.
    Christofides, N., Graph Theory. An Algorithmic Approach, New York: Academic, 1975.zbMATHGoogle Scholar
  3. 3.
    Minieka, E., Optimization Algorithms for Networks and Graphs, New York: Marcel Dekker, 1978.zbMATHGoogle Scholar
  4. 4.
    Teitz, M.B. and Bart, P., Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph, Operat. Res., 1968, vol. 16, pp. 955–961.CrossRefzbMATHGoogle Scholar
  5. 5.
    Sahoo, J., Salahuddin, M.A., Glitho, R., et al., A Survey on Replica Server Placement Algorithms for Content Delivery Networks, IEEE Commun. Survey Tutor., 2017, vol. 19, no. 2, pp. 1002–1026.CrossRefGoogle Scholar
  6. 6.
    Souri, A. and Rahmani, A.M., A Survey for Replica Placement Techniques in Data Grid Environment, Int. J. Modern Educat. Computer Sci., 2014, no. 5, pp. 46–51.Google Scholar
  7. 7.
    Mansouri, N., Adaptive Data Replication Strategy in Cloud Computing for Performance Improvement, Frontiers Computer Sci., 2016, vol. 10, no. 5, pp. 925–935.CrossRefGoogle Scholar
  8. 8.
    Chernyshev, G.A., A Survey of DBMS Physical Design Approaches, Tr. SPIIRAN, 2013, no. 24(1), pp. 222–275.Google Scholar
  9. 9.
    Reese, J., Methods for Solving the p-Median Problem: An Annotated Bibliography, Networks, 2006, vol. 48, no. 3, pp. 125–142.MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Daskin, M.S. and Maass, K.L., The p-Median Problem, in Location Science, Laporte, G., Nickel, S., and Saldanha da Gama, F., Eds., Cham: Springer, 2015, pp. 21–45.Google Scholar
  11. 11.
    Mladenovic, N., Brimberg, J., and Hansen, P., The p-Median Problem: A Survey of Metaheuristic Approaches, Eur. J. Operat. Res., 2007, vol. 179, no. 3, pp. 927–939.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2019

Authors and Affiliations

  1. 1.Trapeznikov Institute of Control SciencesRussian Academy of SciencesMoscowRussia

Personalised recommendations