Title: Journal of Telecommunications and Information Technology, Load Balancing Based on Optimization Algorithms: An Overview, 2019, nr 4


Combinatorial optimization challenges are rooted in real-life problems, continuous optimization problems, discrete optimization problems and other significant problems in telecommunications which include, for example, routing, design of communication networks and load balancing. Load balancing applies to distributed systems and is used for managing web clusters. It allows to forward the load between web servers, using several scheduling algorithms. The main motivation for the study is the fact that combinatorial optimization problems can be solved by applying optimization algorithms. These algorithms include ant colony optimization (ACO), honey bee (HB) and multi-objective optimization (MOO). ACO and HB algorithms are inspired by the foraging behavior of ants and bees which use the process to locate and gather food. However, these two algorithms have been suggested to handle optimization problems with a single-objective. In this context, ACO and HB have to be adjusted to multiobjective optimization problems. This paper provides a summary of the surveyed optimization algorithms and discusses the adaptations of these three algorithms. This is pursued by a detailed analysis and a comparison of three major scheduling techniques mentioned above, as well as three other, new algorithms (resulting from the combination of the aforementioned techniques) used to efficiently handle load balancing issues


National Institute of Telecommunications



Resource Identifier:

ISSN 1509-4553, on-line: ISSN 1899-8852 ; oai:bc.itl.waw.pl:2110


Journal of Telecommunications and Information Technology



Rights Management:

Biblioteka Naukowa Instytutu Łączności

Object collections:

Last modified:

Feb 21, 2020

In our library since:

Feb 21, 2020

Number of object content hits:


All available object's versions:


Show description in RDF format:


Show description in OAI-PMH format:




Citation style:

This page uses 'cookies'. More information