z-logo
Premium
HeS‐CoP: Heuristic switch‐controller placement scheme for distributed SDN controllers in data center networks
Author(s) -
Kim Woojoong,
Li Jian,
Hong James WonKi,
Suh YoungJoo
Publication year - 2017
Publication title -
international journal of network management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.373
H-Index - 28
eISSN - 1099-1190
pISSN - 1055-7148
DOI - 10.1002/nem.2015
Subject(s) - computer science , scalability , scheme (mathematics) , software defined networking , network packet , data center , heuristic , controller (irrigation) , distributed computing , load balancing (electrical power) , computer network , operating system , mathematical analysis , geometry , mathematics , artificial intelligence , agronomy , biology , grid
Summary Software‐defined networking (SDN) has been widely researched and used to manage large‐scale networks such as data center networks (DCNs). An early stage of SDN controller experienced low responsiveness, low scalability, and low reliability. To solve these problems, distributed SDN controllers have been proposed. The concept of distributed SDN controllers distributes control messages among multiple SDN controllers. However, distributed SDN controllers must assign a master controller for each networking devices. Most previous studies, however, did not consider the characteristics of DCNs. Thus, they are not suitable to operate in DCNs. In this paper, we propose HeS‐CoP, a heuristic switch‐controller placement scheme for distributed SDN controllers in DCNs. With the control traffic load and CPU load, HeS‐CoP decides when our scheme should be performed in DCNs. To show the feasibility of HeS‐CoP, we designed and implemented an orchestrator that contains our proposed scheme and then evaluated our proposed scheme. As a result, our proposed scheme well distributes the control traffic load, decreases the average CPU load, and reduces the packet delay.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here