A Convergence Time Optimization Paradigm for OSPF based Networks Through SDN SPF Protocol Computer Communications and Networks (CCN)/Delay Tolerant Networks
Asad Ali Khan, Majid Hussain, M. Zafrullah, Muhammad Sultan Zia · 2017
Distributed routing protocols have been developed extensively in the last couple of decades. But their inflexible and complex behavior have ever been a constraint that makes them inappropriate even for current needs of network. As more and more virtual machines are being added in every network, distributed networks have reached to bottleneck in many aspects. The rise of SDN (Software Defined Networks) has emerged as a potential solution for current and future network requirements. SDN have proved their appropriation than legacy networks in many aspects included with convergence time as a imperative one. This paper provides a comparative analysis based study of convergence time for SDN and an OSPF based legacy network. We have calculated the convergence time of an SDN when there occurs a link update (i.e. network link down/up). Same is calculated for an OSPF based network. Our experimental results show that SDN is far more better choice for large scale networks when compared with OSPF. This time effectiveness turns out to be very considerable when the network is larger and link delays are higher.