Path optimization of box-covering based routing to minimize average packet delay in software defined network

A routing algorithm plays a major role in Data communication across an inter-network. Software-Defined Networking (SDN) is a new era of computer networking that separates Data plane from Control plane which controls, changes and manages the network behavior dynamically via open interfaces with the help of SDN Controllers. In SDN, the networking devices route packets in the form of flows with the help of flow rules given by the controllers and the flow rules are stored in the corresponding flow tables of the networking devices. The Box-Covering (BC) algorithm is an existing algorithm used in SDN for achieving renormalization of networks by calculating the fractal dimension of networks and covering the network with the minimum possible number of boxes and Dijkstra’s algorithm is used for calculating shortest paths. The proposed work focuses on Path Optimization in the Box-Covering-Based Routing (BCR) algorithm, which is an existing algorithm used in large-scale SDN. In the proposed work, a Link-Weight system has been used for bounding the Link Utilization of the shortest path between the Source and the Destination to minimize the Average Packet Delay in the Network. The results show that the proposed work reduces the Average Packet Delay compared to the existing algorithms such as Dijkstra’s algorithm, Graph Compression algorithm and BCR algorithm and also improves the performance of the network.