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

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%