Pub Date : 2024-08-27DOI: 10.1109/TNSM.2024.3450597
Jin Ye;Tiantian Yu;Zhaoyi Li;Jiawei Huang
In recent years, motivated by new datacenter applications and the well-known shortcomings of TCP in data center, many receiver-driven transport protocols have been proposed to provide ultra-low latency and zero packet loss by using the proactive congestion control. However, in the scenario of mixed short and long flows, the short flows with ON/OFF pattern generate micro-burst traffic, which significantly deteriorates the performance of existing receiver-driven transport protocols. Firstly, when the short flows turn into ON mode, the long flows cannot immediately concede bandwidth to the short ones, resulting in queue buildup and even packet loss. Secondly, when the short flows change from ON to OFF mode, the released bandwidth cannot be fully utilized by the long flows, leading to serious bandwidth waste. To address these issues, we propose a new receiver-driven transport protocol, called SAR, which predicts the micro burst generated by short flows and adjusts the sending rate of long flows accordingly. With the aid of micro-burst prediction mechanism, SAR mitigates the bandwidth competition due to the arrival of short flows, and alleviates the bandwidth waste when the short flows leave. The testbed and NS2 simulation experiments demonstrate that SAR reduces the average flow completion time (AFCT) by up to 66% compared to typical receiver-driven transport protocols.
{"title":"SAR: Receiver-Driven Transport Protocol With Micro-Burst Prediction in Data Center Networks","authors":"Jin Ye;Tiantian Yu;Zhaoyi Li;Jiawei Huang","doi":"10.1109/TNSM.2024.3450597","DOIUrl":"10.1109/TNSM.2024.3450597","url":null,"abstract":"In recent years, motivated by new datacenter applications and the well-known shortcomings of TCP in data center, many receiver-driven transport protocols have been proposed to provide ultra-low latency and zero packet loss by using the proactive congestion control. However, in the scenario of mixed short and long flows, the short flows with ON/OFF pattern generate micro-burst traffic, which significantly deteriorates the performance of existing receiver-driven transport protocols. Firstly, when the short flows turn into ON mode, the long flows cannot immediately concede bandwidth to the short ones, resulting in queue buildup and even packet loss. Secondly, when the short flows change from ON to OFF mode, the released bandwidth cannot be fully utilized by the long flows, leading to serious bandwidth waste. To address these issues, we propose a new receiver-driven transport protocol, called SAR, which predicts the micro burst generated by short flows and adjusts the sending rate of long flows accordingly. With the aid of micro-burst prediction mechanism, SAR mitigates the bandwidth competition due to the arrival of short flows, and alleviates the bandwidth waste when the short flows leave. The testbed and NS2 simulation experiments demonstrate that SAR reduces the average flow completion time (AFCT) by up to 66% compared to typical receiver-driven transport protocols.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6409-6422"},"PeriodicalIF":4.7,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187208","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 : 2024-08-27DOI: 10.1109/TNSM.2024.3450596
Jinbin Hu;Zikai Zhou;Jin Zhang
In modern datacenter networks (DCNs), mainstream congestion control (CC) mechanisms essentially rely on Explicit Congestion Notification (ECN) to reflect congestion. The traditional static ECN threshold performs poorly under dynamic scenarios, and setting a proper ECN threshold under various traffic patterns is challenging and time-consuming. The recently proposed reinforcement learning (RL) based ECN Tuning algorithm (ACC) consumes a large number of computational resources, making it difficult to deploy on switches. In this paper, we present a lightweight and hierarchical automated ECN tuning algorithm called LAECN, which can fully exploit the performance benefits of deep reinforcement learning with ultra-low overhead. The simulation results show that LAECN improves performance significantly by reducing latency and increasing throughput in stable network conditions, and also shows consistent high performance in small flows network environments. For example, LAECN effectively improves throughput by up to 47%, 34%, 32% and 24% over DCQCN, TIMELY, HPCC and ACC, respectively.
{"title":"Lightweight Automatic ECN Tuning Based on Deep Reinforcement Learning With Ultra-Low Overhead in Datacenter Networks","authors":"Jinbin Hu;Zikai Zhou;Jin Zhang","doi":"10.1109/TNSM.2024.3450596","DOIUrl":"10.1109/TNSM.2024.3450596","url":null,"abstract":"In modern datacenter networks (DCNs), mainstream congestion control (CC) mechanisms essentially rely on Explicit Congestion Notification (ECN) to reflect congestion. The traditional static ECN threshold performs poorly under dynamic scenarios, and setting a proper ECN threshold under various traffic patterns is challenging and time-consuming. The recently proposed reinforcement learning (RL) based ECN Tuning algorithm (ACC) consumes a large number of computational resources, making it difficult to deploy on switches. In this paper, we present a lightweight and hierarchical automated ECN tuning algorithm called LAECN, which can fully exploit the performance benefits of deep reinforcement learning with ultra-low overhead. The simulation results show that LAECN improves performance significantly by reducing latency and increasing throughput in stable network conditions, and also shows consistent high performance in small flows network environments. For example, LAECN effectively improves throughput by up to 47%, 34%, 32% and 24% over DCQCN, TIMELY, HPCC and ACC, respectively.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6398-6408"},"PeriodicalIF":4.7,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187210","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}
Nowadays, Remote Direct Memory Access (RDMA) is gaining popularity in data centers for low CPU overhead, high throughput, and ultra-low latency. As one of the state-of-the-art RDMA Congestion Control (CC) mechanisms, HPCC leverages the In-band Network Telemetry (INT) features to achieve accurate control and significantly shortens the Flow Completion Time (FCT) for short flows. However, there exists redundant INT information increasing the processing latency at switches and affecting flows’ throughput. Besides, its end-to-end feedback mechanism is not timely enough to help senders cope well with bursty traffic, and there still exists a high probability of triggering Priority-based Flow Control (PFC) pauses under large-scale incast. In this paper, we propose a Congestion-Aware (CA) control mechanism called CACC, which attempts to push CC to the theoretical low INT overhead and PFC pause delay. CACC introduces two CA algorithms to quantize switch buffer and egress port congestion, separately, along with a fine-grained window size adjustment algorithm at the sender. Specifically, the buffer CA algorithm perceives large-scale congestion that may trigger PFC pauses and provides early feedback, significantly reducing the PFC pause delay. The egress port CA algorithm perceives the link state and selectively inserts useful INT data, achieving lower queue sizes and reducing the average overhead per packet from 42 bytes to 2 bits. In our evaluation, compared with HPCC, PINT, and Bolt, CACC shortens the average and tail FCT by up to 27% and 60.1%, respectively.
{"title":"CACC: A Congestion-Aware Control Mechanism to Reduce INT Overhead and PFC Pause Delay","authors":"Xiwen Jie;Jiangping Han;Guanglei Chen;Hang Wang;Peilin Hong;Kaiping Xue","doi":"10.1109/TNSM.2024.3449699","DOIUrl":"10.1109/TNSM.2024.3449699","url":null,"abstract":"Nowadays, Remote Direct Memory Access (RDMA) is gaining popularity in data centers for low CPU overhead, high throughput, and ultra-low latency. As one of the state-of-the-art RDMA Congestion Control (CC) mechanisms, HPCC leverages the In-band Network Telemetry (INT) features to achieve accurate control and significantly shortens the Flow Completion Time (FCT) for short flows. However, there exists redundant INT information increasing the processing latency at switches and affecting flows’ throughput. Besides, its end-to-end feedback mechanism is not timely enough to help senders cope well with bursty traffic, and there still exists a high probability of triggering Priority-based Flow Control (PFC) pauses under large-scale incast. In this paper, we propose a Congestion-Aware (CA) control mechanism called CACC, which attempts to push CC to the theoretical low INT overhead and PFC pause delay. CACC introduces two CA algorithms to quantize switch buffer and egress port congestion, separately, along with a fine-grained window size adjustment algorithm at the sender. Specifically, the buffer CA algorithm perceives large-scale congestion that may trigger PFC pauses and provides early feedback, significantly reducing the PFC pause delay. The egress port CA algorithm perceives the link state and selectively inserts useful INT data, achieving lower queue sizes and reducing the average overhead per packet from 42 bytes to 2 bits. In our evaluation, compared with HPCC, PINT, and Bolt, CACC shortens the average and tail FCT by up to 27% and 60.1%, respectively.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6382-6397"},"PeriodicalIF":4.7,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187216","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 : 2024-08-26DOI: 10.1109/TNSM.2024.3449575
Hui Wang;Zhenyu Yang;Ming Li;Xiaowei Zhang;Yanlan Hu;Donghui Hu
As the origin of blockchains, the Nakamoto Consensus protocol is the primary protocol for many public blockchains (e.g., Bitcoin) used in cryptocurrencies. Blockchains need to be decentralized as a core feature, yet it is difficult to strike a balance between scalability and security. Many approaches to improving blockchain scalability often result in diminished security or compromise the decentralized nature of the system. Inspired by network science, especially the epidemic model, we try to solve this problem by mapping the propagation of transactions and blocks as two interacting epidemics, called the CoSIS model. We extend the transaction propagation process to increase the efficiency of block propagation, which reduces the number of unknown transactions. The reduction of the block propagation latency ultimately increases the blockchain throughput. The theory of complex networks is employed to offer an optimal boundary condition. Finally, the node scores are stored in the chain, so that it also provides a new incentive approach. Our experiments show that CoSIS accelerates blocks’ propagation and TPS is raised by 20% $sim ~33$ % on average. At the same time, the system security can be significantly improved, as an orphaned block rate is close to zero in better cases. CoSIS enhances the scalability and security of the blockchain while ensuring that all changes do not compromise the decentralized nature of the blockchain.
{"title":"CoSIS: A Secure, Scalability, Decentralized Blockchain via Complexity Theory","authors":"Hui Wang;Zhenyu Yang;Ming Li;Xiaowei Zhang;Yanlan Hu;Donghui Hu","doi":"10.1109/TNSM.2024.3449575","DOIUrl":"10.1109/TNSM.2024.3449575","url":null,"abstract":"As the origin of blockchains, the Nakamoto Consensus protocol is the primary protocol for many public blockchains (e.g., Bitcoin) used in cryptocurrencies. Blockchains need to be decentralized as a core feature, yet it is difficult to strike a balance between scalability and security. Many approaches to improving blockchain scalability often result in diminished security or compromise the decentralized nature of the system. Inspired by network science, especially the epidemic model, we try to solve this problem by mapping the propagation of transactions and blocks as two interacting epidemics, called the CoSIS model. We extend the transaction propagation process to increase the efficiency of block propagation, which reduces the number of unknown transactions. The reduction of the block propagation latency ultimately increases the blockchain throughput. The theory of complex networks is employed to offer an optimal boundary condition. Finally, the node scores are stored in the chain, so that it also provides a new incentive approach. Our experiments show that CoSIS accelerates blocks’ propagation and TPS is raised by 20% \u0000<inline-formula> <tex-math>$sim ~33$ </tex-math></inline-formula>\u0000% on average. At the same time, the system security can be significantly improved, as an orphaned block rate is close to zero in better cases. CoSIS enhances the scalability and security of the blockchain while ensuring that all changes do not compromise the decentralized nature of the blockchain.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6204-6217"},"PeriodicalIF":4.7,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187217","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}
Malicious URLs present significant threats to businesses, such as transportation and banking, causing disruptions in business operations. It is essential to identify these URLs; however, existing Machine Learning models are vulnerable to backdoor attacks. These attacks involve manipulating a small portion of the training data labels, such as Label Flipping, which can lead to misclassification. Therefore, it is crucial to incorporate defense mechanisms into machine-learning models to protect against such attacks. The focus of this study is on backdoor attacks in the context of URL detection using ensemble trees. By illuminating the motivations behind such attacks, highlighting the roles of attackers, and emphasizing the critical importance of effective defense strategies, this paper contributes to the ongoing efforts to fortify machine-learning models against adversarial threats within the machine-learning domain in network security. We propose an innovative alarm system that detects the presence of poisoned labels and a defense mechanism designed to uncover the original class labels with the aim of mitigating backdoor attacks on ensemble tree classifiers. We conducted a case study using the Alexa and Phishing Site URL datasets and showed that label-flipping attacks can be addressed using our proposed defense mechanism. Our experimental results prove that the Label Flipping attack achieved an Attack Success Rate between 50-65% within 2-5%, and the innovative defense method successfully detected poisoned labels with an accuracy of up to 100%.
{"title":"Mitigating Label Flipping Attacks in Malicious URL Detectors Using Ensemble Trees","authors":"Ehsan Nowroozi;Nada Jadalla;Samaneh Ghelichkhani;Alireza Jolfaei","doi":"10.1109/TNSM.2024.3447411","DOIUrl":"10.1109/TNSM.2024.3447411","url":null,"abstract":"Malicious URLs present significant threats to businesses, such as transportation and banking, causing disruptions in business operations. It is essential to identify these URLs; however, existing Machine Learning models are vulnerable to backdoor attacks. These attacks involve manipulating a small portion of the training data labels, such as Label Flipping, which can lead to misclassification. Therefore, it is crucial to incorporate defense mechanisms into machine-learning models to protect against such attacks. The focus of this study is on backdoor attacks in the context of URL detection using ensemble trees. By illuminating the motivations behind such attacks, highlighting the roles of attackers, and emphasizing the critical importance of effective defense strategies, this paper contributes to the ongoing efforts to fortify machine-learning models against adversarial threats within the machine-learning domain in network security. We propose an innovative alarm system that detects the presence of poisoned labels and a defense mechanism designed to uncover the original class labels with the aim of mitigating backdoor attacks on ensemble tree classifiers. We conducted a case study using the Alexa and Phishing Site URL datasets and showed that label-flipping attacks can be addressed using our proposed defense mechanism. Our experimental results prove that the Label Flipping attack achieved an Attack Success Rate between 50-65% within 2-5%, and the innovative defense method successfully detected poisoned labels with an accuracy of up to 100%.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6875-6884"},"PeriodicalIF":4.7,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187213","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 : 2024-08-26DOI: 10.1109/TNSM.2024.3450014
Abid Yaqoob;Gabriel-Miro Muntean
Next-generation cellular networks strive to offer ubiquitous connectivity, enhanced transmission rates with increased capacity, and superior network coverage. However, they face significant challenges due to the growing demand for multimedia services across diverse devices. Adaptive multimedia streaming services are essential for achieving good viewer Quality of Experience (QoE) levels amidst these challenges. Yet, the existing adaptive video streaming solutions do not consider diverse QoE preferences or are limited to meeting specific QoE objectives. This paper presents FReD-ViQ, a Fuzzy Reinforcement Learning-Driven Adaptive Streaming Solution for Improved Video QoE that combines the strengths of fuzzy logic and advanced Deep Reinforcement Learning (DRL) mechanisms to deliver exceptional, individually tailored user experiences. FReD-ViQ is a sophisticated streaming solution that leverages efficient membership function modelling to achieve a more finely-grained representation of both input and output spaces. This advanced representation is augmented by a set of fuzzy rules that govern the decision-making process. In addition to its fuzzy logic capabilities, FReD-ViQ incorporates a novel DRL algorithm based on Dueling Double Deep Q-Network (Dueling DDQN), noisy networks, and prioritized experience replay (PER) techniques. This innovative fusion enables effective modelling of uncertain network dynamics and high-dimensional state spaces while optimizing exploration-exploitation trade-offs in adaptive streaming environments. Extensive performance evaluations in real-world simulation settings demonstrate that FReD-ViQ effectively surpasses existing solutions across multiple QoE models, yielding average improvements of 23.10% (Linear QoE), 23.97% (Log QoE), and 33.42% (HD QoE).
{"title":"FReD-ViQ: Fuzzy Reinforcement Learning Driven Adaptive Streaming Solution for Improved Video Quality of Experience","authors":"Abid Yaqoob;Gabriel-Miro Muntean","doi":"10.1109/TNSM.2024.3450014","DOIUrl":"10.1109/TNSM.2024.3450014","url":null,"abstract":"Next-generation cellular networks strive to offer ubiquitous connectivity, enhanced transmission rates with increased capacity, and superior network coverage. However, they face significant challenges due to the growing demand for multimedia services across diverse devices. Adaptive multimedia streaming services are essential for achieving good viewer Quality of Experience (QoE) levels amidst these challenges. Yet, the existing adaptive video streaming solutions do not consider diverse QoE preferences or are limited to meeting specific QoE objectives. This paper presents FReD-ViQ, a Fuzzy Reinforcement Learning-Driven Adaptive Streaming Solution for Improved Video QoE that combines the strengths of fuzzy logic and advanced Deep Reinforcement Learning (DRL) mechanisms to deliver exceptional, individually tailored user experiences. FReD-ViQ is a sophisticated streaming solution that leverages efficient membership function modelling to achieve a more finely-grained representation of both input and output spaces. This advanced representation is augmented by a set of fuzzy rules that govern the decision-making process. In addition to its fuzzy logic capabilities, FReD-ViQ incorporates a novel DRL algorithm based on Dueling Double Deep Q-Network (Dueling DDQN), noisy networks, and prioritized experience replay (PER) techniques. This innovative fusion enables effective modelling of uncertain network dynamics and high-dimensional state spaces while optimizing exploration-exploitation trade-offs in adaptive streaming environments. Extensive performance evaluations in real-world simulation settings demonstrate that FReD-ViQ effectively surpasses existing solutions across multiple QoE models, yielding average improvements of 23.10% (Linear QoE), 23.97% (Log QoE), and 33.42% (HD QoE).","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 5","pages":"5532-5547"},"PeriodicalIF":4.7,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10648983","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187215","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 : 2024-08-26DOI: 10.1109/TNSM.2024.3449889
Dan Tang;Xiaocai Wang;Keqin Li;Chao Yin;Wei Liang;Jiliang Zhang
Distributed Reflection Denial-of-Service (DRDoS) attacks have caused significant destructive effects by virtue of emerging protocol vulnerabilities and amplification advantages, and their intensity is increasing. The emergence of programmable data plane supporting line-rate forwarding provides a new opportunity for fine-grained and efficient attack detection. This paper proposed a light-weight DRDoS attack detection and mitigation system called FAPM, which is deployed at the victim end with the intention of detecting the amplification behavior caused by the attack. It places the work of collecting and calculating reflection features on the data plane operated by “latter window assisting former window” mechanism, and arranges complex identification and regulation logic on the control plane. This approach avoids the hardware constraints of the programmable switch while leveraging their per-packet processing capability. Also, it reduces communication traffic significantly through feature compression and state transitions. Experiments show that FAPM has (1) fast response capability within seconds (2) a memory footprint at the KB level and communication overhead of 1 Kbps, and (3) good robustness.
{"title":"FAPM: A Fake Amplification Phenomenon Monitor to Filter DRDoS Attacks With P4 Data Plane","authors":"Dan Tang;Xiaocai Wang;Keqin Li;Chao Yin;Wei Liang;Jiliang Zhang","doi":"10.1109/TNSM.2024.3449889","DOIUrl":"10.1109/TNSM.2024.3449889","url":null,"abstract":"Distributed Reflection Denial-of-Service (DRDoS) attacks have caused significant destructive effects by virtue of emerging protocol vulnerabilities and amplification advantages, and their intensity is increasing. The emergence of programmable data plane supporting line-rate forwarding provides a new opportunity for fine-grained and efficient attack detection. This paper proposed a light-weight DRDoS attack detection and mitigation system called FAPM, which is deployed at the victim end with the intention of detecting the amplification behavior caused by the attack. It places the work of collecting and calculating reflection features on the data plane operated by “latter window assisting former window” mechanism, and arranges complex identification and regulation logic on the control plane. This approach avoids the hardware constraints of the programmable switch while leveraging their per-packet processing capability. Also, it reduces communication traffic significantly through feature compression and state transitions. Experiments show that FAPM has (1) fast response capability within seconds (2) a memory footprint at the KB level and communication overhead of 1 Kbps, and (3) good robustness.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6703-6715"},"PeriodicalIF":4.7,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187212","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}
RPL is introduced to conduct path selection in Low-power and Lossy Networks (LLN), including IoT. A routing policy in RPL is governed by its objective function, which corresponds to the requirements of the IoT application, e.g., energy-efficiency, and reliability in terms of Packet Delivery Ratio (PDR). In many applications, it is not possible to connect the nodes to the power outlet. Also, since nodes may be geographically inaccessible, replacing the depleted batteries is infeasible. Hence, harvesters are an admirable replacement for traditional batteries to prevent energy hole problem, and consequently to enhance the lifetime and reliability of IoT networks. Nevertheless, the unstable level of energy absorption in harvesters necessitates developing a routing policy, which could consider harvesting aspects. Furthermore, since the rates of absorption, and consumption are incredibly dynamic in different parts of the network, learning-based techniques could be employed in the routing process to provide energy-efficiency. Accordingly, this paper introduces LANTERN; a learning-based routing policy for improving PDR in energy-harvesting IoT networks. In addition to the rate of energy absorption, and consumption, LANTERN utilizes the remaining energy in its routing policy. In this regard, LANTERN introduces a novel routing metric called Energy Exponential Moving Average (EEMA) to perform its path selection. Based on diversified simulations conducted in Cooja, with prolonging the lifetime of the network by $5.7times $ , and mitigating the probability of energy hole problem, LANTERN improves the PDR by up to 97%, compared to the state-of-the-art. Also, the consumed energy per successfully delivered packet is reduced by 76%.
{"title":"LANTERN: Learning-Based Routing Policy for Reliable Energy-Harvesting IoT Networks","authors":"Hossein Taghizadeh;Bardia Safaei;Amir Mahdi Hosseini Monazzah;Elyas Oustad;Sahar Rezagholi Lalani;Alireza Ejlali","doi":"10.1109/TNSM.2024.3450011","DOIUrl":"10.1109/TNSM.2024.3450011","url":null,"abstract":"RPL is introduced to conduct path selection in Low-power and Lossy Networks (LLN), including IoT. A routing policy in RPL is governed by its objective function, which corresponds to the requirements of the IoT application, e.g., energy-efficiency, and reliability in terms of Packet Delivery Ratio (PDR). In many applications, it is not possible to connect the nodes to the power outlet. Also, since nodes may be geographically inaccessible, replacing the depleted batteries is infeasible. Hence, harvesters are an admirable replacement for traditional batteries to prevent energy hole problem, and consequently to enhance the lifetime and reliability of IoT networks. Nevertheless, the unstable level of energy absorption in harvesters necessitates developing a routing policy, which could consider harvesting aspects. Furthermore, since the rates of absorption, and consumption are incredibly dynamic in different parts of the network, learning-based techniques could be employed in the routing process to provide energy-efficiency. Accordingly, this paper introduces LANTERN; a learning-based routing policy for improving PDR in energy-harvesting IoT networks. In addition to the rate of energy absorption, and consumption, LANTERN utilizes the remaining energy in its routing policy. In this regard, LANTERN introduces a novel routing metric called Energy Exponential Moving Average (EEMA) to perform its path selection. Based on diversified simulations conducted in Cooja, with prolonging the lifetime of the network by \u0000<inline-formula> <tex-math>$5.7times $ </tex-math></inline-formula>\u0000, and mitigating the probability of energy hole problem, LANTERN improves the PDR by up to 97%, compared to the state-of-the-art. Also, the consumed energy per successfully delivered packet is reduced by 76%.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6542-6554"},"PeriodicalIF":4.7,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187214","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}
Facilitated by the widespread adoption of Internet of Things (IoT) networks, Location-based services (LBS) have emerged as a new type of services, requiring a high quality of service (QoS) and to provide access to all devices within predefined zones of interest. This is made possible via specific IoT Networks architectures based on the Software Defined Network paradigm. To address the challenge of unstable IoT networks management, where devices can move, appear, or vanish unpredictably, we propose a novel architecture based on a selection process of dominant devices acting as gateways, ensuring continuity of service. We investigate two selection processes, respectively based on Connected Dominating Sets and Deep Q-Network techniques. The objective of this method is to optimize energy consumption while providing high QoS and extending network access to offline devices within predefined zones of interest. In order to evaluate the performance of the proposed architecture with different selection processes, we conducted experiments using emulation tools allowing communication mode demand generations. The metrics used were the proportion of dominant devices, the energy consumption savings, the quality of service and the network extension to offline devices. Ultimately, we present a recommendation concerning the selection process based on the needs of the system.
{"title":"Managing a Resilient Multitier Architecture for Unstable IoT Networks in Location Based-Services","authors":"Aurélien Chambon;Abderrezak Rachedi;Abderrahim Sahli;Ahmed Mebarki","doi":"10.1109/TNSM.2024.3449044","DOIUrl":"10.1109/TNSM.2024.3449044","url":null,"abstract":"Facilitated by the widespread adoption of Internet of Things (IoT) networks, Location-based services (LBS) have emerged as a new type of services, requiring a high quality of service (QoS) and to provide access to all devices within predefined zones of interest. This is made possible via specific IoT Networks architectures based on the Software Defined Network paradigm. To address the challenge of unstable IoT networks management, where devices can move, appear, or vanish unpredictably, we propose a novel architecture based on a selection process of dominant devices acting as gateways, ensuring continuity of service. We investigate two selection processes, respectively based on Connected Dominating Sets and Deep Q-Network techniques. The objective of this method is to optimize energy consumption while providing high QoS and extending network access to offline devices within predefined zones of interest. In order to evaluate the performance of the proposed architecture with different selection processes, we conducted experiments using emulation tools allowing communication mode demand generations. The metrics used were the proportion of dominant devices, the energy consumption savings, the quality of service and the network extension to offline devices. Ultimately, we present a recommendation concerning the selection process based on the needs of the system.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 5","pages":"5304-5320"},"PeriodicalIF":4.7,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187221","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}
The increasing demand for determinism in modern industrial communication, driven by Industry 4.0, has led to the development of IEEE Time-Sensitive Networking (TSN) standards. However, integrating and configuring interconnected heterogeneous industrial networks remains a significant challenge. This paper extends the novel hierarchical Software-Defined Networking (SDN) based architectural design and control plane framework introduced in the context of orchestration and management of a multi-domain TSN network. We present relevant data models and a signaling schema essential for establishing end-to-end inter-domain time-sensitive streams within the proposed architecture. A proof-of-concept implementation validates the feasibility of the framework and demonstrates its performance advantages over the peer-to-peer model. The scalability of the framework for large-scale industrial networks is verified, and it ensures secure information encapsulation among domains, enabling seamless integration of multi-vendor heterogeneous applications. Furthermore, we investigate the use of CORECONF as a lightweight alternative to NETCONF for network management of multi-domain TSN network, providing experimental results.
{"title":"Multi-Domain TSN Orchestration and Management for Large-Scale Industrial Networks","authors":"Sushmit Bhattacharjee;Konstantinos Alexandris;Thomas Bauschert","doi":"10.1109/TNSM.2024.3447789","DOIUrl":"10.1109/TNSM.2024.3447789","url":null,"abstract":"The increasing demand for determinism in modern industrial communication, driven by Industry 4.0, has led to the development of IEEE Time-Sensitive Networking (TSN) standards. However, integrating and configuring interconnected heterogeneous industrial networks remains a significant challenge. This paper extends the novel hierarchical Software-Defined Networking (SDN) based architectural design and control plane framework introduced in the context of orchestration and management of a multi-domain TSN network. We present relevant data models and a signaling schema essential for establishing end-to-end inter-domain time-sensitive streams within the proposed architecture. A proof-of-concept implementation validates the feasibility of the framework and demonstrates its performance advantages over the peer-to-peer model. The scalability of the framework for large-scale industrial networks is verified, and it ensures secure information encapsulation among domains, enabling seamless integration of multi-vendor heterogeneous applications. Furthermore, we investigate the use of CORECONF as a lightweight alternative to NETCONF for network management of multi-domain TSN network, providing experimental results.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6480-6492"},"PeriodicalIF":4.7,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187220","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
扫码关注我们
求助内容：
应助结果提醒方式：