Dynamic Algorithm for Load Distribution Between Computing Resources of Cloud Environments

The article considers the development of a dynamic algorithm for distributing and balancing the load, characterized by nonlinear parameters and fractal structure, between the computing resources of cloud data centers (DCs). A rationale is given for the application of methods of nonlinear dynamics and chaos theory to solving this problem, which is based on the topological similarity of the behavior of deterministic chaotic systems and the input network load of the data center. The load randomness test was conducted by calculating Lyapunov indices. To eliminate noise components of network traffic, the principal component method of its time series was applied. The problem of phase space reconstruction is solved by the delay method based on the embedding theorem and the average mutual information method. Based on this reconstruction, a method for predicting the load dynamics was developed. It was presented in the form of a system of discrete mappings connected by an algebraic polynomial, providing successful prediction of irregular time series and forming the basis for constructing a matrix for distributing data center resources. The aim of the article is to increase the efficiency of using the resources of data center cluster servers in conditions of a fractal structure of the network load by developing a dynamic algorithm for its distribution and balancing based on nonlinear dynamics methods.

Authors

Institutions

Publication Details

Published
2025-03-24
DOI
https://doi.org/10.1109/smartindustrycon65166.2025.10986176
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Algorithm for Load Distribution Between Computing Resources of Cloud Environments

Natal'ya Yu. Bratchenko, Valery P. Mochalov, Dar'ya V. Gosteva
Cloud Computing and Resource Management
article

Dynamic Algorithm for Load Distribution Between Computing Resources of Cloud Environments

Natal'ya Yu. Bratchenko, Valery P. Mochalov, Dar'ya V. Gosteva
article en

Abstract

The article considers the development of a dynamic algorithm for distributing and balancing the load, characterized by nonlinear parameters and fractal structure, between the computing resources of cloud data centers (DCs). A rationale is given for the application of methods of nonlinear dynamics and chaos theory to solving this problem, which is based on the topological similarity of the behavior of deterministic chaotic systems and the input network load of the data center. The load randomness test was conducted by calculating Lyapunov indices. To eliminate noise components of network traffic, the principal component method of its time series was applied. The problem of phase space reconstruction is solved by the delay method based on the embedding theorem and the average mutual information method. Based on this reconstruction, a method for predicting the load dynamics was developed. It was presented in the form of a system of discrete mappings connected by an algebraic polynomial, providing successful prediction of irregular time series and forming the basis for constructing a matrix for distributing data center resources. The aim of the article is to increase the efficiency of using the resources of data center cluster servers in conditions of a fractal structure of the network load by developing a dynamic algorithm for its distribution and balancing based on nonlinear dynamics methods.

North-Caucasus Federal University (RU)
Openalex Percentile: Top 86%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.