![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Heuristics Load Balancing Algorithms for Video on Demand Servers
Subscribe/Renew Journal
The Web Services have gained considerable attention over the last few years. Video-on-Demand (VoD) systems haveresulted in speedy growth of the web traffic. Therefore the concept of load balancer aimed to distribute the tasks to different Web Servers to reduce response times was introduced. This paper attempts to analyze the performance of FCFS, Randomized, Genetic algorithms and Heuristics algorithms for selecting server to meet the VoD requirement. Performances of these algorithms have been simulated with parameters like makespan and average resource utilization for different server models. This paper presents an efficient heuristic called Ga-max-min for distributing the load among servers. Heuristics like min-min and max-min are also applied to heterogeneous server farms and the result is compared with the proposed heuristic for VOD Servers. Ga-max-min was found to provide lower makespan and higher resource utilization than the genetic algorithm.
Keywords
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 183
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 3