Shortest path routing algorithm with dynamic composite weights in SDN networks

With the increase of network resources worldwide, the globally used routing algorithms can’t provide proper network utilization and QoS to the needs of the end users. The introduction of SDN to the world has opened many fields of research for better control, manage and utilize the network traffic. This paper proposes shortest path routing algorithm with dynamic composite weights in SDN networks.