QoS-Guaranteed Controller Placement in SDN

Cheng, Yingying; Wang, Mengqing; Jia, Xiaohua

doi:10.1109/glocom.2015.7416960

Cited by 54 publications

(39 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, there are researches emphasis on the importance of reliability among switch and controller in CPP and several new metrics are proposed as stated in [11][12]. Others heuristic method are also proposed to solve CPP in [13][14][15]. Some methods in [16][17] use mathematical approaches to cater CPP.…”

Section: Static Controller Placementmentioning

confidence: 99%

“…POCO was then extended by using several heuristic algorithms to obtain approximated Pareto optimal placement to compute faster with acceptable accuracy in large network. Table 1 shows the performance summary of the several methods discussed in this paper which is in static controller placement methods [2,[4][5][6][7][8][9][10][11][12][13][14][15][16][17]. Table 2 shows the performance summary of dynamic controller placement methods in [3,[18][19][20][21][22][23][24][25][26].…”

Section: Dynamic Controller Placementmentioning

confidence: 99%

See 1 more Smart Citation

Controller Placement Algorithms in Software Defined Network - A Review of Trends and Challenges

et al. 2017

View full text Add to dashboard Cite

Abstract. Traditional network architectures are complex to manage, comparatively static, rigid and difficult to make changes for new innovation. The proprietary devices in such architectures are based on manual configuration which are unwieldy and error-prone. Software Defined Network (SDN) which is described as a new network paradigm that decouple the control plane from data plane are capable to solve today's network issues and improve the network performance. Nevertheless, among so many challenges and research opportunity in SDN, Controller Placement Problem (CPP) is said to be the most important issues which can directly affect the overall network performance. Thus far, the issue regarding the CPP and its challenge has not been completely reviewed and discussed properly in any other papers. In this paper, we provide a comprehensive review on several optimized controller placement problem algorithms in SDN. This paper also highlights some limitations of the reviewed methods and also emphasizes on suitable approach to address the aforementioned problems.

show abstract

Section: Static Controller Placementmentioning

confidence: 99%

Section: Dynamic Controller Placementmentioning

confidence: 99%

Controller Placement Algorithms in Software Defined Network - A Review of Trends and Challenges

et al. 2017

View full text Add to dashboard Cite

show abstract

“…The control paths are a set of rules between controllers and switches (shown as dashed links in Figure ). Moreover, SDN controller placement has recently attracted increasing attention . There are several algorithms for controller placement in an SDN such as random placement, brute force, and heuristic algorithms .…”

Section: Introductionmentioning

confidence: 99%

“…Moreover, SDN controller placement has recently attracted increasing attention . There are several algorithms for controller placement in an SDN such as random placement, brute force, and heuristic algorithms . These algorithms aim to reduce the latency or the number of controllers .…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Resilient placement of SDN controllers exploiting disjoint paths

Alenazi

Çetinkaya

2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Traditional IP networks are difficult to manage, owing to their rapid expansion and dynamic changes. Software‐defined networks are introduced to simplify network management by separating the network control plane from the packet forwarding plane. Using one or several controllers, SDN switches can be configured to forward data packets to their destinations. The controller placement problem aims to determine the number of controllers and their locations to meet network service requirements. Early approaches used the k‐median and k‐center algorithms, which select k controllers to minimize propagation latency without considering network resilience. In this paper, we developed a new nodal metric, nodal disjoint path (NDP), which measures a node's importance in terms of its diverse connectivity to other nodes. Based on NDP, we propose two algorithms, NDP‐global and NDP‐cluster, for determining the locations of the k controllers to increase network robustness against targeted attacks. We apply the two selection algorithms to four US‐based fiber‐level networks and evaluate their resilience against five centrality‐based attacks and random failures. The evaluation results indicate that selecting controllers by the NDP‐global algorithm, compared with the NDP‐cluster, k‐median, and k‐center algorithms, provides better network resilience in the face of centrality‐based attacks and random failures. The results also indicate that the NDP‐cluster algorithm has a delay performance comparable to that of the k‐median algorithm and provides higher network resilience.

show abstract

Heuristic approaches for the reliable SDN controller placement problem

Singh

Maurya

Kumar

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Software‐defined networking (SDN) is one of the most used network architecture that divides the forwarding plane and control plane. The SDN centrally observes and regulates the network through a software control in the control plane, called as controller. Multiple controllers are needed to manage the software‐defined WAN (SD‐WAN) for handling the scalability and reliability issues of the network as one controller is not enough. Deploying numerous controllers efficiently to improve the performance of the network is known as controller placement problem (CPP). This paper proposes a Varna‐based optimization (VBO) for a reliable CPP that minimizes the total average latency of SDN. To the best of our knowledge, the proposed work is a novel approach, which is compared with particle swarm optimization, teacher learning‐based optimization, and Jaya algorithms to solve reliable CPP. The experimental results show that VBO gives better performance than teacher learning‐based optimization (TLBO), PSO, and Jaya algorithms for the popular topologies that are publicly available.

show abstract

QoS-Guaranteed Controller Placement in SDN

Cited by 54 publications

References 14 publications

Controller Placement Algorithms in Software Defined Network - A Review of Trends and Challenges

Controller Placement Algorithms in Software Defined Network - A Review of Trends and Challenges

Resilient placement of SDN controllers exploiting disjoint paths

Heuristic approaches for the reliable SDN controller placement problem

Contact Info

Product

Resources

About