IEEE Transactions on Network and Service Management最新文献_第2页

Revokable Blockchain-Enabled Ranked Multi-Keyword Attribute-Based Searchable Encryption Scheme With Mobile Edge Computing for Vehicular 基于移动边缘计算的可撤销的基于区块链的排名多关键字属性可搜索加密方案

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2025-04-02 DOI: 10.1109/TNSM.2025.3557262

Ruiwei Hou;Fucai Zhou;Qiang Wang;Zi Jiao;Jintong Sun;Zongye Zhang

{"title":"Revokable Blockchain-Enabled Ranked Multi-Keyword Attribute-Based Searchable Encryption Scheme With Mobile Edge Computing for Vehicular","authors":"Ruiwei Hou;Fucai Zhou;Qiang Wang;Zi Jiao;Jintong Sun;Zongye Zhang","doi":"10.1109/TNSM.2025.3557262","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3557262","url":null,"abstract":"The Internet of Vehicles (IoV) faces critical challenges in balancing real-time data processing, privacy preservation, and secure data sharing amid growing intelligent transportation demands. While mobile edge computing (MEC) reduces latency by offloading tasks to MEC servers, efficient encrypted search and dynamic access control remain unresolved. Attribute-based keyword search (ABKS) enables privacy-preserving queries on encrypted data but exhibits critical limitations such as lack of revocable access for dynamic user privileges, exposed access policy that risk sensitive attribute leakage, and data integrity verification. Moreover, existing ABKS schemes further suffer from centralized key management in attribute-based encryption (ABE), introducing single points of failure and key escrow issues. To address these issues, we propose BC-RMABSE, a blockchain-enabled ABKS scheme. Our scheme leverages the vector space model to enable ranked multi-keyword searches, returning top-k relevant results for improved efficiency. Policy-hiding mechanisms and attribute revocation ensure flexible fine-grained access control while safeguarding sensitive attributes. A decentralized key distribution strategy using Pedersen’s (k, n) secret sharing protocol eliminates reliance on central authority, mitigating security risks. Blockchain technology enforces data integrity through tamper-proof consensus and resolves the “service-payment” imbalance via smart contracts, ensuring transactional fairness between users and untrusted service providers. Experimental analysis indicates that our scheme performs well in terms of both security and search efficiency.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2764-2779"},"PeriodicalIF":4.7,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232007","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}

引用次数: 0

Robust Resource Sharing in Network Slicing via Hypothesis Testing 基于假设检验的网络切片鲁棒资源共享

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2025-04-01 DOI: 10.1109/TNSM.2025.3556752

Panagiotis Nikolaidis;John Baras

{"title":"Robust Resource Sharing in Network Slicing via Hypothesis Testing","authors":"Panagiotis Nikolaidis;John Baras","doi":"10.1109/TNSM.2025.3556752","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3556752","url":null,"abstract":"In network slicing, the network operator needs to satisfy the service level agreements of multiple slices at the same time and on the same physical infrastructure. To do so with reduced provisioned resources, the operator may consider resource sharing mechanisms. However, each slice then becomes susceptible to traffic surges in other slices which degrades performance isolation. To maintain both high efficiency and high isolation, we propose the introduction of hypothesis testing in resource sharing. Our approach comprises two phases. In the trial phase, the operator obtains a stochastic model for each slice that describes its normal behavior, provisions resources and then signs the service level agreements. In the regular phase, whenever there is resource contention, hypothesis testing is conducted to check which slices follow their normal behavior. Slices that fail the test are excluded from resource sharing to protect the well-behaved ones. We test our approach on a mobile traffic dataset. Results show that our approach fortifies the service level agreements against unexpected traffic patterns and achieves high efficiency via resource sharing. Overall, our approach provides an appealing tradeoff between efficiency and isolation.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2731-2746"},"PeriodicalIF":4.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232156","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}

引用次数: 0

Classification-Model Applied to Routing Problem in Flexible-Grid Optical Networks 分类模型在柔性网格光网络路由问题中的应用

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2025-04-01 DOI: 10.1109/TNSM.2025.3556770

André V. S. Xavier;Raul C. Almeida;Leonardo Didier Coelho;Joaquim Ferreira Martins-Filho

{"title":"Classification-Model Applied to Routing Problem in Flexible-Grid Optical Networks","authors":"André V. S. Xavier;Raul C. Almeida;Leonardo Didier Coelho;Joaquim Ferreira Martins-Filho","doi":"10.1109/TNSM.2025.3556770","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3556770","url":null,"abstract":"In recent years, machine learning algorithms have been widely used in optical networks to solve complex problems such as routing, resource allocation, among others. In routing, modulation and spectrum allocation (RMSA) problems, machine learning algorithms can be used to learn patterns in historical data and find good solutions without having to explore all existing solutions. In this paper, we propose an algorithm based on a classification model to solve the routing problem in elastic optical networks. This algorithm predicts the route according to the call request information and the state of the network links. The dataset used to train the proposal is obtained through a dynamic routing algorithm. With this dataset, two versions of the proposal are evaluated with different sets of routes according to the frequency distribution of these routes. Three network topologies are used to evaluate the routing algorithms: six-node, NSFNET and European optical network. The results are compared with two other routing algorithms: Yen’s algorithm (k shortest routes) and the spectrum continuity based shortest path (SCSP) algorithm. This last algorithm is used to train our proposal. Our proposal outperformed the Yen’s algorithm in the three network topologies in terms of blocking probability. When compared to the SCSP algorithm, our proposal obtained an average performance gain of 15% and 25% in the six-node and NSFNET network topologies, respectively. In the European network topology, our proposal achieved an average performance gain at the lowest network loads of 23.19%. In all network topologies considered, our proposal reduced the time spent to find the RMSA solution compared to the SCSP algorithm.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2747-2763"},"PeriodicalIF":4.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10947194","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232157","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}

引用次数: 0

Resource Allocation for Underwater Acoustic Sensor Networks With Partial Spectrum Sharing: When Optimization Meets Deep Reinforcement Learning 部分频谱共享的水声传感器网络资源分配：当优化满足深度强化学习时

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2025-04-01 DOI: 10.1109/TNSM.2025.3556498

Rui Tang;Ruizhi Zhang;Yongjun Xu;Chuan Liu;Chongwen Huang;Chau Yuen

{"title":"Resource Allocation for Underwater Acoustic Sensor Networks With Partial Spectrum Sharing: When Optimization Meets Deep Reinforcement Learning","authors":"Rui Tang;Ruizhi Zhang;Yongjun Xu;Chuan Liu;Chongwen Huang;Chau Yuen","doi":"10.1109/TNSM.2025.3556498","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3556498","url":null,"abstract":"To utilize the limited acoustic spectrum while combating the harsh underwater propagation, we incorporate partial spectrum sharing into an underwater acoustic sensor network and aim to maximize the minimum data collection rate among all underwater sensor nodes through joint power allocation and spectrum assignment. To cope with the non-convex optimization problem, we propose a Hybrid Model-based and Data-based Resource Allocation (HMDRA) scheme: 1) Under any given spectrum assignment strategy, we analyze the impact of the partial spectrum sharing and imperfect successive interference cancellation on baseband signal processing, and formulate a power allocation problem that is solved by the bisection method and Lagrange dual theory. 2) Based on the optimal power allocation strategy, the gradient-free genetic algorithm (GA) is first adopted to approach the optimal solution of the model-less spectrum assignment problem by nearly enumerating the solution space. To reduce complexity, we further propose a deep reinforcement learning (DRL)-based algorithm and obtain an efficient solution by traversing a deep neural network-based policy learned from the training stage. Simulation results show that compared with the GA-based algorithm, the average execution time of the DRL-based algorithm is substantially reduced by 5 orders of magnitude to 0.7076 seconds at the cost of approximately 6 percent performance loss.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2715-2730"},"PeriodicalIF":4.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144231996","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}

引用次数: 0

BECHAIN: A Sharding Blockchain With Higher Security BECHAIN：更高安全性的分片区块链

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2025-03-31 DOI: 10.1109/TNSM.2025.3556456

Xiaochang Guo;Gang Liu;Haoyan Ling;Lei Meng;Tao Wang

{"title":"BECHAIN: A Sharding Blockchain With Higher Security","authors":"Xiaochang Guo;Gang Liu;Haoyan Ling;Lei Meng;Tao Wang","doi":"10.1109/TNSM.2025.3556456","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3556456","url":null,"abstract":"Sharding technology achieves parallel processing of transactions by dividing the network into multiple independent parts, namely shards, significantly increasing the throughput of the blockchain system and reducing transaction processing latency, thereby improving its scalability. Although sharding technology enhances blockchain performance, it also introduces new security challenges, as an individual shard is more vulnerable to attacks compared to the entire network, potentially compromising its consensus reliability. To address these challenges, we propose BECHAIN: a sharding blockchain system with excellent Byzantine node tolerance. It incorporates a series of effective security measures, such as improved node allocation methods, enhanced inter-shard collaborative defense mechanisms, and refined malicious node monitoring strategies, to bolster the blockchain system’s defense against malicious nodes. Key measures include random node allocation, a node reputation scoring model, consensus supervision chain, and shard reconfiguration. Simulation results show that BECHAIN achieves linear scalability and enhances system security by increasing the consensus success rate.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2702-2714"},"PeriodicalIF":4.7,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144231976","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}

引用次数: 0

Augmentation and Fusion: Multi-Feature Fusion-Based Self-Supervised Learning Approach for Traffic Tables 增强与融合：基于多特征融合的交通表自监督学习方法

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2025-03-28 DOI: 10.1109/TNSM.2025.3554824

Xuan Zheng;Xiuli Ma;Lifu Xu;Yanliang Jin;Chun Ke

{"title":"Augmentation and Fusion: Multi-Feature Fusion-Based Self-Supervised Learning Approach for Traffic Tables","authors":"Xuan Zheng;Xiuli Ma;Lifu Xu;Yanliang Jin;Chun Ke","doi":"10.1109/TNSM.2025.3554824","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3554824","url":null,"abstract":"As modern networks face increasing demands for superior service and management, Encrypted Traffic Classification (ETC) technology has become increasingly crucial. Considering that traffic data is easy to collect but hard to label, self-supervised ETC methods have attracted more and more attention. Compared to popular methods based on traffic images and text, traffic tables are simple to construct and more suitable for the flow-packet structure. However, existing methods have two problems: (1) The lack of data augmentation methods for tables weakens the performance of self-supervised learning. (2) Most methods only focus on single feature and cannot make full use of distinct features of traffic tables, such as temporal feature. To solve these problems, we propose a multi-feature fusion method based self-supervised learning approach for traffic tables. A new data augmentation method called Random Subsets Selection (RSS) is introduced alongside an effective fusion approach. In this way, temporal features can be successfully extracted and concatenated with the latent representations of input traffic tables. Experimental results from two open datasets and one self-collected dataset have shown that on imbalanced datasets, our method can effectively solve ETC problems even with a small number of labeled data. Empirically, both classification performance and processing speed are improved. Specifically, compared to the state-of-the-art tabular self-supervised learning method, our method achieves the better classification results on all datasets while the processing speed increases by almost two times, from 1.83 tables per second to 3.76 tables per second.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2647-2662"},"PeriodicalIF":4.7,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232151","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}

引用次数: 0

Distributed Server Allocation for Internet-of-Things Monitoring Services With Preventive Start-Time Optimization Against Server Failure 针对服务器故障进行预防性启动时间优化的物联网监控服务的分布式服务器分配

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2025-03-27 DOI: 10.1109/TNSM.2025.3555277

Shoya Imanaka;Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki

{"title":"Distributed Server Allocation for Internet-of-Things Monitoring Services With Preventive Start-Time Optimization Against Server Failure","authors":"Shoya Imanaka;Akio Kawabata;Bijoy Chand Chatterjee;Eiji Oki","doi":"10.1109/TNSM.2025.3555277","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3555277","url":null,"abstract":"Internet-of-Things (IoT) services require high performance regarding low delay and fault tolerance. Distributed server allocation is well-suited for meeting these requirements in IoT monitoring services. Previous work focused on reducing delay but overlooked the need for fault tolerance in distributed server allocation. This paper proposes a distributed server allocation model based on preventive start-time optimization (PSO) for IoT monitoring services against server failure. The proposed model preventively determines the server allocation to minimize the largest maximum delay between IoT devices and application servers and between database and application servers among all failure patterns. We formulate the proposed model as an integer linear programming (ILP) problem. We introduce a server allocation algorithm based on PSO to accelerate the computation to obtain an optimal server allocation, compared to the ILP approach. We prove that the introduced algorithm obtains a PSO-based optimal allocation in polynomial time. Numerical results show that the introduced algorithm outputs an optimal server allocation faster than the ILP approach. We compare the PSO-based server allocation with allocations based on the start-time and run-time optimization. We observe that the PSO-based allocation reduces the largest maximum delay by 5.5% for a network model with eleven servers compared to the start-time optimization and avoids unnecessary network disconnections while increasing the maximum delay by 5.1% compared to the run-time optimization.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2679-2701"},"PeriodicalIF":4.7,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10943239","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144231994","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}

引用次数: 0

Challenges in Securing UAV IoT Framework: Future Research Perspective 保障无人机物联网框架的挑战：未来研究展望

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2025-03-27 DOI: 10.1109/TNSM.2025.3554354

Abdullah Aljumah;Tariq Ahamed Ahanger;Imdad Ullah

{"title":"Challenges in Securing UAV IoT Framework: Future Research Perspective","authors":"Abdullah Aljumah;Tariq Ahamed Ahanger;Imdad Ullah","doi":"10.1109/TNSM.2025.3554354","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3554354","url":null,"abstract":"Unmanned Aerial Vehicles (UAVs) offer the immense capability for allowing novel applications in a variety of domains including security, military, surveillance, medicine, and traffic monitoring. The prevalence of UAV systems is due to the collaboration and accomplishment of tasks efficiently and effectively. UAVs embedded with camcorders, GPS receivers, and wireless sensors propose enormous promise in realizing the Internet of Things (IoT) service delivery in vast domains. It results in establishing an airborne field of the IoT when empowered with communication protocols of LTE, 4G, and 5G/6G networks. However, numerous difficulties must be addressed before UAVs may be used effectively namely privacy, security, and administration. Conspicuously, in the current article, novel UAV-specific domains enabled by IoT and 5G/6G technology are explored. Moreover, the presented technique assesses sensor requirements and provides an overview of fleet management systems that address aerial networking, privacy, and security concerns. Furthermore, a framework based on the IoT-5G/6G aspect is proposed which can be deployed over UAVs. Finally, in a heterogeneous computational platform, the proposed framework provides a complete IoT architecture that enables secure UAVs.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2607-2629"},"PeriodicalIF":4.7,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232174","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}

引用次数: 0

Unveiling Real-Time Stalling Detection for Video Streaming Traffic 揭示实时延迟检测视频流流量

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2025-03-26 DOI: 10.1109/TNSM.2025.3554822

Ximin Li;Xiaodong Xu;Guo Wei;Xiaowei Qin

{"title":"Unveiling Real-Time Stalling Detection for Video Streaming Traffic","authors":"Ximin Li;Xiaodong Xu;Guo Wei;Xiaowei Qin","doi":"10.1109/TNSM.2025.3554822","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3554822","url":null,"abstract":"In the rapidly evolving field of video traffic, ensuring a smooth video streaming experience for users is critical for network operators. Accurately and promptly detecting stalling events, a significant indicator of poor quality of experience, remains challenging due to varying detection time resolutions in existing techniques, which often detect stalls every video chunk, or every five or ten seconds. This paper makes three key contributions. First, we introduce the concept of detection granularities to enable fair performance comparisons and reveal their impact on detection performance from the data sampling perspective. Second, we propose a novel feature extraction approach that captures both packet-level and chunk-level features in a unified sequential manner to effectively detect stalling events. Third, a novel sample reweighting method is proposed to address the detection timeliness problem by focusing more on difficult samples around stalling starting or ending. Experimental results on both video-on-demand and live streaming traces demonstrate that our feature extraction approach achieves an average improvement of 5.3% in f1-score, 4.7% in coverage rate, and reduces stalling response time by 0.4 seconds compared to existing techniques. Additionally, the sample reweighting method further improves the detection sensitivity without compromising f1-scores for all detection techniques.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2630-2646"},"PeriodicalIF":4.7,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144231995","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}

引用次数: 0

CRP: A Cluster-Based Routing Protocol for Lightweight Nodes in Payment Channel Networks CRP：支付通道网络中基于集群的轻量级节点路由协议

IF 4.7 2区计算机科学

IEEE Transactions on Network and Service Management Pub Date : 2025-03-26 DOI: 10.1109/TNSM.2025.3555174

Jinghui Chen;Qingqing Cai;Gang Sun;Hongfang Yu;Dusit Niyato

{"title":"CRP: A Cluster-Based Routing Protocol for Lightweight Nodes in Payment Channel Networks","authors":"Jinghui Chen;Qingqing Cai;Gang Sun;Hongfang Yu;Dusit Niyato","doi":"10.1109/TNSM.2025.3555174","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3555174","url":null,"abstract":"Although blockchain empowers the IoT trading market and presents new development opportunities for IoT, scalability issues of blockchain limit its application in this area. Payment Channel Networks (PCNs) have emerged as a promising solution to address the scalability issues. With the help of routing protocols, two users can utilize payment channels to conduct off-chain transactions. However, most Payment Channel Network (PCN) routing protocols overlook the scalability of PCNs, resulting in substantial storage, communication, and computational overhead for lightweight nodes, such as IoT devices. Additionally, frequent utilization of a payment channel can quickly exhaust the channel’s balance, leading to congestion and causing subsequent payments to fail. Channel congestion restricts the throughput of PCNs, yet most PCN routing protocols lack designs for channel congestion control. In this paper, we propose a Cluster-based scalable and high-throughput Routing Protocol (CRP), to enhance the scalability and throughput of PCNs. CRP organizes PCNs into clusters to reduce the average routing table size, thereby alleviating users’ storage, communication, and computational overhead. Furthermore, CRP aims to minimize maximum channel congestion when selecting payment routes, thereby improving throughput. Extensive simulations demonstrate that CRP achieves high scalability and throughput compared to state-of-the-art PCN routing protocols.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2663-2678"},"PeriodicalIF":4.7,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232102","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}

引用次数: 0