Routing Algorithm for Software Defined Network Based on Boxcovering Algorithm

TL;DR

This paper introduces a novel SDN routing algorithm based on box-covering methods, improving performance by partitioning networks into subnets and applying shortest path algorithms within and between them.

Contribution

It proposes a new SDN routing approach utilizing box-covering algorithms to enhance routing efficiency in complex networks.

Findings

GC box-covering algorithm outperforms others in SDN routing

Partitioning networks reduces computational complexity

Shortest path calculations are optimized within subnets

Abstract

A routing algorithm is the most fundamental problem in complex network communication. In complex networks, the amount of computation increases as the number of nodes increases which reduces routing performance. In this paper, we propose a routing algorithm for software-defined networking (SDN) based on a box-covering (BC) algorithm. It is known that using the BC algorithm it is possible to increase performance in complex SDN. We partition the entire SDN network into subnets using three existing box-covering methods such as MEMB, GC, and CIEA, then we use Dijkstra\textquotesingle s algorithm to find the shortest path between subnets and within each subnet. We compared all box-covering algorithms and found that the GC algorithm has the highest performance for SDN routing.