International Journal of Network Management最新文献

{"title":"Accelerating network softwarization in the cognitive age","authors":"Kohei Shiomoto,&nbsp;Young-Tak Kim,&nbsp;Christian Esteve Rothenberg,&nbsp;Barbara Martini,&nbsp;Eiji Oki","doi":"10.1002/nem.2241","DOIUrl":"10.1002/nem.2241","url":null,"abstract":"<p>This special issue contains extended versions of three best papers from the IEEE International Conference on Network Softwarization (NetSoft 2021, https://netsoft2021.ieee-netsoft.org/). The theme of NetSoft 2021 was “Accelerating Network Softwarization in the Cognitive Age.” The General Co-Chairs were Kohei Shiomoto, Tokyo City University, Japan and Young-Tak Kim, Yeungnam University, Korea. The TPC-Co-Chairs were Christian Esteve Rothenberg, University of Campinas, Brazil; Barbara Martini, CNIT, Italy; and Eiji Oki, Kyoto University, Japan.</p><p>The first paper, titled “RNN-EdgeQL: An Auto-Scaling and Placement Approach for SFC,” proposes an innovative prediction-based scaling and placement algorithm for service function chains (SFCs) that improves service level agreements (SLAs) and reduces operational costs. The authors use a variant of recurrent neural networks (RNNs) called gated recurrent unit (GRU) for resource demand prediction and an algorithm that applies Q-Learning on Edge computing environment (EdgeQL) to place scaled-out virtual network functions (VNFs) in appropriate locations. The proposed algorithm is tested on realistic temporal dynamic load models and achieves the lowest overall latency, lowest SLA violations, and lowest VNFs requirement compared with existing algorithms.</p><p>The second paper, titled “SRv6-based Time-Sensitive Networks (TSN) with Low Overhead Rerouting,” proposes a software-defined network (SDN)-based approach for low-overhead TSN network updates using segment routing over IPv6 (SRv6) for path control. The authors introduce the concept of TSN subgraphs to quickly reschedule flows traversing problematic areas and propose a TSN-aware routing heuristic to minimize convergence time. The proposed approach yields faster recovery and significantly reduces the number of required reconfigurations upon failures, at the expense of a small SRv6 encoding/decoding overhead.</p><p>The third paper, titled “Analysis of Network Function Sharing in Content Delivery Network-as-a-Service Slicing Scenarios,” investigates the potential efficiencies that can be achieved when sharing a virtual cache function among Internet service providers (ISPs) that are sharing a common physical infrastructure. The authors simulate the sharing of virtualized cache functions and analyze the implications of limiting the storage capacity of the caches at the edge. The paper provides insights into the potential cost savings that can be achieved by sharing network infrastructures and virtualized cache functions among ISPs.</p><p>We believe that these three papers make significant contributions and offer valuable insights into the challenges and opportunities of managing softwarized networks. We hope that this special issue will inspire further research in this area and lead to the development of more efficient and effective network management solutions.</p><p>We would like to thank the authors for their excellent contributions and the reviewers for","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 4","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2241","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45535227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Issue Information","authors":"","doi":"10.1002/pd.6177","DOIUrl":"https://doi.org/10.1002/pd.6177","url":null,"abstract":"No abstract is available for this article.","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":" ","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42673009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Joint service placement and user assignment model in multi-access edge computing networks against base-station failure","authors":"Haruto Taka,&nbsp;Fujun He,&nbsp;Eiji Oki","doi":"10.1002/nem.2233","DOIUrl":"10.1002/nem.2233","url":null,"abstract":"<p>Multi-access edge computing (MEC) enables users to exploit the resources of cloud computing at a base station (BS) in proximity to the users where an MEC server is hosted. While we have advantage of being able to communicate with low latency and small network load in MEC networks, the resources in BSs are limited. One challenge is where to provide users with services from to make efficient use of resources. Furthermore, to enhance the reliability of MEC system, the case that a BS fails needs to be considered. This paper proposes a service placement and user assignment model with preventive start-time optimization against a single BS failure in MEC networks. The proposed model preventively determines the service placement and user assignment in each BS failure pattern to minimize the worst-case penalty which is the largest penalty among all failure patterns. We formulate the proposed model as an integer linear programming problem. We prove that the considered problem is NP-hard. When the problem size becomes large, it may not be solved in a practical computation time. To solve larger size problems, we introduce two algorithms: one is the greedy algorithm with allocation upgrade and the other is with allocation upgrade and preemption. The results show that the introduced algorithms obtain solutions with smaller worst-case penalty than the benchmark in a practical time.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42045703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Placement of virtual network functions for network services","authors":"Brajesh Kumar Umrao,&nbsp;Dharmendra Kumar Yadav","doi":"10.1002/nem.2232","DOIUrl":"10.1002/nem.2232","url":null,"abstract":"<div>\u0000 \u0000 <p>Network function virtualization (NFV) is a name of technology for replacing hardware-based network functions with software programs. Virtual network function (VNF) is a software program that replaces the hardware-based network functionality. The replacement of the hardware-based network functions (middleboxes) with software programs promises the on-demand provisioning of network functions and reduces capital and operational expenses of the network. Due to this replaced network can adapt to the different network functions. Network service providers deploy various network services with different objectives, such as reducing the network's active servers and traffic latency or network operational expenses. In this article, a VNF placement problem is studied to optimize the total operating costs of the networks. To solve the VNF placement problem, we proposed an integer linear program (ILP) model, which has been implemented using CPLEX. Although an ILP-based approach gives an optimal solution, it takes a long execution time to find the solution. Due to the long execution time, the ILP-based approach is not suitable for the real-time VNF placement problem. To address this challenge, we proposed a heuristic based on dynamic programming that performs better than the existing approaches. The simulation results of the proposed solution using real-world topologies show that the heuristic approach finds a feasible solution that is only 1 to 1.34 times far from the optimal one. Moreover, experimental results show that the proposed heuristic is 15 to 423 times faster than the ILP.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44934759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dynamic management network system of automobile detection applying edge computing","authors":"Xianhong Cao","doi":"10.1002/nem.2231","DOIUrl":"https://doi.org/10.1002/nem.2231","url":null,"abstract":"Dynamic vehicle detection requires the transmission of large amounts of data collected by different types of sensors to the edge computing nodes. This is likely to cause network delays and congestion, affecting the computation of the edge computing nodes and thus posing serious security risks. Therefore, optimizing data transmission between vehicles and edge computing nodes is a new challenge to be addressed in the practical application of edge computing‐based vehicle dynamic detection architectures. The data requirements of VDT for vehicle detection dynamic detection in different environments are considered, the optimization objectives and constraints are analysed, and a deviation detection and greedy algorithm is proposed in this paper to address the problems of long mixed‐integer linear programme solution time and insufficient practical applications, and the performance of the algorithm is evaluated through simulation experiments conducted by simulation of urban mobility, a traffic flow simulation tool, and PreScan, a vehicle simulation test software. The results show that compared with the deviation detection algorithm, the greedy algorithm can reduce the communication overhead by 82.6%–86.2% in all cases and improve the performance by 13.6%–19.5%, which is more suitable for practical applications. The results of this paper contribute to the automation and modernization of vehicle technology management and information transfer.","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"31 4","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50802380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Characterizing the Bitcoin network topology with Node-Probe","authors":"Meryam Essaid,&nbsp;Changhyun Lee,&nbsp;Hongteak Ju","doi":"10.1002/nem.2230","DOIUrl":"10.1002/nem.2230","url":null,"abstract":"<p>In blockchain networks, topology discovery is a prerequisite when investigating the network characteristics (e.g., performance and robustness), which can provide a deeper comprehension of the behavior of the nodes and topology dynamicity. In this paper, we conduct a longitudinal study on the Bitcoin topology by collecting network snapshots from 2018 to 2022 with Node-Probe, our topology discovery technique that uses recursive scanning to find all reachable nodes in the Bitcoin network. Using Node-Probe, we have collected 5-week-long snapshots (36-day-long snapshots) of the Bitcoin main network and analyzed the network properties, community structure, and topology dynamicity. We confirm that our approach achieves a precision of 99% with a recall of 98% in inferring the topology. Analytical results on community structure show that the Bitcoin network has \u0000<math>\u0000 <mo>×</mo>\u0000 <mn>4</mn></math> more communities than what should be expected from a random network. Meanwhile, analytical results on dynamicity indicate that the topology stands firmly on heavy and long-running nodes. Improving the propagation mechanism using master nodes could improve the propagation delay by proximity \u0000<math>\u0000 <mo>×</mo>\u0000 <mn>25</mn></math> compared with the Bitcoin default protocol. Considering a K-anonymity attack, any transaction from one of the autonomous systems containing only a single Bitcoin node can easily be linked to real users' IP information.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42874730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dynamic management network system of automobile detection applying edge computing","authors":"Xianhong Cao","doi":"10.1002/nem.2231","DOIUrl":"https://doi.org/10.1002/nem.2231","url":null,"abstract":"<p>Dynamic vehicle detection requires the transmission of large amounts of data collected by different types of sensors to the edge computing nodes. This is likely to cause network delays and congestion, affecting the computation of the edge computing nodes and thus posing serious security risks. Therefore, optimizing data transmission between vehicles and edge computing nodes is a new challenge to be addressed in the practical application of edge computing-based vehicle dynamic detection architectures. The data requirements of VDT for vehicle detection dynamic detection in different environments are considered, the optimization objectives and constraints are analysed, and a deviation detection and greedy algorithm is proposed in this paper to address the problems of long mixed-integer linear programme solution time and insufficient practical applications, and the performance of the algorithm is evaluated through simulation experiments conducted by simulation of urban mobility, a traffic flow simulation tool, and PreScan, a vehicle simulation test software. The results show that compared with the deviation detection algorithm, the greedy algorithm can reduce the communication overhead by 82.6%–86.2% in all cases and improve the performance by 13.6%–19.5%, which is more suitable for practical applications. The results of this paper contribute to the automation and modernization of vehicle technology management and information transfer.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 5","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2231","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50142662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Detection of car parking space by using Hybrid Deep DenseNet Optimization algorithm","authors":"Vankadhara Rajyalakshmi,&nbsp;Kuruva Lakshmanna","doi":"10.1002/nem.2228","DOIUrl":"10.1002/nem.2228","url":null,"abstract":"<p>Internet of Things (IoT) and related applications have revolutionized most of our societal activities, enhancing the quality of human life. This study presents an IoT-based model that enables optimized parking space utilization. The paper implements a Hybrid Deep DenseNet Optimization (HDDNO) algorithm for predicting parking spot availability involving Machine Learning (ML) and deep learning techniques. The HDDNO-based ML model uses secondary data from the National Research Council Park (CNRPark) in Pisa, Italy. Different regression algorithms are employed to forecast parking lot availability for a given time as part of the prediction process. The DenseNet technique has generated promising results, whereas the HDDNO model yielded better accuracy. The use of five optimizers, namely, Adaptive Moment Estimation (Adam), Root Mean Squared Propagation (RMSprop), Adaptive Gradient (AdaGrad), AdaDelta, and Stochastic Gradient Descent (SGD), have played significant roles in minimizing the loss of the model. The part of Adam has enabled the HDDNO model to generate predictions with high accuracy 99.19% and low loss 0.0306%. This proposed methodology would significantly improve environmental safety and act as an initiative toward developing smart cities.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46960201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Editorial for special issue on security and trust on networked systems","authors":"Weizhi Meng,&nbsp;Sokratis K. Katsikas,&nbsp;Jiageng Chen,&nbsp;Chao Chen","doi":"10.1002/nem.2229","DOIUrl":"10.1002/nem.2229","url":null,"abstract":"<p>The world is becoming increasingly connected, from Internet of Things (IoT) and social networks to big data and cloud computing. Networked systems are not just relevant to information technology but have been already integrated with the engineering and cyber-physical systems domains. The agents of networked systems (e.g., sensor networks) can sense, compute, and interact based on a given task. However, networked systems suffer from many security and trust issues, as these systems are mostly designed based on traditional IT infrastructure. For example, attackers can compromise one internal sensor nodes and infect other nodes afterwards. There was an increase in malware attacks on IoT/Connected Devices of 77% in the first half of 2022, according to a recent report by Sonic Wall. This special issue focuses on how to build a trust and secure networked systems, and identifies new issues and directions for future research and development work.</p><p>In the first contribution entitled “Privacy-preserving and efficient user matching based on attribute encryption in mobile social networks,” Wu et al. aimed to protect users' privacy and introduced an attribute-based encryption scheme based on the defined policy. Then the server does not need to decrypt the attribute matching file frequently for dating users. The proposed scheme can provide several benefits: (1) it allows two-way matching to support suitable publishers recommended to requesters with dating interests, (2) our scheme protects the privacy of users by encrypting the tagged keywords of the interest information collected from requesters and the personal attribute information of publishers, and (3) the scheme can reduce the computational cost by transferring most of the decryption work to the matching server and dividing the encryption into preparation and online stages.</p><p>In the second contribution entitled “Privacy Preserving distributed smart grid system based on Hyperledger Fabric and Wireguard,” Yao et al. focused on the security issues of Smart Grid and designed a secure and decentralized energy trading platform in edge area of smart grid system by means of Hyperledger Fabric and WireGuard VPN. WireGuard can customize network gateway and controls traffic by WireGuard Interface, which includes an exclusive private key generated by the elliptic curve, a User Datagram Protocol (UDP) listening port, and a group of peer nodes. The proposed architecture was composed of four main layers, including application, blockchain platform, network structure, and physical infrastructure. In the experiment, the authors tested the bandwidth in WireGuard network and transactions throughput capacity of HyperLedger Fabric blockchain. It showed the feasibility of the proposed architecture, even with the WireGuard communication latency.</p><p>In the third contribution entitled “Intelligent detection of vulnerable functions in software through neural embedding-based code analysis,” Zeng et al. found that conv","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2229","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45677720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A novel data streaming method for detecting abnormal flows in distributed monitoring systems","authors":"Aiping Zhou,&nbsp;Ye Zhu","doi":"10.1002/nem.2227","DOIUrl":"10.1002/nem.2227","url":null,"abstract":"<p>This paper concentrates on the issue of detecting abnormal flows in distributed monitoring systems, which has many network management applications such as anomaly detection and traffic engineering. Collecting massive network traffic in real-time remains a large challenge due to the limited system resource. Most existing approaches perform abnormal flow detection at one measurement point, while they cause large computation and memory overhead for recovering abnormal flows. In this paper, we propose a novel data streaming method that supports accurate abnormal flow detection with a low memory requirement. The key idea of our method is that each monitor compresses flow information to summary data structure, sends the generated data structure to the controller; then the controller aggregates the received data structures, recovers candidates of abnormal flows and estimates their size and change to find abnormal flows on the basis of the aggregated data structure. The experimental results based on real network traffic show that the proposed approach can detect up to 97% of abnormal flows with low memory and update requirements in comparison with related approaches.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49543274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}