Pub Date : 2024-10-09DOI: 10.1016/j.comcom.2024.107968
Antonin Le Floch , Rahim Kacimi , Pierre Druart , Yoann Lefebvre , André-Luc Beylot
Localization inside legacy private 5G networks is a daunting task that involves solving the problem of indoor localization using commercial off-the-shelf proprietary hardware. While some previous work has focused on experimental analysis, none has undertaken to develop a realistic solution based on commercial equipment. In this study, we present the first comprehensive and concrete 5G framework that combines fingerprinting with the 3GPP Enhanced Cell ID (E-CID) approach. Our methodology consists of a machine-learning model to deduce the user’s position by comparing the signal strength received from the User Equipment (UE) with a reference radio power map. To achieve this, the 3GPP protocols and functions are improved to provide open, centralized, and universal localization functions. A new reference map paradigm named Optical Radio Power Estimation using Light Analysis (ORPELA) is introduced. Real-world experiments prove that it is reproducible and more accurate than state-of-the-art radio-planning software. Machine-learning models are then designed, trained, and optimized for an ultra-challenging radio context. Finally, a large-scale experimental campaign encompassing a wide range of cases, including line-of-sight or mobility, is being conducted to demonstrate expected location performance within realistic 5G private networks.
{"title":"A comprehensive framework for 5G indoor localization","authors":"Antonin Le Floch , Rahim Kacimi , Pierre Druart , Yoann Lefebvre , André-Luc Beylot","doi":"10.1016/j.comcom.2024.107968","DOIUrl":"10.1016/j.comcom.2024.107968","url":null,"abstract":"<div><div>Localization inside legacy private 5G networks is a daunting task that involves solving the problem of indoor localization using commercial off-the-shelf proprietary hardware. While some previous work has focused on experimental analysis, none has undertaken to develop a realistic solution based on commercial equipment. In this study, we present the first comprehensive and concrete 5G framework that combines fingerprinting with the 3GPP Enhanced Cell ID (E-CID) approach. Our methodology consists of a machine-learning model to deduce the user’s position by comparing the signal strength received from the User Equipment (UE) with a reference radio power map. To achieve this, the 3GPP protocols and functions are improved to provide open, centralized, and universal localization functions. A new reference map paradigm named Optical Radio Power Estimation using Light Analysis (ORPELA) is introduced. Real-world experiments prove that it is reproducible and more accurate than state-of-the-art radio-planning software. Machine-learning models are then designed, trained, and optimized for an ultra-challenging radio context. Finally, a large-scale experimental campaign encompassing a wide range of cases, including line-of-sight or mobility, is being conducted to demonstrate expected location performance within realistic 5G private networks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107968"},"PeriodicalIF":4.5,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142446522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-09DOI: 10.1016/j.comcom.2024.107972
Chaimaa Nairi , Murtaza Cicioğlu , Ali Çalhan
A donation-tracking system leveraging smart contracts and blockchain technology holds transformative potential for reshaping the landscape of charitable giving, especially within the context of Web 3.0. This paper explores how smart contracts and blockchain can be used to create a transparent and secure ledger for tracking charitable donations. We highlight the limitations of traditional donation systems and how a blockchain-based system can help overcome these challenges. The functionality of smart contracts in donation tracking, offering advantages such as automation, reduced transaction fees, and enhanced accountability, is elucidated. The decentralized and tamper-proof nature of blockchain technology is emphasized for increased transparency and fraud prevention. While elucidating the benefits, we also address challenges in implementing such a system, including the need for technical expertise and security considerations. By fostering trust and accountability, a donation-tracking system in Web 3.0, empowered by smart blockchain networks, aims to catalyze a profound positive impact in the realm of philanthropy.
利用智能合约和区块链技术的捐赠追踪系统具有重塑慈善捐赠格局的变革潜力，尤其是在 Web 3.0 的背景下。本文探讨了如何利用智能合约和区块链创建一个透明、安全的分类账来追踪慈善捐款。我们强调了传统捐赠系统的局限性，以及基于区块链的系统如何帮助克服这些挑战。智能合约在追踪捐赠方面的功能，提供了自动化、降低交易费用和增强问责制等优势，我们对此进行了阐述。强调了区块链技术的去中心化和防篡改特性，以提高透明度和防止欺诈。在阐释这些优势的同时，我们还探讨了实施此类系统所面临的挑战，包括对专业技术知识的需求和安全方面的考虑。通过促进信任和问责制，Web 3.0 中的捐赠追踪系统在智能区块链网络的赋能下，旨在对慈善领域产生深远的积极影响。
{"title":"Smart Blockchain Networks: Revolutionizing Donation Tracking in the Web 3.0","authors":"Chaimaa Nairi , Murtaza Cicioğlu , Ali Çalhan","doi":"10.1016/j.comcom.2024.107972","DOIUrl":"10.1016/j.comcom.2024.107972","url":null,"abstract":"<div><div>A donation-tracking system leveraging smart contracts and blockchain technology holds transformative potential for reshaping the landscape of charitable giving, especially within the context of Web 3.0. This paper explores how smart contracts and blockchain can be used to create a transparent and secure ledger for tracking charitable donations. We highlight the limitations of traditional donation systems and how a blockchain-based system can help overcome these challenges. The functionality of smart contracts in donation tracking, offering advantages such as automation, reduced transaction fees, and enhanced accountability, is elucidated. The decentralized and tamper-proof nature of blockchain technology is emphasized for increased transparency and fraud prevention. While elucidating the benefits, we also address challenges in implementing such a system, including the need for technical expertise and security considerations. By fostering trust and accountability, a donation-tracking system in Web 3.0, empowered by smart blockchain networks, aims to catalyze a profound positive impact in the realm of philanthropy.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107972"},"PeriodicalIF":4.5,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-05DOI: 10.1016/j.comcom.2024.107965
Senay A. Gebreab , Ahmad Musamih , Haya R. Hasan , Khaled Salah , Raja Jayaraman , Yousof Al Hammadi , Mohammed Omar
Digital twins and digital artifacts have become integral components of metaverse platforms, providing users with a rich, immersive, and interactive digital experience through the deployment of diverse digital twins and digital artifacts such as 3D avatars, images, and objects. To date, a significant challenge persists in the lack of practical mechanisms to enable seamless teleportation and cross-metaverse interoperability for these digital twins and digital artifacts. There is also a lack of trusted monetization methods that facilitate trading and leasing of digital twins and digital artifacts. To address these important challenges, this paper proposes a blockchain and Non-Fungible Token (NFT)-based solution that facilitates the integration and teleportation of these digital twins and digital artifacts by providing trusted metadata, verifying ownership, and ensuring the authenticity of digital creations in the virtual world. Key to our solution is the introduction of a bridging mechanism that enables cross-metaverse interoperability, allowing for the portable transfer of NFTs across decentralized metaverse platforms. In addition, our solution focuses on empowering original digital creators by enabling the monetization of their creations through the ownership management capabilities offered by NFTs. To reliably and securely store the metadata and content of tokenized digital twins and digital artifacts, we integrate into our solution the Interplanetary File System (IPFS), a decentralized storage system. To demonstrate the feasibility of our solution, we have developed and deployed all necessary smart contracts that govern the main functionalities and interactions of the proposed system on the Ethereum Goerli Testnet. We present our proposed system architecture, accompanied by informative sequence diagrams, algorithms, and testing details. We discuss how our proposed solution attains the main objectives outlined in the paper. We evaluate our proposed solution in terms of cost and security. We have made the complete source code of our smart contracts publicly available on GitHub.
{"title":"NFTs for accessing, monetizing, and teleporting digital twins and digital artifacts in the metaverse","authors":"Senay A. Gebreab , Ahmad Musamih , Haya R. Hasan , Khaled Salah , Raja Jayaraman , Yousof Al Hammadi , Mohammed Omar","doi":"10.1016/j.comcom.2024.107965","DOIUrl":"10.1016/j.comcom.2024.107965","url":null,"abstract":"<div><div>Digital twins and digital artifacts have become integral components of metaverse platforms, providing users with a rich, immersive, and interactive digital experience through the deployment of diverse digital twins and digital artifacts such as 3D avatars, images, and objects. To date, a significant challenge persists in the lack of practical mechanisms to enable seamless teleportation and cross-metaverse interoperability for these digital twins and digital artifacts. There is also a lack of trusted monetization methods that facilitate trading and leasing of digital twins and digital artifacts. To address these important challenges, this paper proposes a blockchain and Non-Fungible Token (NFT)-based solution that facilitates the integration and teleportation of these digital twins and digital artifacts by providing trusted metadata, verifying ownership, and ensuring the authenticity of digital creations in the virtual world. Key to our solution is the introduction of a bridging mechanism that enables cross-metaverse interoperability, allowing for the portable transfer of NFTs across decentralized metaverse platforms. In addition, our solution focuses on empowering original digital creators by enabling the monetization of their creations through the ownership management capabilities offered by NFTs. To reliably and securely store the metadata and content of tokenized digital twins and digital artifacts, we integrate into our solution the Interplanetary File System (IPFS), a decentralized storage system. To demonstrate the feasibility of our solution, we have developed and deployed all necessary smart contracts that govern the main functionalities and interactions of the proposed system on the Ethereum Goerli Testnet. We present our proposed system architecture, accompanied by informative sequence diagrams, algorithms, and testing details. We discuss how our proposed solution attains the main objectives outlined in the paper. We evaluate our proposed solution in terms of cost and security. We have made the complete source code of our smart contracts publicly available on GitHub.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107965"},"PeriodicalIF":4.5,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-03DOI: 10.1016/j.comcom.2024.107970
Jian Wang , Tengfei Cao , Xingyan Chen , Xiaoying Wang
Vehicle-to-Everything (V2X) communication has the potential to revolutionize the travel experience in intelligent transportation, which has received the great attention recently. However, ensuring the freshness of information from multiple sources is critical for the real-time and reliable communication in vehicular networks, especially for timely updates of service centers. To address this issue, we use a promising metric called Age of Correlated Information (AoCI), which can characterize the freshness of multi-source information. Therefore, we propose a novel model that can dynamically regulate the channel activation matching and edge computing collaboration strategy to minimize AoCI in V2X vehicular networks. Firstly, we describe the system model of a V2X network with edge computing, including definitions and assumptions for freshness of information, edge co-computing, etc. Secondly, we formulate the joint optimization problem as a source-related age minimization (SRAM) problem, which is NP-complete. A heuristic algorithm is proposed to solve it under fast-fading channel. Finally, since traditional graph models cannot capture the changing correlation between nodes in dynamic networks, we use graph convolutional networks(GCN) to extract the features of multi-source correlation. The features extracted by GCN include relevant attributes of the sources and its communication links. The features are provided as input to a double deep Q network (DDQN) for training the model that can adapt to a dynamic network environment. Extensive simulation experiments in different network scenarios validate that our proposed method can effectively and efficiently reduce the average AoCI and the computational resources.
{"title":"Optimization of the age of correlated information in V2X networks with edge computing","authors":"Jian Wang , Tengfei Cao , Xingyan Chen , Xiaoying Wang","doi":"10.1016/j.comcom.2024.107970","DOIUrl":"10.1016/j.comcom.2024.107970","url":null,"abstract":"<div><div>Vehicle-to-Everything (V2X) communication has the potential to revolutionize the travel experience in intelligent transportation, which has received the great attention recently. However, ensuring the freshness of information from multiple sources is critical for the real-time and reliable communication in vehicular networks, especially for timely updates of service centers. To address this issue, we use a promising metric called Age of Correlated Information (AoCI), which can characterize the freshness of multi-source information. Therefore, we propose a novel model that can dynamically regulate the channel activation matching and edge computing collaboration strategy to minimize AoCI in V2X vehicular networks. Firstly, we describe the system model of a V2X network with edge computing, including definitions and assumptions for freshness of information, edge co-computing, etc. Secondly, we formulate the joint optimization problem as a source-related age minimization (SRAM) problem, which is NP-complete. A heuristic algorithm is proposed to solve it under fast-fading channel. Finally, since traditional graph models cannot capture the changing correlation between nodes in dynamic networks, we use graph convolutional networks(GCN) to extract the features of multi-source correlation. The features extracted by GCN include relevant attributes of the sources and its communication links. The features are provided as input to a double deep Q network (DDQN) for training the model that can adapt to a dynamic network environment. Extensive simulation experiments in different network scenarios validate that our proposed method can effectively and efficiently reduce the average AoCI and the computational resources.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107970"},"PeriodicalIF":4.5,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142442243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-03DOI: 10.1016/j.comcom.2024.107967
Shimin Sun , Jinqi Dong , Ze Wang , Xiangyun Liu , Li Han
In this paper, we tackle the critical challenges of content edge caching, such as limited storage capacity, content popularity prediction, dynamic user demand, and user privacy, issues that most existing studies only address partially. We present an innovative Genetic Algorithm-based On-demand Collaborative Edge Caching mechanism (GAOCEC), which introduces a multi-tiered caching architecture integrating cloud, fog, and edge computing. To enhance caching efficiency and minimize system cost, a novel on-demand caching quota mechanism is proposed that dynamically allocates cache resources to edge servers. To strengthen user privacy protection during content popularity prediction, a CNN-BiLSTM-based Federated Learning algorithm (CBFL) is presented that ensures high prediction accuracy without the need to upload local data to the cloud. We also refine the genetic algorithm for content placement by fine-tuning various parameter sets to identify the optimal balance between latency reduction and caching cost. Our experimental results validate the effectiveness of our approach, demonstrating increased cache hit rates, decreased content response times, and an overall improvement in system efficiency. This work provides a comprehensive, adaptive, and privacy-preserving solution for the edge–fog–cloud environment.
{"title":"An on-demand collaborative edge caching strategy for edge–fog–cloud environment","authors":"Shimin Sun , Jinqi Dong , Ze Wang , Xiangyun Liu , Li Han","doi":"10.1016/j.comcom.2024.107967","DOIUrl":"10.1016/j.comcom.2024.107967","url":null,"abstract":"<div><div>In this paper, we tackle the critical challenges of content edge caching, such as limited storage capacity, content popularity prediction, dynamic user demand, and user privacy, issues that most existing studies only address partially. We present an innovative Genetic Algorithm-based On-demand Collaborative Edge Caching mechanism (GAOCEC), which introduces a multi-tiered caching architecture integrating cloud, fog, and edge computing. To enhance caching efficiency and minimize system cost, a novel on-demand caching quota mechanism is proposed that dynamically allocates cache resources to edge servers. To strengthen user privacy protection during content popularity prediction, a CNN-BiLSTM-based Federated Learning algorithm (CBFL) is presented that ensures high prediction accuracy without the need to upload local data to the cloud. We also refine the genetic algorithm for content placement by fine-tuning various parameter sets to identify the optimal balance between latency reduction and caching cost. Our experimental results validate the effectiveness of our approach, demonstrating increased cache hit rates, decreased content response times, and an overall improvement in system efficiency. This work provides a comprehensive, adaptive, and privacy-preserving solution for the edge–fog–cloud environment.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107967"},"PeriodicalIF":4.5,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-02DOI: 10.1016/j.comcom.2024.107961
Assis T. de Oliveira Filho , Eduardo Freitas , Pedro R.X. do Carmo , Eduardo Souto , Judith Kelner , Djamel F.H. Sadok
Cloud computing, a central pillar of modern IT infrastructure, faces constant challenges in provisioning and optimizing network performance, specifically regarding low-latency communication. This study investigates the impact of Single Root I/O Virtualization (SR-IOV) as a critical Quality of Service (QoS) enabler in virtualized environments. Data plane innovative technologies for virtual servers, especially SR-IOV technology, emerged as a promising solution adopted in data centers. When combined with Peripheral Component Interconnect (PCI) Passthrough in Docker environments, SR-IOV promises significant network performance gains. Our rigorous experimental methodology demonstrates that integrating SR-IOV reduces Round-Trip Time (RTT) latency by up to 15 times compared to the traditional Linux based Bridge configuration used in Docker, without significant additional costs. This research is particularly relevant for system administrators, data center professionals, and network traffic engineers, providing them valuable information into optimizing communication in cloud computing environments. By addressing this critical gap in knowledge, our study serves as a practical guide for the effective implementation these emerging technologies for network virtualization. In terms of practical applicability, the results raise valuable insights into the performance and implications of implementing SR-IOV and PCI Passthrough in a Docker environment. As a result, more informed decisions are tailored to the specific requirements of different usage scenarios.
{"title":"Analysis of SR-IOV in Docker containers using RTT measurements","authors":"Assis T. de Oliveira Filho , Eduardo Freitas , Pedro R.X. do Carmo , Eduardo Souto , Judith Kelner , Djamel F.H. Sadok","doi":"10.1016/j.comcom.2024.107961","DOIUrl":"10.1016/j.comcom.2024.107961","url":null,"abstract":"<div><div>Cloud computing, a central pillar of modern IT infrastructure, faces constant challenges in provisioning and optimizing network performance, specifically regarding low-latency communication. This study investigates the impact of Single Root I/O Virtualization (SR-IOV) as a critical Quality of Service (QoS) enabler in virtualized environments. Data plane innovative technologies for virtual servers, especially SR-IOV technology, emerged as a promising solution adopted in data centers. When combined with Peripheral Component Interconnect (PCI) Passthrough in Docker environments, SR-IOV promises significant network performance gains. Our rigorous experimental methodology demonstrates that integrating SR-IOV reduces Round-Trip Time (RTT) latency by up to 15 times compared to the traditional Linux based Bridge configuration used in Docker, without significant additional costs. This research is particularly relevant for system administrators, data center professionals, and network traffic engineers, providing them valuable information into optimizing communication in cloud computing environments. By addressing this critical gap in knowledge, our study serves as a practical guide for the effective implementation these emerging technologies for network virtualization. In terms of practical applicability, the results raise valuable insights into the performance and implications of implementing SR-IOV and PCI Passthrough in a Docker environment. As a result, more informed decisions are tailored to the specific requirements of different usage scenarios.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107961"},"PeriodicalIF":4.5,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-01DOI: 10.1016/j.comcom.2024.107966
J.J. Garcia-Luna-Aceves , Dylan Cirimelli-Low
This paper presents a new routing protocol for wireless networks called RIPPLE-WiN (Routing Information Protocol with Probing for Looplessness and Efficiency in Wireless Networks). RIPPLE-WiN is designed to provide loop-free multipath routing in wireless networks. RIPPLE-WiN accomplishes loop-free routing by replacing destination sequence numbers used in such routing protocols as AODV and DSDV with hop references. Simulation experiments based on the ns3 simulator are used to illustrate that RIPPLE-WiN is far more efficient that OLSR, DSDV and AODV. The simulation results show that RIPPLE-WiN attains better packet delivery rates and delays than the other routing protocols in the presence of failures and mobility while incurring less signaling overhead.
本文介绍了一种新的无线网络路由协议，名为 RIPPLE-WiN（Routing Information Protocol with Probing for Looplessness and Efficiency in Wireless Networks）。RIPPLE-WiN 设计用于在无线网络中提供无环路多径路由。RIPPLE-WiN 通过用跳数引用取代 AODV 和 DSDV 等路由协议中使用的目的序列号来实现无环路由。基于 ns3 模拟器的仿真实验表明，RIPPLE-WiN 的效率远高于 OLSR、DSDV 和 AODV。仿真结果表明，在存在故障和移动性的情况下，RIPPLE-WiN 比其他路由协议能获得更好的数据包传输速率和延迟，同时产生更少的信号开销。
{"title":"RIPPLE-WiN: An efficient protocol for loop-free multipath routing in wireless networks","authors":"J.J. Garcia-Luna-Aceves , Dylan Cirimelli-Low","doi":"10.1016/j.comcom.2024.107966","DOIUrl":"10.1016/j.comcom.2024.107966","url":null,"abstract":"<div><div>This paper presents a new routing protocol for wireless networks called RIPPLE-WiN (Routing Information Protocol with Probing for Looplessness and Efficiency in Wireless Networks). RIPPLE-WiN is designed to provide loop-free multipath routing in wireless networks. RIPPLE-WiN accomplishes loop-free routing by replacing destination sequence numbers used in such routing protocols as AODV and DSDV with hop references. Simulation experiments based on the ns3 simulator are used to illustrate that RIPPLE-WiN is far more efficient that OLSR, DSDV and AODV. The simulation results show that RIPPLE-WiN attains better packet delivery rates and delays than the other routing protocols in the presence of failures and mobility while incurring less signaling overhead.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107966"},"PeriodicalIF":4.5,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-30DOI: 10.1016/j.comcom.2024.107963
Mahsa Moradi , Mahmood Ahmadi , Latif PourKarimi
Network Functions Virtualization (NFV) revolutionizes network services by eliminating the need for dedicated hardware. This virtualization enables flexible and efficient deployment of various network functions like proxies, firewalls, and load balancers. Providing the service requested by the user in the network is done by a sequence of virtual network functions, which are known as service functions chain. One of the main challenges in the development of network functions virtualization architecture is the allocation of resources to the requested network services in network infrastructures, this challenge is called network function virtualization resource allocation problem. Therefore, this paper addresses the resource allocation problem in Network Functions Virtualization (NFV) architectures using mathematical programming techniques. A multi-objective mixed-integer linear programming (MILP) model is proposed to optimize resource allocation for virtual network functions (VNFs). The model incorporates constraints related to node and link resource capacities, as well as delay requirements. The objective functions focus on maximizing network throughput, minimizing node resource costs (CPU cores and memory), reducing capital and operational expenses, and ensuring efficient execution time. These constraints and objective functions are formally defined by mathematical functions. The proposed mathematical model is implemented and solved using the Cplex solver. To evaluate the effectiveness of the proposed mathematical model, various network topologies were evaluated under different parameters. These parameters included the length of Service Function Chains (SFCs), the number and length of flows, node resource capacities, the number of nodes and VNFs. The experimental results demonstrated the model’s ability to efficiently allocate resources to VNFs across these different scenarios.
{"title":"Virtualized network functions resource allocation in network functions virtualization using mathematical programming","authors":"Mahsa Moradi , Mahmood Ahmadi , Latif PourKarimi","doi":"10.1016/j.comcom.2024.107963","DOIUrl":"10.1016/j.comcom.2024.107963","url":null,"abstract":"<div><div>Network Functions Virtualization (NFV) revolutionizes network services by eliminating the need for dedicated hardware. This virtualization enables flexible and efficient deployment of various network functions like proxies, firewalls, and load balancers. Providing the service requested by the user in the network is done by a sequence of virtual network functions, which are known as service functions chain. One of the main challenges in the development of network functions virtualization architecture is the allocation of resources to the requested network services in network infrastructures, this challenge is called network function virtualization resource allocation problem. Therefore, this paper addresses the resource allocation problem in Network Functions Virtualization (NFV) architectures using mathematical programming techniques. A multi-objective mixed-integer linear programming (MILP) model is proposed to optimize resource allocation for virtual network functions (VNFs). The model incorporates constraints related to node and link resource capacities, as well as delay requirements. The objective functions focus on maximizing network throughput, minimizing node resource costs (CPU cores and memory), reducing capital and operational expenses, and ensuring efficient execution time. These constraints and objective functions are formally defined by mathematical functions. The proposed mathematical model is implemented and solved using the Cplex solver. To evaluate the effectiveness of the proposed mathematical model, various network topologies were evaluated under different parameters. These parameters included the length of Service Function Chains (SFCs), the number and length of flows, node resource capacities, the number of nodes and VNFs. The experimental results demonstrated the model’s ability to efficiently allocate resources to VNFs across these different scenarios.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107963"},"PeriodicalIF":4.5,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-30DOI: 10.1016/j.comcom.2024.107964
Azim Akhtarshenas , Mohammad Ali Vahedifar , Navid Ayoobi , Behrouz Maham , Tohid Alizadeh , Sina Ebrahimi , David López-Pérez
Robust machine learning (ML) models can be developed by leveraging large volumes of data and distributing the computational tasks across numerous devices or servers. Federated learning (FL) is a technique in the realm of ML that facilitates this goal by utilizing cloud infrastructure to enable collaborative model training among a network of decentralized devices. Beyond distributing the computational load, FL targets the resolution of privacy issues and the reduction of communication costs simultaneously. To protect user privacy, FL requires users to send model updates rather than transmitting large quantities of raw and potentially confidential data. Specifically, individuals train ML models locally using their own data and then upload the results in the form of weights and gradients to the cloud for aggregation into the global model. This strategy is also advantageous in environments with limited bandwidth or high communication costs, as it prevents the transmission of large data volumes. With the increasing volume of data and rising privacy concerns, alongside the emergence of large-scale ML models like Large Language Models (LLMs), FL presents itself as a timely and relevant solution. It is therefore essential to review current FL algorithms to guide future research that meets the rapidly evolving ML demands. This survey provides a comprehensive analysis and comparison of the most recent FL algorithms, evaluating them on various fronts including mathematical frameworks, privacy protection, resource allocation, and applications. Beyond summarizing existing FL methods, this survey identifies potential gaps, open areas, and future challenges based on the performance reports and algorithms used in recent studies. This survey enables researchers to readily identify existing limitations in the FL field for further exploration.
利用大量数据并将计算任务分配给众多设备或服务器，可以开发出强大的机器学习（ML）模型。联合学习（FL）是机器学习领域的一项技术，它利用云基础设施在分散的设备网络之间实现协作模型训练，从而促进这一目标的实现。除了分散计算负荷，FL 还能同时解决隐私问题和降低通信成本。为了保护用户隐私，FL 要求用户发送模型更新，而不是传输大量原始和潜在的机密数据。具体来说，个人使用自己的数据在本地训练 ML 模型，然后将结果以权重和梯度的形式上传到云端，汇总到全局模型中。这种策略在带宽有限或通信成本较高的环境中也很有优势，因为它可以避免传输大量数据。随着数据量的不断增加和对隐私问题的日益关注，以及大型语言模型（LLM）等大规模 ML 模型的出现，FL 成为了一种适时的相关解决方案。因此，有必要对当前的 FL 算法进行审查，以指导未来的研究，满足快速发展的 ML 需求。本调查报告全面分析和比较了最新的 FL 算法，从数学框架、隐私保护、资源分配和应用等多个方面对其进行了评估。除了总结现有的 FL 方法，本调查还根据最近研究中使用的性能报告和算法，确定了潜在的差距、开放领域和未来挑战。这项调查使研究人员能够随时发现 FL 领域现有的局限性，以便进一步探索。
{"title":"Federated learning: A cutting-edge survey of the latest advancements and applications","authors":"Azim Akhtarshenas , Mohammad Ali Vahedifar , Navid Ayoobi , Behrouz Maham , Tohid Alizadeh , Sina Ebrahimi , David López-Pérez","doi":"10.1016/j.comcom.2024.107964","DOIUrl":"10.1016/j.comcom.2024.107964","url":null,"abstract":"<div><div>Robust machine learning (ML) models can be developed by leveraging large volumes of data and distributing the computational tasks across numerous devices or servers. Federated learning (FL) is a technique in the realm of ML that facilitates this goal by utilizing cloud infrastructure to enable collaborative model training among a network of decentralized devices. Beyond distributing the computational load, FL targets the resolution of privacy issues and the reduction of communication costs simultaneously. To protect user privacy, FL requires users to send model updates rather than transmitting large quantities of raw and potentially confidential data. Specifically, individuals train ML models locally using their own data and then upload the results in the form of weights and gradients to the cloud for aggregation into the global model. This strategy is also advantageous in environments with limited bandwidth or high communication costs, as it prevents the transmission of large data volumes. With the increasing volume of data and rising privacy concerns, alongside the emergence of large-scale ML models like Large Language Models (LLMs), FL presents itself as a timely and relevant solution. It is therefore essential to review current FL algorithms to guide future research that meets the rapidly evolving ML demands. This survey provides a comprehensive analysis and comparison of the most recent FL algorithms, evaluating them on various fronts including mathematical frameworks, privacy protection, resource allocation, and applications. Beyond summarizing existing FL methods, this survey identifies potential gaps, open areas, and future challenges based on the performance reports and algorithms used in recent studies. This survey enables researchers to readily identify existing limitations in the FL field for further exploration.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107964"},"PeriodicalIF":4.5,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-26DOI: 10.1016/j.comcom.2024.107959
Xinhuang Zhou , Ming Luo , Minrong Qiu
Smart grid develops rapidly, but there are still security risks such as user privacy leakage, power data tampering and audit data inconsistency. The existing schemes to ensure data security mainly use traceable ring signcryption, which is applied in distributed application scenarios such as smart grid. Traceable ring signcryption can ensure the anonymity, integrity, unforgeability and confidentiality of data, and can trace the real identity of anonymous users. However, the traceability of these schemes is arbitrary, any actor can trace the identity of anonymous users, and they do not resolve disputes caused by tampered or inconsistent data. To remedy these deficiencies, we combine ring signcryption with consortium blockchain technology for the first time to achieve privacy protection and conditional tracing, which can effectively avoid anonymous user identity being revealed at will. Consortium blockchain is a semi-distributed P2P network that can solve data disputes and is suitable for organizations that require certain access control mechanisms such as smart grid. In this paper, we propose a heterogeneous ring signcryption scheme with privacy protection and conditional tracing (CTHRSC) which between certificateless cryptographic system (CLC) and public key infrastructure (PKI). Besides, we prove that our scheme is secure under the discrete logarithm problem (DLP) and decisional Diffie–Hellman problem (DDHP) in random oracle model (ROM). Compared with other signature or signcryption schemes, our advantages are satisfying conditional tracing and known temporary session key security (KTSKS), requiring less computation cost and communication overhead.
{"title":"A heterogeneous ring signcryption scheme with privacy protection and conditional tracing for smart grid","authors":"Xinhuang Zhou , Ming Luo , Minrong Qiu","doi":"10.1016/j.comcom.2024.107959","DOIUrl":"10.1016/j.comcom.2024.107959","url":null,"abstract":"<div><div>Smart grid develops rapidly, but there are still security risks such as user privacy leakage, power data tampering and audit data inconsistency. The existing schemes to ensure data security mainly use traceable ring signcryption, which is applied in distributed application scenarios such as smart grid. Traceable ring signcryption can ensure the anonymity, integrity, unforgeability and confidentiality of data, and can trace the real identity of anonymous users. However, the traceability of these schemes is arbitrary, any actor can trace the identity of anonymous users, and they do not resolve disputes caused by tampered or inconsistent data. To remedy these deficiencies, we combine ring signcryption with consortium blockchain technology for the first time to achieve privacy protection and conditional tracing, which can effectively avoid anonymous user identity being revealed at will. Consortium blockchain is a semi-distributed P2P network that can solve data disputes and is suitable for organizations that require certain access control mechanisms such as smart grid. In this paper, we propose a heterogeneous ring signcryption scheme with privacy protection and conditional tracing (CTHRSC) which between certificateless cryptographic system (CLC) and public key infrastructure (PKI). Besides, we prove that our scheme is secure under the discrete logarithm problem (DLP) and decisional Diffie–Hellman problem (DDHP) in random oracle model (ROM). Compared with other signature or signcryption schemes, our advantages are satisfying conditional tracing and known temporary session key security (KTSKS), requiring less computation cost and communication overhead.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107959"},"PeriodicalIF":4.5,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142423336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号