19 research outputs found
Controller placement mechanism in software defined network using k-median algorithm
Software Defined Network (SDN) decouples the control plane and the data plane, and moves the control plane to an external entity. The decoupling raises many challenges, and one of these is the placement of the controller in the network. This study aims to address controller placement problem in SDN. k-median is used to determine the placement of the controllers, and the placement with the lowest value of average propagation latency will be chosen. The placement compares two resulted placements. First, comparing to greedy algorithm that computes the combinations according to the order of the nodes and calculates the best values at each step, and the results were identical. The second comparison was with the combinations results from considering the placement from specific nodes, and the results showed that it gives higher results than depending on the lowest values resulted from the k-median. Finally, three controllers are chosen as the minimum number of controllers, they were evaluated in terms of delay and load, and as results it was found that three controllers are suitable number of controllers as long as there is no delay or load in the network. Combining the two algorithms for finding the placement and the number results in Controller Placement Mechanism (CPM
Evaluation of joint controller placement for latency and reliability-aware control plane
The separation of the forwarding and control planes in software-defined networking provides flexibility for network management. The Controller Placement Problem (CPP) is an important issue affecting network performance. This paper presents an evaluation of the Joint Latency and Reliability-Aware Controller Placement (LRCP) optimization model. LRCP provides network administrators with flexible choices to simultaneously achieve a trade-off between the switch-To-controller latency and the controller-To-controller latency, including the reliability aspect using alternative backup paths. Control plane latency (CPL) is used as the evaluation metric and it is defined as the sum of average switch-To-controller latency and the average inter-controller latency. For each optimal placement in the network, the control plane latency using the real latencies of the real network topology is computed. Results from the control plane latency metric show how the number and location of controllers influence the reliability of the network. In the event of a single link failure, the real CPL for LRCP placements is computed and assesses how good the LRCP placements are. The CPL metric is used to compare with other models using latency and reliability metrics.This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work has been also partially funded by the Spanish Ministry of Economy and Competitiveness, under contract TEC 2017-90034-C2-1-R (ALLIANCE).Peer ReviewedPostprint (author's final draft
The Role of Inter-Controller Traffic for Placement of Distributed SDN Controllers
We consider a distributed Software Defined Networking (SDN) architecture
adopting a cluster of multiple controllers to improve network performance and
reliability. Besides the Openflow control traffic exchanged between controllers
and switches, we focus on the control traffic exchanged among the controllers
in the cluster, needed to run coordination and consensus algorithms to keep the
controllers synchronized. We estimate the effect of the inter-controller
communications on the reaction time perceived by the switches depending on the
data-ownership model adopted in the cluster. The model is accurately validated
in an operational Software Defined WAN (SDWAN). We advocate a careful placement
of the controllers, that should take into account both the above kinds of
control traffic. We evaluate, for some real ISP network topologies, the delay
tradeoffs for the controllers placement problem and we propose a novel
evolutionary algorithm to find the corresponding Pareto frontier. Our work
provides novel quantitative tools to optimize the planning and the design of
the network supporting the control plane of SDN networks, especially when the
network is very large and in-band control plane is adopted. We also show that
for operational distributed controllers (e.g. OpenDaylight and ONOS), the
location of the controller which acts as a leader in the consensus algorithm
has a strong impact on the reactivity perceived by switches.Comment: 14 page
Load Balancing Algorithms In Software Defined Network
Compared with the traditional networks, the SDN
networks have shown great advantages in many aspects, but also exist the problem of the load imbalance. If the load distribution uneven in the SDN networks, it will greatly affect the performance of network. Many SDN-based load balancing strategies have been proposed to improve the performance of the
SDN networks. Therefore, in this paper a finding form
comprehensive review help to improve further understanding of lead b balancing algorithms in SDN
More Tolerant Reconstructed Networks by Self-Healing against Attacks in Saving Resource
Complex network infrastructure systems for power-supply, communication, and
transportation support our economical and social activities, however they are
extremely vulnerable against the frequently increasing large disasters or
attacks. Thus, a reconstructing from damaged network is rather advisable than
empirically performed recovering to the original vulnerable one. In order to
reconstruct a sustainable network, we focus on enhancing loops so as not to be
trees as possible by node removals. Although this optimization is corresponded
to an intractable combinatorial problem, we propose self-healing methods based
on enhancing loops in applying an approximate calculation inspired from a
statistical physics approach. We show that both higher robustness and
efficiency are obtained in our proposed methods with saving the resource of
links and ports than ones in the conventional healing methods. Moreover, the
reconstructed network by healing can become more tolerant than the original one
before attacks, when some extent of damaged links are reusable or compensated
as investment of resource. These results will be open up the potential of
network reconstruction by self-healing with adaptive capacity in the meaning of
resilience.Comment: 23 pages, 6 figure
Technology-related disasters:a survey towards disaster-resilient software defined networks
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
A framework for the joint placement of edge service infrastructure and User Plane Functions for 5G
Achieving less than 1 ms end-to-end communication latency, required for certain 5G services and use cases, is imposing severe technical challenges for the deployment of next-generation networks. To achieve such an ambitious goal, the service infrastructure and User Plane Function (UPF) placement at the network edge, is mandatory. However, this solution implies a substantial increase in deployment and operational costs. To cost-effectively solve this joint placement problem, this paper introduces a framework to jointly address the placement of edge nodes (ENs) and UPFs. Our framework proposal relies on Integer Linear Programming (ILP) and heuristic solutions. The main objective is to determine the ENs and UPFs’ optimal number and locations to minimize overall costs while satisfying the service requirements. To this aim, several parameters and factors are considered, such as capacity, latency, costs and site restrictions. The proposed solutions are evaluated based on different metrics and the obtained results showcase over 20% cost savings for the service infrastructure deployment. Moreover, the gap between the UPF placement heuristic and the optimal solution is equal to only one UPF in the worst cases, and a computation time reduction of over 35% is achieved in all the use cases studied.Postprint (author's final draft
AALLA: Attack-Aware Logical Link Assignment Cost-Minimization Model for Protecting Software-Defined Networks against DDoS Attacks
Software-Defined Networking (SDN), which is used in Industrial Internet of Things, uses a controller as its “network brain” located at the control plane. This uniquely distinguishes it from the traditional networking paradigms because it provides a global view of the entire network. In SDN, the controller can become a single point of failure, which may cause the whole network service to be compromised. Also, data packet transmission between controllers and switches could be impaired by natural disasters, causing hardware malfunctioning or Distributed Denial of Service (DDoS) attacks. Thus, SDN controllers are vulnerable to both hardware and software failures. To overcome this single point of failure in SDN, this paper proposes an attack-aware logical link assignment (AALLA) mathematical model with the ultimate aim of restoring the SDN network by using logical link assignment from switches to the cluster (backup) controllers. We formulate the AALLA model in integer linear programming (ILP), which restores the disrupted SDN network availability by assigning the logical links to the cluster (backup) controllers. More precisely, given a set of switches that are managed by the controller(s), this model simultaneously determines the optimal cost for controllers, links, and switches
A balanced partitioning mechanism for multicontroller placement in software-defined wide area networks
Through softwarization, Software-Defined Networking (SDN) may govern the network. Deploying a single controller to manage enormous network traffic is inefficient; hence, having multiple controllers is a necessity of current SDN in wide area networks (WANs). However, the controller placement problem (CPP) is a thriving research subject for efficiently placing many controllers to improve network performance. It has two parts: how the controllers should be distributed and how many
networking devices each controller should be connected to. Consequently, the objective of this study is to propose a Balanced Partitioning Mechanism (BPM) based on the notion of a network partition. Moreover, the BPM is designed based on a modified K-means algorithm. BPM comprises of two approaches: the initialization
method and the partitioning strategy. The farthest-point initialization method is introduced to reduce end-to-end delay between the controllers and switches. The balanced partitioning strategy is used to balance controller loads and partition the network into balanced partitions. The research adopted the Design Science Research
Methodology (DSRM) to accomplish its objectives. The network simulator OMNeT++ was configured to simulate the performance of BPM over the OS3E topology, with two scenarios including five and six domains. The K-means and CNPA algorithms, in particular, were used to evaluate the performance of BPM. In terms of balanced partitioning, the findings reveal that BPM outperforms the K-means and CNPA algorithms by maintaining a good load balance among controllers.
Furthermore, the results show that BPM improves throughput and reduces end-to-end delay between the controllers and switches. In addition, BPM improves the number of packets received by the destination to the number of packets sent by 23% and 29% compared to the K-means for five and six domain scenarios, respectively. Given the diversity of future Internet and IoT, the findings have significant implications for improving the performance of WAN networks