A Dynamic Load Balancing Algorithm for Distributed SLEE in Mobile Service Provisioning

Author

Zhao, Yao ; Yang, Fangchun

Author_Institution

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

fYear

2006

fDate

22-24 Sept. 2006

Firstpage

1

Lastpage

4

Abstract

Along with the growth of service type and user number due to network evolution and convergence, higher performance is required for service logic execution environment (SLEE) in service provisioning. In this paper, an accumulated k-subset algorithm (AK algorithm) is proposed to balance load in distributed SLEE. Based on a model of resource heterogeneity and load vector, the AK algorithm improves the k-subset algorithm by accumulating load information within every update interval. Experiments on different update intervals and request arrival rates suggest AK further reduces herd effect due to stale load information, and outperforms k-subset algorithm by 5%-10%

Keywords

3G mobile communication; IP networks; mobile computing; multimedia communication; resource allocation; IP-based multimedia services; accumulated k-subset algorithm; distributed SLEE; dynamic load balancing algorithm; load vector; mobile service provisioning; request arrival rates; resource heterogeneity; service logic execution environment; Clustering algorithms; Containers; Control systems; Heuristic algorithms; Intelligent networks; Load management; Network servers; Round robin; Service oriented architecture; System performance;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2006. WiCOM 2006.International Conference on

Conference_Location

Wuhan

Print_ISBN

1-4244-0517-3

Type

conf

DOI

10.1109/WiCOM.2006.384

Filename

4149561