基于颗粒的在线流量分类

Pingping Tang, Yu-ning Dong, S. Mao
{"title":"基于颗粒的在线流量分类","authors":"Pingping Tang, Yu-ning Dong, S. Mao","doi":"10.1109/infocomwkshps50562.2020.9162884","DOIUrl":null,"url":null,"abstract":"Currently, it is still a great challenge to achieve online classification of massive traffic flows under dynamic network environments. Therefore, based on granular computing, an artificial intelligence computing method, which is effective to process missing, incomplete, or noisy data, a novel classification model $\\mathrm{M}_{GrC}$ is proposed in this paper. In $\\mathrm{M}_{GrC}$, we first define granules for the traffic flow, then explore the correlation between granules, and finally establish the structure granules to differentiate flow types. $\\mathrm{M}_{GrC}$ explores the inherent relationship between packets, where the data is no longer isolated, but closely related to each other. So, it can identify the traffic more accurately when compared with the traditional classification methods, which assume the packets to be independent. The experiment results also demonstrate its superior robustness and adaptability in highly variable network environment.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Online Traffic Classification Using Granules\",\"authors\":\"Pingping Tang, Yu-ning Dong, S. Mao\",\"doi\":\"10.1109/infocomwkshps50562.2020.9162884\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Currently, it is still a great challenge to achieve online classification of massive traffic flows under dynamic network environments. Therefore, based on granular computing, an artificial intelligence computing method, which is effective to process missing, incomplete, or noisy data, a novel classification model $\\\\mathrm{M}_{GrC}$ is proposed in this paper. In $\\\\mathrm{M}_{GrC}$, we first define granules for the traffic flow, then explore the correlation between granules, and finally establish the structure granules to differentiate flow types. $\\\\mathrm{M}_{GrC}$ explores the inherent relationship between packets, where the data is no longer isolated, but closely related to each other. So, it can identify the traffic more accurately when compared with the traditional classification methods, which assume the packets to be independent. The experiment results also demonstrate its superior robustness and adaptability in highly variable network environment.\",\"PeriodicalId\":104136,\"journal\":{\"name\":\"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/infocomwkshps50562.2020.9162884\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/infocomwkshps50562.2020.9162884","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

目前,如何在动态网络环境下实现海量流量的在线分类仍然是一个很大的挑战。因此,本文基于能够有效处理缺失、不完整或有噪声数据的人工智能计算方法——颗粒计算,提出了一种新的分类模型$\ mathm {M}_{GrC}$。在$\mathrm{M}_{GrC}$中,我们首先定义交通流的颗粒,然后探索颗粒之间的相关性,最后建立结构颗粒来区分流量类型。$\mathrm{M}_{GrC}$探索数据包之间的内在关系,其中数据不再是孤立的,而是彼此密切相关。因此,与传统的假定报文是独立的分类方法相比,该方法可以更准确地识别流量。实验结果表明,该算法在高度可变的网络环境中具有良好的鲁棒性和适应性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Online Traffic Classification Using Granules
Currently, it is still a great challenge to achieve online classification of massive traffic flows under dynamic network environments. Therefore, based on granular computing, an artificial intelligence computing method, which is effective to process missing, incomplete, or noisy data, a novel classification model $\mathrm{M}_{GrC}$ is proposed in this paper. In $\mathrm{M}_{GrC}$, we first define granules for the traffic flow, then explore the correlation between granules, and finally establish the structure granules to differentiate flow types. $\mathrm{M}_{GrC}$ explores the inherent relationship between packets, where the data is no longer isolated, but closely related to each other. So, it can identify the traffic more accurately when compared with the traditional classification methods, which assume the packets to be independent. The experiment results also demonstrate its superior robustness and adaptability in highly variable network environment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信