Talk · International Conference on Wireless Networks and Mobile Communications · October 26, 2023
Routing Algorithm for Software Defined Network Based on Boxcovering Algorithm
Dana Turlykozhayeva, Sayat Akhtanov, Nurzhan Ussipov, Almat Akhmetali, Aslan Bolysbay, Yerkin Shabdan
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.
More by Nurzhan Ussipov
- Topological Centrality in Gaia Open ClustersarXiv · 2026
- AUTONOMOUS SEARCH AND RESCUE DRONE WITH REAL-TIME YOLO OBJECT DETECTION AND GPS NAVIGATION USING RASPBERRY PI 4Eurasian Physical Technical Journal · 2026
- NGC 2516 ШОҒЫРЫНЫҢ N-ДЕНЕ МОДЕЛІН НАҚТЫЛАУ ЖӘНЕ ОНДАҒЫ ЖҰЛДЫЗДЫҚ ҚАРА ҚҰРДЫМДАРBulletin of Toraighyrov University Physics & Mathematics series · 2026
- Photometric variability of Be/X-ray binary IGR J22534+6243Astrophysics · 2026