CAMOR: Congestion Aware Multipath Optimal Routing Solution by Using Software-Defined Networking
Syed Asif Raza Shah, Woojin Seok, Jin Kim, S. Bae, Seo-Young Noh
Abstract
Syed Asif Raza Shah, Woojin Seok, Jin Kim, S. Bae, Seo-Young Noh
Abstract
The standard routing protocols are used to find an optimal path between two given endpoints. Nowadays, the solution of multipath routing becomes fundamental requirement to improve the overall throughput of networks. On the other hand, due to the dynamic and high volume of traffic, it is also more challenging to control the congestion in an efficient way within the networks. Recently, Software-Defined Networking (SDN) becomes more and more popular to achieve the future network goals. In this paper, we proposed a Congestion Aware Multipath Optimal Routing (CAMOR) solution by using SDN and manage the routing intelligence centrally. We proposed a technique that combines the multipath and congestion aware mechanisms for an optimal route selection by considering the congestion in all available paths. The load of each link participating in routing paths is considered as congestion parameter. For better utilization of bandwidth and resources, we proposed per-flow based differentiation method and evenly distribute the traffic on equal cost multiple paths. The experimental results show that our solution can evenly distribute the traffic on several optimal paths instead of routing traffic on a single best/shortest path. It also can improve the overall network performance by avoiding the congestion.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The standard routing protocols are used to find an optimal path between two given endpoints. Nowadays, the solution of multipath routing becomes fundamental requirement to improve the overall throughput of networks. On the other hand, due to the dynamic and high volume of traffic, it is also more challenging to control the congestion in an efficient way within the networks. Recently, Software-Defined Networking (SDN) becomes more and more popular to achieve the future network goals. In this paper, we proposed a Congestion Aware Multipath Optimal Routing (CAMOR) solution by using SDN and manage the routing intelligence centrally. We proposed a technique that combines the multipath and congestion aware mechanisms for an optimal route selection by considering the congestion in all available paths. The load of each link participating in routing paths is considered as congestion parameter. For better utilization of bandwidth and resources, we proposed per-flow based differentiation method and evenly distribute the traffic on equal cost multiple paths. The experimental results show that our solution can evenly distribute the traffic on several optimal paths instead of routing traffic on a single best/shortest path. It also can improve the overall network performance by avoiding the congestion.
Key concepts: Multipath routing, Computer science, Computer network, Equal-cost multi-path routing, Policy-based routing, Network congestion, Software-defined networking, Static routing