Routing Algorithm for Software Defined Network Based on Boxcovering Algorithm
2023 10th International Conference on Wireless Networks and Mobile Communications (WINCOM)(2024)
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'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.
MoreTranslated text
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined