Pub Date : 2024-07-31DOI: 10.1109/TNSM.2024.3436049
Hyunmin Noh;Seunggyu Ji;Yunmin Go;Gi Seok Park;Hwangjun Song
In this paper, we propose a resilient and fast block transmission system for Hyperledger Fabric in multi-cloud environments. The goal of the proposed system is to improve the scalability, transaction throughput, and resilience of Hyperledger Fabric by minimizing the block synchronization time among nodes. To achieve this goal, the proposed system is designed to deliver blocks quickly and reliably to all the participating nodes in time-varying multi-cloud environments. The proposed system includes the delay estimating process with O(N) control message overhead over the P2P network, the effective bandwidth estimating process for block transmission, the Gaussian Mixture Model-based clustering and cluster leader selecting process, and hybrid P2P multicast tree constructing process. In addition, a control message format and delivery process are proposed to efficiently provide hybrid P2P multicast tree and neighbor nodes information to all the participating nodes. And we propose a pull-based local block loss recovery process that can receive lost blocks from multi-node without complicated scheduling using a rateless code. The proposed system is fully implemented by using well-known open sources (e.g., Hyperledger Fabric, Docker, Containernet, and Mininet) and Go/C/Python. Experiment results show that the proposed system can reduce the maximum block arriving time among all the participating nodes by approximately 50%~95% compared to the existing algorithms. This improves not only blockchain transaction per second, but also resilience to various network-layer vulnerabilities and attacks that may occur when the block propagation delay increases.
{"title":"Resilient and Fast Block Transmission System for Scalable Hyperledger Fabric Blockchain in Multi-Cloud Environments","authors":"Hyunmin Noh;Seunggyu Ji;Yunmin Go;Gi Seok Park;Hwangjun Song","doi":"10.1109/TNSM.2024.3436049","DOIUrl":"10.1109/TNSM.2024.3436049","url":null,"abstract":"In this paper, we propose a resilient and fast block transmission system for Hyperledger Fabric in multi-cloud environments. The goal of the proposed system is to improve the scalability, transaction throughput, and resilience of Hyperledger Fabric by minimizing the block synchronization time among nodes. To achieve this goal, the proposed system is designed to deliver blocks quickly and reliably to all the participating nodes in time-varying multi-cloud environments. The proposed system includes the delay estimating process with O(N) control message overhead over the P2P network, the effective bandwidth estimating process for block transmission, the Gaussian Mixture Model-based clustering and cluster leader selecting process, and hybrid P2P multicast tree constructing process. In addition, a control message format and delivery process are proposed to efficiently provide hybrid P2P multicast tree and neighbor nodes information to all the participating nodes. And we propose a pull-based local block loss recovery process that can receive lost blocks from multi-node without complicated scheduling using a rateless code. The proposed system is fully implemented by using well-known open sources (e.g., Hyperledger Fabric, Docker, Containernet, and Mininet) and Go/C/Python. Experiment results show that the proposed system can reduce the maximum block arriving time among all the participating nodes by approximately 50%~95% compared to the existing algorithms. This improves not only blockchain transaction per second, but also resilience to various network-layer vulnerabilities and attacks that may occur when the block propagation delay increases.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 5","pages":"5118-5134"},"PeriodicalIF":4.7,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141873178","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-07-29DOI: 10.1109/TNSM.2024.3435544
Alex S. Santos;Eonassis Oliveira Santos;Sabidur Rahman;Lena Wosinska;Juliana de Santi;Gustavo B. Figueiredo
Network operators must deal with Classes of Service (CoS), which have several quality requirements, such as latency, bandwidth/capacity, priority, etc. Besides, it is observed an increase in the volume of traffic that is offered to the transport network. This traffic can be affected by network natural disasters or human-made attacks. In this case, network operators must decide which services to restore, considering their different requirements. In this work, we present a Lightpath Selection Algorithm (LSA) that aims to select lightpaths to be restored after a resource crunch. This algorithm has a multicriteria decision approach considering CoS, Bandwidth, number of Hops, and Holding time. Moreover, service degradation is also considered for those lightpaths that can not be restored with full bandwidth. Results show that our proposed algorithm can improve network restorability and availability without penalizing low-level CoSs.
{"title":"Multi-Criteria Decision Approach for Lightpath Restoration After Resource Crunch","authors":"Alex S. Santos;Eonassis Oliveira Santos;Sabidur Rahman;Lena Wosinska;Juliana de Santi;Gustavo B. Figueiredo","doi":"10.1109/TNSM.2024.3435544","DOIUrl":"10.1109/TNSM.2024.3435544","url":null,"abstract":"Network operators must deal with Classes of Service (CoS), which have several quality requirements, such as latency, bandwidth/capacity, priority, etc. Besides, it is observed an increase in the volume of traffic that is offered to the transport network. This traffic can be affected by network natural disasters or human-made attacks. In this case, network operators must decide which services to restore, considering their different requirements. In this work, we present a Lightpath Selection Algorithm (LSA) that aims to select lightpaths to be restored after a resource crunch. This algorithm has a multicriteria decision approach considering CoS, Bandwidth, number of Hops, and Holding time. Moreover, service degradation is also considered for those lightpaths that can not be restored with full bandwidth. Results show that our proposed algorithm can improve network restorability and availability without penalizing low-level CoSs.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 5","pages":"5521-5531"},"PeriodicalIF":4.7,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141873445","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-07-29DOI: 10.1109/tnsm.2024.3435869
Jiaze Shang, Tianbo Lu, Pengfei Zhao
{"title":"SIM: Achieving High Profit through Integration of Selfish Strategy into Innocent Mining","authors":"Jiaze Shang, Tianbo Lu, Pengfei Zhao","doi":"10.1109/tnsm.2024.3435869","DOIUrl":"https://doi.org/10.1109/tnsm.2024.3435869","url":null,"abstract":"","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"52 1","pages":""},"PeriodicalIF":5.3,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141870315","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-07-29DOI: 10.1109/tnsm.2024.3435505
Jorge Pueyo, Daniel Camps-Mur, Miguel Catalan-Cid
{"title":"PHaul: A PPO-Based Forwarding Agent for Sub6 Enhanced Integrated Acess and Backhaul Networks","authors":"Jorge Pueyo, Daniel Camps-Mur, Miguel Catalan-Cid","doi":"10.1109/tnsm.2024.3435505","DOIUrl":"https://doi.org/10.1109/tnsm.2024.3435505","url":null,"abstract":"","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"28 1","pages":""},"PeriodicalIF":5.3,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141870557","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}
{"title":"DPU-Enhanced Multi-Agent Actor-Critic Algorithm for Cross-Domain Resource Scheduling in Computing Power Network","authors":"Shuaichao Wang, Shaoyong Guo, Jiakai Hao, Yinlin Ren, Feng Qi","doi":"10.1109/tnsm.2024.3434997","DOIUrl":"https://doi.org/10.1109/tnsm.2024.3434997","url":null,"abstract":"","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"45 1","pages":""},"PeriodicalIF":5.3,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141870559","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-07-29DOI: 10.1109/TNSM.2024.3435484
Neeraj Sharma;Kalpesh Kapoor
The use of blockchain-based cryptocurrencies has significantly increased over the last ten years; nevertheless, the broader acceptance of these currencies is hindered by scaling challenges. Payment Channel Networks (PCN), which operates as a layer two solution, presents itself as a viable option for augmenting the scalability of a blockchain network. In order to reduce the time and cost associated with the on-chain settlement, users have the option to conduct off-chain transactions through payment channels within their network. The growth of the PCN is expected to be accompanied by a corresponding increase in the number of transactions. However, the current distributed routing algorithms are unable to manage several simultaneous transactions due to deadlocks efficiently. We illustrate the possibility of deadlock in distributed routing algorithms. We prove that routing two transactions in PCN is NP-complete by reducing it from a two-commodity flow problem. In contrast to earlier work that avoided deadlock by exploiting locking or priority queues, our work emphasizes routing algorithms to avoid conditions for deadlock. We enhance the routing choices to minimize the number of saturated links that can cause deadlock. Resource allocation graphs are used to illustrate the necessary and sufficient conditions required for transactions to be in a deadlock. We also show how the dynamic behavior of resources can affect the deadlock situation in future timestamps. The deadlock trilemma and the relation between concurrency, resources, and deadlocks have also been discussed. The experimental evaluation shows that the proposed methodology yields an improvement in transaction count in the Speedy and the Webflow algorithms by 41% and 27%, respectively.
{"title":"Deadlock Prevention in Payment Channel Networks","authors":"Neeraj Sharma;Kalpesh Kapoor","doi":"10.1109/TNSM.2024.3435484","DOIUrl":"10.1109/TNSM.2024.3435484","url":null,"abstract":"The use of blockchain-based cryptocurrencies has significantly increased over the last ten years; nevertheless, the broader acceptance of these currencies is hindered by scaling challenges. Payment Channel Networks (PCN), which operates as a layer two solution, presents itself as a viable option for augmenting the scalability of a blockchain network. In order to reduce the time and cost associated with the on-chain settlement, users have the option to conduct off-chain transactions through payment channels within their network. The growth of the PCN is expected to be accompanied by a corresponding increase in the number of transactions. However, the current distributed routing algorithms are unable to manage several simultaneous transactions due to deadlocks efficiently. We illustrate the possibility of deadlock in distributed routing algorithms. We prove that routing two transactions in PCN is NP-complete by reducing it from a two-commodity flow problem. In contrast to earlier work that avoided deadlock by exploiting locking or priority queues, our work emphasizes routing algorithms to avoid conditions for deadlock. We enhance the routing choices to minimize the number of saturated links that can cause deadlock. Resource allocation graphs are used to illustrate the necessary and sufficient conditions required for transactions to be in a deadlock. We also show how the dynamic behavior of resources can affect the deadlock situation in future timestamps. The deadlock trilemma and the relation between concurrency, resources, and deadlocks have also been discussed. The experimental evaluation shows that the proposed methodology yields an improvement in transaction count in the Speedy and the Webflow algorithms by 41% and 27%, respectively.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 5","pages":"5164-5177"},"PeriodicalIF":4.7,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141870556","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-07-29DOI: 10.1109/TNSM.2024.3434955
Dahina Koulougli;Kim Khoa Nguyen;Mohamed Cheriet
Restoring traffic in multi-layer multi-domain networks (MLMD) can be inefficient and expensive due to the reconfiguration of both intra-domain and inter-domain paths under limited resources and information sharing. This often results in traffic loss and resource over-provisioning within the MLMD, leading to sub-optimal restoration throughput and high costs. In this study, we harness FlexEthernet (FlexE) on inter-domain links to maximize the restoration throughput at minimum cost. FlexE link aggregation is an effective technique to deal with the costly impact of alternative domain rerouting that allows diverting traffic over aggregated links parallel to the failed ones, without disrupting the intra-domain connections. Additionally, FlexE helps increase network reutilization by leveraging time division multiplexing (TDM) to flexibly shift affected traffic to underutilized aggregated links. However, scheduling traffic migration in FlexE is a challenging issue that has not been fully investigated in the literature. In this paper, we initially formulate the FlexE-based traffic restoration problem as a mixed integer non-linear program (MINLP) and then introduce an approximation algorithm to efficiently solve this problem in polynomial time. Furthermore, we propose a supervised learning approach to predict the optimal restoration policy for large-size instances. Experimental results show that our solution restores up to 14% more traffic than a state-of-the-art approach.
{"title":"Optimized FlexEthernet for Inter-Domain Traffic Restoration","authors":"Dahina Koulougli;Kim Khoa Nguyen;Mohamed Cheriet","doi":"10.1109/TNSM.2024.3434955","DOIUrl":"10.1109/TNSM.2024.3434955","url":null,"abstract":"Restoring traffic in multi-layer multi-domain networks (MLMD) can be inefficient and expensive due to the reconfiguration of both intra-domain and inter-domain paths under limited resources and information sharing. This often results in traffic loss and resource over-provisioning within the MLMD, leading to sub-optimal restoration throughput and high costs. In this study, we harness FlexEthernet (FlexE) on inter-domain links to maximize the restoration throughput at minimum cost. FlexE link aggregation is an effective technique to deal with the costly impact of alternative domain rerouting that allows diverting traffic over aggregated links parallel to the failed ones, without disrupting the intra-domain connections. Additionally, FlexE helps increase network reutilization by leveraging time division multiplexing (TDM) to flexibly shift affected traffic to underutilized aggregated links. However, scheduling traffic migration in FlexE is a challenging issue that has not been fully investigated in the literature. In this paper, we initially formulate the FlexE-based traffic restoration problem as a mixed integer non-linear program (MINLP) and then introduce an approximation algorithm to efficiently solve this problem in polynomial time. Furthermore, we propose a supervised learning approach to predict the optimal restoration policy for large-size instances. Experimental results show that our solution restores up to 14% more traffic than a state-of-the-art approach.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 5","pages":"5001-5017"},"PeriodicalIF":4.7,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141870558","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-07-29DOI: 10.1109/TNSM.2024.3435769
Jakob Miserez;Didier Colle;Mario Pickavet;Wouter Tavernier
Next-generation Internet will require strict end-to-end delay guarantees to support upcoming latency-sensitive applications. The IEEE 802.1 Time-Sensitive Networking (TSN) standard has become the de-facto solution for Ethernet-based L2 networks to support applications with strict latency, jitter and packet loss requirements. The IETF DetNet Working Group tries to expand on TSN to support real-time applications over larger-scale L3 networks. This paper proposes control and routing strategies that provide latency guarantees in L3 networks without requiring time synchronization among nodes. The proposed strategies include a link-state routing protocol and several exploration-based protocols that exploit queue-level information and network calculus to provide latency guarantees. Additionally, the use of queueing delay budgets enables independence among flows, while enabling fine-grained routing. This allows to make better routing decisions and to support applications with diverse latency requirements. Moreover, traffic shaping is only required at the network ingress. The strategies are evaluated extensively and compared in a simulation environment in multiple large-scale scenarios, considering acceptance rate, network utilization, path dissemination time, control overhead, and memory consumption, as well as how these metrics evolve w.r.t. different network scales. Experimental results demonstrate that representative delay-constrained traffic demands can be accommodated adequately by queue-level link-state routing protocols only in smaller-scale networks. In larger-scale network scenarios, breadth-first exploration-based protocols are required to provide stable performance w.r.t. acceptance rate and path dissemination times at the cost of only linearly increasing control overhead and memory footprint.
{"title":"Exploiting Queue Information for Scalable Delay-Constrained Routing in Deterministic Networks","authors":"Jakob Miserez;Didier Colle;Mario Pickavet;Wouter Tavernier","doi":"10.1109/TNSM.2024.3435769","DOIUrl":"10.1109/TNSM.2024.3435769","url":null,"abstract":"Next-generation Internet will require strict end-to-end delay guarantees to support upcoming latency-sensitive applications. The IEEE 802.1 Time-Sensitive Networking (TSN) standard has become the de-facto solution for Ethernet-based L2 networks to support applications with strict latency, jitter and packet loss requirements. The IETF DetNet Working Group tries to expand on TSN to support real-time applications over larger-scale L3 networks. This paper proposes control and routing strategies that provide latency guarantees in L3 networks without requiring time synchronization among nodes. The proposed strategies include a link-state routing protocol and several exploration-based protocols that exploit queue-level information and network calculus to provide latency guarantees. Additionally, the use of queueing delay budgets enables independence among flows, while enabling fine-grained routing. This allows to make better routing decisions and to support applications with diverse latency requirements. Moreover, traffic shaping is only required at the network ingress. The strategies are evaluated extensively and compared in a simulation environment in multiple large-scale scenarios, considering acceptance rate, network utilization, path dissemination time, control overhead, and memory consumption, as well as how these metrics evolve w.r.t. different network scales. Experimental results demonstrate that representative delay-constrained traffic demands can be accommodated adequately by queue-level link-state routing protocols only in smaller-scale networks. In larger-scale network scenarios, breadth-first exploration-based protocols are required to provide stable performance w.r.t. acceptance rate and path dissemination times at the cost of only linearly increasing control overhead and memory footprint.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 5","pages":"5260-5272"},"PeriodicalIF":4.7,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10614378","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141873177","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-07-26DOI: 10.1109/tnsm.2024.3434457
Nidhi Sharma, Krishan Kumar
{"title":"A Novel Latency Aware Resource Allocation and Offloading Strategy With Improved Prioritization and DDQN for Edge-Enabled UDNs","authors":"Nidhi Sharma, Krishan Kumar","doi":"10.1109/tnsm.2024.3434457","DOIUrl":"https://doi.org/10.1109/tnsm.2024.3434457","url":null,"abstract":"","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"70 1","pages":""},"PeriodicalIF":5.3,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141779624","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-07-26DOI: 10.1109/tnsm.2024.3434328
Forough Shahab Samani, Rolf Stadler
{"title":"A Framework for Dynamically Meeting Performance Objectives on a Service Mesh","authors":"Forough Shahab Samani, Rolf Stadler","doi":"10.1109/tnsm.2024.3434328","DOIUrl":"https://doi.org/10.1109/tnsm.2024.3434328","url":null,"abstract":"","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"45 1","pages":""},"PeriodicalIF":5.3,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141779625","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
扫码关注我们
求助内容：
应助结果提醒方式：