Minimum Cost Load Migration in Distributed Software Defined Networks

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Software defined networking is a network paradigm which separates the control plane and the data plane. In a large SDN network, multiple controllers are used for handling switches’ requests. Because of the unbalanced requests, sometimes some controllers get overloaded. If switch’s management can be shifted from the overloaded controller to idle controllers, network performance can be improved. But shifting the switches will bring cost to the system. In this paper, the isolation nodes problem is studied. A minimum cost load migration approach and a heuristic migration algorithm are proposed. The proposed load migration approach can avoid the isolation nodes. The simulation results show that the proposed approach enhances the system performance.

Author supplied keywords

Cite

CITATION STYLE

APA

Qin, K., Huang, C., Ganesan, N., & Liu, K. (2018). Minimum Cost Load Migration in Distributed Software Defined Networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 252, pp. 197–207). Springer Verlag. https://doi.org/10.1007/978-3-030-00916-8_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free