Improved Feature Selection and Stream Traffic Classification Based on Machine Learning in Software-Defined Networks

计算机科学 特征选择 交通分类 选择(遗传算法) 机器学习 人工智能 软件 软件定义的网络 数据挖掘 计算机网络 操作系统 互联网
作者
Arwa M. Eldhai,Mosab Hamdan,Ahmed Abdelaziz,Mohamed Hashem,Sharief F. Babiker,Muhammad Nadzir Marsono,Muzaffar Hamzah,N. Z. Jhanjhi
出处
期刊:IEEE Access [Institute of Electrical and Electronics Engineers]
卷期号:12: 34141-34159 被引量:2
标识
DOI:10.1109/access.2024.3370435
摘要

Traffic classification (TC) in software-defined networks (SDN) based on machine learning (ML) proves to be a viable option for improving network management. Therefore, TC assists SDN, and SDN facilitates the feature selection (FS) process, especially when using ML as a classification mechanism to extract measurements and related information from the incoming data to the SDN controller. Despite these advantages, there is still a lack of adequate support for tasks related to TC and FS because traffic profiles are often very similar, making classification difficult. Moreover, stream learning (SL), when it is used with TC, shows many challenges. Therefore, robust statistical flow features are needed to reduce the overhead from the SDN control plane. Consequently, these statistical flow features could extract online features, handle concept drift and process an infinite data stream with finite resources (time and memory). This paper aims to improve the overall performance of TC based on the SL technique to selection of relevant FS to alleviate load from the SDN control plane by the following. First, an FS mechanism named Boruta is proposed. Second, we propose a streaming-based traffic classification method in SDN called hoeffding adaptive trees (HAT), adaptive random forest (ARF), and k-nearest neighbour with adaptive sliding window detector (KNN-ADWIN). These techniques can dynamically handle the drift concept and solve the problem of consuming memory and time to reduce the SDN controller's overhead. Third, real and synthetic traffic traces are used to assess the proposed FS and stream TC performance. According to simulation results, the Boruta FS technique can achieve up to 95 % average accuracy, and up to 87% average per application to precision, recall, and f-score than other works in the literature. Furthermore, findings for SL techniques reveal that the proposed methods can retain up to 85% average accuracy, 78% kappa, and average rates between 62-88% in precision, recall, f-score. Also, the HAT has lower time and memory consumption reach to 15s and 105KB comparison to ART and KNN-ADWIN.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
曼青发布了新的文献求助10
刚刚
1秒前
xxy发布了新的文献求助10
1秒前
呜呼啦呼发布了新的文献求助10
2秒前
哈哈发布了新的文献求助10
2秒前
阳墨贤发布了新的文献求助20
4秒前
Hello应助哼哼唧唧采纳,获得10
4秒前
仿生人发布了新的文献求助10
4秒前
5秒前
纸速度完成签到 ,获得积分10
5秒前
科研通AI2S应助Fangyu采纳,获得10
6秒前
ri_290发布了新的文献求助10
6秒前
lkkkkk发布了新的文献求助10
6秒前
飘逸冰淇淋完成签到,获得积分10
6秒前
ww2026应助dxh采纳,获得10
7秒前
7秒前
7秒前
鱼0306发布了新的文献求助10
7秒前
Aryatarg发布了新的文献求助10
8秒前
从容的翼发布了新的文献求助10
8秒前
所所应助sjh采纳,获得10
8秒前
March3完成签到 ,获得积分10
9秒前
好吧发布了新的文献求助10
9秒前
张会发布了新的文献求助10
10秒前
威武鸽子发布了新的文献求助10
11秒前
酷波er应助小费采纳,获得50
11秒前
12秒前
12秒前
12秒前
12秒前
dada完成签到,获得积分10
13秒前
XHQ完成签到,获得积分10
13秒前
13秒前
太阳完成签到 ,获得积分10
14秒前
科目三应助科研通管家采纳,获得80
14秒前
香蕉觅云应助科研通管家采纳,获得10
14秒前
星辰大海应助科研通管家采纳,获得15
15秒前
Jasper应助科研通管家采纳,获得10
15秒前
Jasper应助科研通管家采纳,获得10
15秒前
香蕉觅云应助科研通管家采纳,获得10
15秒前
高分求助中
Clinical Epidemiology: The Essentials, 6e 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
The Graphene Handbook (2019 Edition) 800
Adhesion Science: Principles & Practice 800
Signals, Systems, and Signal Processing 610
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 600
久松真一著作集〈第5巻〉禅と芸術 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6544251
求助须知:如何正确求助?哪些是违规求助? 8333779
关于积分的说明 17858421
捐赠科研通 5652516
什么是DOI,文献DOI怎么找? 2937202
邀请新用户注册赠送积分活动 1913517
关于科研通互助平台的介绍 1776109