Controller placement strategies for a resilient SDN control plane

Vizarreta, Petra; Machuca, Carmen Mas; Kellerer, Wolfgang

doi:10.1109/rndm.2016.7608295

Cited by 69 publications

(65 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The objective of both approaches is to find working and protection control paths with minimum length to enable fast and efficient failover and lower end‐to‐end delay. Their results demonstrated that RCP‐DCR yields better network resilience than RCP‐DCP, as it aims to provide protection against controller failures …”

Section: Background and Related Workmentioning

confidence: 99%

“…Their results demonstrated that RCP-DCR yields better network resilience than RCP-DCP, as it aims to provide protection against controller failures. 42 Kobo et al investigated optimal controller placement for the distributed control system in software-defined wireless sensor network setting. They utilize k-median, k-center, and k-median algorithms to place and relocate k controllers to improve scalability, reliability, and performance of the network.…”

Section: Controller Placement Problemmentioning

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

Section: Background and Related Workmentioning

confidence: 99%

Section: Controller Placement Problemmentioning

confidence: 99%

Resilient placement of SDN controllers exploiting disjoint paths

Alenazi

Çetinkaya

2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Vizarreta et al [44] provide two resilient controller placement models for joint optimization of controller placement and resilient control path routing.…”

Section: B Control Plane Reliabilitymentioning

confidence: 99%

Technology-related disasters: A survey towards disaster-resilient Software Defined Networks

Machuca

Secci

Vizarreta

et al. 2016

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)

Self Cite

View full text Add to dashboard Cite

Abstract-Resilience against disaster scenarios is essential to network operators, not only because of the potential economic impact of a disaster but also because communication networks form the basis of crisis management. COST RECODIS aims at studying measures, rules, techniques and prediction mechanisms for different disaster scenarios. This paper gives an overview of different solutions in the context of technology-related disasters. After a general overview, the paper focuses on resilient Software Defined Networks.

show abstract

“…In [20], controllers are assumed to fail with a given probability and the average delays take into account failure probabilities. In [21], a CPP is proposed guaranteeing two node disjoint paths from each switch to its primary controller, and another CPP guaranteeing node disjoint paths from each switch to its primary and to its backup controller. In [22], the resilient capacitated CPP is addressed considering multiple controller failures where each switch has a given traffic load and controllers have an associated capacity.…”

Section: Introductionmentioning

confidence: 99%

“…The closest work is [14] which studies the content placement, routing, and protection of paths on a datacenter over optical network scenario but SRGs modeling disasters must be known a priori. In SDN, [21] exploits the idea of having two node disjoint paths from each switch (one to its primary and another to its backup controller) to protect the SDN control plane to single node failures and geodiversity routing is a natural extension of such work. To the best of our knowledge, the selection of the anycast nodes exploiting the path geodiversity concept has not been addressed.…”

Section: Introductionmentioning

confidence: 99%

The Minimum Cost D-Geodiverse Anycast Routing with Optimal Selection of Anycast Nodes

Sousa

Santos

2019

2019 15th International Conference on the Design of Reliable Communication Networks (DRCN)

View full text Add to dashboard Cite

Consider a geographical network with associated link costs. In anycast routing, network nodes are partitioned into two sets-the source nodes and the anycast (destination) nodes-and the traffic of each source node is routed towards the anycast node providing the minimum routing cost path. By considering a given geographical distance parameter D, we define an anycast routing solution as D-geodiverse when for each source node there are two routing paths, each one towards a different anycast node, such that the geographical distance between the two paths is at least D. Such a solution has the property that any disaster with a coverage diameter below D affecting one routing path (but without involving neither the source node nor its entire set of outgoing links) cannot affect the other path, enhancing in this way the network robustness to natural disasters. The selection of the anycast nodes has an impact both on the feasibility and cost of a Dgeodiverse anycast routing solution. Therefore, for a desired number of anycast nodes R, we define the minimum cost Dgeodiverse anycast problem (MCD-GAP) aiming to identify a set of R anycast nodes that obtain a minimum cost routing solution. The problem is defined based on integer linear programming and is extended to consider the existence of vulnerability regions in the network, i.e., by imposing the geographical distance D only between network elements belonging to the same region. We present computational results showing the tradeoff between D and R in the optimal solutions obtained with and without vulnerability regions.

show abstract

Controller placement strategies for a resilient SDN control plane

Cited by 69 publications

References 14 publications

Resilient placement of SDN controllers exploiting disjoint paths

Resilient placement of SDN controllers exploiting disjoint paths

Technology-related disasters: A survey towards disaster-resilient Software Defined Networks

The Minimum Cost D-Geodiverse Anycast Routing with Optimal Selection of Anycast Nodes

Contact Info

Product

Resources

About