With the increasing demand for blockchain technology in various industry sectors, there has been a growing interest in the Byzantine Fault Tolerance (BFT) consensus that is the backbone of most of these blockchains. However, many state-of-the-art algorithms that require reliable connections can only offer limited throughput in wide-area networks (WANs), where participants are connected over long distances and may experience unpredictable network failures. The partially-connected BFTs are designed for unreliable and highly dynamic networks yet impose exponential communication complexity. This paper proposes Stable Byzantine Fault Tolerance (SBFT), a BFT communication abstraction that can sustain high throughput and low latency in WAN. SBFT separates the leader from consensus in pipelined BFT consensus and uses an adaptive consensus mechanism to resist dynamic faulty links, maintaining consensus efficiency when network connectivity is high while adapting to dynamic networks with low connectivity. We implemented a prototype of SBFT and tested it on the WAN. The results demonstrate that SBFT has a throughput similar to HotStuff in a fault-free environment but can reduce about 80% of consensus latency. Besides, SBFT retains 40% of the original throughput when the link failure probability is 0.4, while the baseline HotStuff retains less than 40% when the link failure probability is only 0.1.
{"title":"Stable Byzantine Fault Tolerance in Wide Area Networks With Unreliable Links","authors":"Sitong Ling;Zhuotao Liu;Qi Li;Xinle Du;Jing Chen;Ke Xu","doi":"10.1109/TNET.2024.3461872","DOIUrl":"https://doi.org/10.1109/TNET.2024.3461872","url":null,"abstract":"With the increasing demand for blockchain technology in various industry sectors, there has been a growing interest in the Byzantine Fault Tolerance (BFT) consensus that is the backbone of most of these blockchains. However, many state-of-the-art algorithms that require reliable connections can only offer limited throughput in wide-area networks (WANs), where participants are connected over long distances and may experience unpredictable network failures. The partially-connected BFTs are designed for unreliable and highly dynamic networks yet impose exponential communication complexity. This paper proposes Stable Byzantine Fault Tolerance (SBFT), a BFT communication abstraction that can sustain high throughput and low latency in WAN. SBFT separates the leader from consensus in pipelined BFT consensus and uses an adaptive consensus mechanism to resist dynamic faulty links, maintaining consensus efficiency when network connectivity is high while adapting to dynamic networks with low connectivity. We implemented a prototype of SBFT and tested it on the WAN. The results demonstrate that SBFT has a throughput similar to HotStuff in a fault-free environment but can reduce about 80% of consensus latency. Besides, SBFT retains 40% of the original throughput when the link failure probability is 0.4, while the baseline HotStuff retains less than 40% when the link failure probability is only 0.1.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"5310-5325"},"PeriodicalIF":3.0,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142859327","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-24DOI: 10.1109/TNET.2024.3457696
Meng Jin;Shun Yao;Kexin Li;Xiaohua Tian;Xinbing Wang;Chenghu Zhou;Xinde Cao
We in this paper present TiSee, an RFID-based sensing system that supports miniature robots to perform agile tasks in everyday environments. TiSee’s unique capability is that it uses a single arbitrarily-deployed antenna to locate a target with sub-cm-level accuracy and identify its orientation to within few degrees. Compared with existing solutions which rely on either antenna arrays or multiple RFID readers, TiSee is cheap, compact, and applicable to miniature robots. The idea of TiSee is to stick an RFID tag on the robot (or its gripper) and use it as a moving “antenna” to locate the tags on the target. The core of this design is a novel technique which can build a “channel” between two commercial RFID tags. Such an inter-tag channel is proved to be highly sensitive to the change in inter-tag distance and is resistant to multipath. By leveraging this channel and the mobility of the robot, we emulate an antenna array and use it for fine-grained localization and orientation estimation. Our experiments show that TiSee achieves a median accuracy of 9.5mm and 3.1° in 3D localization and orientation estimation. TiSee brings an eye-in-hand “camera” to miniature robots, supporting them to perform agile tasks in dark, cluttered, and occluded settings.
{"title":"Fine-Grained UHF RFID Localization for Robotics","authors":"Meng Jin;Shun Yao;Kexin Li;Xiaohua Tian;Xinbing Wang;Chenghu Zhou;Xinde Cao","doi":"10.1109/TNET.2024.3457696","DOIUrl":"https://doi.org/10.1109/TNET.2024.3457696","url":null,"abstract":"We in this paper present TiSee, an RFID-based sensing system that supports miniature robots to perform agile tasks in everyday environments. TiSee’s unique capability is that it uses a single arbitrarily-deployed antenna to locate a target with sub-cm-level accuracy and identify its orientation to within few degrees. Compared with existing solutions which rely on either antenna arrays or multiple RFID readers, TiSee is cheap, compact, and applicable to miniature robots. The idea of TiSee is to stick an RFID tag on the robot (or its gripper) and use it as a moving “antenna” to locate the tags on the target. The core of this design is a novel technique which can build a “channel” between two commercial RFID tags. Such an inter-tag channel is proved to be highly sensitive to the change in inter-tag distance and is resistant to multipath. By leveraging this channel and the mobility of the robot, we emulate an antenna array and use it for fine-grained localization and orientation estimation. Our experiments show that TiSee achieves a median accuracy of 9.5mm and 3.1° in 3D localization and orientation estimation. TiSee brings an eye-in-hand “camera” to miniature robots, supporting them to perform agile tasks in dark, cluttered, and occluded settings.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"5247-5262"},"PeriodicalIF":3.0,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142859223","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}
Border Gateway Protocol (BGP) is the only inter-domain routing protocol that plays an important role on the Internet. However, BGP suffers from route leaks, which can cause serious security threats. To mitigate the effects of route leaks, accurate and timely route leak locating is of great importance. Prior studies leverage AS business relationships to locate route leaks in real time. However, they fail to achieve high locating accuracy. Recent studies apply machine learning to accurately detect route leaks from statistical features of massive BGP messages. Nevertheless, they have high detection latency and cannot further locate route leaks. In this paper, we propose a real-time and accurate route leak locating system named RoLL+. It leverages distinctive AS triplet features to accurately locate AS triplets with route leaks from each BGP message in real time. Considering that RoLL+ may receive a substantial volume of BGP update messages per second, we integrate a cache-like design and a lazy update mechanism into the system to effectively identify route leaks at scale. Our experimental results on real-world BGP route leak data demonstrate that it can achieve 92% locating accuracy with less than 1 ms locating latency. Furthermore, the results show that RoLL+ can process over 7,000 AS triplets per second, meeting real-world throughput requirements.
{"title":"RoLL+: Real-Time and Accurate Route Leak Locating With AS Triplet Features at Scale","authors":"Jiang Li;Jiahao Cao;Zili Meng;Renjie Xie;Qi Li;Yuan Yang;Mingwei Xu","doi":"10.1109/TNET.2024.3458943","DOIUrl":"https://doi.org/10.1109/TNET.2024.3458943","url":null,"abstract":"Border Gateway Protocol (BGP) is the only inter-domain routing protocol that plays an important role on the Internet. However, BGP suffers from route leaks, which can cause serious security threats. To mitigate the effects of route leaks, accurate and timely route leak locating is of great importance. Prior studies leverage AS business relationships to locate route leaks in real time. However, they fail to achieve high locating accuracy. Recent studies apply machine learning to accurately detect route leaks from statistical features of massive BGP messages. Nevertheless, they have high detection latency and cannot further locate route leaks. In this paper, we propose a real-time and accurate route leak locating system named RoLL+. It leverages distinctive AS triplet features to accurately locate AS triplets with route leaks from each BGP message in real time. Considering that RoLL+ may receive a substantial volume of BGP update messages per second, we integrate a cache-like design and a lazy update mechanism into the system to effectively identify route leaks at scale. Our experimental results on real-world BGP route leak data demonstrate that it can achieve 92% locating accuracy with less than 1 ms locating latency. Furthermore, the results show that RoLL+ can process over 7,000 AS triplets per second, meeting real-world throughput requirements.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"5263-5278"},"PeriodicalIF":3.0,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142859203","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-20DOI: 10.1109/TNET.2024.3458922
Juan Zhu;Shaowei Wang
Deterministic mobile networks are essential for advanced applications that demand strict quality of service (QoS) assurances under limited resource availability. Though network slicing can optimize average performance metrics to offer best-effort services, it often fails to meet the high-reliability requirements of deterministic communication scenarios. In this paper, we introduce a novel QoS-guaranteed inter-slice radio resource allocation scheme for mobile networks to deliver deterministic services over the long term. First, we develop an analytical martingale-based stochastic network calculus framework, which yields stochastic bounds for transmission delays and queue backlogs across various traffic arrival patterns. These bounds produce robust interval estimations that guide resource allocation decisions, effectively addressing channel variability and long-tail QoS effects. Then, an efficient resource allocation algorithm is proposed to approach the derived performance bounds while ensuring fairness across different radio slices with diverse QoS needs. The framework also incorporates an adaptive traffic predictor, enabling our algorithm to track and respond to network dynamics. Numerical results demonstrate that our proposed scheme achieves a promising trade-off between resource utilization and QoS guarantees.
{"title":"QoS-Guaranteed Resource Allocation in Mobile Communications: A Stochastic Network Calculus Approach","authors":"Juan Zhu;Shaowei Wang","doi":"10.1109/TNET.2024.3458922","DOIUrl":"https://doi.org/10.1109/TNET.2024.3458922","url":null,"abstract":"Deterministic mobile networks are essential for advanced applications that demand strict quality of service (QoS) assurances under limited resource availability. Though network slicing can optimize average performance metrics to offer best-effort services, it often fails to meet the high-reliability requirements of deterministic communication scenarios. In this paper, we introduce a novel QoS-guaranteed inter-slice radio resource allocation scheme for mobile networks to deliver deterministic services over the long term. First, we develop an analytical martingale-based stochastic network calculus framework, which yields stochastic bounds for transmission delays and queue backlogs across various traffic arrival patterns. These bounds produce robust interval estimations that guide resource allocation decisions, effectively addressing channel variability and long-tail QoS effects. Then, an efficient resource allocation algorithm is proposed to approach the derived performance bounds while ensuring fairness across different radio slices with diverse QoS needs. The framework also incorporates an adaptive traffic predictor, enabling our algorithm to track and respond to network dynamics. Numerical results demonstrate that our proposed scheme achieves a promising trade-off between resource utilization and QoS guarantees.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"5159-5171"},"PeriodicalIF":3.0,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142859222","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-19DOI: 10.1109/TNET.2024.3456789
Xinliang Wei;Lei Fan;Yuanxiong Guo;Zhu Han;Yu Wang
The advancement of satellite-based quantum networks shows promise in transforming global communication infrastructure by establishing a secure and reliable quantum Internet. These networks use optical signals from satellites to ground stations to distribute high-fidelity quantum entanglements over long distances, overcoming the limitations of traditional terrestrial systems. However, the complexity of satellite-based entanglement distribution and terrestrial quantum swapping in the integrated network requires joint optimization with satellite assignment, resource allocation, and path selection. To address this challenge, we introduce a hybrid quantum-classical algorithm to solve the optimization problem by leveraging the strengths of both quantum and classical computing. The original problem is decomposed into a master problem and several subproblems using Dantzig-Wolfe decomposition and linearization techniques. Through experiments, this study demonstrates the effectiveness and reliability of the proposed methods in optimizing large-scale networks and managing qubit usage compared to the classical optimization techniques. The findings provide valuable insights for designing and implementing satellite-based entanglement distribution in quantum networks, paving the way for a secure global quantum communication infrastructure.
{"title":"Entanglement From Sky: Optimizing Satellite-Based Entanglement Distribution for Quantum Networks","authors":"Xinliang Wei;Lei Fan;Yuanxiong Guo;Zhu Han;Yu Wang","doi":"10.1109/TNET.2024.3456789","DOIUrl":"https://doi.org/10.1109/TNET.2024.3456789","url":null,"abstract":"The advancement of satellite-based quantum networks shows promise in transforming global communication infrastructure by establishing a secure and reliable quantum Internet. These networks use optical signals from satellites to ground stations to distribute high-fidelity quantum entanglements over long distances, overcoming the limitations of traditional terrestrial systems. However, the complexity of satellite-based entanglement distribution and terrestrial quantum swapping in the integrated network requires joint optimization with satellite assignment, resource allocation, and path selection. To address this challenge, we introduce a hybrid quantum-classical algorithm to solve the optimization problem by leveraging the strengths of both quantum and classical computing. The original problem is decomposed into a master problem and several subproblems using Dantzig-Wolfe decomposition and linearization techniques. Through experiments, this study demonstrates the effectiveness and reliability of the proposed methods in optimizing large-scale networks and managing qubit usage compared to the classical optimization techniques. The findings provide valuable insights for designing and implementing satellite-based entanglement distribution in quantum networks, paving the way for a secure global quantum communication infrastructure.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"5295-5309"},"PeriodicalIF":3.0,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142859336","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}
This paper presents RF-Transformer, a unified backscatter radio hardware abstraction that allows a low-power IoT device to directly communicate with heterogeneous wireless receivers. Unlike existing backscatter systems that are tailored to a specific wireless communication protocol, RF-Transformer provides a programmable interface to the micro-controller, allowing IoT devices to synthesize different types of protocol-compliant backscatter signals in the PHY layer. By leveraging the nonlinear characteristics of the negative impedance, RF-Transformer also achieves a cross-frequency backscatter design that enables IoT devices in harmonic frequency bands to communicate with each other. We implement a PCB prototype of RF-Transformer on 2.4 GHz ISM band and conduct extensive experiments. We leverage the software defined platform USRP to transmit the carrier signal and receive the backscatter signal to verify the efficacy of our design. Our extensive field studies show that RF-Transformer achieves 23.8 Mbps, 247.1 Kbps, 986.5 Kbps, and 27.3 Kbps throughput when generating standard Wi-Fi, ZigBee, Bluetooth, and LoRa signals.
{"title":"Towards Programmable Backscatter Radio Design for Heterogeneous Wireless Networks","authors":"Xiuzhen Guo;Yuan He;Jiacheng Zhang;Yunhao Liu;Longfei Shangguan","doi":"10.1109/TNET.2024.3454095","DOIUrl":"10.1109/TNET.2024.3454095","url":null,"abstract":"This paper presents RF-Transformer, a unified backscatter radio hardware abstraction that allows a low-power IoT device to directly communicate with heterogeneous wireless receivers. Unlike existing backscatter systems that are tailored to a specific wireless communication protocol, RF-Transformer provides a programmable interface to the micro-controller, allowing IoT devices to synthesize different types of protocol-compliant backscatter signals in the PHY layer. By leveraging the nonlinear characteristics of the negative impedance, RF-Transformer also achieves a cross-frequency backscatter design that enables IoT devices in harmonic frequency bands to communicate with each other. We implement a PCB prototype of RF-Transformer on 2.4 GHz ISM band and conduct extensive experiments. We leverage the software defined platform USRP to transmit the carrier signal and receive the backscatter signal to verify the efficacy of our design. Our extensive field studies show that RF-Transformer achieves 23.8 Mbps, 247.1 Kbps, 986.5 Kbps, and 27.3 Kbps throughput when generating standard Wi-Fi, ZigBee, Bluetooth, and LoRa signals.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"5020-5032"},"PeriodicalIF":3.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142248683","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-16DOI: 10.1109/TNET.2024.3456124
Fuliang Li;Minglong Li;Yunhang Pu;Yuxin Zhang;Xingwei Wang;Jiannong Cao
Network verification has recently made strides, focusing on the satisfiability of configurations and policies or the performance and versatility of their methods. However, they generally ignore explainability, which is the ability to explain why a network violates or satisfies a certain forwarding policy. In this paper, we propose an explainable network verification framework XNV, which uses a novel interpretable fault analysis method to construct an effective explainable network verifier using knowledge graph (KG). XNV provides appropriate explanations to help operators understand the verification results, improving the transparency and trustworthiness of the verification system. First, XNV uses the KG as an intermediate representation of the configuration semantic level, storing the configuration semantics and routing protocol states. Then, XNV constructs human-logical fault trees for policies and implements root-cause analysis of policy violations based on KG queries and minimum cut set matching. Experiments and case evaluations show that our system provides good interpretability while balancing performance, accelerated understanding, and handling of misconfigurations.
{"title":"XNV: Explainable Network Verification","authors":"Fuliang Li;Minglong Li;Yunhang Pu;Yuxin Zhang;Xingwei Wang;Jiannong Cao","doi":"10.1109/TNET.2024.3456124","DOIUrl":"https://doi.org/10.1109/TNET.2024.3456124","url":null,"abstract":"Network verification has recently made strides, focusing on the satisfiability of configurations and policies or the performance and versatility of their methods. However, they generally ignore explainability, which is the ability to explain why a network violates or satisfies a certain forwarding policy. In this paper, we propose an explainable network verification framework XNV, which uses a novel interpretable fault analysis method to construct an effective explainable network verifier using knowledge graph (KG). XNV provides appropriate explanations to help operators understand the verification results, improving the transparency and trustworthiness of the verification system. First, XNV uses the KG as an intermediate representation of the configuration semantic level, storing the configuration semantics and routing protocol states. Then, XNV constructs human-logical fault trees for policies and implements root-cause analysis of policy violations based on KG queries and minimum cut set matching. Experiments and case evaluations show that our system provides good interpretability while balancing performance, accelerated understanding, and handling of misconfigurations.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"5097-5111"},"PeriodicalIF":3.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142859219","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-16DOI: 10.1109/TNET.2024.3452953
Amir Ashtari Gargari;Andrea Ortiz;Matteo Pagin;Wanja de Sombre;Michele Zorzi;Arash Asadi
Wireless backhauling at millimeter-wave frequencies (mmWave) in static scenarios is a well-established practice in cellular networks. However, highly directional and adaptive beamforming in today’s mmWave systems have opened new possibilities for self-backhauling. Tapping into this potential, 3GPP has standardized Integrated Access and Backhaul (IAB) allowing the same base station to serve both access and backhaul traffic. Although much more cost-effective and flexible, resource allocation and path selection in IAB mmWave networks is a formidable task. To date, prior works have addressed this challenge through a plethora of classic optimization and learning methods, generally optimizing Key Performance Indicators (KPIs) such as throughput, latency, and fairness, and little attention has been paid to the reliability of the KPI. We propose Safehaul, a risk-averse learning-based solution for IAB mmWave networks. In addition to optimizing the average performance, Safehaul ensures reliability by minimizing the losses in the tail of the performance distribution. We develop a novel simulator and show via extensive simulations that Safehaul not only reduces the latency by up to 43.2% compared to the benchmarks, but also exhibits significantly more reliable performance, e.g., 71.4% less variance in latency.
{"title":"Risk-Averse Learning for Reliable mmWave Self-Backhauling","authors":"Amir Ashtari Gargari;Andrea Ortiz;Matteo Pagin;Wanja de Sombre;Michele Zorzi;Arash Asadi","doi":"10.1109/TNET.2024.3452953","DOIUrl":"https://doi.org/10.1109/TNET.2024.3452953","url":null,"abstract":"Wireless backhauling at millimeter-wave frequencies (mmWave) in static scenarios is a well-established practice in cellular networks. However, highly directional and adaptive beamforming in today’s mmWave systems have opened new possibilities for self-backhauling. Tapping into this potential, 3GPP has standardized Integrated Access and Backhaul (IAB) allowing the same base station to serve both access and backhaul traffic. Although much more cost-effective and flexible, resource allocation and path selection in IAB mmWave networks is a formidable task. To date, prior works have addressed this challenge through a plethora of classic optimization and learning methods, generally optimizing Key Performance Indicators (KPIs) such as throughput, latency, and fairness, and little attention has been paid to the reliability of the KPI. We propose Safehaul, a risk-averse learning-based solution for IAB mmWave networks. In addition to optimizing the average performance, Safehaul ensures reliability by minimizing the losses in the tail of the performance distribution. We develop a novel simulator and show via extensive simulations that Safehaul not only reduces the latency by up to 43.2% compared to the benchmarks, but also exhibits significantly more reliable performance, e.g., 71.4% less variance in latency.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"4989-5003"},"PeriodicalIF":3.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142858970","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}
Consistent routing updates through Software-Defined Networking (SDN) can be difficult due to the asynchronous and distributed nature of the data plane. Recent studies have achieved consistent unicast routing updates. However, achieving consistent updates with drop-freeness and duplicate-freeness remains a challenge for multicast with fewer known results. This paper proposes a Novel Ordered Update Scheme called Nous, a novel approach that offers a comprehensive solution for consistently updating multicast routing based on SDN. To avoid duplicate entries, Nous configures the inport match field in the forwarding rules. Nous implements a dependency graph to schedule update operations dynamically. It also solves the Replace Operation Tree Migration Problem (ROTMP) using a greedy solution. To compare the greedy solution with the optimal solution, we employ the state-of-the-art mathematical programming solver Gurobi Optimizer 7.5 (for solving the optimization problem), Mininet 2.0, and Floodlight 1.2 (for simulation and comparison) to obtain a near-optimal solution. Simulation results show that using the greedy solution, Nous can usually achieve near-optimal solutions to the ROTMP with an average of fewer than 1.2 rounds and within 10 ms in different scenarios. This makes Nous the first ordered update scheme to guarantee two consistent states simultaneously.
由于数据平面的异步性和分布式特性，通过软件定义网络（SDN）进行一致的路由更新非常困难。最近的研究已经实现了一致的单播路由更新。然而，对于已知结果较少的组播来说，实现无丢弃和无重复的一致更新仍是一个挑战。本文提出了一种名为 Nous 的新颖有序更新方案，这种新颖的方法为基于 SDN 的组播路由一致更新提供了全面的解决方案。为避免重复条目，Nous 在转发规则中配置了内端口匹配字段。Nous 采用依赖关系图来动态调度更新操作。它还使用贪婪解决方案解决了替换操作树迁移问题（ROTMP）。为了比较贪婪解决方案和最优解决方案，我们使用了最先进的数学编程求解器 Gurobi Optimizer 7.5（用于求解优化问题）、Mininet 2.0 和 Floodlight 1.2（用于仿真和比较），以获得接近最优的解决方案。仿真结果表明，使用贪婪解决方案，Nous 通常能在不同场景下以平均少于 1.2 轮和 10 毫秒内的速度实现 ROTMP 的近优解决方案。这使得 Nous 成为第一个能同时保证两种一致状态的有序更新方案。
{"title":"Nous: Drop-Freeness and Duplicate-Freeness for Consistent Updating in SDN Multicast Routing","authors":"Xiaofeng Gao;Akbar Majidi;Yucen Gao;Guanhao Wu;Nazila Jahanbakhsh;Linghe Kong;Guihai Chen","doi":"10.1109/TNET.2024.3404967","DOIUrl":"10.1109/TNET.2024.3404967","url":null,"abstract":"Consistent routing updates through Software-Defined Networking (SDN) can be difficult due to the asynchronous and distributed nature of the data plane. Recent studies have achieved consistent unicast routing updates. However, achieving consistent updates with drop-freeness and duplicate-freeness remains a challenge for multicast with fewer known results. This paper proposes a Novel Ordered Update Scheme called Nous, a novel approach that offers a comprehensive solution for consistently updating multicast routing based on SDN. To avoid duplicate entries, Nous configures the inport match field in the forwarding rules. Nous implements a dependency graph to schedule update operations dynamically. It also solves the Replace Operation Tree Migration Problem (ROTMP) using a greedy solution. To compare the greedy solution with the optimal solution, we employ the state-of-the-art mathematical programming solver Gurobi Optimizer 7.5 (for solving the optimization problem), Mininet 2.0, and Floodlight 1.2 (for simulation and comparison) to obtain a near-optimal solution. Simulation results show that using the greedy solution, Nous can usually achieve near-optimal solutions to the ROTMP with an average of fewer than 1.2 rounds and within 10 ms in different scenarios. This makes Nous the first ordered update scheme to guarantee two consistent states simultaneously.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 5","pages":"3685-3698"},"PeriodicalIF":3.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142248686","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-13DOI: 10.1109/TNET.2024.3453903
Qiuye He;Edwin Yang;Song Fang;Shangqing Zhao
Breathing rates and crowd counting can be used to verify the human presence, especially the former one can disclose a person’s physiological status. Many studies have demonstrated success in applying channel state information (CSI) to estimate the breathing rates of stationary individuals and count the number of people in motion. Due to the invisibility of radio signals, the ubiquitous deployment of wireless infrastructures, and the elimination of the line-of-sight (LOS) requirement, such wireless inference techniques can surreptitiously work and violate user privacy. However, little research has been conducted specifically in mitigating misuse of those techniques. This paper proposes new proactive countermeasures against all existing CSI-based vital signs and crowd counting inference methods. Specifically, we set up ambush locations with carefully designed wireless signals, allowing eavesdroppers to infer a false breathing rate or person count specified by the transmitter. The true breathing rate or person count is thus protected. Experimental results on software-defined radio platforms with 5 participants demonstrate the effectiveness of the proposed defenses. An eavesdropper can be misled into believing any desired breathing rate with an error of less than 1.2 bpm when the user lies on a bed in a bedroom, and 0.9 bpm when the user sits in a chair in an office room. Additionally, our proposed defense mechanisms can deceive an attacker into believing there are moving individuals in an empty room with a 100% success rate, using both Support Vector Machine (SVM) and Decision Tree (DT) classifiers.
{"title":"Revisiting Wireless Breath and Crowd Inference Attacks With Defensive Deception","authors":"Qiuye He;Edwin Yang;Song Fang;Shangqing Zhao","doi":"10.1109/TNET.2024.3453903","DOIUrl":"10.1109/TNET.2024.3453903","url":null,"abstract":"Breathing rates and crowd counting can be used to verify the human presence, especially the former one can disclose a person’s physiological status. Many studies have demonstrated success in applying channel state information (CSI) to estimate the breathing rates of stationary individuals and count the number of people in motion. Due to the invisibility of radio signals, the ubiquitous deployment of wireless infrastructures, and the elimination of the line-of-sight (LOS) requirement, such wireless inference techniques can surreptitiously work and violate user privacy. However, little research has been conducted specifically in mitigating misuse of those techniques. This paper proposes new proactive countermeasures against all existing CSI-based vital signs and crowd counting inference methods. Specifically, we set up ambush locations with carefully designed wireless signals, allowing eavesdroppers to infer a false breathing rate or person count specified by the transmitter. The true breathing rate or person count is thus protected. Experimental results on software-defined radio platforms with 5 participants demonstrate the effectiveness of the proposed defenses. An eavesdropper can be misled into believing any desired breathing rate with an error of less than 1.2 bpm when the user lies on a bed in a bedroom, and 0.9 bpm when the user sits in a chair in an office room. Additionally, our proposed defense mechanisms can deceive an attacker into believing there are moving individuals in an empty room with a 100% success rate, using both Support Vector Machine (SVM) and Decision Tree (DT) classifiers.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 6","pages":"4976-4988"},"PeriodicalIF":3.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142248684","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：