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

DRL-Based Time-Varying Workload Scheduling With Priority and Resource Awareness 基于drl的具有优先级和资源感知的时变工作负载调度

IF 4.7 2区计算机科学

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

Qifeng Liu;Qilin Fan;Xu Zhang;Xiuhua Li;Kai Wang;Qingyu Xiong

引用次数: 0

ArchSentry: Enhanced Android Malware Detection via Hierarchical Semantic Extraction ArchSentry：通过分层语义提取增强Android恶意软件检测

IF 4.7 2区计算机科学

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

Tianbo Wang;Mengyao Liu;Huacheng Li;Lei Zhao;Changnan Jiang;Chunhe Xia;Baojiang Cui

{"title":"ArchSentry: Enhanced Android Malware Detection via Hierarchical Semantic Extraction","authors":"Tianbo Wang;Mengyao Liu;Huacheng Li;Lei Zhao;Changnan Jiang;Chunhe Xia;Baojiang Cui","doi":"10.1109/TNSM.2025.3559255","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3559255","url":null,"abstract":"Android malware poses a significant challenge for mobile platforms. To evade detection, contemporary malware variants use API substitution or obfuscation techniques to hide malicious activities and mask their shallow semantic characteristics. However, existing research lacks analysis of the hierarchical semantic associated with Android apps. To address this problem, we propose ArchSentry, an enhanced Android malware detection via hierarchical semantic extraction. First, we select entities and their relationships relevant to Android software behavior through the software architecture and represent them using a heterogeneous graph. Then, we structure meta-paths to represent rich semantic information to achieve semantic enhancement and improve efficiency. Next, we design a meta-path semantic selection method based on KL Divergence to identify and eliminate redundant features. To achieve a comprehensive representation of the overall software semantics and improve performance, we construct a feature fusion approach based on Restricted Boltzmann Machines (RBM) and AutoEncoder (AE) during the pre-training phase, while preserving the probability distribution characteristics of various meta-paths. Finally, Deep Neural Networks (DNN) process fusion features for comprehensive feature sets. Experimental results on real-world application samples indicate that ArchSentry achieves a remarkable 99.2% detection rate for Android malware, with a low false positive rate below 1%. These results surpass the performance of current state-of-the-art approaches.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2822-2837"},"PeriodicalIF":4.7,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144229457","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

Joint Controller Placement and TDMA Scheduling in Software Defined Wireless Multihop Networks 软件定义无线多跳网络中的联合控制器布置与TDMA调度

IF 4.7 2区计算机科学

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

Yiannis Papageorgiou;Merkouris Karaliopoulos;Kostas Choumas;Iordanis Koutsopoulos

{"title":"Joint Controller Placement and TDMA Scheduling in Software Defined Wireless Multihop Networks","authors":"Yiannis Papageorgiou;Merkouris Karaliopoulos;Kostas Choumas;Iordanis Koutsopoulos","doi":"10.1109/TNSM.2025.3559104","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3559104","url":null,"abstract":"We study TDMA-scheduled Software Defined Wireless Multihop Networks (SDWMNs), whereby the data traffic and SDN control messages share the same network links and TDMA resources. Since the topology of WMNs dynamically changes, maintaining a responsive SDN plane is essential for meeting data traffic rate requirements. Placing more SDN controllers reduces communication delays at the SDN layer and increases its responsiveness. However, it demands more TDMA resources and reduces the available ones for data traffic. We analyze this trade-off between data traffic performance and SDN layer responsiveness by delving into two distinct resource allocation mechanisms in the WMN, the SDN controller placement and TDMA scheduling. We capture their interaction into an optimization problem formulation, which aims at maximizing the SDN-responsiveness subject to data traffic rate requirements, topology conditions, and the available TDMA resources. We propose a novel heuristic for the hard-to-solve problem that leverages the network state information gathered at the SDN layer. We find that our heuristic can increase the SDN-responsiveness by 44% when varying the rate reserved for rate-elastic data traffic within 40% of what is nominally requested. The heuristic is modular in accommodating different controller placement algorithms and robust to different alternative for the SDN software implementation.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2807-2821"},"PeriodicalIF":4.7,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232191","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

Bandwidth Efficient Cache Selection and Cache-Content Advertisement 带宽高效缓存选择和缓存内容发布

IF 4.7 2区计算机科学

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

Itamar Cohen

{"title":"Bandwidth Efficient Cache Selection and Cache-Content Advertisement","authors":"Itamar Cohen","doi":"10.1109/TNSM.2025.3558835","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3558835","url":null,"abstract":"Caching is extensively used in various networking environments to optimize performance by reducing latency, bandwidth, and energy consumption. To optimize performance, caches often advertise their content using indicators, which are data structures that trade space efficiency for accuracy. However, this tradeoff introduces the risk of false indications. Existing solutions for cache content advertisement and cache selection often lead to inefficiencies, failing to adapt to dynamic network conditions. This paper introduces SALSA2, a Scalable Adaptive and Learning-based Selection and Advertisement Algorithm, which addresses these limitations through a dynamic and adaptive approach. SALSA2 accurately estimates mis-indication probabilities by considering inter-cache dependencies and dynamically adjusts the size and frequency of indicator advertisements to minimize transmission overhead while maintaining high accuracy. Our extensive simulation study, conducted using a variety of real-world cache traces, demonstrates that SALSA2 achieves up to 84% bandwidth savings compared to the state-of-the-art solution and close-to-optimal service cost in most scenarios. These results highlight SALSA2’s effectiveness in enhancing cache management, making it a robust and versatile solution for modern networking challenges.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2795-2806"},"PeriodicalIF":4.7,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232100","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

QoE-Aware Joint Visual and Haptic Signal Transmission With Adaptive Data Compression for Immersive Interactions in Human Digital Twin 基于自适应数据压缩的qoe感知关节视觉和触觉信号传输，用于数字孪生体沉浸式交互

IF 4.7 2区计算机科学

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

Kun Wu;Jiayuan Chen;Lucheng Chen;Zili Liu;Changyan Yi;Shuai Xu;Junyi Wang;Jiawen Kang

{"title":"QoE-Aware Joint Visual and Haptic Signal Transmission With Adaptive Data Compression for Immersive Interactions in Human Digital Twin","authors":"Kun Wu;Jiayuan Chen;Lucheng Chen;Zili Liu;Changyan Yi;Shuai Xu;Junyi Wang;Jiawen Kang","doi":"10.1109/TNSM.2025.3558358","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3558358","url":null,"abstract":"Human digital twin (HDT) is envisioned as a system interconnecting physical twins (PTs) in the real world with virtual twins (VTs) in the digital world, enabling advanced human-centric applications. Unlike optimizing the quality of experience (QoE) of users in single-modal signal transmission for conventional services, users’ QoE in multi-modal signal transmission required by HDT is difficult to guarantee. To tackle this, we study an optimization of QoE in multi-modal transmission, focusing on joint visual and haptic signal feedback transmissions from VT to its PT, for providing immersive interactions in HDT. To evaluate a synthesized performance of visual and haptic experiences, we design a comprehensive QoE model, taking into account video quality, continuous video quality switching rate and average haptic feedback error. Then, to maximize QoE with a guarantee on synchronization between visual and haptic signal transmissions, we dynamically optimize bandwidth allocation, bitrate and rendering mode of the video, and haptic signal’s compression threshold. To this end, we propose a deep reinforcement learning based algorithm, called VisHap. Furthermore, we build an HDT multi-modal interaction platform for collecting an authentic dataset, and by using it, we conduct experiments, showing that VisHap is not only feasible but also outperforms the counterparts.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2780-2794"},"PeriodicalIF":4.7,"publicationDate":"2025-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144229555","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

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