Sofiane Mounine Hemam
ABSTRACT
Load balancing consists in distributing the work of a dedicated server on two or more other systems in order to optimize resource utilization, and response time.
In the context of Peer To Peer system, nodes can join or leave the system at any time which affect negatively on the distribution of the load between nodes that provide the Web Service.
In this paper, we propose an algorithm which allows balancing the load between nodes, and takes into consideration the probability of nodes failure in selecting the Web server in order to give a strong chance to requests to be executed without problem.
- Milojicic, D-D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard B., Rollins S. and Xu, Z. 2002. P2P Computing. http://www.hpl.hp.com/techreports/2002/HPL-2002-57.pdfGoogle Scholar
- Shirky, C. 2001. What is P2P and What Isn't. In O'Reilly Peer to Peer and Web Service Conference, Washington. http://conferences.oreillynet.com/p2p/.Google Scholar
- Theotokis, S. A. and Spinellis D. 2004. A survey of peer-to-peer content distribution technologies. ACM Computing Surveys. 36, 4 (2004), 335--371. Google ScholarDigital Library
- Loo, A. W. S. 2006. Peer-to-Peer Computing: Building Supercomputers with Web Technologies. Edition Springer, 2006. Google ScholarDigital Library
- Cardellini, V., Colajanni, M., and Yu, P. S. 1999. Dynamic Load Balancing on Web-Server Systems. IEEE Internet Computing. (1999), 28--39. Google ScholarDigital Library
- MoseDale, D., Foss, W., McCool, R., and Lesson, L. 1997. Administering Netscape's Internet Site. IEEE Internet Computing. 1 (1997), 28--35. Google ScholarDigital Library
- Yoshikawa, C., Chun, B., Eastham, P., Vahdat, A., Anderson, T., and Culler, D. 1997. Using Smart Clients to Build Scalable Services. In Proceeding Usenix. (1997), 105--117 Google ScholarDigital Library
- Brisco, T. 1995. DNS Support for Load Balancing. RFC 1794, Rutgers University, (April 1995). Google ScholarDigital Library
- Dias, D., Kish, W., Mukherjee, R., Tewari, R. 1996. A Scalable and Highly Available Web-Server. In Proceeding 41st International Computer Conference (San Jose, CA, 1996). COMPCON'96, 85--92. Google ScholarDigital Library
- Mod_backhand, http://www.backhand.org/mod_backhand/Google Scholar
- Schlossnagle, T. 2000. The Backhand Project: Load balancing and Monitoring Apache Web Clusters. In Proceeding ApacheCon Europe 2000, (London, Britain, 2000).Google Scholar
- Tse, S. S. H. 2013. Online Balancing Two Independent Criteria upon Placements and Deletions, IEEE Transactions on Parallel and Distributed Systems. 24, 8 (August 2013), 1644--1650. Google ScholarDigital Library
- Tse, S. S. H. 2012. Online Bounds on Balancing Two Independent Criteria with Replication and Reallocation, IEEE Transactions on Computers. 61, 11, (November 2012), 1601--1610. Google ScholarDigital Library
- Tse, S. S. H. 2009. Online Bicriteria Load Balancing using Object Reallocation. IEEE Transactions on Parallel and Distributed Systems. 20, 3, (March 2009), 379--388. Google ScholarDigital Library
- Tse, S. S. H. 2005. Approximate Algorithms for Document Placement in Distributed Web Servers. IEEE Transactions on Parallel and Distributed Systems. 16, 6, (June 2005), 489--496. Google ScholarDigital Library
- Dongarra, J. J., Saule, E., Jeannot, E., Shi, Z. 2007. Biobjective Scheduling Algorithms for Optimizing Makespan and Reliability on Heterogeneous Systems. In proceeding the nineteenth annual ACM symposium on Parallel algorithms and architectures (2007). New York, NY, USA, 280--288 Google ScholarDigital Library
- Hemam, S. M., and Hidouci, K. W. 2012. D3-P2P: Managing Distributed and Replicated Database in P2P Environment by Using Quorum System. Journal of Digital Information Management JDIM. 10, 6. (December, 2012), 351--364.Google Scholar
- Hemam, S. M. and Hidouci, K. W. 2011. Towards a Novel Architecture for Managing Distributed and Replicated Database in P2P System with Node Dynamicity. In Proceeding 2nd World Conference on Information Technology, Antalya Turkey (November 2011), 99--100Google Scholar
- Peersim, 2010. http://peersim.sourceforge.net.Google Scholar
Index Terms
- Load balancing by requests redistribution In failure nodes context
Recommendations
Dynamic load balancing in RCAN content addressable network
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and CommunicationRCAN [1] is a novel multi-ring content addressable peer-to-peer system. RCAN was proposed in the aim of improving the routing performance of CAN [4] overlays while minimizing the maintenance overhead during nodes churn in large networks. The key idea of ...
A Load Balancing Method under Zipf-Like Requests Distribution in DHT-Based P2P Network Systems
WISM '09: Proceedings of the 2009 International Conference on Web Information Systems and MiningDHT-based peer-to-peer systems have been proposed in the past few years. Scalability, fault tolerance and searching speed of the DHT based P2P systems have been greatly improved in contrast to the unstructured P2P systems. These DHT-base systems have ...
The Benefits of Estimated Global Information in DHT Load Balancing
CCGRID '11: Proceedings of the 2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid ComputingDistributed hash tables (DHT) often rely on uniform hashing for balancing the load among their nodes. However, the most overloaded node may still have a load up to O(log N) times higher than the average load. DHTs with support for range queries cannot ...
Comments