IEEE Transactions on Network and Service Management最新文献

{"title":"Domain Tailored Large Language Models for Log Mask Prediction in Cellular Network Diagnostics","authors":"Sayed Taheri;Achintha Ihalage;Prateek Mishra;Sean Coaker;Faris Muhammad;Hamed Al-Raweshidy","doi":"10.1109/TNSM.2025.3541384","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3541384","url":null,"abstract":"Software logs generated by dedicated network testing hardware are often complex and bear minimal similarity to natural language, requiring the expertise of engineers to understand and capture defects recorded in these logs. This manual process is inefficient and expensive for both service providers and their clients. In this study, we demonstrate the transformative potential of Artificial Intelligence (AI), specifically through domain-tailoring of Large Language Models (LLMs) like RoBERTa, BigBird, and Flan-T5, to streamline the process of defect diagnostics. Particularly, we pre-train these models ground up on a real industrial telecommunications log corpus, and perform finetuning on a multi-label classification objective. This facilitates identifying a correct set of log points to be enabled for rapid detection of defects that arise during network testing. Despite encountering several challenges such as intricate text structures, heavily skewed label distribution, and inconsistencies in historical data labelling, our tailored LLMs achieve commendable performance on previously unseen defect cases, significantly reducing the turnaround times. This research not only serves as an exemplar for adapting LLMs in telecommunications industry for automated defect diagnostics, but also has wide implications for software log analysis across various industries.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2370-2381"},"PeriodicalIF":4.7,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232146","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":"IAR-AKA: An Efficient Authentication Scheme for Healthcare Tactile Internet Beyond Conventional Security","authors":"Xin Yang;Yimin Guo","doi":"10.1109/TNSM.2025.3542796","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3542796","url":null,"abstract":"With the rapid advancement of 5G technology, the tactile Internet is emerging as a novel paradigm of interaction, particularly in fields like healthcare, where stringent demands for real-time and precise performance are prevalent. During the transmission and storage of medical data, malicious adversaries may attempt to compromise sensitive patient information or even disrupt the normal operation of medical devices, posing a threat to patient safety. Many existing authentication schemes claim and prove to resist various known attacks. However, subsequent research has uncovered security vulnerabilities in these schemes, primarily due to their oversight of implicit attacks, which stem from different combinations or inferences of known attacks. In this context, the design of a lightweight authentication scheme that is secure against implicit attacks becomes crucial. This paper proposes IAR-AKA, an authentication scheme for the healthcare tactile Internet environment that surpasses conventional security. We conduct formal security proofs based on session key security and its corresponding implicit attacks, and also perform non-formal security analysis based on the relationship between implicit attacks and security goals. The output of AVISPA tool indicates IAR-AKA is secure. Furthermore, detailed performance analysis results indicate that IAR-AKA not only possesses more security attributes against implicit attacks compared to similar solutions in comparable contexts but also exhibits lower communication and computation costs.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2396-2411"},"PeriodicalIF":4.7,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232152","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":"Minimizing Data Collection Latency for Coexisting Time-Critical Wireless Networks With Tree Topologies","authors":"Jialin Zhang;Wei Liang;Bo Yang;Huaguang Shi;Ying-Chang Liang","doi":"10.1109/TNSM.2025.3541245","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3541245","url":null,"abstract":"Time-Critical Wireless Network (TCWN) is a promising communication technology that can satisfy the low latency, high reliability, and deterministic requirements of mission-critical applications. Multiple TCWNs required by various applications inevitably coexist with each other. Most existing works aim to achieve acceptable latency or consider the simplest topology (i.e., line topology). As latency requirements become more stringent, exploring the minimum data collection latency becomes an interesting problem. In this paper, the coexisting system consists of multiple tree-topology-based TCWNs. We first establish a conversion framework to convert an arbitrary tree topology into multiple analogous line topologies to reduce the analysis complexity. We then propose a Time-Critical wireless network Scheduling (TCS) algorithm to minimize the data collection latency of coexisting TCWNs. The TCS algorithm consists of two phases. In the internetwork scheduling phase, we strictly derive a general expression to characterize the practical network requirements. In the intranetwork scheduling phase, we design two levels of priority assignment algorithms to accurately characterize the critical states and resource requirements of different nodes. We conduct extensive simulations to verify the effectiveness of the TCS algorithm. The evaluation results show that the TCS algorithm can achieve minimum data collection latency in more than 99.956% cases, and the maximum difference compared to the optimal value is one time slot.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2354-2369"},"PeriodicalIF":4.7,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232193","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":"GSA-DT: A Malicious Traffic Detection Model Based on Graph Self-Attention Network and Decision Tree","authors":"Saihua Cai;Han Tang;Jinfu Chen;Tianxiang Lv;Wenjun Zhao;Chunlei Huang","doi":"10.1109/TNSM.2025.3531885","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3531885","url":null,"abstract":"Malicious attack has shown a rapid growth in recent years, it is very important to accurately detect malicious traffic to defend against malicious attacks. Compared with machine learning and deep learning technologies, <underline>g</u>raph <underline>c</u>onvolutional neural <underline>n</u>etwork (GCN) achieves better detection results of malicious traffic due to additional consideration of the correlation between network traffic features. However, existing GCN-based detection models suffer from fixed weight assignment, only focusing on local features, lack the ability to model graph structure and relationships as well as having gradient disappearance. To solve these problems, this paper proposes the GSA-DT model based on <underline>g</u>raph <underline>s</u>elf-<underline>a</u>ttention network and <underline>d</u>ecision <underline>t</u>ree. GSA-DT first preprocesses the original network traffic to obtain better traffic features and labels, and then uses GCN to extract the topological structure of network traffic as well as capture the correlation relationships among traffic features, where the ReLU activation function is replaced by LeakyReLU to overcome the problems of neuron “death” and gradient disappearance during the training process; It also introduces the self-attention mechanism into GCN to assign larger weights to the key features to reduce the interference of redundant features. Finally, GSA-DT uses decision tree to perform the detection of malicious traffic. Experimental results on four network traffic datasets show that GSA-DT model improves the detection accuracy over 1% on average than seven advanced malicious traffic detection models, and it also performs better in F1-measure, TPR, FPR as well as stability.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"2059-2073"},"PeriodicalIF":4.7,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143860843","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":"DLAZE: Detecting DNS Tunnels Using Lightweight and Accurate Method for Zero-Day Exploits","authors":"Neha Sharma;Mayank Swarnkar;Divyanshu","doi":"10.1109/TNSM.2025.3541234","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3541234","url":null,"abstract":"Domain Name System (DNS) protocol is highly targeted nowadays for creating tunnels and extracting information from the intended machines. The reason for such exploitation is that DNS is passed unchecked by most firewalls and Intrusion Detection Systems (IDSs) to maintain the network’s quality of service. Most detection methods utilize the signatures of tunneled queries and tools for DNS tunnel detection. However, the new or updated tool versions bypass these signature-based methods. Moreover, DNS generally comprises a significant portion of total network traffic with a skewed distribution of legitimate DNS traffic against DNS tunnels. Thus, checking each DNS packet against signatures is a bottleneck to the efficiency of the network. To resolve this problem, we propose DLAZE, which can efficiently detect known and unknown DNS tunnels in the network traffic without compromising the efficiency of the network. DLAZE consists of a three-layer system. The first layer utilizes our already proposed work OptiTuneD, which filters out nearly all legitimate DNS packets with linear time complexity and solves the problem of the skewed distribution of legitimate vs tunneled DNS. The remaining packets are passed to the second layer, which uses the Bidirectional Encoder Representations from Transformers (BERT) model to identify legitimate DNS packets that remained unidentified at the first layer with the quadratic time complexity. The third layer obtains only unknown or zero-day DNS packets that can be legitimate or tunnels, which are differentiated using the Probing method with constant time complexity. We tested DLAZE using three publicly available datasets. The experimental results show that the average recall, precision, and F1-score obtained on all three datasets are 98.74%, 97.46%, and 97.95%, respectively, with the average processing time for each DNS packet as 473.25 milliseconds.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2343-2353"},"PeriodicalIF":4.7,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232154","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":"Zero-Determinant Incentive Strategy for Transaction Trading in Blockchain System","authors":"Liang Feng;Cunqing Hua;Jianan Hong","doi":"10.1109/TNSM.2025.3540036","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3540036","url":null,"abstract":"Blockchain has been widely applied in many industries to provide secure and reliable services, in which the activities of the participating nodes are recorded as transactions. Although the original design assumes nodes disseminate the transactions voluntarily, they may be reluctant to provide transactions for others due to the lack of cooperative incentives. To fill the gap, we study the transaction collecting process in the blockchain system under the leader-based consensus protocol. Specifically, we design an incentive scheme to reward the followers if they provide unique transactions to the leader. Considering the selfish nature of different nodes, we model the transaction trading process between nodes as an Iterated Prisoner’s Dilemma (IPD), and a modified zero-determinant (ZD) strategy is proposed such that the follower could correlate the leader’s payoff with the leader’s cooperation probability. We theoretically prove the effectiveness of our proposed algorithm. Simulation results show the leader’s payoff changes under the follower’s different control functions. The proposed scheme can regulate the behavior of blockchain nodes during the transaction trading process.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2311-2322"},"PeriodicalIF":4.7,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144229469","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":"A Decentralized Oracle Network Constructed From Weighted Schnorr Multisignature","authors":"Zhiwei Wang","doi":"10.1109/TNSM.2025.3539615","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3539615","url":null,"abstract":"A decentralized oracle network is a good solution for blockchain interoperability, and a multisignature is a proper cryptographic primitive for off-chain aggregation where each participating signer’s public key can be identified during verification. An important requirement for the decentralized oracle network is that some important data requests may require high-reputation nodes to validate the external data, while some common data requests may need only low-cost nodes to execute the validation. Thus, we present a weighted Schnorr multisignature to meet this requirement, which is proven to be unforgeable. However, purely relying on the cryptographic scheme cannot fully identify each participating node’s reputation; thus, we design three on-chain contracts for recording and identifying the oracle nodes’ reputation and realizing the reword mechanism. The on-chain components (e.g., smart contracts) and the off-chain components (e.g., oracle nodes) constitute a whole blockchain interoperability system. We implement our system over the Ethereum platform and analyze its on-chain and off-chain costs.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1583-1593"},"PeriodicalIF":4.7,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143871080","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":"An Efficient Task Allocation in Mobile Crowdsensing Environments","authors":"Abderrafi Abdeddine;Youssef Iraqi;Loubna Mekouar","doi":"10.1109/TNSM.2025.3540293","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3540293","url":null,"abstract":"Mobile Crowdsensing (MCS) is gaining attention for large-scale sensing that involves three types of entities: task requesters, workers equipped with sensing devices, and the platform that assigns tasks to workers considering their objectives and constraints. However, finding an allocation solution that satisfies the conditions above is NP-hard. A few studies suggested approximate solutions to this problem, focusing on one of the task’s objectives: coverage maximization. Yet, they implement it in a single-task environment or with weak objective consideration, i.e., they consider other objectives, reducing the utility the task will receive. This study proposes a task allocation that focuses only on maximizing the task coverage, where we improved the solution to consider future task coverage possibilities. We consider an opportunistic MCS environment in which sensing has no impact on user trajectories. We assume a one-to-many matching where a task can be assigned to several workers, while a worker can be matched to at most one task. We first formulate the problem mathematically and prove it to be NP-hard. Then, we design three heuristic-based solutions that are more efficient and perform extensive performance evaluations based on a real-world dataset. Each solution improves the data quality and has a maximum execution time of milliseconds.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2323-2342"},"PeriodicalIF":4.7,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232155","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":"Adaptive Traffic Control: OpenFlow-Based Prioritization Strategies for Achieving High Quality of Service in Software-Defined Networking","authors":"Yu-Fang Chen;Frank Yeong-Sung Lin;Sheng-Yung Hsu;Tzu-Lung Sun;Yennun Huang;Chiu-Han Hsiao","doi":"10.1109/TNSM.2025.3540012","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3540012","url":null,"abstract":"This paper tackles key challenges in Software-Defined Networking (SDN) by proposing a novel approach for optimizing resource allocation and dynamic priority assignment using OpenFlow’s priority field. The proposed Lagrangian relaxation (LR)-based algorithms significantly reduces network delay, achieving performance management with dynamic priority levels while demonstrating adaptability and efficiency in a sliced network. The algorithms’ effectiveness were validated through computational experiments, highlighting the strong potential for QoS management across diverse industries. Compared to the Same Priority baseline, the proposed methods: RPA, AP–1, and AP–2, exhibited notable performance improvements, particularly under strict delay constraints. For future applications, the study recommends expanding the algorithm to handle larger networks, integrating it with artificial intelligence technologies for proactive resource optimization. Additionally, the proposed methods lay a solid foundation for addressing the unique demands of 6G networks, particularly in areas such as base station mobility (Low-Earth Orbit, LEO), ultra-low latency, and multi-path transmission strategies.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2295-2310"},"PeriodicalIF":4.7,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10877862","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144229451","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}

{"title":"Design of Multiple-Plane Twisted and Folded Clos Network Guaranteeing Admissible Blocking Probability","authors":"Eiji Oki;Ryotaro Taniguchi;Kazuya Anazawa;Takeru Inoue","doi":"10.1109/TNSM.2025.3539907","DOIUrl":"https://doi.org/10.1109/TNSM.2025.3539907","url":null,"abstract":"Future advancements in data centers are anticipated to incorporate advanced circuit switching technologies, especially optical switching, which achieve high transmission capacity and energy efficiency. Previous studies addressed a Clos-network design problem to guarantee an admissible blocking probability to maximize the switching capacity, which is defined by the number of terminals connected to the network. However, as the number of available <inline-formula> <tex-math>${N} times {N}$ </tex-math></inline-formula> switches increases, the switching capacity no longer increases due to the switch port limitation. This paper proposes a design of a multiple-plane twisted-folded (TF) Clos network, named MP-TF, to enhance the switching capacity, which is limited by the original TF-Clos, by guaranteeing an admissible blocking probability. MP-TF consists of identical M TF-Clos planes and pairs of a <inline-formula> <tex-math>$1times {M}$ </tex-math></inline-formula> selector and an <inline-formula> <tex-math>${M} times 1$ </tex-math></inline-formula> selector, each pair of which is associated with a transmitter and receiver pair. We formulate a design model of MP-TF as an optimization problem to maximize the switching capacity. We introduce connection admission control in MP-TF, named MP-CAC. We derive the theorem that the MP-TF design model using MP-CAC guarantees the admissible blocking probability. Numerical results observe that MP-TF increases the switching capacity as the number of TF-Clos planes when available <inline-formula> <tex-math>${N} times {N}$ </tex-math></inline-formula> switches are sufficient; for example, with seven planes, the switching capacity is 1.97 times larger than that of one plane, given a request active probability of 0.6 and an admissible blocking probability of 0.01. We find that the computation time for MP-TF diminishes with an increase in the number of TF-Clos planes. Designing MP-TF is similar to designing a single TF-Clos plane, differing mainly in the handling of connection admission control. With a larger number of <inline-formula> <tex-math>${N} times {N}$ </tex-math></inline-formula> switches, MP-TF enables the design of a smaller TF-Clos plane. We provide the analyses of optical power management and network cost of MP-TF.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 3","pages":"2278-2294"},"PeriodicalIF":4.7,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10877882","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144232001","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}