A Classification Framework for IoT Network Traffic Data for Provisioning 5G Network Slices in Smart Computing Applications

Ziran Min, S. Gokhale, Shashank Shekhar, C. Mahmoudi, Zhuangwei Kang, Yogesh D. Barve, A. Gokhale
{"title":"A Classification Framework for IoT Network Traffic Data for Provisioning 5G Network Slices in Smart Computing Applications","authors":"Ziran Min, S. Gokhale, Shashank Shekhar, C. Mahmoudi, Zhuangwei Kang, Yogesh D. Barve, A. Gokhale","doi":"10.1109/SMARTCOMP58114.2023.00034","DOIUrl":null,"url":null,"abstract":"Existing massive deployments of IoT devices in support of smart computing applications across a range of domains must leverage critical features of 5G, such as network slicing, to receive differentiated and reliable services. However, the voluminous, dynamic, and heterogeneous nature of IoT traffic imposes complexities on the problems of network flow classification, network traffic analysis, and accurate quantification of the network requirements, thereby making the provisioning of 5G network slices across the application mix a challenging problem. To address these needs, we propose a novel network traffic classification approach that consists of a pipeline that combines Principal Component Analysis (PCA), with KMeans clustering and Hellinger distance. PCA is applied as the first step to efficiently reduce the dimensionality of features while preserving as much of the original information as possible. This significantly reduces the runtime of KMeans, which is applied as the second step. KMeans, being an unsupervised approach, eliminates the need to label data which can be cumbersome, error-prone, and time-consuming. In the third step, a Hellinger distance-based recursive KMeans algorithm is applied to merge similar clusters toward identifying the optimal number of clusters. This makes the final clustering results compact and intuitively interpretable within the context of the problem, while addressing the limitations of traditional KMeans algorithm, such as sensitivity to initialization and the requirement of manual specification of the number of clusters. Evaluation of our approach on a real-world IoT dataset demonstrates that the pipeline can compactly represent the dataset as three clusters. The service properties of these clusters can be easily inferred and directly mapped to different types of slices in the 5G network.","PeriodicalId":163556,"journal":{"name":"2023 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"25 6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE International Conference on Smart Computing (SMARTCOMP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMARTCOMP58114.2023.00034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Existing massive deployments of IoT devices in support of smart computing applications across a range of domains must leverage critical features of 5G, such as network slicing, to receive differentiated and reliable services. However, the voluminous, dynamic, and heterogeneous nature of IoT traffic imposes complexities on the problems of network flow classification, network traffic analysis, and accurate quantification of the network requirements, thereby making the provisioning of 5G network slices across the application mix a challenging problem. To address these needs, we propose a novel network traffic classification approach that consists of a pipeline that combines Principal Component Analysis (PCA), with KMeans clustering and Hellinger distance. PCA is applied as the first step to efficiently reduce the dimensionality of features while preserving as much of the original information as possible. This significantly reduces the runtime of KMeans, which is applied as the second step. KMeans, being an unsupervised approach, eliminates the need to label data which can be cumbersome, error-prone, and time-consuming. In the third step, a Hellinger distance-based recursive KMeans algorithm is applied to merge similar clusters toward identifying the optimal number of clusters. This makes the final clustering results compact and intuitively interpretable within the context of the problem, while addressing the limitations of traditional KMeans algorithm, such as sensitivity to initialization and the requirement of manual specification of the number of clusters. Evaluation of our approach on a real-world IoT dataset demonstrates that the pipeline can compactly represent the dataset as three clusters. The service properties of these clusters can be easily inferred and directly mapped to different types of slices in the 5G network.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向智能计算应用中5G网络切片发放的物联网网络流量数据分类框架
为了支持跨领域的智能计算应用,现有的大规模部署的物联网设备必须利用5G的关键特性,如网络切片,以获得差异化和可靠的服务。然而,物联网流量的庞大、动态和异构特性给网络流分类、网络流量分析和准确量化网络需求等问题带来了复杂性,从而使跨应用组合提供5G网络切片成为一个具有挑战性的问题。为了满足这些需求,我们提出了一种新的网络流量分类方法,该方法由结合主成分分析(PCA)、KMeans聚类和海灵格距离的管道组成。采用PCA作为第一步,有效地降低特征的维数,同时尽可能多地保留原始信息。这大大减少了作为第二步应用的KMeans的运行时间。作为一种无监督的方法,KMeans消除了标记数据的需要,这可能是繁琐的、容易出错的和耗时的。在第三步中,应用基于Hellinger距离的递归KMeans算法合并相似的聚类,以确定最优的聚类数量。这使得最终的聚类结果紧凑,并且在问题的上下文中可以直观地解释,同时解决了传统KMeans算法的局限性,例如对初始化的敏感性以及需要手动指定聚类数量。对我们的方法在现实世界物联网数据集上的评估表明,管道可以紧凑地将数据集表示为三个集群。这些集群的业务属性可以很容易地推断出来,并直接映射到5G网络中不同类型的切片上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Teaching Humanoid Robots to Assist Humans for Collaborative Tasks Keynotes A Novel Context Aware Paths Recommendation Approach for the Cultural Heritage Enhancement Internet of Things in SPA Medicine: A General Framework to Improve User Treatments Nisshash: Design of An IoT-based Smart T-Shirt for Guided Breathing Exercises
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1