Improved Adaptive Routing Algorithm in Distributed Data Centers
Dmitry Perepelkin, Maria Ivanchikova
DOI: 10.15598/aeee.v15i3.2185
Abstract
Currently, telecom operators use virtualization of network infrastructure based on Data Centers (DCs). But when a company grows to a certain size and one DC is not sufficient, there are questions how to further develop the network infrastructure. There is a need to expand existing DC boundaries or to add new elements in the network structure. In this paper, we propose improved adaptive routing algorithm in distributed networks of DCs with united service providers, which increases the efficiency of adaptive routing process during dynamic adding of nodes or communication links. The mathematical model and enlarged form of algorithm are shown in the work. In the paper, a comparison of the proposed algorithm with known analogies, such as modified Dijkstra’s algorithm and paired transitions algorithm, is performed. To validate the correctness of proposed algorithm, we developed software for simulation of adaptive routing processes in networks of distributed DCs. Comparative analysis of adaptive routing algorithms in distributed networks of DCs with united service providers confirms the effectiveness of the proposed approach and reduces the complexity of constructing routing tables to the value O(mN).