Cost Based Load Balancing for Network Geographic Information Service
Wu Zeng · Acta Geodaetica et Cartographica Sinica · 2009
A distributed least cost algorithm is proposed by taking into account the waiting time of terrain tile request in server queue and the process time of it in server,based on an unit time cost vector.Dispatch probability space for each server is calculated and target server is determined through the landing point of a temporarily generated random number in the probability space.The scalability of the algorithm is satisfactory and the maintenance and update of clustered servers is flexible by configuring the unit time cost vector.Extensive simulations indicate that,for terrain tile requests of large-scale and high intensity,the least cost algorithm can balance servers' load efficiently and response the requests with minimal time.Simulation results also show that under low intensity requests,the considered load balancing algorithms behave approximately the same,while under high intensity request,it is better to design load balancing by considering queue situation of clustered servers.