A new Dynamic Routing Approach for Software Defined Network

Abstract

Introduces a new dynamic routing approach tailored for Software Defined Network (SDN) that takes advantages of the programmability and centralized control inherent SDN architectures. Traditional routing protocols often struggles often to adapt to dynamic network conditions, leading to suboptimal performance and resource utilization. In contrast the objective of the paper is to proposed approach uses real time network information collected by the SDN controller to dynamic adjust routing decisions and dynamic routing algorithms for software define networks in wide area network (SDN-WAN), provide a new approach; By employing a combination of machine learning algorithm and network speed back mechanism. Using the approach optimizes routing paths based on factors such as link utilization and quality of service requirements.  The shortest feasible path (SOFP) is an adaptation of the shortest feasible path algorithm that uses a statistical technique from the OpenFlow interface. The goal of the SFOP algorithm is to efficiently use SDN-WAN resources by determining the best route from source to destination.  Overall, the dynamic routing approach provides a promising solution to efficiently manage network traffic in SDN. Paving the way for more adaptative and responsive networking infrastructure.