Study of enterprise load balancing algorithms using model-based design

Authors

  • K. A. Aidarov al-Farabi Kazakh National University, Almaty, Republic of Kazakhstan
  • A. Zh. Almatov al-Farabi Kazakh National University, Almaty, Republic of Kazakhstan

Keywords:

load balancing, discrete-event simulation, model based design, probabilistic modeling

Abstract

Given work describes load balancing algorithms for external services with unspecified clients used in real enterprise facilities. Simplest example of such service is a pair of a web server and a browser. Principles of load balancing, their pros and cons are considered, their implementation and applicability to different services are described. Algorithms of load balancing for DNS Round Robin, Direct Routing, Redirect methods are studied. Result of model implementation for cluster system allowed to obtain estimations of oscillation effect decrease between its overloaded and normal states. As a conclusion recommendations for using implemented model of queuing network for different enterprise services of user request processing are given.

References

[1] Al-Amri, M. S., and S. E. Ahmed. "New job selection and location policies for load-distributing algorithms."International Journal of Network Management 12, no. 3 (2002): 165-78. doi:10.1002/nem.428.
[2] Aversa, R., B. Di Martino, N. Mazzocca, and S. Venticinque. "A hierarchical distributed-shared memory parallel Branch&Bound application with PVM and OpenMP for multiprocessor clusters."Parallel Computing 31, no. 10-12 (2005): 1034-047. doi:10.1016/j.parco.2005.03.010.
[3] Borkar, G. M., M. A. Pund, and P. Jawade. "Implementation of round robin policy in DNS for thresholding of distributed web server system."Proceedings of the International Conference & Workshop on Emerging Trends in Technology – ICWET ’11, 2011, 198-201. doi:10.1145/1980022.1980067.
[4] Barros, F. J. "Modeling and simulation of parallel adaptive divide-and-conquer algorithms."The Journal of Supercomputing 43, no. 3 (2007): 241-55. doi:10.1007/s11227-007-0143-3.
[5] Eckstein, J., W. E. Hart, and C. A. Phillips. PEBBL: an object-oriented framework for scalable parallel branch and bound."Mathematical Programming Computation 7, no. 4 (2015): 429-69. doi:10.1007/s12532-015-0087-1.
[6] Geist, R., and K. Trivedi. "Queueing Network Models in Computer System Design."Mathematics Magazine 55, no. 2 (1982): 67. doi:10.2307/2690049.
[7] Kameda, H., J. Li, C. Kim, and Y. Zhang. "Overall Optimal Load Balancing vs. Individually Optimal Load Balancing."Optimal Load Balancing in Distributed Computer Systems Telecommunication Networks and Computer Systems, 1997, 35-97. doi:10.1007/978-1-4471-0969-3_2. "ALBL: an adaptive load balancing algorithm for distributed web
[8] Kontogiannis, S., and A. Karakos. systems."International Journal of Communication Networks and Distributed Systems 13, no. 2 (2014): 144. doi:10.1504/ijcnds.2014.064041.
[9] Krislock, N., J. Malick, and F. Roupin. "BiqCrunch."ACM Transactions on Mathematical Software 43, no. 4 (2017): 1-23. doi:10.1145/3005345.
[10] Martin, R. C. Agile software development principles, patterns, and practices. Harlow: Pearson Education Ltd, 2014.
[11] MathWorks "SimEvents User’s Guide."The MathWorks Inc., Natick, MA, USA (2016): 208 p.
[12] MathWorks "Simulink User’s Guide."The MathWorks Inc., Natick, MA, USA (2016): 3290 p.
[13] Mazzucco, M., I. Mitrani, J. Palmer, M. Fisher, and P. Mckee. "Web Service Hosting and Revenue Maximization."Fifth European Conference on Web Services (ECOWS’07), 2007. doi:10.1109/ecows.2007.8.
[14] Mitrani, I. Probabilistic modelling. Cambridge: Cambridge University Press, 2004.
[15] Navarre, D., P. Palanque, and R. Bastide. "Model-Based Interactive Prototyping of Highly Interactive Applications."Computer-Aided Design of User Interfaces III (2002): 205-16. doi:10.1007/978-94-010-0421-3_18.
[16] Teo, Y. M., and R. Ayani. "Comparison of Load Balancing Strategies on Cluster-based Web Servers."Simulation 77, no. 5-6 (2001): 185-95. doi:10.1177/003754970107700504.
[17] Waraich, S. S. "Classification of Dynamic Load Balancing Strategies in a Network of Workstations."Fifth International Conference on Information Technology: New Generations (itng 2008), 2008, 1263-265. doi:10.1109/itng.2008.166.
[18] Wimmer, M., D. Cederman, J. Larsson Träff, and P. Tsigas. "Work-stealing with configurable scheduling strategies."ACM SIGPLAN Notices 48, no. 8 (2013): 315. doi:10.1145/2517327.2442562.
[19] Wrzesinska, G., A. Oprescu, T. Kielmann, and H. Bal. "Persistent Fault-Tolerance for Divide-and-Conquer Applications on the Grid."Euro-Par 2007 Parallel Processing Lecture Notes in Computer Science: 425-36. doi:10.1007/978-3-540-74466-5_46.

Downloads

Published

2018-06-27