Flow based Traffic Scheduling in Software Defined Network

Abstract

The Software Defined Network (SDN) offers centralized traffic flow control from a global view of the underlying network, covering the route for SDN's various traffic engineering research. The continuous development of virtual machine migration, data backup, or MapReduce operations, the scale of the current network become more and more enormous. Equal-Cost Multi-Path (ECMP) is a method of multipath routing to distribute the flows using static hashing method. These flows do not reveal degrading due to static hashing for the resulting collisions. Traffic overloads due to long delay and low throughput will frequently cause connection congestion and result in less flow transmission performance. The paper focuses on the Flow based Traffic Scheduling FTS scheme that provides rerouting solution by scheduling the flow to the maximum available bandwidth path between the several paths. The experimental evaluations are used to show the efficiency of FTS in relation to ECMP and Hedera with reference to average throughput and flow completion time (FCT).