Latest revision as of 10:35, 25 January 2021

Abstract

In this paper, the diakoptical method of inter-area routing with load balancing in a telecommunication network was proposed. The method allows to increase the scalability of routing solutions in comparison with the centralized approach without reducing the efficiency of the network, estimated by the maximum value of link load threshold. The method involves the decomposition of the general routing problem in a multi-area network into several routing subtasks of smaller size that can be solved for each individual area followed by combining the solutions obtained for the whole telecommunication network. The foundation of the method is a flow-based routing model based on the implementation of the concept of Traffic Engineering and focused on minimizing the maximum value of link load threshold. The results of the analysis confirmed the operability of the method on a variety of numerical examples and demonstrated the full correspondence of the efficiency of the obtained diakoptical routing solutions to the centralized approach. The advantage of the proposed method is also the absence of the need to coordinate routing solutions received on subnetworks, which positively affects both the time of solving the set task and the amount of service traffic circulated in the network associated with the transfer of data on the state of network areas and coordinating information.

Original document

The different versions of the original document can be found in:

• https://link.springer.com/content/pdf/10.1007%2F978-3-030-43070-2_32.pdf

• http://link.springer.com/content/pdf/10.1007/978-3-030-43070-2_32,

http://dx.doi.org/10.1007/978-3-030-43070-2_32 under the license http://www.springer.com/tdm

• https://link.springer.com/chapter/10.1007%2F978-3-030-43070-2_32,

https://academic.microsoft.com/#/detail/3038082915