Performance Evaluation of Multi-hop Routing in Software Defined Network

Abstract

From the origin of the Internet, data transmission over the network uses routing algorithms to get some directions. The novel path labeling techniques does not follow any multipath methodologies. In case of any busy event, the sender node must wait before forwarding data to the destination node. This results in higher delay and lesser throughput. To overcome these types of problems, an optimal routing based on certain network parameters is proposed to compute the cost for every routing cycle. This method also adopts multipath in case of any congestion or busy network, which avoids network performance to degrade. Software Defined Networks (SDN) are intelligent networks where the routing decisions are not based on some traditional algorithms in which different sizes of networks are designed using different network topologies and devices. The cost factor is computed each time while routing the data from source to destination. The goal of routing is to achieve the minimum cost path. Various topologies like spanning tree, ring tree, and dual tree are evaluated on the basis of factors like bandwidth usage, cost, and link efficiency. The main focus is to evaluate the performance of various topologies in terms of routing. The SDN routing is the solution to handle all the drawbacks of traditional routing protocols. The performance of spanning tree, ring and dual tree are compared with each other and the outcomes of spanning tree are better than a ring and dual tree in terms of cost. The bandwidth is more efficiently utilized in spanning tree, but the links are heavily used in spanning tree, which results in some chances of congestion. The average cost of the dual-tree is better than the performance of spanning tree.