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, AK algorithm improves 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％.

关键词： distributed SLEE service provisioning load balancing stale information

作者: Yao Zhao Fangchun Yang

作者单位: State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing,China

会议类型: 国际会议

会议名称: 第二届IEEE无线通讯、网络技术暨移动计算国际会议

会议地点: 武汉

会议语种:英文

在线出版日期: 2006-09-01（万方平台首次上网日期，不代表论文的发表时间）