Dynamic metric OSPF-based routing protocol for Software Defined Networks

Abstract

Routing protocols are needed in networking to find the optimal path to reach the destination. However, networks are changing both their use finality and their technology. Paradigms like Software Defined Networks (SDNs) introduce the possibility and the necessity to improve the routing protocols. In this paper, a modification of the Open Shortest Path First (OSPF) routing protocol is proposed in order to allow the protocol to change the metric calculation dynamically according to the network requirements. Experiments, which compare our proposal against the OSPF protocol, are performed in five different scenarios. In these scenarios, the performance of the multimedia traffic has been increased 33% in terms of bandwidth utilization, 80% of loss rate reduction and delay reduction on VoIP communications.

An Efficient Network Resource Management in SDN for Cloud Services

“…In [14], the authors modified the OSPF routing protocol to dynamically change the metric calculation based on the network requirements. They give the privilege to multimedia traffic flows based on network requirements to improve the quality of multimedia services.…”

“…In addition, their protocol requires the flows to be explicitly classified into multimedia and non-multimedia types when the traffic enters the network. In [14], the authors used an artificial intelligence module, proposed in [15], for flow classification. However, that module is just optimized for separating small sensor data from multimedia data and does not consider diverse traffic data.…”

“…For performance comparison, we also implemented the OSPF, which is the most commonly used in the conventional path selection algorithms. Many researchers have investigated its performance in the SDN environment [12,13] and compared their proposals with the OSPF [14]. In our study, we also evaluate the OSPF and compare it with our proposed algorithm.…”

Methods to Measure the Network Path Connectivity

“…erefore, the number of shortest paths is also an important topological index for the functionality of a network. Many classical routing algorithms and robustness measures are designed for networks according to the shortest paths [6,[18][19][20][21][22][23][24].…”

“…the complexity of the PCNL will increase with the increase of L ij . Considering the influence of shortest paths on network functionality[6,[18][19][20][21][22][23][24] and the complexity of the PCNL, we set L ij � |p ij | to calculate the shortest path connectivity of a network. en, equations (…”