Dmytro Vovchenko

Work place: Computer Systems Software Department, Faculty of Program Systems and Applied Mathematics, Igor Sikorsky Kyiv Polytechnic Institute, Kyiv, 03056, Ukraine

E-mail: dvovchenko1313@gmail.com

Website: https://orcid.org/0009-0008-1806-5159

Research Interests:

Biography

Dmytro Vovchenko, PhD student at the Computer Systems Software Department, Faculty of Program Systems and Applied Mathematics, National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Ukraine. He is currently working on his dissertation in the field of distributed software systems and intelligent load balancing. He is the author and co-author of several scientific publications related to big data processing and adaptive load balancing approaches. His research focuses on cloud technologies, distributed multi-node systems, machine learning, and the advancement of artificial intelligence. He is particularly interested in software system performance analysis, including the identification of bottlenecks in web applications, inefficient resource utilization, unoptimized queries, and database-level performance issues that impact overall system efficiency.

Author Articles
Intelligent Load Balancing Framework for Distributed Big Data Processing System

By Ivan Dychka Liubov Oleshchenko Dmytro Vovchenko Zhengbing Hu

DOI: https://doi.org/10.5815/ijwmt.2026.03.05, Pub. Date: 8 Jun. 2026

This paper proposes an intelligent load balancing framework for distributed big data processing systems that integrates machine learning techniques with adaptive weight-based decision mechanisms. The study addresses limitations of traditional static load balancing methods, which do not account for dynamic workload variations and heterogeneous request characteristics, leading to inefficient resource utilization and bottlenecks in multi-node environments. The proposed approach combines an online learning model for real-time estimation of request complexity with multi-parameter evaluation of node states, including CPU utilization, memory consumption, queue length, response latency, and cache efficiency. A dynamic weighting strategy is used to construct an integrated load indicator for adaptive request distribution across nodes. The framework is deployed within a multi-layer distributed architecture consisting of clustered application servers, distributed databases, caching subsystems, and monitoring components, ensuring scalable and fault-tolerant processing. For evaluation, a three-node simulation environment was used with 10,000 heterogeneous requests, followed by extended testing on semi-realistic workload traces derived from web traffic patterns and database query logs. The dataset included over 1.2 million requests, capturing bursty arrivals, skewed distributions, and heterogeneous complexity. Experimental results show that the proposed method improves load distribution uniformity to 6%, reduces average response time to 210 ms, and increases throughput up to 13,800 requests per second. Statistical validation using confidence intervals and hypothesis testing confirms a 47% (±3.2% at 95% confidence level) reduction in mean response time and throughput improvement up to 14,200 requests per second under realistic workloads. 

[...] Read more.
Other Articles