Effect of Service Broker Policies and Load Balancing Algorithms on the Performance of Large Scale Internet Applications in Cloud Datacenters
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 5
Abstract
Cloud computing is advancing rapidly. With such advancement, it has become possible to develop and host large scale distributed applications on the Internet more economically and more flexibly. However, the geographical distribution of user bases, the available Internet infrastructure within those geographical areas, and the dynamic nature of usage patterns of the user bases are critical factors that affect the performance of these applications. Therefore, it is necessary to compromise between datacenters, service broker policies, and load balancing algorithms to optimize the performance of the application and the cost to the owners. This paper aims at studying the effect of service broker policies and load balancing algorithms on the performance of large-scale Internet applications under different configurations of datacenters. To achieve this goal, we modeled the behavior of the popular Facebook application with the most recent worldwide users’ statistics. Then, we evaluated the performance of this application under different configurations of datacenters using: 1) two different service broker policies, namely, closest datacenter and optimum response time; and 2) three load-balancing algorithms, namely, round robin, equally spread current execution, and throttled load balancer. The overall average response time of the application and the overall average time spent for processing a user request by a datacenter are measured and the results are discussed. This study would help service providers generate valuable insights on coordination between datacenters, service policies, and load balancing algorithms when designing Cloud infrastructure services in geographically distributed areas. In addition, application designers would benefit greatly from this study in identifying the optimal arrangement for their applications.
Authors and Affiliations
Ali Meftah, Ahmed E. Youssef, Mohammad Zakariah
Keywords
Related Articles
- EP ID EP316301
- DOI 10.14569/IJACSA.2018.090529
- Views 82
- Downloads 0
General Characteristics and Common Practices for ICT Projects: Evaluation Perspective
In today’s business world, organizations are more dependent on Information and Communication Technologies (ICT) resources. Cloud services, communication services and software services are most common resources, enterpris...
Implementation of Cooperative Spectrum Sensing Algorithm using Raspberry Pi
A novel cooperative spectrum sensing algorithm is implemented and analyzed using Raspberry Pi. In the proposed setup, Nokia cell phone is used as a spectrum sensing device while Raspberry Pi functions as a FC device to c...
An Empirical Investigation of Predicting Fault Count, Fix Cost and Effort Using Software Metrics
Software fault prediction is important in software engineering field. Fault prediction helps engineers manage their efforts by identifying the most complex parts of the software where errors concentrate. Researchers usua...
THE BITWISE OPERATIONS RELATED TO A FAST SORTING ALGORITHM
In the work we discuss the benefit of using bitwise operations in programming. Some interesting examples in this respect have been shown. What is described in detail is an algorithm for sorting an integer array with the...
Modeling Mechanical and Electrical Uncertain Systems using Functions of Robust Control MATLAB Toolbox®3
Uncertainty is inherent property of all real life control systems, and this is due to that there is nothing constant practically; all parameters are going to change under some environmental circumstances, therefore contr...