Traffic Flow Control Algorithm in Software Defined Networking

Abstract

Software Defined Networking (SDN) is an architecture which used to split up the control plane and data planes in routers and switches to make networks programmable and scalable. In SDN, the control can be decoupled from hardware and applied in software. As a total effect, it is easier to accordingly modify the network. Traditional network cannot guarantee the data transfer and the traffic flow from the network. Traffic engineering is an important technique and network application to optimize a network and improve its robustness. Due to increase in traffic demand, traffic engineering has the ability to minimize the degradation of service and failure in network. In this research the traffic flow control (TFC) algorithm in SDN traffic engineering is introduced so as to prevent too much traffic flow on the given link. The shortest path algorithm is a part of traffic flow control algorithm which is used to find the shortest path from source to destination. The proposed algorithm defines a limit of bytes on data travelled from multiple source without any drop of packets so as to prevent the traffic on the link. Comparison is made between Congestion Avoidance Algorithm and the proposed algorithm. Results of the evaluation work prove that our approach has improved the network performance in terms of throughput, jitter and latency.