A Weighted K-Subset Load Balancing Algorithm for Distributed Slee in Next Generation Network

Load balancing with stale information is becoming an increasingly important problem for distributed systems. And k-subset algorithm is promising to address this problem. In this paper, the load balancing problem for distributed SLEE in NGN is studied. Considering the heterogeneity of the clustering system, a load model is designed, and a weighted k-subset (WK) algorithm is proposed. WK improves k-subset algorithm with a weight defined on the process capabilities and the resource capacities of the nodes. Experiments show that WK balances system load effectively, and outperforms k-subset in every situation by about 10%.