Routing In Software-defined Networks Research Articles

Single and Multi-Type Controllers with Soft Computing Methods and Routing in Software Defined Network

The software defined networking topology is enabled for efficient configuration for monitoring and enhance the network performance. The multi-controller placement becomes very critical, and it can be rectified by the proposed approach. The comparison of single type and the multi controllers are discussed in this paper.The first paper is compared with the dragonfly algorithm, in this we have considered only multi POX controllers. So the latency difference depends on the iteration of the algorithm. Thus the latency is reduced in proposed algorithm. Similarly the second paper has compared with the existing algorithm of firefly, which states the multi type of controllers such as POX, NOX, BEACON and FLOODLIGHT, among that latency is calculated and compared. The selection criteria are varied according to its type. Hence the routing is carried out on the two controllers alike POX, and NOX, through ad hoc on demand distance vector routing protocol. Subsequently, the selected controllers specifically are placed and simulated in Pareto-based Optimal Controller placement (POCO) tool for the Internet 2 topology and network simulator(NS2). Finally the comparison results makes the proposed system is better than previous methods.

Single and Multi-Type Controllers with Soft Computing Methods and Routing in Software Defined Network

The software defined networking topology is enabled for efficient configuration for monitoring and enhance the network performance. The multi-controller placement becomes very critical, and it can be rectified by the proposed approach. The comparison of single type and the multi controllers are discussed in this paper.The first paper is compared with the dragonfly algorithm, in this we have considered only multi POX controllers. So the latency difference depends on the iteration of the algorithm. Thus the latency is reduced in proposed algorithm. Similarly the second paper has compared with the existing algorithm of firefly, which states the multi type of controllers such as POX, NOX, BEACON and FLOODLIGHT, among that latency is calculated and compared. The selection criteria are varied according to its type. Hence the routing is carried out on the two controllers alike POX, and NOX, through ad hoc on demand distance vector routing protocol. Subsequently, the selected controllers specifically are placed and simulated in Pareto-based Optimal Controller placement (POCO) tool for the Internet 2 topology and network simulator(NS2). Finally the comparison results makes the proposed system is better than previous methods.

Routing policy validation for the integrated system supporting routing in Software Defined Networks (SDNRoute)

In the article, a validation module, being a component of an integrated system supporting routing in software defined networks (SDNRoute), is proposed and thoroughly examined. The module allows for the verification of the results provided by the optimization module before these results are deployed in the production network. Routing policies are validated for their impact on the network quality parameters and against the threat of overloading (congestion).

Segment Routing in Software Defined Networks: A Survey

Segment routing (SR) has emerged as a promising source-routing methodology to overcome the challenges in the current routing schemes. It has received noticeable attention both in industry and academia, due to its flexibility, scalability, and applicability, especially in software defined networks. The emerging cloud services require strict service level agreements such as packet loss, delay, and jitter. Studies have shown that traditional network architectures lack the essential flexibility and scalability to offer these services. To combat this, a more flexible and agile routing paradigm of SR enables a source node to steer an incoming packet along a performance engineered path represented as an ordered list of instructions called segment list. This is encoded as a multiprotocol label switching label stack or an IPv6 address list in the packet header. This paper provides a comprehensive review of the novel SR technology by describing its architecture, operations, and key applications to date. SR paradigm can be effectively applied to a wide range of network applications, such as traffic engineering, network resiliency, network monitoring, and service function chaining, to achieve efficient network solutions. Furthermore, this paper identifies an interesting set of future research directions and open issues that can help realize the full potential of the emergent SR paradigm.

An Optimization Routing Algorithm Based on Segment Routing in Software-Defined Networks.

Software-defined networks (SDNs) are improving the controllability and flexibility of networks as an innovative network architecture paradigm. Segment routing (SR) exploits an end-to-end logical path and is composed of a sequence of segments as an effective routing strategy. Each segment is represented by a middle point. The combination of SR and SDN can meet the differentiated business needs of users and can quickly deploy applications. In this paper, we propose two routing algorithms based on SR in SDN. The algorithms aim to save the cost of the path, alleviate the congestion of networks, and formulate the selection strategy by comprehensively evaluating the value of paths. The simulation results show that compared with existing algorithms, the two proposed algorithms can effectively reduce the consumption of paths and better balance the load of the network. Furthermore, the proposed algorithms take into account the preferences of users, actualize differentiated business networks, and achieve a larger comprehensive evaluation value of the path compared with other algorithms.

Survey on IoV routing protocols: Security and network architecture

SummaryAs today, vehicles are equipped with wireless sensors and on‐board computers capable of collecting and processing a large amount of data; they can communicate to each other via different communication types and through different relay nodes. Internet of Vehicles (IoV) routing protocols are deployed to monitor these communications with various strategies to achieve a high availability of communication. In this paper, we propose to extend an existing taxonomy representing the necessary criteria to build IoV routing algorithms, by adding two new important criteria: security aspect and network architecture. Enhanced vehicular routing protocols with different security mechanisms have been studied, compared, and classified with respect to the authentication, the integrity, the confidentiality, the nonrepudiation, and the availability of data and communications. Routing protocols using the software‐defined networking (SDN) paradigm have also been reviewed in order to compare with those with traditional network architectures. Three types of SDN routing protocols, namely, centralized, decentralized, and hybrid control planes, have been analyzed. This survey will be useful for the choice of IoV routing protocols that take into account the flexibility, the scalability, and the intelligence of vehicular networks, as well as the security mechanisms against cyberattacks while being cost aware.

Expressive Content-Based Routing in Software-Defined Networks

With the vision of Internet of Things gaining popularity at a global level, efficient publish/subscribe middleware for communication within and across data centers is extremely desirable. In this respect, the very popular Software-Defined Networking, which enables publish/subscribe middleware to perform line-rate filtering of events directly on hardware, can prove to be very useful. While deploying content filters directly on switches of a software-defined network allows optimized paths, high throughput rates, and low end-to-end latency, it suffers from certain inherent limitations with respect to number of bits available on hardware switches to represent these filters. Such a limitation affects expressiveness of filters, resulting in unnecessary traffic in the network. In this paper, we explore various complementary techniques to represent content filters expressively while being limited by hardware. We implement and evaluate techniques that i) use workload, in terms of events and subscriptions, to represent content, and ii) efficiently select attributes to reduce redundancy in content. Our detailed performance evaluations show the potential of these techniques in reducing unnecessary traffic when subjected to different workloads. Furthermore, the techniques proposed in this paper require significant updates to the network, i.e., the data plane, which must be performed in a consistent manner to ensure desired system behavior. As a result, in this paper, we, also, design and evaluate a light-weight approach that ensures data plane consistency in the presence of dynamic network updates.

Dynamic Attack-Resilient Routing in Software Defined Networks

The scale of connected devices in the modern communication network and its heterogeneous nature have made securing the network more challenging. However, with the advent of software defined networking (SDN), the algorithmic complexity is handled at a centralized control plane and the network elements perform only data forwarding based on control plane decisions. This enables researchers to design innovative security protocols at the control plane to dynamically defend against attacks. In this paper, we propose a dynamic attack-resilient routing (ARR) approach and develop an optimization formulation for fragmented multipath routing taking reliability and load into consideration for SDN-enabled networks. Though erasure encoding has been well studied for resilient data storage, it is rarely mentioned in the context of network routing owing to its complexity, redundancy, and difficulty of satisfying practical routing constraints. In this paper, we dynamically determine the optimal route for erasure-encoded fragments of the data, in terms of attack resilience, under the constraint on allowable encoding redundancy. Since the ARR algorithm is computationally prohibitive for larger networks, we develop a heuristic solution for the same using a multipath-tree. The proposed algorithm dynamically routes the data fragments along a set of reliable and lightly loaded paths to achieve multipath diversity and thereby improve data availability at the destination even in the presence of attacks. We demonstrate the effectiveness of our proposed approach in terms of weighted path reliability, resilience, and blocking performance through simulations.

Hybrid routing by joint optimization of per-flow routing and tag-based routing in software-defined networks

Hybrid routing by joint optimization of per-flow routing and tag-based routing in software-defined networks

DROM: Optimizing the Routing in Software-Defined Networks With Deep Reinforcement Learning

This paper proposes DROM, a deep reinforcement learning mechanism for Software-Defined Networks (SDN) to achieve a universal and customizable routing optimization. DROM simplifies the network operation and maintenance by improving the network performance, such as delay and throughput, with a black-box optimization in continuous time. We evaluate the DROM with experiments. The experimental results show that DROM has the good convergence and effectiveness and provides better routing configurations than existing solutions to improve the network performance, such as reducing the delay and improving the throughput.

RouteGuardian: Constructing secure routing paths in software-defined networking

Software-Defined Networking (SDN) decouples the control plane and the data plane in network switches and routers, which enables the rapid innovation and optimization of routing and switching configurations. However, traditional routing mechanisms in SDN, based on the Dijkstra shortest path, do not take the capacity of nodes into account, which may lead to network congestion. Moreover, security resource utilization in SDN is inefficient and is not addressed by existing routing algorithms. In this paper, we propose RouteGuardian, a reliable security-oriented SDN routing mechanism, which considers the capabilities of SDN switch nodes combined with a Network Security Virtualization framework. Our scheme employs the distributed network security devices effectively to ensure analysis of abnormal traffic and malicious node isolation. Furthermore, RouteGuardian supports dynamic routing reconfiguration according to the latest network status. We prototyped RouteGuardian and conducted theoretical analysis and performance evaluation. Our results demonstrate that this approach can effectively use the existing security devices and mechanisms in SDN.

Multi-threaded Routing in Software-defined Networking

Multi-threaded Routing in Software-defined Networking

A software defined network routing in wireless multihop network

SDN has been touted as one of the most promising solutions for future Internet with the innovative design ideas that the control plane is logically centralized and decoupled from the data plane. Current research on SDN mainly focuses on wired network and data center, while software-defined wireless multi-hop network is put forth in a few researches, but only at stage of putting forth models and concepts. In this paper, we propose a novel routing protocol applied SDN in wireless multi-hop network. The implementation of the protocol is given in detail, and OPNET is used to build the model and carry on the simulation experiment. A large number of simulation experiments are performed to compare the key parameters of different networks. Simulation results show that our proposed routing protocol provide shortest path and disjoint multipath routing for nodes, and its network lifetime is longer than existing algorithms (OLSR, AODV) when traffic load reaches a certain value.

Energy-aware routing for software-defined networks with discrete link rates: A benders decomposition-based heuristic approach

The energy efficiency of wired networks has received considerable attention over the past decade due to its economic and environmental impacts. However, because of the vertical integration of the control and data planes in conventional networks, optimizing energy consumption in such networks is challenging. Software-defined networking (SDN) is an emerging networking paradigm that decouples the control plane from the data plane and introduces network programmability for the development of network applications. In this work, we propose an energy-aware integral flow-routing solution to improve the energy efficiency of the SDN routing application. We consider discreteness of link rates and pose the routing problem as a mixed integer linear programming (MILP) problem, which is known to be NP complete. The proposed solution is a heuristic implementation of the Benders decomposition method that routes additional single and multiple flows without resolving the routing problem. Performance evaluations demonstrate that the proposed solution achieves a close-to-optimal performance (within 3.27% error) compared to CPLEX on various topologies with less than 0.056% of CPLEX average computation time. Furthermore, our solution outperforms the shortest path algorithm by 24.12% to 54.35% in power savings.

Multi-threaded Routing in Software-defined Net-working

Multi-threaded Routing in Software-defined Net-working

An efficient routing algorithm based on segment routing in software-defined networking

Software-defined networking (SDN) is an emerging architecture that offers advantages over traditional network architecture. Segment routing (SR) defines the path of information through the network via an ordered list of multi-protocol label switching (MPLS) mechanisms on the packet headers at the ingress device, and this system makes SDN routing management more simple and efficient. SR can also solve some scalability issues in SDN. In this paper, we propose a routing algorithm for SDN with SR that can meet the bandwidth requirements of routing requests. Our algorithm considers the balance of traffic load and reduces the extra cost of packet header size in a network. Simulation results show that the performance of our algorithm is better than that of previously developed algorithms in terms of the average network throughput and the average rejection rate of routing requests.

An Improved Ant Colony Algorithm for Routing in Software Defined Networking

An Improved Ant Colony Algorithm for Routing in Software Defined Networking

An Optimal Path Computation Architecture for the Cloud-Network on Software-Defined Networking

Legacy networks do not open the precise information of the network domain because of scalability, management and commercial reasons, and it is very hard to compute an optimal path to the destination. According to today’s ICT environment change, in order to meet the new network requirements, the concept of software-defined networking (SDN) has been developed as a technological alternative to overcome the limitations of the legacy network structure and to introduce innovative concepts. The purpose of this paper is to propose the application that calculates the optimal paths for general data transmission and real-time audio/video transmission, which consist of the major services of the National Research & Education Network (NREN) in the SDN environment. The proposed SDN routing computation (SRC) application is designed and applied in a multi-domain network for the efficient use of resources, selection of the optimal path between the multi-domains and optimal establishment of end-to-end connections.