Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
Local search for load balancing problems for servers with large dimension. / Davydov, I. A.; Melnikov, A. A.; Kononova, P. A.
в: Automation and Remote Control, Том 78, № 3, 01.03.2017, стр. 412-424.Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
}
TY - JOUR
T1 - Local search for load balancing problems for servers with large dimension
AU - Davydov, I. A.
AU - Melnikov, A. A.
AU - Kononova, P. A.
PY - 2017/3/1
Y1 - 2017/3/1
N2 - We consider a new load balancing model that arises in the processing of user requests for files located on a given set of servers. The optimization criterion is the total excess of actual load over the limit load. In order to redistribute the load and minimize the criterion, files can be moved between the servers. We show that if there are no other constraints related to the stage of moving the files, then this problem is equivalent to a problem previously considered in literature. For this special case of this problem, we propose a stochastic local search scheme that combines a special procedure for fast querying of the neighborhoods and a procedure of non-aggravating modification of intermediate solutions. Results of numerical experiments show that the proposed approach is able to find high-quality solutions for instances of large dimension under tight time constraints.
AB - We consider a new load balancing model that arises in the processing of user requests for files located on a given set of servers. The optimization criterion is the total excess of actual load over the limit load. In order to redistribute the load and minimize the criterion, files can be moved between the servers. We show that if there are no other constraints related to the stage of moving the files, then this problem is equivalent to a problem previously considered in literature. For this special case of this problem, we propose a stochastic local search scheme that combines a special procedure for fast querying of the neighborhoods and a procedure of non-aggravating modification of intermediate solutions. Results of numerical experiments show that the proposed approach is able to find high-quality solutions for instances of large dimension under tight time constraints.
KW - combinatorial optimization
KW - packing problems
KW - randomized neighborhood
KW - stochastic local search
UR - http://www.scopus.com/inward/record.url?scp=85014951422&partnerID=8YFLogxK
U2 - 10.1134/S0005117917030031
DO - 10.1134/S0005117917030031
M3 - Article
AN - SCOPUS:85014951422
VL - 78
SP - 412
EP - 424
JO - Automation and Remote Control
JF - Automation and Remote Control
SN - 0005-1179
IS - 3
ER -
ID: 9028907