Accumulative-Load Aware Routing in Software-Defined Networks

Abstract

This paper proposes a novel routing method called Accumulative-Load Aware Routing (ALAR) for Software-Defined Networks (SDN), that takes into account the cumulative load of flows on each link. By employing knowledge of the whole network topology and traffic in route computation, this approach enhances the utilization of network resources, minimize the probability of congestion and through which the average end to end delay is also improved. Using Mininet network emulator, simulation provides comparisons with conventional shortest path routing, and also presents results demonstrating that ALAR not only can utilize the network resources much better than legacy shortest path routing but also can avoid potential congestion problem of shortest path routing.