IEEE Transactions on Network and Service Management最新文献

{"title":"ML-Based Handover Prediction Over a Real O-RAN Deployment Using RAN Intelligent Controller","authors":"Merim Dzaferagic;Bruno Missi Xavier;Diarmuid Collins;Vince D'Onofrio;Magnos Martinello;Marco Ruffini","doi":"10.1109/TNSM.2024.3468910","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3468910","url":null,"abstract":"O-RAN introduces intelligent and flexible network control in all parts of the network. The use of controllers with open interfaces allow us to gather real time network measurements and make intelligent/informed decision. The work in this paper focuses on developing a use-case for open and reconfigurable networks to investigate the possibility to predict handover events and understand the value of such predictions for all stakeholders that rely on the communication network to conduct their business. We propose a Long-Short Term Memory Machine Learning approach that takes standard Radio Access Network measurements to predict handover events. The models were trained on real network data collected from a commercial O-RAN setup deployed in our OpenIreland testbed. Our results show that the proposed approach can be optimized for either recall or precision, depending on the defined application level objective. We also link the performance of the Machine Learning (ML) algorithm to the network operation cost. Our results show that ML-based matching between the required and available resources can reduce operational cost by more than 80%, compared to long term resource purchases.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"635-647"},"PeriodicalIF":4.7,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10695758","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621620","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":"Multi-Beam Satellite Optical Networks: A Joint Time-Slot Resource Scheduling for End-to-End Services From a Networking Perspective","authors":"Hua Wang;Yanxian Bi;Fulong Yan;Long Wang;Jie Zhang;Lena Wosinska","doi":"10.1109/TNSM.2024.3468376","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3468376","url":null,"abstract":"Satellite optical networks combined with multi-beam technologies can be referred to as multi-beam satellite optical networks (MB-SONs). These networks are expected to play a crucial role in satellite Internet, potentially achieving Gigabit/s inter-satellite (IS) communication in the future. However, the growing demand for the satellite-to-mobile communications bring a challenge for making use of hybrid IS and satellite-to-ground (SG) transmission resources, which is worthy of studying. Given the different characteristics of IS links and SG links in terms of time windows and transmission capacities, existing solutions can hardly provide a suitable option for the optimal utilization of transmission capacity in MB-SONs. In this paper, we focus on the joint scheduling of optical wavelengths in IS and multiple beams in SG for the services sent from one ground station to the other ground station (which are referred to as end-to-end services). In response to the above-mentioned different characteristics of IS and SG links, we find that at least two constraints need to be followed in the joint scheduling. Also, the length of common time window will not exceed the minimum time window of IS and SG links on the path. The second one is that the volume of transmission capacity of a path depends on the length of CTW and the minimum bandwidth of IS and SG links, which should meet the service requirements. Considering these two constraints related to the length of CTW and the volume of transmission capacity, the main contributions of this paper can be concluded: i) defining the joint time slot allocation (JTSA) problem for multiple beams and wavelengths with different transmission capacities, ii) proposing an integer linear programming (ILP) model with object to minimize the number of time slots occupied by services, iii) designing the common time window for time slot assignment (CTW-TSA) algorithm as an option in practical implementations. The proposed ILP and CTW-TSA algorithm are evaluated by comparing the simulation results with the scheme using. The simulation of the CTW-TSA algorithm was compared to separate resource scheduling (SRS) without the store-and-forward function. The results showed a reduction of almost 0.201 in service blocking probability and an increase in average bandwidth utilization of about 0.159 for IS links and 0.164 for SG uplinks/downlinks.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"426-438"},"PeriodicalIF":4.7,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621873","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":"GonoGo - Assessing the Confidence Level of Distribute Intrusion Detection Systems Alarms Based on BGP","authors":"Renato S. Silva;Luís M. Felipe de Moraes","doi":"10.1109/TNSM.2024.3468907","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3468907","url":null,"abstract":"Although Border Gateway Protocol – BGP is increasingly becoming a multi-purpose protocol, it suffers from security issues regarding bogus announcements for malicious goals. Some of these security breaches are particularly critical for distributed intrusion detection systems that use BGP as their underlay network for interchanging alarms. In this case, assessing the confidence level of these BGP messages helps to prevent internal attacks. Most of the proposals addressing the confidence level of BGP messages rely on complex and time-consuming mechanisms that can also be a potential target for intelligent attacks. In this paper, we propose Gonogo as an out-of-band system based on machine learning to infer the confidence level of the intrusion alarms using just the mandatory header of each BGP message that transports them. Tests using a synthetic data set reflecting the indirect effects of a widespread worm attack over the BGP network show promising results, considering well-known performance metrics, such as recall, accuracy, receiver operating characteristics (ROC), and f1-score.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"209-219"},"PeriodicalIF":4.7,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621965","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":"Flow Adjustment and Scale-Free Reliable Topology Control for Underwater Acoustic Sensor Networks","authors":"Yin Wang;Na Xia;Bin Chen;Yutao Yin;Lei Chen;Zijian Wang;Sizhou Wei;Ke Zhang","doi":"10.1109/TNSM.2024.3467106","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3467106","url":null,"abstract":"To improve the reliability and efficiency of underwater acoustic sensor networks (UASNs) under limited node energy and network attacks, a joint scheme of enhancing robustness and extending network lifetime is proposed in this paper. Scale-free networks exhibit strong robustness against random failures, and because of the lower number of link connections, nodes consume energy more slowly. We first introduce a new scale-free topology evolution model that adjusts the initial number of nodes according to the characteristics of UASNs. This model incorporates factors such as flow load, energy consumption, and distance into the preferential attachment mechanism, balancing the network load and enhancing its resistance to attacks. Further, based on this topology, we propose a network flow adjustment algorithm that features the joint selection of paths and corresponding power levels. Energy consumption is balanced among nodes in proportion to their residual energy, rather than by minimizing the absolute consumed power. Numerical simulations show that different topologies significantly affect network lifetime, which is the longest when the number of links added is 2. The network lifetime of the proposed scheme surpasses the state-of-the-art schemes, such as ETFLA, Initial-BA, and VODA, by up to 37.18%, 46.23%, and 128.80%, respectively.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"846-859"},"PeriodicalIF":4.7,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143621600","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":"BDIP: An Efficient Big Data-Driven Information Processing Framework and Its Application in DDoS Attack Detection","authors":"Qiyuan Fan;Xue Li;Puming Wang;Xin Jin;Shaowen Yao;Shengfa Miao;Sizhang Li;Min An;Jing Xu","doi":"10.1109/TNSM.2024.3464729","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3464729","url":null,"abstract":"With the rapid advancement of 5G communication technology in the era of big data, massive terminal devices connected to the Internet have dramatically increased the scale of network, generating a large amount of high-dimensional and heterogeneous information. This not only enhances the difficulty of information processing in the network, but also poses a severe challenge to data storage and calculation, which has become a big data problem to be solved urgently. To cope with it, this paper proposes an efficient information processing framework and applies it to Distributed Denial of Service (DDoS) attack detection. Overall, three major highlights are made: (i) Tensor is used to represent multi-modal information in large-scale networks; (ii) A novel denoising algorithm based on tensor train(TT) decomposition is proposed, focused on optimizing both computation and correlation; (iii) A big data-driven information processing framework is developed, which includes information preprocessing, denoising and classification. Results in case study indicate that the framework can achieve an accuracy of 99.19%, all while maintaining the great storage advantage, well speedup ratio and strong computing capabilities under the same computational complexity. It can also be generalized to other network data processing scenarios.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"284-298"},"PeriodicalIF":4.7,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143619082","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":"HSS: A Memory-Efficient, Accurate, and Fast Network Measurement Framework in Sliding Windows","authors":"Zijun Hang;Yongjie Wang;Yuliang Lu","doi":"10.1109/TNSM.2024.3460751","DOIUrl":"https://doi.org/10.1109/TNSM.2024.3460751","url":null,"abstract":"Network measurement is indispensable to network management. This paper focuses on three fundamental network measurement tasks: membership query, frequency query, and heavy hitter query. Existing solutions, such as sketches, sliding window algorithms, and the Sliding Sketch framework, struggle to simultaneously achieve memory efficiency, accuracy, real-time operation, and generic application. Accordingly, this paper proposes the Half Sliding Sketch (HSS), an improvement over the state-of-the-art Sliding Sketch framework. The HSS framework is applied to five contemporary sketches for the three aforementioned query tasks. Theoretical analysis reveals that our framework is faster, more memory-efficient and more accurate than the state-of-the-art Sliding Sketch while still being generic. Extensive experimental results reveal that HSS significantly enhances the accuracy for the three query tasks, achieving improvements of \u0000<inline-formula> <tex-math>$2times $ </tex-math></inline-formula>\u0000 to \u0000<inline-formula> <tex-math>$28.7times $ </tex-math></inline-formula>\u0000, \u0000<inline-formula> <tex-math>$1.5times $ </tex-math></inline-formula>\u0000 to \u0000<inline-formula> <tex-math>$9times $ </tex-math></inline-formula>\u0000, and \u0000<inline-formula> <tex-math>$2.4times $ </tex-math></inline-formula>\u0000 to \u0000<inline-formula> <tex-math>$3.6times $ </tex-math></inline-formula>\u0000, respectively. Moreover, in terms of speed, HSS is \u0000<inline-formula> <tex-math>$1.2times $ </tex-math></inline-formula>\u0000 to \u0000<inline-formula> <tex-math>$1.5times $ </tex-math></inline-formula>\u0000 faster than the Sliding Sketch.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"5958-5976"},"PeriodicalIF":4.7,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142880341","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":"LRB: Locally Repairable Blockchain for IoT Integration","authors":"Zihan Jiang;Qi Chen;Zhihong Deng;He Zhang","doi":"10.1109/TNSM.2024.3462813","DOIUrl":"10.1109/TNSM.2024.3462813","url":null,"abstract":"Recently, blockchain has become a crucial technology for addressing security concerns in the Internet of Things (IoT). However, the substantial storage requirements of blockchain present a major obstacle to integrating IoT with blockchain. This paper introduces a novel coded blockchain architecture called locally repairable blockchain (LRB) to reduce the storage costs for IoT devices. Our architecture employs a node selection allocation algorithm to determine encoding parameters and local repair groups based on the blockchain’s current state, enhancing system availability. We also present a new coding process, GELRC, which combines group coding exchange methods with locally repairable codes, significantly reducing encoding complexity. GELRC facilitates low-cost local repair and improves fault tolerance. Furthermore, we introduce a specialized Vandermonde matrix for designing the local codes of LRB, enhancing the scalability of existing coded blockchains. Experimental results demonstrate that our architecture outperforms previous coded blockchain solutions with greater fault tolerance, improved single-point repair capabilities, lower coding complexity, and particularly, eliminates the need for re-encoding when new nodes are added.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6233-6247"},"PeriodicalIF":4.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142264521","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":"Popularity-Conscious Service Caching and Offloading in Digital Twin and NOMA-Aided Connected Autonomous Vehicular Systems","authors":"Biswadip Bandyopadhyay;Pratyay Kuila;Mahesh Chandra Govil","doi":"10.1109/TNSM.2024.3462481","DOIUrl":"10.1109/TNSM.2024.3462481","url":null,"abstract":"The proliferation of 5G/B5G communication has led to increased integration between digital twin (DT) technology and connected autonomous vehicular systems (CAVS). The complex and resource-intensive vehicular applications pose significant connectivity and performance challenges for CAVS. To improve connectivity, optimize spectrum allocation, and mitigate network congestion, non-orthogonal multiple access (NOMA) is implemented. Furthermore, offloading and service caching are employed by storing and offloading relevant services at the edge of vehicular networks. However, due to the limited caching storage of vehicular edge servers, the decision to cache popular and emergent services to minimize delay and energy consumption becomes challenging. The decisions regarding computation offloading and service caching are also strongly coupled. In this work, a popularity-conscious service caching and offloading problem (PSCAOP) in a DT and NOMA-aided CAVS (DTCAVS) is studied. PSCAOP is mathematically constructed and observed to be NP-complete. Then a quantum-inspired particle swarm optimization (QPSO) algorithm is proposed for DTCAVS (DTCAVS-QPSO), aiming to minimize delay and energy consumption. DTCAVS-QPSO prioritizes the popular and emergent service caching. The quantum particle (QP) is encoded to provide a comprehensive solution to the PSCAOP. A one-time mapping algorithm is used to decode the QPs. The fitness function is formulated considering delay, energy consumption, and type of service. All the phases of DTCAVS-QPSO are observed to be bounded in polynomial time. The significance of the proposed DTCAVS-QPSO is demonstrated through extensive simulations and hypothesis-based statistical analysis. Experimental outcomes underscore the superiority of the DTCAVS-QPSO over other standard works, indicating an average delay and an energy consumption reduction between 6% and 49%.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6451-6464"},"PeriodicalIF":4.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142264519","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":"SECURE: Secure and Efficient Protocol Using Randomness and Edge-Computing for Drone-Assisted Internet of Vehicles","authors":"Himani Sikarwar;Harsha Vasudev;Debasis Das;Mauro Conti;Koustav Kumar Mondal","doi":"10.1109/TNSM.2024.3462746","DOIUrl":"10.1109/TNSM.2024.3462746","url":null,"abstract":"The Internet of Vehicles (IoV) faces significant challenges related to secure authentication, efficient communication, and privacy preservation due to the high mobility of vehicles, the need for real-time data processing, varying quality of communication links, and the diverse range of devices and protocols requiring interoperability. These challenges are further complicated by the large-scale, dynamic, and heterogeneous nature of IoV systems. Traditional approaches using Road Side Connecting Nodes (RSCNs) face challenges like limited range, high costs, and single points of failure. Drone-assisted IoV (DIoV) networks address these issues by using Unmanned Aerial Vehicles (UAVs) as mobile edge nodes, enhancing connectivity, extending coverage, and improving adaptability and resilience. To address these challenges, we propose SECURE, a drone-assisted, Physically Unclonable Function (PUF)-based authentication and privacy-preserving protocol integrated with edge computing. This architecture replaces RSCNs with edge nodes and incorporates UAVs as mobile edge nodes, providing extended coverage, reduced latency, and enhanced adaptability. The PUFs in SECURE generate unique hardware-based cryptographic keys, adding an additional layer of security, while edge computing offloads computational tasks, improves network efficiency, and further reduces latency. The formal security analysis, conducted using the Random Oracle Model (ROM), proves the robustness of the session key against active and passive adversaries. Furthermore, informal security analysis demonstrates that SECURE effectively resists various security attacks, while achieving confidentiality, integrity, and authenticity in DIoV. In SECURE, we have considered two types of devices for experiments: NVIDIA Jetson Xavier NX and Raspberry Pi 4. The performance analysis, considering the results from Jetson Xavier NX, demonstrates that SECURE achieves maximum upto approximately 82.1% less communication cost and 78% faster computation time compared to the state-of-the-art schemes.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6974-6988"},"PeriodicalIF":4.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142264557","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 Feature Selection for Predicting Application Performance Degradation in Edge Cloud Environments","authors":"Behshid Shayesteh;Chunyan Fu;Amin Ebrahimzadeh;Roch H. Glitho","doi":"10.1109/TNSM.2024.3462831","DOIUrl":"10.1109/TNSM.2024.3462831","url":null,"abstract":"Applications deployed in edge cloud environments can have stringent requirements such as high throughput and high availability. However, these applications may suffer from performance degradation caused by various underlying reasons such as infrastructure-related faults. Handling application performance degradation proactively is thus critical for maintaining the application Quality-of-Service (QoS). This can be achieved through predicting application performance degradation using Machine Learning (ML) models. The performance of these ML models may degrade over time due to changes in the relevancy of features used for training the ML model for application performance degradation, i.e., feature drift. In this paper, we predict application performance degradation in edge clouds and propose a framework for adapting to the feature drifts that may occur in this environment. This framework detects a feature drift using performance of the prediction model as well as feature importance, and updates the features and adapts the prediction model to the drift considering the severity of the feature drift. We have built a proof-of-concept of our proposed framework on a Kubernetes testbed. It is demonstrated that the proposed framework can achieve up to 9.1% higher F1-score compared to Dynamic Correlation-based Feature Selection (DCFS) approach for feature drift adaptation from the literature.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"121-138"},"PeriodicalIF":4.7,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142264766","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}