Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Acta Geodaetica et Cartographica Sinica》 2009-03
Add to Favorite Get Latest Update

Cost Based Load Balancing for Network Geographic Information Service

WANG Hao1,YU Zhanwu2,LI Rui2,ZENG Wu31.School of Electronic Information,Wuhan University,Wuhan 430079,China;2.State Key Laboratory of Information Engineering in Surveying,Mapping and Remote Sensing,Wuhan University,Wuhan 430079,China;3.Department of Electrical Information Engineering,Wuhan Polytechnic University,Wuhan 430023,China  
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.
【Fund】: 国家973计划(2004CB318206);; 国家863计划(2007AA12Z214)
【CateGory Index】: P208
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved