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

Author

Zhao, Yao ; Yang, Fangchun ; Bai, Dongwei

Author_Institution

State Key Lab. of Networking & Switching Technol., Beijing Univ. of Posts & Telecommun.

fYear

2006

fDate

25-27 Oct. 2006

Firstpage

1

Lastpage

5

Abstract

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%.

Keywords

computer networks; resource allocation; distributed SLEE; distributed systems; next generation network; service logic execution environment; weighted k-subset load balancing algorithm; Clustering algorithms; Containers; Integrated circuit modeling; Intelligent networks; Load management; Load modeling; Network servers; Next generation networking; Round robin; Service oriented architecture; NGN; distributed system; k-subset algorithm; load balancing; stale information;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Networking in China, 2006. ChinaCom '06. First International Conference on

Conference_Location

Beijing

Print_ISBN

1-4244-0463-0

Electronic_ISBN

1-4244-0463-0

Type

conf

DOI

10.1109/CHINACOM.2006.344642

Filename

4149895