Dynamic-Distributed Load Balancing for Highly-Performance and Responsiveness Distributed-GIS (D-GIS)

Aissatou Diasse, Foroski Kone
DOI: 10.4236/jgis.2011.32009                

Abstract

In recent years, several results have been introduced to enhance distributed GIS performance. While much more efforts have focused on tile map and simple symbologies on dynamic map, load balancing GIS servers have not been addressed by the GIS community so far. This paper, therefore, proposed dynamic distributed load balancing for D-GIS in order to quickly render information to client interface by involving a set of GIS servers which process clients’ requests depending of an algorithm. In the model, several concepts were introduced and defined: Virtual Server within physical machine which constitutes a setup environment for a single GIS server, Load Hash Table which contains information about virtual server’s capacity, real-time load and other mandatory elements, Request Split Table which splits requests depending of the input area’s Quantity of Information and stores request tasks composition for later reconstitution. At last we have Distributed Failover Callback Function Table level one (respectively level two) which determines whether or not the request had been successfully processed by the chosen virtual server (respectively physical machine). This table allows sending back the same request to another virtual server (respectively physical node). Two load handlers (primary and secondary) are defined in case of failure. Our Model achieves efficient load balancing by: providing efficient node selection; optimizing request routing; managing node failover; involving client’s request partitioning and introducing method type decomposition. A simulation of the algorithm shows a low response time when performing GIS operations.

Keywords

Load Balancing, Distributed-GIS, Performance, Responsiveness

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	S. Malik, “Dynamic Load Balancing in a Network of Workstation,” 95.515 Research Report, 19 November, 2000.
[2]	Sandeep Sharma, Sarabjit Singh, and Meenakshi Shar- ma, “Performance Analysis of Load Balancing Algorithms,” Proceedings of World Academy of Science, Engineering and Technology, Vol. 38, 2008.
[3]	Y. R. Lan, “A Dynamic Load Balancing Mechanism for Distributed Systems,” Journal of Computer Science and Technology, Vol. 11, No. 3, 1996, pp. 192-207.
[4]	A. Sayer, “Thesis Proposal: High Performance, Federation and Service-Oriented Geographic Information Systems,” Indiana university, Indiana.
[5]	P. S. Zhao and C. J. Yang, “The Study on the Architecture of Web-GIS by Institute of RS Applications,” Chinese Academy of Sciences,Beijing.
[6]	D. L. Eager, E. D. Lazowska and John Zahorjan, “Adaptive Load Sharing in Homogeneous Distributed Systems,” IEEE Transactions on Software Engineering, Vol. 12, No. 5, May 1986, pp. 662-675.
[7]	A. Sharma, S. Singh, and Meenakshi, “Sharma: Performance Analysis of Load Balancing Algorithms,” Proceedings of World Academy of Science, Engineering and Technology, Vol. 38, 2008. http://masters.donntu.edu.ua/2010/fknt/babkin/li- brary/article11.pdf
[8]	B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp and I. Stoica, “Load Balancing in Dynamic Structured P2P Systems,” Performance Evaluation, Vol. 63, No. 3, 2006, pp. 217-240. http://www.ieee-infocom.org/2004/Papers/46_4.PDF
[9]	J. Feigenbaum and S. Shenker, “Distributed Algorithmic Mechanism Design Recent Results and Future Directions,” DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications, New York, 2002.
[10]	T. Horanont, N. K. Tripathi and R. Raghavan, “A Comparative Asseessment of Internet GIS Server systems,” Space Technology Applications and Research Program, School of Advanced Technologies Asian Institute of Technology, Thailand, 2005.
[11]	W. J. Bolosky, J. R. Douceur, D. Ely and M. Theimer, “Feasibility of a Serverless Distributed File System an Existing Set of Desktop PCs,” Proceedings of the deployed on International Conference on Measurement and Modeling of Computer Systems, Santa Clara, CA, June 2000, pp. 34-43.
[12]	J. Ledlie and M. Seltzer, “Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn,” Division of Engineering and Applied Science, Harvard University, September 2009. http://dash.harvard.edu/bitstream/handle/1/2962660/Seltzer_DistributedSecure.pdf?sequence=2
[13]	P. B. Godfrey and I. Stoica , “Heterogeneity and Load Balance in Distributed Hash Tables,” Computer Science Division, University of California, Berkeley.
[14]	D. R. Karger and M. Ruhl, “Simple Efficient Load Balancing Algorithm for Peer-to-Peer Systems,” SPAA '04 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004. http://static.googleusercontent.com/external_content/untrusted_dlcp/research.google.com/fr//pubs/archive/33339.pdf
[15]	A. Rao, K. Lakshminarayanan, S. Surana, R. Karp and I. Stoica, “Load Balancing in Structured P2P Systems,” Proceedings of IEEE INFOCOM, February, 2003. http://www.ieee-infocom.org/2004/Papers/46_4.PDF
[16]	F. Dabek, M. F. Kaashoek, D. Karger, R. Morris and I. Stoica, “Wide-area Cooperative Storage with CFS,” SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles, Vol. 35, No. 5, pp. 202-215.
[17]	Hash Table from Wikipedia the Free Encyclopaedia, Access on April 2010. http://en.wikipedia.org/wiki/Hash_table
[18]	Virtual Server form Wikipedia. http://en.wikipedia.org/wiki/Virtual_private_server
[19]	L. P. Cox and B. D. Noble, “Samsara: Honor among Thieves in Peer-to-Peer Storage,” Department of Electrical Engineering and Computer Science, University of Michigan Ann Arbor, MI 48109-2122. Page 4. http://www.eecs.harvard.edu/~mema/courses/cs264/papers/samsara-sosp2003.pdf