Research Article Open Access

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

R. Sukumar1 and V. Vasudevan1
  • 1 ,
Journal of Computer Science
Volume 5 No. 12, 2009, 956-961

DOI: https://doi.org/10.3844/jcssp.2009.956.961

Published On: 31 December 2009

How to Cite: Sukumar, R. & Vasudevan, V. (2009). Server Optimization Using Heuristic Algorithms for Dynamic-Split-and-Merge Scheme in Wireless Multicast. Journal of Computer Science, 5(12), 956-961. https://doi.org/10.3844/jcssp.2009.956.961

Abstract

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.

  • 1,243 Views
  • 1,686 Downloads
  • 0 Citations

Download

Keywords

  • Heuristic algorithm
  • load balancing
  • dynamic split and merge, destination servers