The purpose of this paper is to determine the values of the parameters in a new method (Dynamic Weighted Round-Robin, DWRR) developed for solving Internet traffic jam problems. Using the traditional Round-Robin (RR) method as a base, DWRR was developed to efficiently control loads in a multiple-link network. Unlike least-load algorithm, DWRR does not need to trace system loads continually, but achieves a far better load balancing than RR does. Mathematical functions are developed for predicting the optimal time interval of detection of line loads in this method, while the concept of variance in statistics is used as the criterion for evaluating the load balance level. A couple of related coefficients have also been determined by analyzing the simulation data. A centralized gateway with a multi-link-load-balancer is modeled for explaining the proposed algorithm. In addition, both theoretical and practical approaches are provided in this paper, along with performance comparisons between them. The results obtained from the computational experiments show that DWRR achieves a superior network loads balancing.
