Review of Path Selection Algorithms with Link Quality and Critical Switch Aware for Heterogeneous Traffic in SDN

Software Defined Networking (SDN) introduced network management flexibility that eludes traditional network architecture. Nevertheless, the pervasive demand for various cloud computing services with different levels of Quality of Service requirements in our contemporary world made network service provisioning challenging. One of these challenges is path selection (PS) for routing heterogeneous traffic with end-to-end quality of service support specific to each traffic class. The challenge had gotten the research community\u27s attention to the extent that many PSAs were proposed. However, a gap still exists that calls for further study. This paper reviews the existing PSA and the Baseline Shortest Path Algorithms (BSPA) upon which many relevant PSA(s) are built to help identify these gaps. The paper categorizes the PSAs into four, based on their path selection criteria, (1) PSAs that use static or dynamic link quality to guide PSD, (2) PSAs that consider the criticality of switch in terms of an update operation, FlowTable limitation or port capacity to guide PSD, (3) PSAs that consider flow variabilities to guide PSD and (4) The PSAs that use ML optimization in their PSD. We then reviewed and compared the techniques\u27 design in each category against the identified SDN PSA design objectives, solution approach, BSPA, and validation approaches. Finally, the paper recommends directions for further research

Energy-aware dynamic-link load balancing method for a software-defined network using a multi-objective artificial bee colony algorithm and genetic operators

Information and communication technology (ICT) is one of the sectors that have the highest energy consumption worldwide. It implies that the use of energy in the ICT must be controlled. A software-defined network (SDN) is a new technology in computer networking. It separates the control and data planes to make networks more programmable and flexible. To obtain maximum scalability and robustness, load balancing is essential. The SDN controller has full knowledge of the network. It can perform load balancing efficiently. Link congestion causes some problems such as long transmission delay and increased queueing time. To overcome this obstacle, the link load balancing strategy is useful. The link load-balancing problem has the nature of NP-complete; therefore, it can be solved using a meta-heuristic approach. In this study, a novel energy-aware dynamic routing method is proposed to solve the link load-balancing problem while reducing power consumption using the multiobjective artificial bee colony algorithm and genetic operators. The simulation results have shown that the proposed scheme has improved packet loss rate, round trip time and jitter metrics compared with the basic ant colony, genetic-ant colony optimisation, and round-robin methods. Moreover, it has reduced energy consumption. © 2020 Institution of Engineering and Technology. All rights reserved

Dynamic Weighted Round Robin Approach in Software-Defined Networks Using Pox Controller

Load balancing is important in solving over-load traffic problems in the network. Therefore, it has been among the first appealing applications in Software Defined Networking (SDN) networks. Numerous SDN-based load-balancing approaches have been recommended to enhance the performance of SDN networks. However, network control could be more manageable in large networks with hundreds of switches and routers. The SDN is a unique way of building, controlling, and developing networks to modify this unpleasant situation. The major concept of SDN contains logically centralizing network management in an SDN controller, which manages and observes the behaviour of the network. Numerous load-balancing approaches are known, such as Round Robin (RR), random policy, Weighted randomized policy (WRP), etc. Every load-balancing policy approach has some benefits and detriments. This paper developed an advanced load-balancing algorithm, a dynamic weighted round-robin (DWRR), and ran it on the top of the SDN controller. Then we calculate the result of our proposed load-balancing approach by comparing it with the current round-robin (RR) and weighted round-robin (WRR) approaches. Mininet tool is utilized for the investigation, and the controller utilized as the control plane is named the POX controller

An identification based network link backup method

in order to solve the problem of network link failure or link congestion, this paper proposes an identifi cation based link backup method, which uses the identification network to carry out collaborative backup of links, formulates the link level through the network identifi cation mechanism, divides the routing characteristics through the link level, and calculates the link level through the link backup protocol between routers. When the high priority link fails or the link congestion occurs, the low priority link can be used for routing; When the transmission rate of a single link decreases, the low priority link can also be enabled. So as to achieve network load balancing and maximize link utilization. Through mini net simulation, the experimental topology is built and verifi ed. The results show that this method can quickly repair the link failure, quickly switch the link, reduce the network interruption delay, when the high priority link failure or congestion, it can quickly establish the route update, and quickly recover, so as to achieve the purpose of network load balancing

A Survey Paper on Optimization Based SDN Powered by Fog Computing

The demand of cloud computing is increasing day by day due to their wide range of applications. But cloud computing suffered from various demerits like lack of mobility, unreliable latency, and position awareness. These drawbacks are overcome by the fog computing or edge computing which providing elasticity to the resources and reliability to the latency. In this paper we are studied various researches related to the cloud computing and fog computing for different applications. Several challenges are also discussed while implementing edge computing to the network. The chances provided by the fog computing system also elaborated for the future work. Different applications are discussed with their advantages and outcomes of fog computing system. The real time applications like IIOT fog computing provided better computational time. All the characteristics and key features of fog computing are discussed in this work. We get an idea of using fog computing with optimization algorithm for our IIOT applications

SOSW: Scalable and optimal nearsighted location selection for fog node deployment and routing in SDN-based wireless networks for IoT systems

In a fog computing (FC) architecture, cloud services migrate towards the network edge and operate via edge devices such as access points (AP), routers, and switches. These devices become part of a virtualization infrastructure and are referred to as “fog nodes”. Recently, software-defined networking (SDN) has been used in FC to improve its control and manageability. The current SDN-based FC literature has overlooked two issues: (a) fog nodes’ deployment at optimal locations and (b) SDN best path computation for data flows based on constraints (i.e., end-to-end delay and link utilization). To solve these optimization problems, this paper suggests a novel approach, called scalable and optimal near-sighted location selection for fog node deployment and routing in SDN-based wireless networks for IoT systems (SOSW). First, the SOSW model uses singular-value decomposition (SVD) and QR factorization with column pivoting linear algebra methods on the traffic matrix of the network to compute the optimal locations for fog nodes, and second, it introduces a new heuristic-based traffic engineering algorithm, called the constraint-based shortest path algorithm (CSPA), which uses ant colony optimization (ACO) to optimize the path computation process for task offloading. The results show that our proposed approach significantly reduces average latency and energy consumption in comparison with existing approaches

Exploiting the power of multiplicity: a holistic survey of network-layer multipath

The Internet is inherently a multipath network: For an underlying network with only a single path, connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity, through which a diverse collection of paths is resource pooled as a single resource, to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities, promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault tolerance (through the use of multiple paths in backup/redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be multipath, including the use of multipath technology in data center computing; the ready availability of multiple heterogeneous radio interfaces in wireless (such as Wi-Fi and cellular) in wireless devices; ubiquity of mobile devices that are multihomed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as multipath TCP. The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely, the control plane problem of how to compute and select the routes and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work