Show simple item record

dc.contributor.authorAl-Saadi, M
dc.contributor.authorKhan, Asiya
dc.contributor.authorKelefouras, V
dc.contributor.authorWalker, DJ
dc.contributor.authorAl-Saadi, B
dc.date.accessioned2023-03-20T12:33:33Z
dc.date.available2023-03-20T12:33:33Z
dc.date.issued2023-03-02
dc.identifier.issn0093-3341
dc.identifier.issn2673-8732
dc.identifier.urihttps://pearl.plymouth.ac.uk/handle/10026.1/20601
dc.description.abstract

<jats:p>Software-defined networks (SDNs) have the capabilities of controlling the efficient movement of data flows through a network to fulfill sufficient flow management and effective usage of network resources. Currently, most data center networks (DCNs) suffer from the exploitation of network resources by large packets (elephant flow) that enter the network at any time, which affects a particular flow (mice flow). Therefore, it is crucial to find a solution for identifying and finding an appropriate routing path in order to improve the network management system. This work proposes a SDN application to find the best path based on the type of flow using network performance metrics. These metrics are used to characterize and identify flows as elephant and mice by utilizing unsupervised machine learning (ML) and the thresholding method. A developed routing algorithm was proposed to select the path based on the type of flow. A validation test was performed by testing the proposed framework using different topologies of the DCN and comparing the performance of a SDN-Ryu controller with that of the proposed framework based on three factors: throughput, bandwidth, and data transfer rate. The results show that 70% of the time, the proposed framework has higher performance for different types of flows.</jats:p>

dc.format.extent218-238
dc.languageen
dc.publisherMDPI AG
dc.titleSDN-Based Routing Framework for Elephant and Mice Flows Using Unsupervised Machine Learning
dc.typejournal-article
plymouth.issue1
plymouth.volume3
plymouth.publication-statusPublished online
plymouth.journalNetwork
dc.identifier.doi10.3390/network3010011
plymouth.organisational-group|Plymouth
plymouth.organisational-group|Plymouth|Faculty of Science and Engineering
plymouth.organisational-group|Plymouth|Faculty of Science and Engineering|School of Engineering, Computing and Mathematics
plymouth.organisational-group|Plymouth|REF 2021 Researchers by UoA
plymouth.organisational-group|Plymouth|Users by role
plymouth.organisational-group|Plymouth|Users by role|Academics
plymouth.organisational-group|Plymouth|REF 2021 Researchers by UoA|UoA12 Engineering
dcterms.dateAccepted2023-02-22
dc.date.updated2023-03-20T12:33:32Z
dc.rights.embargodate2023-3-24
dc.identifier.eissn2673-8732
rioxxterms.versionofrecord10.3390/network3010011


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record


All items in PEARL are protected by copyright law.
Author manuscripts deposited to comply with open access mandates are made available in accordance with publisher policies. Please cite only the published version using the details provided on the item record or document. In the absence of an open licence (e.g. Creative Commons), permissions for further reuse of content should be sought from the publisher or author.
Theme by 
Atmire NV