Journal of Computer Science

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

R. Sukumar and V. Vasudevan

DOI : 10.3844/jcssp.2009.956.961

Journal of Computer Science

Volume 5, Issue 12

Pages 956-961


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.


© 2009 R. Sukumar and V. Vasudevan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.