首页 > 最新文献

Journal of Network and Computer Applications最新文献

英文 中文
Reliability-assured service function chain migration strategy in edge networks using deep reinforcement learning 使用深度强化学习的边缘网络中可靠的服务功能链迁移策略
IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-14 DOI: 10.1016/j.jnca.2024.103999
Yilin Li , Peiying Zhang , Neeraj Kumar , Mohsen Guizani , Jian Wang , Konstantin Igorevich Kostromitin , Yi Wang , Lizhuang Tan

With the widespread adoption of edge computing and the rollout of 5G technology, the edge network is experiencing rapid growth. Edge computing enables the execution of certain computational tasks on edge devices, fostering more efficient resource utilization. However, the reliability of the edge network is constrained by its network connections. Network instability can significantly compromise service quality. An effective service function chain (SFC) migration algorithm is essential to optimize resource utilization, enhance service quality. This paper begins by analyzing the current research landscape of edge networks and SFC migration algorithms. Subsequently, the challenges associated with edge network and SFC migration are formally articulated, leading to the proposal of a SFC migration algorithm based on deep reinforcement learning (DRL) with a focus on reliability assurance (RA-SFCM). The algorithm leverages multi-agent deep reinforcement learning to dynamically perceive changes in the edge network environment. It introduces an advantage function to evaluate the performance of each agent relative to the average level and incorporates a central attention mechanism with multiple attention heads to better capture the interdependencies and relationships among different agents. Additionally, this paper innovatively defines and quantifies the reliability of the migration process. By introducing a reliability penalty mechanism based on the migration target nodes and link capacity, it enhances the reliability of the migration schemes. The experimental results conclusively demonstrate the remarkable advantages of the RA-SFCM algorithm in terms of real-time performance, resource utilization efficiency, and reliability. Compared to algorithms such as Sa-VNFM, ROVM, and DLTSAC, RA-SFCM exhibits superior performance. For RA-SFCM, the optimized deployment migration strategy enhances real-time performance, precise resource management improves utilization efficiency, and advanced fault tolerance mechanisms strengthen reliability.

随着边缘计算的广泛应用和 5G 技术的推出,边缘网络正经历着快速发展。边缘计算可以在边缘设备上执行某些计算任务,提高资源利用效率。然而,边缘网络的可靠性受到其网络连接的限制。网络不稳定会严重影响服务质量。有效的服务功能链(SFC)迁移算法对于优化资源利用、提高服务质量至关重要。本文首先分析了当前边缘网络和 SFC 迁移算法的研究现状。随后,正式阐述了与边缘网络和 SFC 迁移相关的挑战,进而提出了一种基于深度强化学习(DRL)的 SFC 迁移算法,重点关注可靠性保证(RA-SFCM)。该算法利用多代理深度强化学习来动态感知边缘网络环境的变化。它引入了一个优势函数来评估每个代理相对于平均水平的表现,并结合了一个具有多个注意头的中央注意机制,以更好地捕捉不同代理之间的相互依赖和关系。此外,本文还创新性地定义并量化了迁移过程的可靠性。通过引入基于迁移目标节点和链路容量的可靠性惩罚机制,增强了迁移方案的可靠性。实验结果充分证明了 RA-SFCM 算法在实时性、资源利用效率和可靠性方面的显著优势。与 Sa-VNFM、ROVM 和 DLTSAC 等算法相比,RA-SFCM 表现出更优越的性能。对于 RA-SFCM,优化的部署迁移策略提高了实时性,精确的资源管理提高了利用效率,先进的容错机制增强了可靠性。
{"title":"Reliability-assured service function chain migration strategy in edge networks using deep reinforcement learning","authors":"Yilin Li ,&nbsp;Peiying Zhang ,&nbsp;Neeraj Kumar ,&nbsp;Mohsen Guizani ,&nbsp;Jian Wang ,&nbsp;Konstantin Igorevich Kostromitin ,&nbsp;Yi Wang ,&nbsp;Lizhuang Tan","doi":"10.1016/j.jnca.2024.103999","DOIUrl":"10.1016/j.jnca.2024.103999","url":null,"abstract":"<div><p>With the widespread adoption of edge computing and the rollout of 5G technology, the edge network is experiencing rapid growth. Edge computing enables the execution of certain computational tasks on edge devices, fostering more efficient resource utilization. However, the reliability of the edge network is constrained by its network connections. Network instability can significantly compromise service quality. An effective service function chain (SFC) migration algorithm is essential to optimize resource utilization, enhance service quality. This paper begins by analyzing the current research landscape of edge networks and SFC migration algorithms. Subsequently, the challenges associated with edge network and SFC migration are formally articulated, leading to the proposal of a SFC migration algorithm based on deep reinforcement learning (DRL) with a focus on reliability assurance (RA-SFCM). The algorithm leverages multi-agent deep reinforcement learning to dynamically perceive changes in the edge network environment. It introduces an advantage function to evaluate the performance of each agent relative to the average level and incorporates a central attention mechanism with multiple attention heads to better capture the interdependencies and relationships among different agents. Additionally, this paper innovatively defines and quantifies the reliability of the migration process. By introducing a reliability penalty mechanism based on the migration target nodes and link capacity, it enhances the reliability of the migration schemes. The experimental results conclusively demonstrate the remarkable advantages of the RA-SFCM algorithm in terms of real-time performance, resource utilization efficiency, and reliability. Compared to algorithms such as Sa-VNFM, ROVM, and DLTSAC, RA-SFCM exhibits superior performance. For RA-SFCM, the optimized deployment migration strategy enhances real-time performance, precise resource management improves utilization efficiency, and advanced fault tolerance mechanisms strengthen reliability.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103999"},"PeriodicalIF":7.7,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142012580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
CESA: Communication efficient secure aggregation scheme via sparse graph in federated learning CESA:联合学习中通过稀疏图实现的通信高效安全聚合方案
IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-14 DOI: 10.1016/j.jnca.2024.103997
Ruijin Wang , Jinbo Wang , Xiong Li , Jinshan Lai , Fengli Zhang , Xikai Pei , Muhammad Khurram Khan

As a distributed learning paradigm, federated learning can be effectively applied to the decentralized system since it can resolve the “data island” problem. However, it is also vulnerable to serious privacy breaches. Although existing secure aggregation technique can address privacy concerns, they also incur significant additional computation and communication costs. To address these challenges, this paper offers a Communication Efficient Secure Aggregation scheme. Firstly, the central server uses the communication delay between terminals as the weight of the fully terminal-connected graph to transform it into a sparse connected graph based on the minimal spanning tree. Secondly, instead of relying on central server for key advertisement, the terminals advertise keys via a neighboring terminal forwarding approach based on sparsely graph. Thirdly, we propose using the central server for auxiliary advertising to address unexpected terminal dropout. Simultaneously, we theoretically demonstrate our scheme’s security and have lower computation and communication costs. Experiments show that CESA can reduce the running time by 28.2% without sacrificing security and model accuracy compared to conventional secure aggregation when there are 10 terminals in the system.

作为一种分布式学习范式,联盟学习可以有效地应用于分散系统,因为它可以解决 "数据孤岛 "问题。然而,它也容易造成严重的隐私泄露。虽然现有的安全聚合技术可以解决隐私问题,但也会产生大量额外的计算和通信成本。为了应对这些挑战,本文提出了一种通信高效安全聚合方案。首先,中央服务器利用终端之间的通信延迟作为全终端连接图的权重,将其转换为基于最小生成树的稀疏连接图。其次,终端不依赖中央服务器发布密钥,而是通过基于稀疏图的相邻终端转发方式发布密钥。第三,我们建议使用中央服务器进行辅助广告,以解决终端意外掉线的问题。同时,我们从理论上证明了我们方案的安全性,并降低了计算和通信成本。实验表明,当系统中有 10 个终端时,与传统的安全聚合相比,CESA 可以在不牺牲安全性和模型准确性的情况下减少 28.2% 的运行时间。
{"title":"CESA: Communication efficient secure aggregation scheme via sparse graph in federated learning","authors":"Ruijin Wang ,&nbsp;Jinbo Wang ,&nbsp;Xiong Li ,&nbsp;Jinshan Lai ,&nbsp;Fengli Zhang ,&nbsp;Xikai Pei ,&nbsp;Muhammad Khurram Khan","doi":"10.1016/j.jnca.2024.103997","DOIUrl":"10.1016/j.jnca.2024.103997","url":null,"abstract":"<div><p>As a distributed learning paradigm, federated learning can be effectively applied to the decentralized system since it can resolve the “data island” problem. However, it is also vulnerable to serious privacy breaches. Although existing secure aggregation technique can address privacy concerns, they also incur significant additional computation and communication costs. To address these challenges, this paper offers a <u>C</u>ommunication <u>E</u>fficient <u>S</u>ecure <u>A</u>ggregation scheme. Firstly, the central server uses the communication delay between terminals as the weight of the fully terminal-connected graph to transform it into a sparse connected graph based on the minimal spanning tree. Secondly, instead of relying on central server for key advertisement, the terminals advertise keys via a neighboring terminal forwarding approach based on sparsely graph. Thirdly, we propose using the central server for auxiliary advertising to address unexpected terminal dropout. Simultaneously, we theoretically demonstrate our scheme’s security and have lower computation and communication costs. Experiments show that CESA can reduce the running time by 28.2% without sacrificing security and model accuracy compared to conventional secure aggregation when there are 10 terminals in the system.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103997"},"PeriodicalIF":7.7,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142012562","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A survey on security issues in IoT operating systems 物联网操作系统安全问题调查
IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-06 DOI: 10.1016/j.jnca.2024.103976
Panjun Sun, Yi Wan, Zongda Wu, Zhaoxi Fang

The security issues of the core (operating systems) of the Internet of Things (IoT) are becoming increasingly urgent and prominent, this article conducts a systematic research and summary of the security of the current mainstream IoT operating system. Firstly, based on the architecture and applications functions of IoT devices, this article introduces the concept of operating system security, analyzes and studies the security vulnerabilities, key technologies, and attack and defense security mechanisms of operating systems. Secondly, this article investigates the application scenario used by IoT operating systems, such as smart homes, smart healthcare, smart industries, blockchain, and the Internet of Vehicles. Next, from the perspective of building a complete security system, this article investigates the security mechanisms, security frameworks, security kernels, platform integrity, and security testing of IoT operating systems. Finally, this article points out the security challenges and opportunities faced by IoT operating systems, summarizes the current research status, and puts forward corresponding suggestions.

物联网核心(操作系统)的安全问题日益紧迫和突出,本文对当前主流物联网操作系统的安全性进行了系统研究和总结。首先,本文基于物联网设备的体系结构和应用功能,介绍了操作系统安全的概念,分析研究了操作系统的安全漏洞、关键技术和攻防安全机制。其次,本文研究了物联网操作系统的应用场景,如智能家居、智能医疗、智能工业、区块链、车联网等。其次,本文从构建完整安全体系的角度出发,研究了物联网操作系统的安全机制、安全框架、安全内核、平台完整性和安全测试。最后,本文指出了物联网操作系统面临的安全挑战和机遇,总结了目前的研究现状,并提出了相应的建议。
{"title":"A survey on security issues in IoT operating systems","authors":"Panjun Sun,&nbsp;Yi Wan,&nbsp;Zongda Wu,&nbsp;Zhaoxi Fang","doi":"10.1016/j.jnca.2024.103976","DOIUrl":"10.1016/j.jnca.2024.103976","url":null,"abstract":"<div><p>The security issues of the core (operating systems) of the Internet of Things (IoT) are becoming increasingly urgent and prominent, this article conducts a systematic research and summary of the security of the current mainstream IoT operating system. Firstly, based on the architecture and applications functions of IoT devices, this article introduces the concept of operating system security, analyzes and studies the security vulnerabilities, key technologies, and attack and defense security mechanisms of operating systems. Secondly, this article investigates the application scenario used by IoT operating systems, such as smart homes, smart healthcare, smart industries, blockchain, and the Internet of Vehicles. Next, from the perspective of building a complete security system, this article investigates the security mechanisms, security frameworks, security kernels, platform integrity, and security testing of IoT operating systems. Finally, this article points out the security challenges and opportunities faced by IoT operating systems, summarizes the current research status, and puts forward corresponding suggestions.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103976"},"PeriodicalIF":7.7,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141904703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An efficient exact method with polynomial time-complexity to achieve k-strong barrier coverage in heterogeneous wireless multimedia sensor networks 在异构无线多媒体传感器网络中实现 k 强屏障覆盖的多项式时间复杂性高效精确方法
IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-05 DOI: 10.1016/j.jnca.2024.103985
Nguyen Thi My Binh , Huynh Thi Thanh Binh , Ho Viet Duc Luong , Nguyen Tien Long , Trinh Van Chien

Barrier coverage in Wireless Sensor Networks (WSNs) plays a pivotal role in surveillance and security applications. It serves as a fundamental mechanism for identifying and detecting potential intruders who endeavor to infiltrate a sensor barrier. Achieving k-strong barrier coverage is a vital indicator of a WSN’s capability to detect unauthorized intrusions. This paper establishes efficient k-strong barrier coverage in hybrid wireless multimedia sensor networks, referred to as MMS-KSB. The primary goal is to identify a minimal number of mobile sensors to obtain k-barrier coverage. Exhibiting the combinatorial structure, previous research on building k-strong barrier has failed to provide a polynomial time solution for the considered problem and resorted to approximation algorithms. We, therefore, introduce a precise algorithm, named ExA-KSB, and provide theoretical analysis to substantiate that our proposed method achieves an exact solution with polynomial time complexity. Furthermore, we conduct comprehensive experiments to evaluate the efficacy of our algorithm by comparing it with existing approaches. Numerical results demonstrate that ExA-KSB surpasses previous algorithms, and offers superior solution quality with competitive computational efficiency.

无线传感器网络(WSN)中的障碍物覆盖在监控和安全应用中起着至关重要的作用。它是识别和检测试图渗入传感器屏障的潜在入侵者的基本机制。实现 k 强屏障覆盖是 WSN 检测未经授权入侵能力的重要指标。本文在混合无线多媒体传感器网络(简称 MMS-KSB)中建立了高效的 k 强屏障覆盖。主要目标是确定最少数量的移动传感器,以获得 k 强屏障覆盖。由于该问题具有组合结构,以往关于建立 k 强屏障的研究未能提供多项式时间的解决方案,只能采用近似算法。因此,我们引入了一种精确算法,命名为 ExA-KSB,并通过理论分析证明我们提出的方法能以多项式时间复杂度实现精确求解。此外,我们还进行了全面的实验,通过与现有方法的比较来评估我们算法的功效。数值结果表明,ExA-KSB 超越了之前的算法,并以极具竞争力的计算效率提供了卓越的求解质量。
{"title":"An efficient exact method with polynomial time-complexity to achieve k-strong barrier coverage in heterogeneous wireless multimedia sensor networks","authors":"Nguyen Thi My Binh ,&nbsp;Huynh Thi Thanh Binh ,&nbsp;Ho Viet Duc Luong ,&nbsp;Nguyen Tien Long ,&nbsp;Trinh Van Chien","doi":"10.1016/j.jnca.2024.103985","DOIUrl":"10.1016/j.jnca.2024.103985","url":null,"abstract":"<div><p>Barrier coverage in Wireless Sensor Networks (WSNs) plays a pivotal role in surveillance and security applications. It serves as a fundamental mechanism for identifying and detecting potential intruders who endeavor to infiltrate a sensor barrier. Achieving <span><math><mi>k</mi></math></span>-strong barrier coverage is a vital indicator of a WSN’s capability to detect unauthorized intrusions. This paper establishes efficient <span><math><mi>k</mi></math></span>-strong barrier coverage in hybrid wireless multimedia sensor networks, referred to as MMS-KSB. The primary goal is to identify a minimal number of mobile sensors to obtain <span><math><mi>k</mi></math></span>-barrier coverage. Exhibiting the combinatorial structure, previous research on building <span><math><mi>k</mi></math></span>-strong barrier has failed to provide a polynomial time solution for the considered problem and resorted to approximation algorithms. We, therefore, introduce a precise algorithm, named ExA-KSB, and provide theoretical analysis to substantiate that our proposed method achieves an exact solution with polynomial time complexity. Furthermore, we conduct comprehensive experiments to evaluate the efficacy of our algorithm by comparing it with existing approaches. Numerical results demonstrate that ExA-KSB surpasses previous algorithms, and offers superior solution quality with competitive computational efficiency.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103985"},"PeriodicalIF":7.7,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142006823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy-preserving federated learning for proactive maintenance of IoT-empowered multi-location smart city facilities 为主动维护物联网赋能的多地点智能城市设施而进行的隐私保护联合学习
IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-05 DOI: 10.1016/j.jnca.2024.103996
Zu-Sheng Tan , Eric W.K. See-To , Kwan-Yeung Lee , Hong-Ning Dai , Man-Leung Wong

The widespread adoption of the Internet of Things (IoT) and deep learning (DL) have facilitated a social paradigm shift towards smart cities, accelerating the rapid construction of smart facilities. However, newly constructed facilities often lack the necessary data to learn any predictive models, preventing them from being truly smart. Additionally, data collected from different facilities is heterogeneous or may even be privacy-sensitive, making it harder to train proactive maintenance management (PMM) models that are robust to provide services across them. These properties impose challenges that have not been adequately addressed, especially at the city level. In this paper, we present a privacy-preserving, federated learning (FL) framework that can assist management personnel to proactively manage the maintenance schedule of IoT-empowered facilities in different organizations through analyzing heterogeneous IoT data. Our framework consists of (1) an FL platform implemented with fully homomorphic encryption (FHE) for training DL models with time-series heterogeneous IoT data and (2) an FL-based long short-term memory autoencoder model, namely FedLSTMA, for facility-level PMM. To evaluate our framework, we did extensive simulations with real-world data harvested from IoT-empowered public toilets, demonstrating that the DL-based FedLSTMA outperformed other traditional machine learning (ML) algorithms and had a high level of generalizability and capabilities of transferring knowledge from existing facilities to newly constructed facilities under the situation of huge data heterogeneity. We believe that our framework can be a potential solution for overcoming the challenges inherent in managing and maintaining other smart facilities, ultimately contributing to the effective realization of smart cities.

物联网(IoT)和深度学习(DL)的广泛应用促进了社会模式向智能城市的转变,加快了智能设施的快速建设。然而,新建设施往往缺乏学习任何预测模型所需的数据,无法实现真正的智能化。此外,从不同设施收集到的数据是异构的,甚至可能是隐私敏感的,这就更难训练出强大的主动维护管理(PMM)模型,以便在不同设施之间提供服务。这些特性带来的挑战尚未得到充分解决,尤其是在城市层面。在本文中,我们提出了一个保护隐私的联合学习(FL)框架,该框架可以帮助管理人员通过分析异构物联网数据,主动管理不同组织中物联网供电设施的维护计划。我们的框架包括:(1)利用全同态加密(FHE)实现的 FL 平台,用于利用时间序列异构物联网数据训练 DL 模型;(2)基于 FL 的长短期记忆自动编码器模型,即 FedLSTMA,用于设施级 PMM。为了评估我们的框架,我们利用从物联网供电的公共厕所获取的真实世界数据进行了大量模拟,结果表明,基于 DL 的 FedLSTMA 优于其他传统机器学习(ML)算法,并且在数据异构性巨大的情况下,具有较高的泛化能力,能够将知识从现有设施转移到新建设施。我们相信,我们的框架可以成为克服管理和维护其他智能设施固有挑战的潜在解决方案,最终为有效实现智慧城市做出贡献。
{"title":"Privacy-preserving federated learning for proactive maintenance of IoT-empowered multi-location smart city facilities","authors":"Zu-Sheng Tan ,&nbsp;Eric W.K. See-To ,&nbsp;Kwan-Yeung Lee ,&nbsp;Hong-Ning Dai ,&nbsp;Man-Leung Wong","doi":"10.1016/j.jnca.2024.103996","DOIUrl":"10.1016/j.jnca.2024.103996","url":null,"abstract":"<div><p>The widespread adoption of the Internet of Things (IoT) and deep learning (DL) have facilitated a social paradigm shift towards smart cities, accelerating the rapid construction of smart facilities. However, newly constructed facilities often lack the necessary data to learn any predictive models, preventing them from being truly smart. Additionally, data collected from different facilities is heterogeneous or may even be privacy-sensitive, making it harder to train proactive maintenance management (PMM) models that are robust to provide services across them. These properties impose challenges that have not been adequately addressed, especially at the city level. In this paper, we present a privacy-preserving, federated learning (FL) framework that can assist management personnel to proactively manage the maintenance schedule of IoT-empowered facilities in different organizations through analyzing heterogeneous IoT data. Our framework consists of (1) an FL platform implemented with fully homomorphic encryption (FHE) for training DL models with time-series heterogeneous IoT data and (2) an FL-based long short-term memory autoencoder model, namely FedLSTMA, for facility-level PMM. To evaluate our framework, we did extensive simulations with real-world data harvested from IoT-empowered public toilets, demonstrating that the DL-based FedLSTMA outperformed other traditional machine learning (ML) algorithms and had a high level of generalizability and capabilities of transferring knowledge from existing facilities to newly constructed facilities under the situation of huge data heterogeneity. We believe that our framework can be a potential solution for overcoming the challenges inherent in managing and maintaining other smart facilities, ultimately contributing to the effective realization of smart cities.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103996"},"PeriodicalIF":7.7,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142012561","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy preservation in Artificial Intelligence and Extended Reality (AI-XR) metaverses: A survey 人工智能和扩展现实(AI-XR)元verses 中的隐私保护:调查
IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-02 DOI: 10.1016/j.jnca.2024.103989
Mahdi Alkaeed , Adnan Qayyum , Junaid Qadir

The metaverse is a nascent concept that envisions a virtual universe, a collaborative space where individuals can interact, create, and participate in a wide range of activities. Privacy in the metaverse is a critical concern as the concept evolves and immersive virtual experiences become more prevalent. The metaverse privacy problem refers to the challenges and concerns surrounding the privacy of personal information and data within Virtual Reality (VR) environments as the concept of a shared VR space becomes more accessible. Metaverse will harness advancements from various technologies such as Artificial Intelligence (AI), Extended Reality (XR) and Mixed Reality (MR) to provide personalized and immersive services to its users. Moreover, to enable more personalized experiences, the metaverse relies on the collection of fine-grained user data that leads to various privacy issues. Therefore, before the potential of the metaverse can be fully realized, privacy concerns related to personal information and data within VR environments must be addressed. This includes safeguarding users’ control over their data, ensuring the security of their personal information, and protecting in-world actions and interactions from unauthorized sharing. In this paper, we explore various privacy challenges that future metaverses are expected to face, given their reliance on AI for tracking users, creating XR and MR experiences, and facilitating interactions. Moreover, we thoroughly analyze technical solutions such as differential privacy, Homomorphic Encryption, and Federated Learning and discuss related sociotechnical issues regarding privacy.

元宇宙(metaverse)是一个新兴概念,它设想了一个虚拟宇宙,一个个人可以互动、创造和参与各种活动的协作空间。随着元宇宙概念的发展和身临其境的虚拟体验的普及,元宇宙中的隐私问题成为人们关注的焦点。元宇宙隐私问题是指随着共享虚拟现实(VR)空间概念的普及,围绕虚拟现实(VR)环境中个人信息和数据隐私的挑战和担忧。元宇宙将利用人工智能(AI)、扩展现实(XR)和混合现实(MR)等各种技术的进步,为用户提供个性化和身临其境的服务。此外,为了实现更加个性化的体验,元宇宙依赖于收集细粒度的用户数据,这就导致了各种隐私问题。因此,在充分发挥元宇宙的潜力之前,必须解决 VR 环境中与个人信息和数据有关的隐私问题。这包括保障用户对其数据的控制,确保其个人信息的安全,以及保护用户在虚拟世界中的行为和互动免受未经授权的共享。在本文中,我们将探讨未来的元虚拟现实技术预计将面临的各种隐私挑战,因为它们依赖人工智能来跟踪用户、创建 XR 和 MR 体验以及促进交互。此外,我们还深入分析了差分隐私、同态加密和联合学习等技术解决方案,并讨论了与隐私相关的社会技术问题。
{"title":"Privacy preservation in Artificial Intelligence and Extended Reality (AI-XR) metaverses: A survey","authors":"Mahdi Alkaeed ,&nbsp;Adnan Qayyum ,&nbsp;Junaid Qadir","doi":"10.1016/j.jnca.2024.103989","DOIUrl":"10.1016/j.jnca.2024.103989","url":null,"abstract":"<div><p>The metaverse is a nascent concept that envisions a virtual universe, a collaborative space where individuals can interact, create, and participate in a wide range of activities. Privacy in the metaverse is a critical concern as the concept evolves and immersive virtual experiences become more prevalent. The metaverse privacy problem refers to the challenges and concerns surrounding the privacy of personal information and data within Virtual Reality (VR) environments as the concept of a shared VR space becomes more accessible. Metaverse will harness advancements from various technologies such as Artificial Intelligence (AI), Extended Reality (XR) and Mixed Reality (MR) to provide personalized and immersive services to its users. Moreover, to enable more personalized experiences, the metaverse relies on the collection of fine-grained user data that leads to various privacy issues. Therefore, before the potential of the metaverse can be fully realized, privacy concerns related to personal information and data within VR environments must be addressed. This includes safeguarding users’ control over their data, ensuring the security of their personal information, and protecting in-world actions and interactions from unauthorized sharing. In this paper, we explore various privacy challenges that future metaverses are expected to face, given their reliance on AI for tracking users, creating XR and MR experiences, and facilitating interactions. Moreover, we thoroughly analyze technical solutions such as differential privacy, Homomorphic Encryption, and Federated Learning and discuss related sociotechnical issues regarding privacy.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103989"},"PeriodicalIF":7.7,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1084804524001668/pdfft?md5=1b10971c5af604f8b43a86d1554a73bc&pid=1-s2.0-S1084804524001668-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141963237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
CRSFL: Cluster-based Resource-aware Split Federated Learning for Continuous Authentication CRSFL:基于集群的资源感知拆分联合学习,实现持续验证
IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-02 DOI: 10.1016/j.jnca.2024.103987
Mohamad Wazzeh , Mohamad Arafeh , Hani Sami , Hakima Ould-Slimane , Chamseddine Talhi , Azzam Mourad , Hadi Otrok

In the ever-changing world of technology, continuous authentication and comprehensive access management are essential during user interactions with a device. Split Learning (SL) and Federated Learning (FL) have recently emerged as promising technologies for training a decentralized Machine Learning (ML) model. With the increasing use of smartphones and Internet of Things (IoT) devices, these distributed technologies enable users with limited resources to complete neural network model training with server assistance and collaboratively combine knowledge between different nodes. In this study, we propose combining these technologies to address the continuous authentication challenge while protecting user privacy and limiting device resource usage. However, the model’s training is slowed due to SL sequential training and resource differences between IoT devices with different specifications. Therefore, we use a cluster-based approach to group devices with similar capabilities to mitigate the impact of slow devices while filtering out the devices incapable of training the model. In addition, we address the efficiency and robustness of training ML models by using SL and FL techniques to train the clients simultaneously while analyzing the overhead burden of the process. Following clustering, we select the best set of clients to participate in training through a Genetic Algorithm (GA) optimized on a carefully designed list of objectives. The performance of our proposed framework is compared to baseline methods, and the advantages are demonstrated using a real-life UMDAA-02-FD face detection dataset. The results show that CRSFL, our proposed approach, maintains high accuracy and reduces the overhead burden in continuous authentication scenarios while preserving user privacy.

在瞬息万变的技术世界中,持续的身份验证和全面的访问管理对于用户与设备的交互至关重要。最近出现的拆分学习(SL)和联合学习(FL)是训练分散式机器学习(ML)模型的有前途的技术。随着智能手机和物联网(IoT)设备的使用越来越多,这些分布式技术使资源有限的用户能够在服务器的协助下完成神经网络模型训练,并在不同节点之间协同组合知识。在本研究中,我们建议将这些技术结合起来,在保护用户隐私和限制设备资源使用的同时,解决持续验证难题。然而,由于 SL 的顺序训练和不同规格的物联网设备之间的资源差异,模型的训练速度较慢。因此,我们采用基于集群的方法,将功能相似的设备分组,以减轻速度慢的设备的影响,同时过滤掉无法训练模型的设备。此外,我们还使用 SL 和 FL 技术同时训练客户端,同时分析该过程的开销负担,从而解决训练 ML 模型的效率和鲁棒性问题。在聚类之后,我们通过遗传算法(GA)根据精心设计的目标列表进行优化,选择一组最佳客户端参与训练。我们将所提框架的性能与基线方法进行了比较,并使用真实的 UMDAA-02-FD 人脸检测数据集展示了其优势。结果表明,我们提出的 CRSFL 方法在连续身份验证场景中保持了较高的准确性,并减少了开销负担,同时保护了用户隐私。
{"title":"CRSFL: Cluster-based Resource-aware Split Federated Learning for Continuous Authentication","authors":"Mohamad Wazzeh ,&nbsp;Mohamad Arafeh ,&nbsp;Hani Sami ,&nbsp;Hakima Ould-Slimane ,&nbsp;Chamseddine Talhi ,&nbsp;Azzam Mourad ,&nbsp;Hadi Otrok","doi":"10.1016/j.jnca.2024.103987","DOIUrl":"10.1016/j.jnca.2024.103987","url":null,"abstract":"<div><p>In the ever-changing world of technology, continuous authentication and comprehensive access management are essential during user interactions with a device. Split Learning (SL) and Federated Learning (FL) have recently emerged as promising technologies for training a decentralized Machine Learning (ML) model. With the increasing use of smartphones and Internet of Things (IoT) devices, these distributed technologies enable users with limited resources to complete neural network model training with server assistance and collaboratively combine knowledge between different nodes. In this study, we propose combining these technologies to address the continuous authentication challenge while protecting user privacy and limiting device resource usage. However, the model’s training is slowed due to SL sequential training and resource differences between IoT devices with different specifications. Therefore, we use a cluster-based approach to group devices with similar capabilities to mitigate the impact of slow devices while filtering out the devices incapable of training the model. In addition, we address the efficiency and robustness of training ML models by using SL and FL techniques to train the clients simultaneously while analyzing the overhead burden of the process. Following clustering, we select the best set of clients to participate in training through a Genetic Algorithm (GA) optimized on a carefully designed list of objectives. The performance of our proposed framework is compared to baseline methods, and the advantages are demonstrated using a real-life UMDAA-02-FD face detection dataset. The results show that CRSFL, our proposed approach, maintains high accuracy and reduces the overhead burden in continuous authentication scenarios while preserving user privacy.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103987"},"PeriodicalIF":7.7,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141993639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Designing transport scheme of 3D naked-eye system 设计 3D 裸眼系统的传输方案
IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-02 DOI: 10.1016/j.jnca.2024.103988
Rong Zheng, Xiaoqin Feng, Fengyuan Ren

3D naked-eye is constructed from multi-stream as a typical representation of stereoscopic video. Its enormous data volume and stringent low-delay transport requirements pose significant challenges for high-quality real-time transport. Through analysis and experimental verification that current streaming media transport frameworks using the server–client or peer-to-peer scheme face difficulties when transmitting 3D naked-eye in a one-to-one format. Besides, the existing bandwidth estimation algorithms cannot achieve the expected performance when dealing with delay-sensitive traffic. This results in low bandwidth utilization and slow bandwidth estimation, rendering it unfeasible to deliver multi-stream on time. We propose an effective transport framework with different modules for real-time multi-stream and introduce an Agent-to-Agent transport scheme that provides many-to-one connection as the main implementation way of 3D naked-eye transport framework. Additionally, we propose a direct bandwidth estimation algorithm to quickly match network bandwidth for low-delay transport. The Agent terminal centrally processes consolidates transports, and provides macro-level management of multiple video streams. The algorithm directly detects the available bandwidth using packet interval and packet rate models. Finally, using rate decision algorithm arbitrates the results to directly measure the maximum available bandwidth of the link. The Agent-to-Agent achieves 99% bandwidth utilization, addressing the limitations of existing streaming schemes in handling concurrent data streams. Our algorithm provides precise bandwidth estimates with minimal time overhead, meeting the requirements of a delay-sensitive 3D naked-eye system across diverse environments.

裸眼 3D 由多数据流构建而成,是立体视频的典型表现形式。其巨大的数据量和严格的低延迟传输要求为高质量的实时传输带来了巨大挑战。通过分析和实验验证,目前使用服务器-客户端或点对点方案的流媒体传输框架在以一对一格式传输裸眼 3D 时面临困难。此外,现有的带宽估算算法在处理对延迟敏感的流量时无法达到预期性能。这导致带宽利用率低,带宽估算速度慢,无法按时传输多数据流。我们为实时多流提出了一个包含不同模块的有效传输框架,并引入了一种提供多对一连接的代理对代理传输方案,作为三维裸眼传输框架的主要实现方式。此外,我们还提出了一种直接带宽估算算法,以快速匹配网络带宽,实现低延迟传输。代理终端集中处理合并传输,对多个视频流进行宏观管理。该算法利用数据包间隔和数据包速率模型直接检测可用带宽。最后,使用速率决策算法对结果进行仲裁,以直接测量链路的最大可用带宽。代理对代理的带宽利用率达到 99%,解决了现有流媒体方案在处理并发数据流方面的局限性。我们的算法以最小的时间开销提供精确的带宽估算,满足了不同环境下对延迟敏感的 3D 裸眼系统的要求。
{"title":"Designing transport scheme of 3D naked-eye system","authors":"Rong Zheng,&nbsp;Xiaoqin Feng,&nbsp;Fengyuan Ren","doi":"10.1016/j.jnca.2024.103988","DOIUrl":"10.1016/j.jnca.2024.103988","url":null,"abstract":"<div><p>3D naked-eye is constructed from multi-stream as a typical representation of stereoscopic video. Its enormous data volume and stringent low-delay transport requirements pose significant challenges for high-quality real-time transport. Through analysis and experimental verification that current streaming media transport frameworks using the server–client or peer-to-peer scheme face difficulties when transmitting 3D naked-eye in a one-to-one format. Besides, the existing bandwidth estimation algorithms cannot achieve the expected performance when dealing with delay-sensitive traffic. This results in low bandwidth utilization and slow bandwidth estimation, rendering it unfeasible to deliver multi-stream on time. We propose an effective transport framework with different modules for real-time multi-stream and introduce an Agent-to-Agent transport scheme that provides many-to-one connection as the main implementation way of 3D naked-eye transport framework. Additionally, we propose a direct bandwidth estimation algorithm to quickly match network bandwidth for low-delay transport. The Agent terminal centrally processes consolidates transports, and provides macro-level management of multiple video streams. The algorithm directly detects the available bandwidth using packet interval and packet rate models. Finally, using rate decision algorithm arbitrates the results to directly measure the maximum available bandwidth of the link. The Agent-to-Agent achieves 99% bandwidth utilization, addressing the limitations of existing streaming schemes in handling concurrent data streams. Our algorithm provides precise bandwidth estimates with minimal time overhead, meeting the requirements of a delay-sensitive 3D naked-eye system across diverse environments.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103988"},"PeriodicalIF":7.7,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141904708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DFier: A directed vulnerability verifier for Ethereum smart contracts DFier:以太坊智能合约的定向漏洞验证器
IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-07-30 DOI: 10.1016/j.jnca.2024.103984
Zeli Wang , Weiqi Dai , Ming Li , Kim-Kwang Raymond Choo , Deqing Zou

Smart contracts are self-executing digital agreements that automatically enforce the terms between parties, playing a crucial role in blockchain systems. However, due to the potential losses of digital assets caused by vulnerabilities, the security issues of Ethereum smart contracts have garnered widespread attention. To address this, researchers have developed various techniques to detect vulnerabilities in smart contracts, with fuzzing techniques achieving promising results. Nonetheless, current fuzzers are unable to effectively exercise suspicious targets because they overlook two key factors: comprehensively exploring all paths to the targets and providing high-quality directed seed inputs. This paper presents a Directed vulnerability veriFier (DFier), which elaborates effective transaction sequences with directed inputs for the fuzzer. This focuses on exploring target paths and automatically validating whether the specified locations are vulnerable. Specifically, DFier employs static analysis to help locate target paths, facilitating their comprehensive exploration. Additionally, we devise three heuristic strategies to enable our fuzzing technique to generate directed inputs that effectively validate the targets. Extensive experiments demonstrate that DFier is effective in verifying contract security, compared with three existing contract fuzzers (i.e., contractFuzzer, sFuzz, and conFuzzius), while the performance losses are in an acceptable range.

智能合约是一种自动执行的数字协议,可以自动执行各方之间的条款,在区块链系统中发挥着至关重要的作用。然而,由于漏洞可能导致数字资产损失,以太坊智能合约的安全问题引起了广泛关注。为此,研究人员开发了各种技术来检测智能合约中的漏洞,其中模糊技术取得了可喜的成果。然而,目前的模糊器由于忽略了两个关键因素,即全面探索通往目标的所有路径和提供高质量的定向种子输入,因此无法有效地对可疑目标进行练习。本文提出了一种定向漏洞验证器(DFier),它为模糊器精心设计了具有定向输入的有效交易序列。其重点是探索目标路径,并自动验证指定位置是否存在漏洞。具体来说,DFier 利用静态分析来帮助定位目标路径,从而促进对目标路径的全面探索。此外,我们还设计了三种启发式策略,使我们的模糊技术能够生成有效验证目标的定向输入。广泛的实验证明,与现有的三种合同模糊器(即 contractFuzzer、sFuzz 和 conFuzzius)相比,DFier 能有效验证合同的安全性,而性能损失在可接受的范围内。
{"title":"DFier: A directed vulnerability verifier for Ethereum smart contracts","authors":"Zeli Wang ,&nbsp;Weiqi Dai ,&nbsp;Ming Li ,&nbsp;Kim-Kwang Raymond Choo ,&nbsp;Deqing Zou","doi":"10.1016/j.jnca.2024.103984","DOIUrl":"10.1016/j.jnca.2024.103984","url":null,"abstract":"<div><p>Smart contracts are self-executing digital agreements that automatically enforce the terms between parties, playing a crucial role in blockchain systems. However, due to the potential losses of digital assets caused by vulnerabilities, the security issues of Ethereum smart contracts have garnered widespread attention. To address this, researchers have developed various techniques to detect vulnerabilities in smart contracts, with fuzzing techniques achieving promising results. Nonetheless, current fuzzers are unable to effectively exercise suspicious targets because they overlook two key factors: comprehensively exploring all paths to the targets and providing high-quality directed seed inputs. This paper presents a <u>D</u>irected vulnerability veri<u>Fier</u> (DFier), which elaborates effective transaction sequences with directed inputs for the fuzzer. This focuses on exploring target paths and automatically validating whether the specified locations are vulnerable. Specifically, DFier employs static analysis to help locate target paths, facilitating their comprehensive exploration. Additionally, we devise three heuristic strategies to enable our fuzzing technique to generate directed inputs that effectively validate the targets. Extensive experiments demonstrate that DFier is effective in verifying contract security, compared with three existing contract fuzzers (i.e., contractFuzzer, sFuzz, and conFuzzius), while the performance losses are in an acceptable range.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103984"},"PeriodicalIF":7.7,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141904701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MATE: A multi-agent reinforcement learning approach for Traffic Engineering in Hybrid Software Defined Networks MATE:用于混合软件定义网络流量工程的多代理强化学习方法
IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-07-30 DOI: 10.1016/j.jnca.2024.103981
Yingya Guo , Mingjie Ding , Weihong Zhou , Bin Lin , Cen Chen , Huan Luo

Hybrid Software Defined Networks (Hybrid SDNs), which combines the robustness of distributed network and the flexibility of centralized network, is now a prevailing network architecture. Previous hybrid SDN Traffic Engineering (TE) solutions search an optimal link weight setting or compute the splitting ratios of traffic leveraging heuristic algorithms. However, these methods cannot react timely to the fluctuating traffic demands in dynamic environments and suffer a hefty performance degradation when traffic demands change or network failures happen, especially when network scale is large. To cope with this, we propose a Multi-Agent reinforcement learning based TE method MATE that timely determines the route selection for network flows in dynamic hybrid SDNs. Through dividing the large-scale routing optimization problem into small-scale problem, MATE can better learn the mapping between the traffic demands and routing policy, and efficiently make online routing inference with dynamic traffic demands. To collaborate multiple agents and speed up the convergence in the training process, we innovatively design the actor network and introduce previous actions of all agents in the training of each agent. Extensive experiments conducted on different network topologies demonstrate our proposed method MATE has superior TE performance with dynamic traffic demands and is robust to network failures.

混合软件定义网络(Hybrid SDN)结合了分布式网络的鲁棒性和集中式网络的灵活性,是目前流行的网络架构。以往的混合 SDN 流量工程(TE)解决方案利用启发式算法搜索最佳链路权重设置或计算流量分流比。然而,这些方法无法及时应对动态环境中不断变化的流量需求,当流量需求发生变化或网络发生故障时,尤其是当网络规模较大时,性能会严重下降。为此,我们提出了一种基于多代理强化学习的 TE 方法 MATE,它能及时确定动态混合 SDN 中网络流的路由选择。通过将大规模路由优化问题划分为小规模问题,MATE 可以更好地学习流量需求与路由策略之间的映射关系,并在动态流量需求下高效地进行在线路由推断。为了让多个代理协同工作并加快训练过程的收敛速度,我们创新性地设计了代理网络,并在每个代理的训练中引入了所有代理之前的行动。在不同网络拓扑结构上进行的大量实验证明,我们提出的 MATE 方法在动态流量需求下具有卓越的 TE 性能,并且对网络故障具有鲁棒性。
{"title":"MATE: A multi-agent reinforcement learning approach for Traffic Engineering in Hybrid Software Defined Networks","authors":"Yingya Guo ,&nbsp;Mingjie Ding ,&nbsp;Weihong Zhou ,&nbsp;Bin Lin ,&nbsp;Cen Chen ,&nbsp;Huan Luo","doi":"10.1016/j.jnca.2024.103981","DOIUrl":"10.1016/j.jnca.2024.103981","url":null,"abstract":"<div><p>Hybrid Software Defined Networks (Hybrid SDNs), which combines the robustness of distributed network and the flexibility of centralized network, is now a prevailing network architecture. Previous hybrid SDN Traffic Engineering (TE) solutions search an optimal link weight setting or compute the splitting ratios of traffic leveraging heuristic algorithms. However, these methods cannot react timely to the fluctuating traffic demands in dynamic environments and suffer a hefty performance degradation when traffic demands change or network failures happen, especially when network scale is large. To cope with this, we propose a Multi-Agent reinforcement learning based TE method MATE that timely determines the route selection for network flows in dynamic hybrid SDNs. Through dividing the large-scale routing optimization problem into small-scale problem, MATE can better learn the mapping between the traffic demands and routing policy, and efficiently make online routing inference with dynamic traffic demands. To collaborate multiple agents and speed up the convergence in the training process, we innovatively design the actor network and introduce previous actions of all agents in the training of each agent. Extensive experiments conducted on different network topologies demonstrate our proposed method MATE has superior TE performance with dynamic traffic demands and is robust to network failures.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"231 ","pages":"Article 103981"},"PeriodicalIF":7.7,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141904706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Network and Computer Applications
全部 Appl. Clay Sci. Chem. Ecol. Geochem. J. Environmental Claims Journal INT J MOD PHYS B 2013 IEEE International Conference on Computer Vision Yan Ke Xue Bao (Hong Kong) ACTA GEOL POL Geobiology npj Clim. Atmos. Sci. Geosci. J. Ecol. Res. NANOPHOTONICS-BERLIN Engineering Science and Technology, an International Journal Acta Geochimica 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops Int. J. Astrobiol. ECOL RESTOR Bull. Geol. Soc. Den. Int. J. Climatol. 2013 IEEE 39th Photovoltaic Specialists Conference (PVSC) ENG SANIT AMBIENT Astrophys. J. Suppl. Ser. UNIVERSE-BASEL 2009 16th International Conference on Industrial Engineering and Engineering Management Espacio Tiempo y Forma. Serie VI, Geografía Am. J. Sci. ERN: Regulation (IO) (Topic) GROUNDWATER Org. Geochem. CHIN OPT LETT Ocean and Coastal Research 液晶与显示 Int. J. Geomech. Nat. Rev. Phys. ENVIRON GEOL 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT) J. Opt. ACTA REUMATOL PORT Essentials of Polymer Flooding Technique Clim. Change 2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST) 2013 IEEE International Conference on Consumer Electronics (ICCE) [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science 2011 International Conference on Computer Vision Environ. Prog. Sustainable Energy J. Plasma Phys. Pure Appl. Geophys. AAPG Bull. Basin Res. Carbon Balance Manage. Geochim. Cosmochim. Acta ACTA PETROL SIN Energy Ecol Environ Environ. Educ. Res, Int. J. Biometeorol. 2010 International Conference on Challenges in Environmental Science and Computer Engineering Ecol. Indic. Ecol. Monogr. Clean-Soil Air Water Acta Geophys. Environ. Technol. Innovation BIOGEOSCIENCES J MICRO-NANOLITH MEM Big Earth Data Adv. Meteorol. ENVIRONMENT Geochem. Trans. Contrib. Mineral. Petrol. Environ. Eng. Manage. J. Ecol. Eng. ENVIRON HEALTH-GLOB Environ. Geochem. Health Ann. Glaciol. Environ. Eng. Res. Environ. Prot. Eng. Can. J. Phys. Energy Environ. Annu. Rev. Earth Planet. Sci. ACTA GEOL SIN-ENGL Am. J. Phys. Anthropol. Environ. Toxicol. Pharmacol. Q. J. R. Meteorolog. Soc. Environ. Res. Lett. Adv. Atmos. Sci. Environ. Eng. Sci. Atmos. Chem. Phys. Archaeol. Anthropol. Sci. J. Atmos. Chem. Geol. Ore Deposits ECOTOXICOLOGY IZV-PHYS SOLID EART+ Geostand. Geoanal. Res. Transactions. Section on Ophthalmology. American Academy of Ophthalmology and Otolaryngology Acta Oceanolog. Sin. Chin. Phys. Lett. Environ. Chem. Atmos. Meas. Tech. Am. Mineral. Classical Quantum Gravity
×
引用
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