Routing method in multi domain software defined networks

AS’AD MAHMOUD AS’AD ALNASER; HAZEM (MOH’D SAID) HATAMLEH; YURII KULAKOV

Author(s)

AS’AD MAHMOUD AS’AD ALNASER Department of Applied Science, Ajloun University College, Al-Balqa Applied University, Ajloun, Jordan

HAZEM (MOH’D SAID) HATAMLEH Department of Applied Science, Ajloun University College, Al-Balqa Applied University, Ajloun, Jordan

YURII KULAKOV National Technical University of Ukraine “Igor Sikorsky, Kyiv

Abstract

This article examines the issues of routing in multi-domain software-defined networks (SDN) of large size. The advantages of routing with the help of software-defined networks technology are given. The expediency of using multipath routing in computer networks of large size is justified. A method for dividing the network into domains by the k-means method is proposed. The division of the network into domains and the use of intra-domain and inter-domain routing can reduce the time complexity of routing. A centralized routing information method in the SDN controller is proposed. A modified algorithm for multipath routing along the distance vector is proposed and substantiated. In the routing process, with the formation. of a given route, routes from all intermediate sites to the destination node are formed simultaneously. This eliminates the repeated formation of routing information for the previously formed paths. Algorithms for inter-domain and intra-domain multipath routing are proposed to simplify the re-routing procedure if the network topology changes.

Publication Details

Page(s) 4978-4986

DOI DOI not available

Published Journal: Journal of Theoretical and Applied Information Technology, Volume: 100, Issue: 13, Year: 2022

Request the full text from PASTIC

Keywords

Multipath routing, re-routing, Routing algorithm, software-defined networking, Domain controller, Routing domains, Distance Vector, SDN controller, Time Complexity