Open AccessBio‐inspired Load Balancing Routing for Delay‐Guaranteed Services in Ever‐Changing Networks
Author(s) -
Kim YoungMin,
Kim Hak Suh,
Jung BooGeum,
Park HeaSook,
Park HongShik
Publication year - 2013
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.13.1812.0114
Subject(s) - computer science , load balancing (electrical power) , network delay , distributed computing , network topology , computer network , routing (electronic design automation) , exploit , ant colony , ant colony optimization algorithms , algorithm , mathematics , geometry , computer security , network packet , grid
We consider a new load balancing routing for delay‐guaranteed services in the network in which the traffic is dynamic and network topologies frequently change. For such an ever‐changing network, we propose a new online load balancing routing called AntLBR, which exploits the ant colony optimization method. Generally, to achieve load balancing, researchers have tried to calculate the traffic split ratio by solving a complicated linear programming (LP) problem under the static network environment. In contrast, the proposed AntLBR does not make any attempt to solve this complicated LP problem. So as to achieve load balancing, AntLBR simply forwards incoming flows by referring to the amount of pheromone trails. Simulation results indicate that the AntLBR algorithm achieves a more load‐balanced network under the changing network environment than techniques used in previous research while guaranteeing the requirements of delay‐guaranteed services.