Under high loads, a multimedia duster server can serve many hundreds of connections concurrently, where a load balancer distributes the incoming connection request to each node according to a preset algorithm. Among existing scheduling algorithms, round-Robin and least-connection do not take into account the difference of service capability of each node and improved algorithms such as weighted round-Robin and weighted least-connection. They also do not consider the fact that the ratio of number of TCP connections and the fixed weight does not reflect the real load of node. In this paper we introduce our attempts in improving the scheduling algorithms and propose a variable weighted least-connection algorithm, which assigns variable weight, instead of fixed weight, to each node according to its real time resource. A validating trial has been performed and the results show that the proposed algorithm has effective load balancing in one central control node scenario.
展开▼
