METHOD FOR REDISTRIBUTING FUNCTIONS BETWEEN NODES OF A DISTRIBUTED INFORMATION SYSTEM THAT HAS UNDERGONE PARTIAL PHYSICAL DESTRUCTION
DOI:
https://doi.org/10.18372/2310-5461.71.21424Keywords:
distributed information system, function redistribution, binary variables, combinatorial optimisation, branch-and-bound algorithm, partial physical destruction, assignment problemAbstract
This article addresses the problem of restoring operability of a distributed information system (DIS) that has undergone partial physical destruction with data processing centres put out of service. Such restoration is carried out by redistributing the functions of damaged nodes among the surviving elements of the system. Under conditions of physical damage to the entire system or its individual elements, it is important not only to restore the connectivity of the system, but also to ensure the execution of critical functions that were assigned to it and fixed at the lost nodes. The loss of computing resources can lead to service degradation, reduced performance and disruption of data processing integrity.
The paper considers a basic variant of the redistribution problem in which the entire set of functions of a lost node can be transferred to one of the surviving elements without splitting it into parts. Memory is also taken as the primary resource. Side effects related to possible slowdown of surviving nodes due to increased memory usage are not considered at this stage.
The proposed method is aimed at adapting the DIS to new operating conditions by delegating functional loads from damaged nodes to surviving ones, taking into account their residual memory. The approach is based on representing the system as a weighted graph, where surviving vertices are characterised by available memory and damaged ones by the amount of memory required to restore their functionality.
The relevance of the study is driven by the growing role of distributed information systems in critical areas, including military, energy, transport, etc., where physical destruction of infrastructure can lead to the loss of nodes along with the functions assigned to them. The ability to promptly transfer a complete set of functions to surviving elements will ensure continuity of key services without the need for immediate restoration of damaged equipment.
The scientific novelty of the proposed method lies in formalising the problem of redistributing functions of damaged nodes as a placement problem with a single resource constraint on memory and a prohibition on splitting functional complexes. This approach allows narrowing the space of possible solutions by pre-selecting surviving nodes that have sufficient residual memory to accept the full set of functions of the disabled element. This ensures computational simplicity and creates a basis for further model extension with additional resources and performance indicators.
References
Kirti, A. K., Maurya, R. S., & Yadav, R. S. (2023). Fault tolerance of deadline constrained tasks based on load balancing in cloud computing. In Proceedings of the 14th International Conference on Computing Communication and Networking Technologies (ICCCNT). IEEE. https://doi.org/10.1109/ICCCNT56998.2023.10307764
Khalil, M. I. K., Ahmad, I., & Almazroi, A. A. (2019). Energy efficient indivisible workload distribution in geographically distributed data centers. IEEE Access, 7, 82672–82680. https://doi.org/10.1109/ACCESS.2019.2924130
Nauss, R. M. (2003). Solving the generalized assignment problem: An optimizing and heuristic approach. INFORMS Journal on Computing, 15(3), 249–266. https://doi.org/10.1287/ijoc.15.3.249.16075
Öncan, T. (2007). A survey of the generalized assignment problem and its applications. INFOR: Information Systems and Operational Research, 45(3), 123–141. https://doi.org/10.3138/infor.45.3.123
Liu, H., Ma, R., Shi, H., & Zhang, G. (2022). Online generalized assignment problem with historical information. Theoretical Computer Science, 922, 438–446. https://doi.org/10.1016/j.tcs.2022.04.041
Bradley, S., Hax, A., & Magnanti, T. (1977). Applied mathematical programming. Addison-Wesley. https://web.mit.edu/15.053/www/AMP-Chapter-09.pdf
Erden, E., & Altınel, İ. K. (2018). Restoration of services in disrupted infrastructure systems: A network science approach. PLOS ONE, 13(2), Article e0192272. https://doi.org/10.1371/journal.pone.0192272
Almoghathawi, Y., Selim, S., & Barker, K. (2023). Community structure recovery optimization for partial disruption, functionality, and restoration in interdependent networks. Reliability Engineering and System Safety, 229, Article 108810. https://doi.org/10.1016/j.ress.2022.108810
Kempe, D., Kleinberg, J., & Demers, A. (2012). Optimal recovery of damaged infrastructure network. arXiv. https://arxiv.org/abs/1207.2799
Morrison, D. R., Jacobson, S. H., Sauppe, J. J., & Sewell, E. C. (2016). Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optimization, 19, 79–102. https://doi.org/10.1016/j.disopt.2016.01.005
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Rodion Lytvynenko
This work is licensed under a Creative Commons Attribution 4.0 International License.
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.
