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

Developing an asynchronous technique to evaluate the performance of SDN HP Aruba switch and OVS

Developers of Software Defined Network (SDN) faces a lack of or difficulty in getting a physical environment to test their inventions and developments. That drives them to use a virtual environment for their experiments. This work addresses the differences between the SDN virtual environment and physical SDN switches, which leads to equip a more realistic SDN virtual environment. Consequently, this paper presents a precise performance evaluation and comparison of off-the-shelf SDN devices, HP Aruba 3810M, with Open Virtual Switch (OVS) inside Mininet emulator. This work examines the variability of the path delay, throughput, packet losses and jitter of SDN in a different windows size of the packets and network background loads. Our conducted experiments consider a number of protocols such as ICMP, TCP and UDP. In order to evaluate the network latency accurately, a new asynchronous latency measurement technique is proposed. The developed technique shows more precise results in comparison to other techniques. Furthermore, the work focuses on extracting the flow-setup latency, caused by the external SDN controller when setting flow rules into the switch. The comparison of results shows a dissimilarity in the behaviour of SDN hardware and the Mininet emulator. The SDN hardware exposed higher latency and flow-setup time due to extra resources of delay, which the emulator does not possess

Developing an asynchronous technique to evaluate the performance of SDN HP Aruba switch and OVS

Developers of Software Defined Network (SDN) faces a lack of or difficulty in getting a physical environment to test their inventions and developments. That drives them to use a virtual environment for their experiments. This work addresses the differences between the SDN virtual environment and physical SDN switches, which leads to equip a more realistic SDN virtual environment. Consequently, this paper presents a precise performance evaluation and comparison of off-the-shelf SDN devices, HP Aruba 3810M, with Open Virtual Switch (OVS) inside Mininet emulator. This work examines the variability of the path delay, throughput, packet losses and jitter of SDN in a different windows size of the packets and network background loads. Our conducted experiments consider a number of protocols such as ICMP, TCP and UDP. In order to evaluate the network latency accurately, a new asynchronous latency measurement technique is proposed. The developed technique shows more precise results in comparison to other techniques. Furthermore, the work focuses on extracting the flow-setup latency, caused by the external SDN controller when setting flow rules into the switch. The comparison of results shows a dissimilarity in the behaviour of SDN hardware and the Mininet emulator. The SDN hardware exposed higher latency and flow-setup time due to extra resources of delay, which the emulator does not possess

A Novel Placement Algorithm for the Controllers Of the Virtual Networks (COVN) in SD-WAN with Multiple VNs

The escalation of communication demands and the emergence of new telecommunication concepts such as 5G cellular system and smart cities requires the consolidation of a flexible and manageable backbone network. These requirements motivated the researcher to come up with a new placement algorithm for the Controller of Virtual Network (COVN). This is because SDN and network virtualisation techniques (NFV and NV), are integrated to produce multiple virtual networks running on a single SD-WAN infrastructure, which serves the new backbone. One of the significant challenges of SD-WAN is determining the number and the locations of its controllers to optimise the network latency and reliability. This problem is fairly investigated and solved by several controller placement algorithms where the focus is only on physical controllers. The advent of the sliced SD-WAN produces a new challenge, which necessitates the SDWAN controllers (physical controller/hosted server) to run multiple instances of controllers (virtual controllers). Every virtual network is managed by its virtual controllers. This calls for an algorithm to determine the number and the positions of physical and virtual controllers of the multiple virtual SD-WANs. According to the literature review and to the best of the author knowledge, this problem is neither examined nor yet solved. To address this issue, the researcher designed a novel COVN placement algorithm to compute the controller placement of the physical controllers, then calculate the controller placement of every virtual SD-WAN independently, taking into consideration the controller placement of other virtual SD-WANs. COVN placement does not partition the SD-WAN when placing the physical controllers, unlike all previous placement algorithms. Instead, it identifies the nodes of the optimal reliability and latency to all switches of the network. Then, it partitions every VN separately to create its independent controller placement. COVN placement optimises the reliability and the latency according to the desired weights. It also maintains the load balancing and the optimal resources utilisation. Moreover, it supports the recovering of the controller failure. This novel algorithm is intensively evaluated using the produced COVN simulator and the developed Mininet emulator. The results indicate that COVN placement achieves the required optimisations mentioned above. Also, the implementations disclose that COVN placement can compute the controller placement for a large network ( 754 switches) in very small computation time (49.53 s). In addition, COVN placement is compared to POCO algorithm. The outcome reveals that COVN placement provides better reliability in about 30.76% and a bit higher latency in about 1.38%. Further, it surpasses POCO by constructing the balanced clusters according to the switch loads and offering the more efficient placement to recover controller-failure