Enhancing 5G network slicing for IoT traffic with a novel clustering framework

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ziran Min , Swapna Gokhale , Shashank Shekhar , Charif Mahmoudi , Zhuangwei Kang , Yogesh Barve , Aniruddha Gokhale
{"title":"Enhancing 5G network slicing for IoT traffic with a novel clustering framework","authors":"Ziran Min ,&nbsp;Swapna Gokhale ,&nbsp;Shashank Shekhar ,&nbsp;Charif Mahmoudi ,&nbsp;Zhuangwei Kang ,&nbsp;Yogesh Barve ,&nbsp;Aniruddha Gokhale","doi":"10.1016/j.pmcj.2024.101974","DOIUrl":null,"url":null,"abstract":"<div><p>The current extensive deployment of IoT devices, crucial for enhancing smart computing applications in diverse domains, necessitates the utilization of essential 5G features, notably network slicing, to ensure the provision of distinct and reliable services. However, the voluminous, dynamic, and varied nature of IoT traffic introduces complexities in network flow classification, traffic analysis, and the accurate determination of network requirements. These complexities pose a significant challenge in effectively provisioning 5G network slices across various applications. To address this, we propose an innovative approach for network traffic classification, comprising a pipeline that integrates Principal Component Analysis (PCA) with KMeans clustering and the Hellinger distance measure. The application of PCA as the initial step effectively reduces the dimensionality of the data while retaining most of the original information, which significantly lowers the computational demands for the subsequent KMeans clustering phase. KMeans, an unsupervised learning method, eliminates the labor-intensive and error-prone process of data labeling. Following this, a Hellinger distance-based recursive KMeans algorithm is employed to merge similar clusters, aiding in the determination of the optimal number of clusters. This results in final clustering outcomes that are both compact and intuitively interpretable, overcoming the inherent limitations of the traditional KMeans algorithm, such as its sensitivity to initial conditions and the requirement for manually specifying the number of clusters. An evaluation of our method using a real-world IoT dataset has shown that our pipeline can efficiently represent the dataset in three distinct clusters. The characteristics of these clusters can be readily understood and directly correlated with various types of network slices in the 5G network, demonstrating the efficacy of our approach in managing the complexities of IoT traffic for 5G network slice provisioning.</p></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":null,"pages":null},"PeriodicalIF":3.0000,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1574119224000993/pdfft?md5=35a9df2be399c91dc234552871f71dd2&pid=1-s2.0-S1574119224000993-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pervasive and Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1574119224000993","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The current extensive deployment of IoT devices, crucial for enhancing smart computing applications in diverse domains, necessitates the utilization of essential 5G features, notably network slicing, to ensure the provision of distinct and reliable services. However, the voluminous, dynamic, and varied nature of IoT traffic introduces complexities in network flow classification, traffic analysis, and the accurate determination of network requirements. These complexities pose a significant challenge in effectively provisioning 5G network slices across various applications. To address this, we propose an innovative approach for network traffic classification, comprising a pipeline that integrates Principal Component Analysis (PCA) with KMeans clustering and the Hellinger distance measure. The application of PCA as the initial step effectively reduces the dimensionality of the data while retaining most of the original information, which significantly lowers the computational demands for the subsequent KMeans clustering phase. KMeans, an unsupervised learning method, eliminates the labor-intensive and error-prone process of data labeling. Following this, a Hellinger distance-based recursive KMeans algorithm is employed to merge similar clusters, aiding in the determination of the optimal number of clusters. This results in final clustering outcomes that are both compact and intuitively interpretable, overcoming the inherent limitations of the traditional KMeans algorithm, such as its sensitivity to initial conditions and the requirement for manually specifying the number of clusters. An evaluation of our method using a real-world IoT dataset has shown that our pipeline can efficiently represent the dataset in three distinct clusters. The characteristics of these clusters can be readily understood and directly correlated with various types of network slices in the 5G network, demonstrating the efficacy of our approach in managing the complexities of IoT traffic for 5G network slice provisioning.

利用新颖的聚类框架加强 5G 网络切片,以实现物联网流量
目前,物联网设备的广泛部署对加强不同领域的智能计算应用至关重要,因此有必要利用基本的 5G 功能,特别是网络切片功能,以确保提供独特而可靠的服务。然而,物联网流量的海量、动态和多样化特性给网络流分类、流量分析和准确确定网络需求带来了复杂性。这些复杂性对在各种应用中有效配置 5G 网络切片构成了巨大挑战。为解决这一问题,我们提出了一种创新的网络流量分类方法,其中包括一个将主成分分析(PCA)与 KMeans 聚类和海灵格距离测量相结合的管道。作为初始步骤,PCA 的应用有效降低了数据维度,同时保留了大部分原始信息,这大大降低了后续 KMeans 聚类阶段的计算需求。KMeans 是一种无监督学习方法,省去了数据标注这一耗费大量人力且容易出错的过程。随后,采用基于海灵格距离的递归 KMeans 算法来合并相似的聚类,从而帮助确定聚类的最佳数量。这使得最终的聚类结果既紧凑又可直观地解释,克服了传统 KMeans 算法的固有局限性,如对初始条件的敏感性和手动指定聚类数量的要求。使用真实世界的物联网数据集对我们的方法进行的评估表明,我们的管道可以有效地将数据集表示为三个不同的簇。这些聚类的特征很容易理解,并与 5G 网络中各种类型的网络切片直接相关,这证明了我们的方法在管理物联网流量的复杂性以进行 5G 网络切片配置方面的功效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Pervasive and Mobile Computing
Pervasive and Mobile Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
7.70
自引率
2.30%
发文量
80
审稿时长
68 days
期刊介绍: As envisioned by Mark Weiser as early as 1991, pervasive computing systems and services have truly become integral parts of our daily lives. Tremendous developments in a multitude of technologies ranging from personalized and embedded smart devices (e.g., smartphones, sensors, wearables, IoTs, etc.) to ubiquitous connectivity, via a variety of wireless mobile communications and cognitive networking infrastructures, to advanced computing techniques (including edge, fog and cloud) and user-friendly middleware services and platforms have significantly contributed to the unprecedented advances in pervasive and mobile computing. Cutting-edge applications and paradigms have evolved, such as cyber-physical systems and smart environments (e.g., smart city, smart energy, smart transportation, smart healthcare, etc.) that also involve human in the loop through social interactions and participatory and/or mobile crowd sensing, for example. The goal of pervasive computing systems is to improve human experience and quality of life, without explicit awareness of the underlying communications and computing technologies. The Pervasive and Mobile Computing Journal (PMC) is a high-impact, peer-reviewed technical journal that publishes high-quality scientific articles spanning theory and practice, and covering all aspects of pervasive and mobile computing and systems.
×
引用
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学术官方微信