A New Algorithm for Controller Placement in SDN
G Ramya1, R Manoharan2
1G Ramya, Computer Science and Engineering, Pondicherry Engineering College, Pondicherry, India.
2R Manoharan, Computer Science and Engineering, Pondicherry Engineering College, Pondicherry, India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 1196-1201 | Volume-8 Issue-6, August 2019. | Retrieval Number: F8368088619/2019©BEIESP | DOI: 10.35940/ijeat.F8368.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: SDN network supports centralized network management by splitting control plane and data plane of forwarding devices and places the network intelligence in a software entity called controller. The controller can be placed in selective places of network to effectively monitor and control network activities. Large scale network needs multiple controller to manage control activities of network. In order to identify the optimum number of controllers and its effective locations in the network, a new algorithm is proposed using cut-vertex concept from graph theory. The proposed algorithm is simulated using Mininet SDN emulator. To study the performance of the proposed algorithm, multiple scenarios were used in the simulation and performance was analysed using parameters viz., flow installation time, average latency of network, throughput.
Keywords: Controller placements, Cut-vertex, Mininet, SDN.