Server Optimization Using Heuristic Algorithms for Dynamic-Split-and-Merge Scheme in Wireless Multicast | Science Publications

Journal of Computer Science

R. Sukumar¹  V. Vasudevan¹ 

关键词: Heuristic algorithm;    load balancing;    dynamic split and merge;   

DOI  :  10.3844/jcssp.2009.956.961

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

Problem statement: In order to minimize the overall network traffic in a multiserver system, the number of users served by each server (and hence the group size) should remain constant. As the underlying traffic fluctuates, a split and merge scheme is implemented in a physical server to achieve load balancing. Approach: Minimizing the number of servers during the merge operation is NP hard and to achieve these two algorithms namely FFD bin packing algorithm and LL algorithm were proposed to find the near optimal values of destination servers. Results: The performance of these algorithms were analyzed and compared based on several parameters. Conclusion: Results showed that LL algorithm outperforms FFD algorithm.

【 授权许可】

Unknown