Pub Date : 2025-09-26DOI: 10.1109/TNSM.2025.3613876
Mahmoud Abouyoussef;Muhammad Ismail;Mostafa F. Shaaban
Dynamic wireless charging (DWC) facilitates energy transfer from the electric grid to moving electric vehicles (EVs) via charging pads (CPs) positioned along roadways. To maximize satisfied charging requests, given the limited supply capacity, dynamic charging coordination is required to determine suitable CPs for mobile EVs. Charging coordination necessitates EV owners to share their information (i.e., the identities and locations) with charging service providers (CSPs) to allocate the best CP for charging. However, charging coordination raises privacy concerns due to the exchange of private information. Moreover, a fast authentication mechanism is then required between EVs and CPs to initiate the charging process. In addition to the privacy limitation, existing DWC strategies lack the presence of multiple CSPs, which is a crucial aspect given the significant growth of the EV market. Consequently, centralization arises, with a single CSP overseeing the entire network. This paper proposes a semi-decentralized privacy-preserving networking strategy utilizing a specially designed consortium blockchain to support dynamic charging coordination, authentication, and billing while ensuring user anonymity and data unlinkability. Our proposed strategy leverages a novel semi-decentralized K-times group signature scheme and distributed random number generators to achieve privacy and decentralization. Simulation results showed that the proposed method reduces the EV authentication time to 0.1 ms while limiting storage requirements to just 4 MB per block at each EV. Additionally, the proposed strategy showed improved security and privacy features when compared with IBM’s privacy-preserving blockchain (Identity Mixer).
{"title":"Secure and Semi-Decentralized Blockchain-Based Privacy-Preserving Networking Strategy for Dynamic Wireless Charging of EVs","authors":"Mahmoud Abouyoussef;Muhammad Ismail;Mostafa F. Shaaban","doi":"10.1109/TNSM.2025.3613876","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3613876","url":null,"abstract":"Dynamic wireless charging (DWC) facilitates energy transfer from the electric grid to moving electric vehicles (EVs) via charging pads (CPs) positioned along roadways. To maximize satisfied charging requests, given the limited supply capacity, dynamic charging coordination is required to determine suitable CPs for mobile EVs. Charging coordination necessitates EV owners to share their information (i.e., the identities and locations) with charging service providers (CSPs) to allocate the best CP for charging. However, charging coordination raises privacy concerns due to the exchange of private information. Moreover, a fast authentication mechanism is then required between EVs and CPs to initiate the charging process. In addition to the privacy limitation, existing DWC strategies lack the presence of multiple CSPs, which is a crucial aspect given the significant growth of the EV market. Consequently, centralization arises, with a single CSP overseeing the entire network. This paper proposes a semi-decentralized privacy-preserving networking strategy utilizing a specially designed consortium blockchain to support dynamic charging coordination, authentication, and billing while ensuring user anonymity and data unlinkability. Our proposed strategy leverages a novel semi-decentralized K-times group signature scheme and distributed random number generators to achieve privacy and decentralization. Simulation results showed that the proposed method reduces the EV authentication time to 0.1 ms while limiting storage requirements to just 4 MB per block at each EV. Additionally, the proposed strategy showed improved security and privacy features when compared with IBM’s privacy-preserving blockchain (Identity Mixer).","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 6","pages":"6083-6096"},"PeriodicalIF":5.4,"publicationDate":"2025-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145665802","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}
Pub Date : 2025-09-22DOI: 10.1109/TNSM.2025.3612386
Liang Feng;Cunqing Hua;Lingya Liu;Jianan Hong
Blockchain technology has gained widespread adoption across diverse applications; however, its peer-to-peer network architecture remains susceptible to eclipse attacks via malicious neighbor infiltration. Existing defense mechanisms typically rely either on historical data to detect attacks post hoc or on diverse neighbor selection to prevent them. These approaches, however, exhibit critical limitations: detection-based strategies are inherently reactive, while diversity-based selection lacks rigorous quantitative models to characterize the differences between neighbors. To bridge this gap, this article proposes integrating data analysis techniques directly into the neighbor selection process. Specifically, the proposed method dynamically evaluates peers’ block propagation performance and quantifies inter-peer differences using Wasserstein distance metrics. This enables the application of determinantal point processes (DPPs) to select an optimal set of high-performing and diverse peers as neighbors. Empirical evaluation utilizing Bitcoin network data demonstrates that the proposed scheme simultaneously achieves adaptive neighbor selection and robust protection against eclipse attacks.
{"title":"Quality and Diversity Balanced Neighbor Selection Against Eclipse Attack in Blockchain System","authors":"Liang Feng;Cunqing Hua;Lingya Liu;Jianan Hong","doi":"10.1109/TNSM.2025.3612386","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3612386","url":null,"abstract":"Blockchain technology has gained widespread adoption across diverse applications; however, its peer-to-peer network architecture remains susceptible to eclipse attacks via malicious neighbor infiltration. Existing defense mechanisms typically rely either on historical data to detect attacks post hoc or on diverse neighbor selection to prevent them. These approaches, however, exhibit critical limitations: detection-based strategies are inherently reactive, while diversity-based selection lacks rigorous quantitative models to characterize the differences between neighbors. To bridge this gap, this article proposes integrating data analysis techniques directly into the neighbor selection process. Specifically, the proposed method dynamically evaluates peers’ block propagation performance and quantifies inter-peer differences using Wasserstein distance metrics. This enables the application of determinantal point processes (DPPs) to select an optimal set of high-performing and diverse peers as neighbors. Empirical evaluation utilizing Bitcoin network data demonstrates that the proposed scheme simultaneously achieves adaptive neighbor selection and robust protection against eclipse attacks.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 6","pages":"6037-6047"},"PeriodicalIF":5.4,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145665726","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}
Pub Date : 2025-09-18DOI: 10.1109/TNSM.2025.3611445
Zhijie Wang;Zhen Zhang;Tengjiao He;Hao Xie
Serverless computing has been widely regarded as an ideal computing paradigm, enabling edge servers to host serverless functions. Due to its high scalability and usage-based pricing model, it provides efficient services across various applications. However, in the deployment process of serverless applications, past works lack considerations for the parallel relationships between stateful functions, which increases end to end latency. To leverage the parallel dependencies between functions, we propose a strategy for dependent function parallelization deployment, named LPCD (Low latency Parallel Candidate Deployment strategy). By partitioning the problem into inter-layer function deployment and analyzing optimal substructures, a heuristic algorithm is introduced to determine candidate deployment strategies for each layer of the users, which aims at identifying the optimal edge server for each function instance during deployment to enhance user satisfaction. Through simulation experiments, we evaluate the performance of the strategy. The experiments results indicate that the average latency was reduced by at least 41% compared with the state-of-the-art strategies.
{"title":"LPCD: A Parallel Candidate Deployment Strategy in Stateful Serverless Computing With Low Latency","authors":"Zhijie Wang;Zhen Zhang;Tengjiao He;Hao Xie","doi":"10.1109/TNSM.2025.3611445","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3611445","url":null,"abstract":"Serverless computing has been widely regarded as an ideal computing paradigm, enabling edge servers to host serverless functions. Due to its high scalability and usage-based pricing model, it provides efficient services across various applications. However, in the deployment process of serverless applications, past works lack considerations for the parallel relationships between stateful functions, which increases end to end latency. To leverage the parallel dependencies between functions, we propose a strategy for dependent function parallelization deployment, named LPCD (Low latency Parallel Candidate Deployment strategy). By partitioning the problem into inter-layer function deployment and analyzing optimal substructures, a heuristic algorithm is introduced to determine candidate deployment strategies for each layer of the users, which aims at identifying the optimal edge server for each function instance during deployment to enhance user satisfaction. Through simulation experiments, we evaluate the performance of the strategy. The experiments results indicate that the average latency was reduced by at least 41% compared with the state-of-the-art strategies.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 6","pages":"5927-5944"},"PeriodicalIF":5.4,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145665745","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}
Pub Date : 2025-09-17DOI: 10.1109/TNSM.2025.3611309
Ori Mazor;Ori Rottenstreich
Cryptocurrencies have gained high popularity in recent years, with over 9000 of them, including major ones such as Bitcoin and Ether. Each cryptocurrency is implemented on one blockchain or over several such networks. Recently, various technologies known as blockchain interoperability have been developed to connect these different blockchains and create an interconnected blockchain ecosystem. This paper aims to provide insights on the blockchain ecosystem and the connection between blockchains that we refer to as the interoperability graph. Our approach is based on the analysis of the correlation between cryptocurrencies implemented over the different blockchains. We examine over 4800 cryptocurrencies implemented on 76 blockchains and their daily prices over a year. This experimental study has potential implications for decentralized finance (DeFi), including portfolio investment strategies and risk management.
{"title":"Understanding the Blockchain Interoperability Graph Based on Cryptocurrency Price Correlation","authors":"Ori Mazor;Ori Rottenstreich","doi":"10.1109/TNSM.2025.3611309","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3611309","url":null,"abstract":"Cryptocurrencies have gained high popularity in recent years, with over 9000 of them, including major ones such as Bitcoin and Ether. Each cryptocurrency is implemented on one blockchain or over several such networks. Recently, various technologies known as blockchain interoperability have been developed to connect these different blockchains and create an interconnected blockchain ecosystem. This paper aims to provide insights on the blockchain ecosystem and the connection between blockchains that we refer to as the interoperability graph. Our approach is based on the analysis of the correlation between cryptocurrencies implemented over the different blockchains. We examine over 4800 cryptocurrencies implemented on 76 blockchains and their daily prices over a year. This experimental study has potential implications for decentralized finance (DeFi), including portfolio investment strategies and risk management.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 6","pages":"6245-6259"},"PeriodicalIF":5.4,"publicationDate":"2025-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145665783","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}
Pub Date : 2025-09-12DOI: 10.1109/TNSM.2025.3604833
Zhuolun Li;Srijoni Majumdar;Evangelos Pournaras
Conditional information reveal systems automate the release of information upon meeting specific predefined conditions, such as a designated time in the future. This paper presents a new practical timed-release cryptography system that “sends messages in the future” with highly accurate decryption times. The core of the proposed system is a novel secret sharing scheme with verifiable information reveal, and a data sharing system is devised on smart contracts. This paper also introduces a breakthrough in the understanding, design, and application of conditional information reveal systems that are highly secure and decentralized. A complete evaluation portfolio is provided to this pioneering paradigm, including analytical results, a validation of its robustness in the Tamarin Prover and a performance evaluation of a real-world, open-source system prototype deployed across the globe. Using real-world election data, we also demonstrate the applicability of this innovative system in e-voting, illustrating its capacity to secure and ensure fair elections.
{"title":"Send Message to the Future? Blockchain-Based Time Machines for Decentralized Reveal of Locked Information","authors":"Zhuolun Li;Srijoni Majumdar;Evangelos Pournaras","doi":"10.1109/TNSM.2025.3604833","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3604833","url":null,"abstract":"Conditional information reveal systems automate the release of information upon meeting specific predefined conditions, such as a designated time in the future. This paper presents a new practical timed-release cryptography system that “sends messages in the future” with highly accurate decryption times. The core of the proposed system is a novel secret sharing scheme with verifiable information reveal, and a data sharing system is devised on smart contracts. This paper also introduces a breakthrough in the understanding, design, and application of conditional information reveal systems that are highly secure and decentralized. A complete evaluation portfolio is provided to this pioneering paradigm, including analytical results, a validation of its robustness in the Tamarin Prover and a performance evaluation of a real-world, open-source system prototype deployed across the globe. Using real-world election data, we also demonstrate the applicability of this innovative system in e-voting, illustrating its capacity to secure and ensure fair elections.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 6","pages":"6112-6127"},"PeriodicalIF":5.4,"publicationDate":"2025-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11162935","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145665755","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}
Pub Date : 2025-09-11DOI: 10.1109/TNSM.2025.3608077
Mounir Bensalem;Admela Jukan
We consider the problem of signaling rate and performance for control and management of reconfigurable intelligent surfaces (RISs) in next-generation mobile networks. To this end, we first analytically determine the rates of RIS reconfigurations and handover using a stochastic geometry network model. We derive closed-form expressions of these rates, while taking into account static obstacles (both known and unknown), self-blockage, RIS location density, and variations in the angle and direction of user mobility. Based on the derived rates, we analyze the signaling rates of a sample novel signaling protocol, which we propose as an extension of the current handover signaling protocol. We evaluate the signaling overhead due to RIS reconfigurations and the related energy consumption. We also provide a capacity planning analysis of the related RIS control plane server for its dimensioning in the network management system. The results quantify the impact of known and unknown obstacles on the RIS reconfiguration rate and the handover rate as a function of device density and mobility. We evaluate the scalability of the model, the related signaling overhead, energy efficiency, and server capacity in the control plane. To the best of our knowledge, this is the first analytical model to derive the closed form expressions of RIS reconfiguration rates, along with handover rates, and relate its statistical properties to the signaling rate and performance in next-generation mobile networks.
{"title":"Signaling Rate and Performance of RIS Reconfiguration and Handover Management in Next Generation Mobile Networks","authors":"Mounir Bensalem;Admela Jukan","doi":"10.1109/TNSM.2025.3608077","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3608077","url":null,"abstract":"We consider the problem of signaling rate and performance for control and management of reconfigurable intelligent surfaces (RISs) in next-generation mobile networks. To this end, we first analytically determine the rates of RIS reconfigurations and handover using a stochastic geometry network model. We derive closed-form expressions of these rates, while taking into account static obstacles (both known and unknown), self-blockage, RIS location density, and variations in the angle and direction of user mobility. Based on the derived rates, we analyze the signaling rates of a sample novel signaling protocol, which we propose as an extension of the current handover signaling protocol. We evaluate the signaling overhead due to RIS reconfigurations and the related energy consumption. We also provide a capacity planning analysis of the related RIS control plane server for its dimensioning in the network management system. The results quantify the impact of known and unknown obstacles on the RIS reconfiguration rate and the handover rate as a function of device density and mobility. We evaluate the scalability of the model, the related signaling overhead, energy efficiency, and server capacity in the control plane. To the best of our knowledge, this is the first analytical model to derive the closed form expressions of RIS reconfiguration rates, along with handover rates, and relate its statistical properties to the signaling rate and performance in next-generation mobile networks.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 6","pages":"6159-6176"},"PeriodicalIF":5.4,"publicationDate":"2025-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11160619","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145665795","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}
Pub Date : 2025-09-11DOI: 10.1109/TNSM.2025.3608796
Anna Karanika;Rui Yang;Xiaojuan Ma;Jiangran Wang;Shalni Sundram;Indranil Gupta
While mesh networking for edge settings (e.g., smart buildings, farms, battlefields, etc.) has received much attention, the layer of control over such meshes remains largely centralized and cloud-based. This paper focuses on applications with commonplace sense-trigger-actuate (STA) workloads—like the abstraction of routines popular now in smart homes, but applied to larger-scale edge IoT deployments. We present CoMesh, which tackles the challenge of building a decentralized mesh-based control plane for local, non-cloud, and hubless management of sense-trigger-actuate applications. CoMesh builds atop an abstraction called the coterie, which spreads STA load in a fine-grained way both across space and across time. A coterie uses a novel combination of techniques such as zero-message-exchange protocols (for fast proactive member selection), quorum-based agreement, and locality-sensitive hashing. We analyze and theoretically prove safety and liveness properties of CoMesh. Our evaluation with both a Raspberry Pi-4 deployment and larger-scale simulations, using real building maps and real routine workloads, shows that CoMesh is load-balanced, fast, fault-tolerant, and scalable.
{"title":"There is More Control in Egalitarian Edge IoT Meshes","authors":"Anna Karanika;Rui Yang;Xiaojuan Ma;Jiangran Wang;Shalni Sundram;Indranil Gupta","doi":"10.1109/TNSM.2025.3608796","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3608796","url":null,"abstract":"While mesh networking for edge settings (e.g., smart buildings, farms, battlefields, etc.) has received much attention, the layer of control over such meshes remains largely centralized and cloud-based. This paper focuses on applications with commonplace sense-trigger-actuate (STA) workloads—like the abstraction of routines popular now in smart homes, but applied to larger-scale edge IoT deployments. We present CoMesh, which tackles the challenge of building a decentralized mesh-based control plane for local, non-cloud, and hubless management of sense-trigger-actuate applications. CoMesh builds atop an abstraction called the coterie, which spreads STA load in a fine-grained way both across space and across time. A coterie uses a novel combination of techniques such as zero-message-exchange protocols (for fast proactive member selection), quorum-based agreement, and locality-sensitive hashing. We analyze and theoretically prove safety and liveness properties of CoMesh. Our evaluation with both a Raspberry Pi-4 deployment and larger-scale simulations, using real building maps and real routine workloads, shows that CoMesh is load-balanced, fast, fault-tolerant, and scalable.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"23 ","pages":"896-909"},"PeriodicalIF":5.4,"publicationDate":"2025-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11159320","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145852462","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}
Pub Date : 2025-09-10DOI: 10.1109/TNSM.2025.3608074
Wei-Kun Chen;Ya-Feng Liu;Yu-Hong Dai;Zhi-Quan Luo
In this paper, we consider the network slicing (NS) problem which aims to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and manage network resources to meet diverse quality of service (QoS) requirements. We propose a mixed-integer nonlinear programming (MINLP) formulation for the considered NS problem that can flexibly route the traffic flow of the services on multiple paths and provide end-to-end delay and reliability guarantees for all services. To overcome the computational difficulty due to the intrinsic nonlinearity in the MINLP formulation, we transform the MINLP formulation into an equivalent mixed-integer linear programming (MILP) formulation and further show that their continuous relaxations are equivalent. In sharp contrast to the continuous relaxation of the MINLP formulation which is a nonconvex nonlinear programming problem, the continuous relaxation of the MILP formulation is a polynomial-time solvable linear programming problem, which significantly facilitates the algorithmic design. Based on the newly proposed MILP formulation, we develop a customized column generation (cCG) algorithm for solving the NS problem. The proposed cCG algorithm is a decomposition-based algorithm and is particularly suitable for solving large-scale NS problems. Numerical results demonstrate the efficacy of the proposed formulations and the proposed cCG algorithm.
{"title":"QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks","authors":"Wei-Kun Chen;Ya-Feng Liu;Yu-Hong Dai;Zhi-Quan Luo","doi":"10.1109/TNSM.2025.3608074","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3608074","url":null,"abstract":"In this paper, we consider the network slicing (NS) problem which aims to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and manage network resources to meet diverse quality of service (QoS) requirements. We propose a mixed-integer nonlinear programming (MINLP) formulation for the considered NS problem that can flexibly route the traffic flow of the services on multiple paths and provide end-to-end delay and reliability guarantees for all services. To overcome the computational difficulty due to the intrinsic nonlinearity in the MINLP formulation, we transform the MINLP formulation into an equivalent mixed-integer linear programming (MILP) formulation and further show that their continuous relaxations are equivalent. In sharp contrast to the continuous relaxation of the MINLP formulation which is a nonconvex nonlinear programming problem, the continuous relaxation of the MILP formulation is a polynomial-time solvable linear programming problem, which significantly facilitates the algorithmic design. Based on the newly proposed MILP formulation, we develop a customized column generation (cCG) algorithm for solving the NS problem. The proposed cCG algorithm is a decomposition-based algorithm and is particularly suitable for solving large-scale NS problems. Numerical results demonstrate the efficacy of the proposed formulations and the proposed cCG algorithm.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 6","pages":"6021-6036"},"PeriodicalIF":5.4,"publicationDate":"2025-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145665790","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}
Pub Date : 2025-09-08DOI: 10.1109/TNSM.2025.3607004
Xinhan Liu;Robert Kooij;Piet Van Mieghem
The node-reliability polynomial $nRel_{G}(p)$ measures the probability that a connected network remains connected given that each node functions independently with probability $p$ . Computing node-reliability polynomials $nRel_{G}(p)$ exactly is NP-hard. Here we propose efficient approximations. First, we develop an accurate Monte Carlo simulation, which is accelerated by incorporating a Laplace approximation that captures the polynomial’s main behavior. We also introduce three degree-based stochastic approximations (Laplace, arithmetic, and geometric), which leverage the degree distribution to estimate $nRel_{G}(p)$ with low complexity. Beyond approximations, our framework addresses the reliability-based Global Robustness Improvement Problem ($k$ -GRIP) by selecting exactly $k$ links to add to a given graph so as to maximize its node reliability. A Greedy Lowest-Degree Pairing Link Addition (Greedy-LD) Algorithm, is proposed which offers a computationally efficient and practically effective heuristic, particularly suitable for large-scale networks.
{"title":"Node-Reliability: Monte Carlo, Laplace, and Stochastic Approximations and a Greedy Link-Augmentation Strategy","authors":"Xinhan Liu;Robert Kooij;Piet Van Mieghem","doi":"10.1109/TNSM.2025.3607004","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3607004","url":null,"abstract":"The node-reliability polynomial <inline-formula> <tex-math>$nRel_{G}(p)$ </tex-math></inline-formula> measures the probability that a connected network remains connected given that each node functions independently with probability <inline-formula> <tex-math>$p$ </tex-math></inline-formula>. Computing node-reliability polynomials <inline-formula> <tex-math>$nRel_{G}(p)$ </tex-math></inline-formula> exactly is NP-hard. Here we propose efficient approximations. First, we develop an accurate Monte Carlo simulation, which is accelerated by incorporating a Laplace approximation that captures the polynomial’s main behavior. We also introduce three degree-based stochastic approximations (Laplace, arithmetic, and geometric), which leverage the degree distribution to estimate <inline-formula> <tex-math>$nRel_{G}(p)$ </tex-math></inline-formula> with low complexity. Beyond approximations, our framework addresses the reliability-based Global Robustness Improvement Problem (<inline-formula> <tex-math>$k$ </tex-math></inline-formula>-GRIP) by selecting exactly <inline-formula> <tex-math>$k$ </tex-math></inline-formula> links to add to a given graph so as to maximize its node reliability. A Greedy Lowest-Degree Pairing Link Addition (Greedy-LD) Algorithm, is proposed which offers a computationally efficient and practically effective heuristic, particularly suitable for large-scale networks.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"23 ","pages":"756-766"},"PeriodicalIF":5.4,"publicationDate":"2025-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145852507","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}
Pub Date : 2025-08-29DOI: 10.1109/TNSM.2025.3603597
Shiqi Zhang;Mridul Gupta;Behnam Dezfouli
As the number of WiFi devices and their traffic demands continue to rise, the need for a scalable and high-performance wireless infrastructure becomes increasingly essential. Central to this infrastructure are WiFi Access Points (APs), which facilitate packet switching between Ethernet and WiFi interfaces. Despite APs’ reliance on the Linux kernel’s data plane for packet switching, the detailed operations and complexities of switching packets between Ethernet and WiFi interfaces have not been investigated in existing works. This paper makes the following contributions towards filling this research gap. Through macro and micro-analysis of empirical experiments, our study reveals insights in two distinct categories. Firstly, while the kernel’s statistics offer valuable insights into system operations, we identify and discuss potential pitfalls that can severely affect system analysis. For instance, we reveal how packet switching rate and the implementation of drivers influence the meaning and accuracy of statistics related to packet-switching tasks and processor utilization. Secondly, we analyze the impact of the packet switching path and core configuration on performance and power consumption. Specifically, we identify the differences in Ethernet-to-WiFi and WiFi-to-Ethernet data paths regarding processing components, multi-core utilization, and energy efficiency.
{"title":"Understanding Linux Kernel-Based Packet Switching on WiFi Access Points","authors":"Shiqi Zhang;Mridul Gupta;Behnam Dezfouli","doi":"10.1109/TNSM.2025.3603597","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3603597","url":null,"abstract":"As the number of WiFi devices and their traffic demands continue to rise, the need for a scalable and high-performance wireless infrastructure becomes increasingly essential. Central to this infrastructure are WiFi Access Points (APs), which facilitate packet switching between Ethernet and WiFi interfaces. Despite APs’ reliance on the Linux kernel’s data plane for packet switching, the detailed operations and complexities of switching packets between Ethernet and WiFi interfaces have not been investigated in existing works. This paper makes the following contributions towards filling this research gap. Through macro and micro-analysis of empirical experiments, our study reveals insights in two distinct categories. Firstly, while the kernel’s statistics offer valuable insights into system operations, we identify and discuss potential pitfalls that can severely affect system analysis. For instance, we reveal how packet switching rate and the implementation of drivers influence the meaning and accuracy of statistics related to packet-switching tasks and processor utilization. Secondly, we analyze the impact of the packet switching path and core configuration on performance and power consumption. Specifically, we identify the differences in Ethernet-to-WiFi and WiFi-to-Ethernet data paths regarding processing components, multi-core utilization, and energy efficiency.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 5","pages":"3792-3808"},"PeriodicalIF":5.4,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145315532","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：