Abstract

During the past few years, software-defined networking (SDN) has become a successful architecture that decouples the control plane from the data plane. SDN has the capability to monitor and control the network in a central fashion through a softwarization process. The central element is the controller. For the current SDN architectures, there is an essential need for multiple controllers. The process of placing the controllers efficiently in an SDN environment is called the controller placement problem (CPP). Earlier CPP solutions focused on improving the propagation delays through the capacity of the controllers and the dynamic load on the switches. In this paper, we develop a novel algorithm called dynamic feedback algorithm for controller placement for SDN (DFBCPSDN). DFBCPSDN is compared with the varna-based optimization (VBO) towards solving the CPP. We used the VBO as the reference model to this work since it is relatively a new algorithm. Moreover, the VBO extensively outperformed many other existing models. To the best of our knowledge, this is one of the first attempts to minimize the total average latency of SDN using feedback control theoretic techniques. Experimental results indicate that the DFBCPSDN outperforms the VBO algorithm implemented in two well-known topologies, namely Internet2 OS3E topology and EU-GÉANT topology. We observe that for uncapacitated CPP, the DFBCPSDN outperforms the VBO for Internet2 OS3E and EU-GÉANT topologies by 11% and 9%, respectively, in terms of total average latency. On the other hand, for capacitated CPP, the DFBCPSDN algorithm outperforms the VBO reference model by 10% and 8%, respectively.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.