Adaptive Path Selection Algorithm with Flow Classification for Software-Defined Networks

Muhammed Nura Yusuf (), Kamalrulnizam bin Abu Bakar, Babangida Isyaku, Ahmed Hamza Osman, Maged Nasser and Fatin A. Elhaj
Additional contact information
Muhammed Nura Yusuf: Faculty of Computing, Univerisiti Teknologi Malaysia, Johor 81310, Malaysia
Kamalrulnizam bin Abu Bakar: Faculty of Computing, Univerisiti Teknologi Malaysia, Johor 81310, Malaysia
Babangida Isyaku: Faculty of Computing, Univerisiti Teknologi Malaysia, Johor 81310, Malaysia
Ahmed Hamza Osman: Department of Information System, Faculty of Computing and Information Technology in Rabigh, King Abdulaziz University, Jedda 21911, Saudi Arabia
Maged Nasser: School of Computer Sciences, Universiti Sains Malaysia, Penang 11800, Malaysia
Fatin A. Elhaj: College of Art, Science and Information Technology, University of Khorfakkan, Sharjah P.O. Box 18119, United Arab Emirates

Mathematics, 2023, vol. 11, issue 6, 1-24

Abstract: Software-Defined Networking (SDN) is a trending architecture that separates controller and forwarding planes. This improves network agility and efficiency. The proliferation of the Internet of Things devices has increased traffic flow volume and its heterogeneity in contemporary networks. Since SDN is a flow-driven network, it requires the corresponding rule for each flow in the flowtable. However, the traffic heterogeneity complicates the rules update operation due to varied quality of service requirements and en-route behavior. Some flows are delay-sensitive while others are long-lived with a propensity to consume network buffers, thereby inflicting congestion and delays on the network. The delay-sensitive flows must be routed through a path with minimal delay, while congestion-susceptible flows are guided along a route with adequate capacity. Although several efforts were introduced over the years to efficiently route flows based on different QoS parameters, the current path selection techniques consider either link or switch operation during decisions. Incorporating composite path metrics with flow classification during path selection decisions has not been adequately considered. This paper proposes a technique based on composite metrics with flow classification to differentiate congestion-prone flows and reroute them along appropriate paths to avoid congestion and loss. The technique is integrated into the SDN controller to guide the selection of paths suitable to each traffic class. Compared to other works, the proposed approach improved the path load ratio by 25%, throughput by 35.6%, and packet delivery ratio by 31.7%.

Keywords: SDN; path selection; path quality; heterogeneous traffic; elephant flow; mice flow (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/6/1404/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/6/1404/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:6:p:1404-:d:1097315

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().