node rating

A Method for Balancing Server Node Loads Based on Dynamic Ranking Evaluation

This paper addresses the challenge of achieving effective load distribution in information systems operating under dynamic and unpredictable traffic conditions. The study examines traditional static load balancing algorithms, such as Round Robin and Least Connections, and highlights their limitations in adaptive environments. To overcome these constraints, a node rating–based approach is proposed, which dynamically evaluates server states by considering CPU utilization, memory load, and average response time.