Endpoint-transparent Multipath Transport with Software-defined Networks

Multipath forwarding consists of using multiple paths simultaneously to transport data over the network. While most such techniques require endpoint modifications, we investigate how multipath forwarding can be done inside the network, transparently to endpoint hosts. With such a network-centric approach, packet reordering becomes a critical issue as it may cause critical performance degradation. We present a Software Defined Network architecture which automatically sets up multipath forwarding, including solutions for reordering and performance improvement, both at the sending side through multipath scheduling algorithms, and the receiver side, by resequencing out-of-order packets in a dedicated in-network buffer. We implemented a prototype with commonly available technology and evaluated it in both emulated and real networks. Our results show consistent throughput improvements, thanks to the use of aggregated path capacity. We give comparisons to Multipath TCP, where we show our approach can achieve a similar performance while offering the advantage of endpoint transparency

Fast network configuration in Software Defined Networking

Software Defined Networking (SDN) provides a framework to dynamically adjust and re-program the data plane with the use of flow rules. The realization of highly adaptive SDNs with the ability to respond to changing demands or recover after a network failure in a short period of time, hinges on efficient updates of flow rules. We model the time to deploy a set of flow rules by the update time at the bottleneck switch, and formulate the problem of selecting paths to minimize the deployment time under feasibility constraints as a mixed integer linear program (MILP). To reduce the computation time of determining flow rules, we propose efficient heuristics designed to approximate the minimum-deployment-time solution by relaxing the MILP or selecting the paths sequentially. Through extensive simulations we show that our algorithms outperform current, shortest path based solutions by reducing the total network configuration time up to 55% while having similar packet loss, in the considered scenarios. We also demonstrate that in a networked environment with a certain fraction of failed links, our algorithms are able to reduce the average time to reestablish disrupted flows by 40%

Analyzing Methods and Opportunities in Software-Defined (SDN) Networks for Data Traffic Optimizations

Computer networks are dynamic and require constant updating and monitoring of operations to meet the growing volume of data trafficked. This generates a number of cost issues as well as performance management and tuning to deliver granular quality of service (QoS), balancing data load, and controlling the occurrence of bottlenecks. As an alternative, a new programmable network paradigm has been used under the name of Software Defined Networks (SDN). The SDN consists of decoupling the data plane and controlling the network, where a programmable controller is responsible for managing rules for routing the data to various devices. Thus, the hardware that remains in the network data stream simply addresses the routing of the packets quickly according to these rules. In this context, this article conducts a study on different methods and approaches that are being used in the literature to solve problems in the optimization of data traffic in the network through the use of SDN. In particular, this study differs from other reviews of SDN because it focuses on issues such as QoS, load balancing, and congestion control. Finally, in addition to the review of the SDN's state-of-the-art in the areas mentioned, a survey of future challenges and research opportunities in the area is also presented. load balancing and congestion control. Finally, in addition to the review of the SDN's state-of-the-art in the areas mentioned, a survey of future challenges and research opportunities in the area is also presented. load balancing and congestion control. Finally, in addition to the review of the SDN's state-of-the-art in the areas mentioned, a survey of future challenges and research opportunities in the area is also presented

EOCC-TARA for Software Defined WBAN

Wireless Body Area Network (WBAN) is a promising cost-effective technology for the privacy confined military applications and healthcare applications like remote health monitoring, telemedicine, and e-health services. The use of a Software-Defined Network (SDN) approach improves the control and management processes of the complex structured WBANs and also provides higher flexibility and dynamic network structure. To seamless routing performance in SDN-based WBAN, the energy-efficiency problems must be tackled effectively. The main contribution of this paper is to develop a novel Energy Optimized Congestion Control based on Temperature Aware Routing Algorithm (EOCC-TARA) using Enhanced Multi-objective Spider Monkey Optimization (EMSMO) for SDN-based WBAN. This algorithm overcomes the vital challenges, namely energy-efficiency, congestion-free communication, and reducing adverse thermal effects in WBAN routing. First, the proposed EOCC-TARA routing algorithm considers the effects of temperature due to the thermal dissipation of sensor nodes and formulates a strategy to adaptively select the forwarding nodes based on temperature and energy. Then the congestion avoidance concept is added with the energy-efficiency, link reliability, and path loss for modeling the cost function based on which the EMSMO provides the optimal routing. Simulations were performed, and the evaluation results showed that the proposed EOCC-TARA routing algorithm has superior performance than the traditional routing approaches in terms of energy consumption, network lifetime, throughput, temperature control, congestion overhead, delay, and successful transmission rate