基于流分类的SDN网络流量路由优化研究

Haythem Yahyaoui, Saifeddine Aidi, M. Zhani
{"title":"基于流分类的SDN网络流量路由优化研究","authors":"Haythem Yahyaoui, Saifeddine Aidi, M. Zhani","doi":"10.1109/CCNC46108.2020.9045216","DOIUrl":null,"url":null,"abstract":"Cloud storage services are gaining a widespread popularity thanks to their scalability and performance. Several companies and users are relying on such services to store and retrieve their files. In this context, the file transfer time is critical for users' satisfaction. This time can be minimized by carefully selecting the routing strategy to transfer the flow of packets associated with each file. In this paper, we introduce a novel class-based routing strategy called LUNA that is able to minimize the flow completion time. LUNA classifies the flows into mice and elephants based on their size. Afterwards, it leverages a machine learning technique called association rules to generate the forwarding rules and route each flow based on its class (i.e., mouse or elephant). Experimental results show that LUNA has successfully identified the class of 80% of the flows. Furthermore, its class-based routing outperforms basic routing strategies in terms of flow completion time, throughput and packet loss by almost 47%, 41% and 23%, respectively.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"On Using Flow Classification to Optimize Traffic Routing in SDN Networks\",\"authors\":\"Haythem Yahyaoui, Saifeddine Aidi, M. Zhani\",\"doi\":\"10.1109/CCNC46108.2020.9045216\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud storage services are gaining a widespread popularity thanks to their scalability and performance. Several companies and users are relying on such services to store and retrieve their files. In this context, the file transfer time is critical for users' satisfaction. This time can be minimized by carefully selecting the routing strategy to transfer the flow of packets associated with each file. In this paper, we introduce a novel class-based routing strategy called LUNA that is able to minimize the flow completion time. LUNA classifies the flows into mice and elephants based on their size. Afterwards, it leverages a machine learning technique called association rules to generate the forwarding rules and route each flow based on its class (i.e., mouse or elephant). Experimental results show that LUNA has successfully identified the class of 80% of the flows. Furthermore, its class-based routing outperforms basic routing strategies in terms of flow completion time, throughput and packet loss by almost 47%, 41% and 23%, respectively.\",\"PeriodicalId\":443862,\"journal\":{\"name\":\"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)\",\"volume\":\"143 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC46108.2020.9045216\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC46108.2020.9045216","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

云存储服务由于其可伸缩性和性能而获得广泛的普及。一些公司和用户依靠这种服务来存储和检索他们的文件。在这种情况下,文件传输时间对用户的满意度至关重要。通过仔细选择传输与每个文件关联的数据包流的路由策略,可以最大限度地减少这段时间。在本文中,我们介绍了一种新的基于类的路由策略,称为LUNA,它能够最大限度地减少流完成时间。LUNA根据它们的大小将它们分为老鼠和大象。然后,它利用一种称为关联规则的机器学习技术来生成转发规则,并根据其类(即鼠标或大象)路由每个流。实验结果表明,LUNA成功地识别了80%的流的类别。此外,其基于类的路由在流完成时间、吞吐量和数据包丢失方面分别比基本路由策略高出近47%、41%和23%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Using Flow Classification to Optimize Traffic Routing in SDN Networks
Cloud storage services are gaining a widespread popularity thanks to their scalability and performance. Several companies and users are relying on such services to store and retrieve their files. In this context, the file transfer time is critical for users' satisfaction. This time can be minimized by carefully selecting the routing strategy to transfer the flow of packets associated with each file. In this paper, we introduce a novel class-based routing strategy called LUNA that is able to minimize the flow completion time. LUNA classifies the flows into mice and elephants based on their size. Afterwards, it leverages a machine learning technique called association rules to generate the forwarding rules and route each flow based on its class (i.e., mouse or elephant). Experimental results show that LUNA has successfully identified the class of 80% of the flows. Furthermore, its class-based routing outperforms basic routing strategies in terms of flow completion time, throughput and packet loss by almost 47%, 41% and 23%, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信