International Journal of Network Management最新文献_第9页

Blockchain-inspired lightweight trust-based system in vehicular networks 车载网络中受区块链启发的轻量级信任系统

IF 1.5 4区计算机科学

International Journal of Network Management Pub Date : 2023-03-29 DOI: 10.1002/nem.2226

Sandeep Kumar Arora, Gulshan Kumar, Mustapha Hedabou, El Mehdi Amhoud, Celestine Iwendi

{"title":"Blockchain-inspired lightweight trust-based system in vehicular networks","authors":"Sandeep Kumar Arora, Gulshan Kumar, Mustapha Hedabou, El Mehdi Amhoud, Celestine Iwendi","doi":"10.1002/nem.2226","DOIUrl":"10.1002/nem.2226","url":null,"abstract":"<p>A decentralized application runs on the blockchain network without the intervention of a central authority. Transparency in transactions and security in vehicular networks are the issues for central systems. The proposed system uses blockchain-based smart contracts, which eliminate the requirement for any third-party verification. Additionally, with signature verification and reduced overhead, smart contracts also help in a fast and secure transaction. This study suggests a trust-based system paradigm where certificate authority (CA) is employed for vehicle registration. We also propose a blockchain-based system that provides efficient two-way authentication and key agreement through encryption and digital signatures. The analysis of the proposed model reveals that it is an efficient way of establishing distributed trust management, which helps in preserving vehicle privacy. The proposed scheme is tested in Automated Validation of Internet Security-sensitive Protocols (AVISPA), and security parameters verification in Network Simulator 2(NS2) also shows that the proposed scheme is more effective in comparison with existing schemes in terms of authentication cost, storage cost, and overhead.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 5","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2226","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42598057","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}

引用次数: 1

A group key exchange and secure data sharing based on privacy protection for federated learning in edge-cloud collaborative computing environment 边缘云协同计算环境下基于隐私保护的联合学习组密钥交换和安全数据共享

IF 1.5 4区计算机科学

International Journal of Network Management Pub Date : 2023-03-29 DOI: 10.1002/nem.2225

Wenjun Song, Mengqi Liu, Thar Baker, Qikun Zhang, Yu-an Tan

{"title":"A group key exchange and secure data sharing based on privacy protection for federated learning in edge-cloud collaborative computing environment","authors":"Wenjun Song, Mengqi Liu, Thar Baker, Qikun Zhang, Yu-an Tan","doi":"10.1002/nem.2225","DOIUrl":"10.1002/nem.2225","url":null,"abstract":"<div>\u0000 \u0000 <p>Federated learning (FL) is widely used in internet of things (IoT) scenarios such as health research, automotive autopilot, and smart home systems. In the process of model training of FL, each round of model training requires rigorous decryption training and encryption uploading steps. The efficiency of FL is seriously affected by frequent encryption and decryption operations. A scheme of key computation and key management with high efficiency is urgently needed. Therefore, we propose a group key agreement technique to keep private information and confidential data from being leaked, which is used to encrypt and decrypt the transmitted data among IoT terminals. The key agreement scheme includes hidden attribute authentication, multipolicy access, and ciphertext storage. Key agreement is designed with edge-cloud collaborative network architecture. Firstly, the terminal generates its own public and private keys through the key algorithm then confirms the authenticity and mapping relationship of its private and public keys to the cloud server. Secondly, IoT terminals can confirm their cryptographic attributes to the cloud and obtain the permissions corresponding to each attribute by encrypting the attributes. The terminal uses these permissions to encrypt the FL model parameters and uploads the secret parameters to the edge server. Through the storage of the edge server, these ciphertext decryption parameters are shared with the other terminal models of FL. Finally, other terminal models are trained by downloading and decrypting the shared model parameters for the purpose of FL. The performance analysis shows that this model has a better performance in computational complexity and computational time compared with the cited literature.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 5","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46857570","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}

引用次数: 1

Stochastic modeling and performance analysis in balancing load and traffic for vehicular ad hoc networks: A review 车辆自组织网络负载与流量平衡的随机建模与性能分析综述

IF 1.5 4区计算机科学

International Journal of Network Management Pub Date : 2023-03-17 DOI: 10.1002/nem.2224

Banoth Ravi, Manoj Kumar, Yu-Chen Hu, Shamsul Hassan, Bittu Kumar

{"title":"Stochastic modeling and performance analysis in balancing load and traffic for vehicular ad hoc networks: A review","authors":"Banoth Ravi, Manoj Kumar, Yu-Chen Hu, Shamsul Hassan, Bittu Kumar","doi":"10.1002/nem.2224","DOIUrl":"10.1002/nem.2224","url":null,"abstract":"<div>\u0000 \u0000 <p>The rapid growth of vehicular applications has resulted in high demand for Internet technology, which demands an unprecedented network capacity and a high quality of service (QoS). In vehicular ad hoc networks (VANETs), since nodes (vehicles) are highly mobile. The dynamic nature of the network topology in the VANET system changes due to frequent changes in link connectivity. The vehicles-to-vehicles (V2V), vehicles-to-infrastructure (V2I), and QoS, as well as the heterogeneity of applications within the VANET. VANETs have been introduced to make driving comfortable by providing safety and support to drivers. Due to the flexibility and offloading schemes available in-vehicle applications, there are some limitations. However, there are many issues in providing optimum service provisioning and scheduling in the vehicular environment. In VANETs, BSs and roadside units (RSUs) improve QoS. However, Internet services transmit packets to vehicles using stochastic models, and it predicts the traffic on a VANET. We provide open challenges to drive stochastic models in this direction.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 5","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42995165","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}

引用次数: 2

A federated semi-supervised learning approach for network traffic classification 一种用于网络流量分类的联邦半监督学习方法

IF 1.5 4区计算机科学

International Journal of Network Management Pub Date : 2023-01-26 DOI: 10.1002/nem.2222

Zhiping Jin, Zhibiao Liang, Meirong He, Yao Peng, Hanxiao Xue, Yu Wang

{"title":"A federated semi-supervised learning approach for network traffic classification","authors":"Zhiping Jin, Zhibiao Liang, Meirong He, Yao Peng, Hanxiao Xue, Yu Wang","doi":"10.1002/nem.2222","DOIUrl":"10.1002/nem.2222","url":null,"abstract":"<div>\u0000 \u0000 <p>The classification of network traffic, which involves classifying and identifying the type of network traffic, is the most fundamental step to network service improvement and modern network management. Classic machine learning and deep learning methods have widely adopted in the field of network traffic classification. However, there are two major challenges in practice. One is the user privacy concern in cross-domain traffic data sharing for the purpose of training a global classification model, and the other is the difficulty to obtain large amount of labeled data for training. In this paper, we propose a novel approach using federated semi-supervised learning for network traffic classification, in which the federated server and clients from different domains work together to train a global classification model. Among them, unlabeled data are used on the client side, and labeled data are used on the server side. The experimental results derived from a public dataset show that the accuracy of the proposed approach can reach 97.81%, and the accuracy gap between the federated learning approach and the centralized training method is minimal.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48667275","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}

引用次数: 8

Audit-based correction mechanism for malicious statistics information of data plane 基于审计的数据平面恶意统计信息纠正机制

IF 1.5 4区计算机科学

International Journal of Network Management Pub Date : 2023-01-23 DOI: 10.1002/nem.2219

Dong Liang, Qinrang Liu, Ke Song, Binghao Yan, Tao Hu

{"title":"Audit-based correction mechanism for malicious statistics information of data plane","authors":"Dong Liang, Qinrang Liu, Ke Song, Binghao Yan, Tao Hu","doi":"10.1002/nem.2219","DOIUrl":"10.1002/nem.2219","url":null,"abstract":"<div>\u0000 \u0000 <p>In software-defined networking (SDN), the controller relies on the information collected from the data plane for route planning, load balancing, and other functions. Statistics information is the most important kind of information among them, so the correctness of statistics information is the key to the proper operation of the network. Most of the current research on data plane focuses on policy consistency, rule redundancy, forwarding anomalies, and so on, and little attention is paid to whether the statistics information uploaded by the switches to the controller is correct. However, incorrect statistics information inevitably leads the controller to make wrong decisions. Therefore, this paper proposes an audit-based malicious information correction mechanism to address the problem of wrong statistics information uploaded by the switches. This mechanism audits the statistics information and locates malicious switches before uploading the statistics information to the controller. It identifies and corrects the statistics information errors by combining flow path and statistics information. We have performed simulations on Nsfnet, Abilene, and Fat-Tree, and the results show that our method can correct about 70% of the statistical information errors with less computational cost. To the best of our knowledge, this paper is the first malicious statistics information correction scheme for wildcard rules.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41318375","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}

引用次数: 0

Optimal network-aware virtual data center embedding 最佳的网络感知虚拟数据中心嵌入

IF 1.5 4区计算机科学

International Journal of Network Management Pub Date : 2023-01-19 DOI: 10.1002/nem.2223

Ameni Hbaieb, Mahdi Khemakhem

{"title":"Optimal network-aware virtual data center embedding","authors":"Ameni Hbaieb, Mahdi Khemakhem","doi":"10.1002/nem.2223","DOIUrl":"10.1002/nem.2223","url":null,"abstract":"<div>\u0000 \u0000 <p>Recently, the virtual data center embedding (VDCE) problem has drawn significant attention because of a growing need for efficient means of data center resource allocation. By ensuring a set of virtual data center (VDC) integration requests coming from his customers, among the main concern of an infrastructure provider is the maximization of the utilization rate of data center resources and benefits. However, existing VDCE solutions mostly focus on consolidating virtual machines in a single physical data center. Therefore, in this work, we improve the consolidated targets techniques, that consider only the virtual machines integration, by the consideration of network devices and fabrics (e.g., switches and paths/links). We consider new unreleased constraints such as multiple virtual nodes of the same request co-location, and intermediate node requirements when a virtual link is mapped. To address the above problem, in this paper, we propose a binary linear programming-based model, called BLP-VDCE, to solve the VDCE problem with network-aware consideration. This model ensures a simultaneous consolidated embedding of virtual nodes and virtual links. Extensive simulations show that solving the proposed BLP-VDCE model can efficiently embed VDC requests with a high physical resource utilization rate.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47924761","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}

引用次数: 0

Analysis of network function sharing in Content Delivery Network-as-a-service slicing scenarios 内容分发网络即服务切片场景下的网络功能共享分析

IF 1.5 4区计算机科学

International Journal of Network Management Pub Date : 2023-01-17 DOI: 10.1002/nem.2221

Luis M. Contreras, Alberto Solano, Francisco Cano, Jesus Folgueira

{"title":"Analysis of network function sharing in Content Delivery Network-as-a-service slicing scenarios","authors":"Luis M. Contreras, Alberto Solano, Francisco Cano, Jesus Folgueira","doi":"10.1002/nem.2221","DOIUrl":"10.1002/nem.2221","url":null,"abstract":"<p>Video content consumption is currently dominating the mix of traffic observed in Internet service provider (ISP) networks. The distribution of that content is usually performed by means of content delivery network (CDN) caches storing and delivering multimedia. The advent of virtualization is calling attention to the CDN providers as a use case for virtualizing the cache function. In parallel, there is a trend for sharing network infrastructures as a way of reducing deployment costs by ISPs. Then, an interesting scenario emerges when considering the possibility of sharing virtualized cache functions among ISPs which are sharing a common physical infrastructure, mostly considering that those ISPs offer similar video content catalogs to end users. Furthermore, when deciding to share the caches among ISPs, it is interesting to understand the impacts due to limiting the storage capacity at the edge sites. This paper investigates through simulations the potential efficiencies that can be achieved when sharing a virtual cache function if compared with the classical approach of independent virtual caches operated per ISP, as well as the implications of limiting the storage capacity of the caches at the edge.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 4","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46079470","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}

引用次数: 0

On minimizing flow monitoring costs in large-scale software-defined network networks 在大型软件定义网络中最小化流量监控成本

IF 1.5 4区计算机科学

International Journal of Network Management Pub Date : 2023-01-03 DOI: 10.1002/nem.2220

Haythem Yahyaoui, Mohamed Faten Zhani, Ouns Bouachir, Moayad Aloqaily

{"title":"On minimizing flow monitoring costs in large-scale software-defined network networks","authors":"Haythem Yahyaoui, Mohamed Faten Zhani, Ouns Bouachir, Moayad Aloqaily","doi":"10.1002/nem.2220","DOIUrl":"10.1002/nem.2220","url":null,"abstract":"<div>\u0000 \u0000 <p>Recent years have witnessed the rise of novel network applications such as telesurgery, telepresence, and holoportation. As such applications have stringent performance requirements, timely and accurate traffic monitoring becomes of paramount importance to be able to react in a timely and efficient manner, and swiftly adjust the network configuration to achieve the sought-after requirements. However, existing monitoring schemes are either incurring high cost (e.g., high bandwidth consumption) due to the large number of monitoring messages or inefficient when they incur high reporting delay (i.e., the time needed for a monitoring message to reach the controller) making the collected statistics obsolete. In this paper, we address this problem and propose monitoring mechanisms for software defined networks that minimize the monitoring cost while satisfying an upper bound on the reporting delay of the statistics. Our solutions allow to carefully select the switch that should report the statistics about each flow crossing the network taking into consideration the available bandwidth and the capacity of the switch (i.e., the maximum number of flows that it can monitor). In particular, we formulate the switch-to-flow selection problem as an integer linear program and propose two heuristic algorithms to cope with large-scale instances of the problem. We consider the scenario where a single controller is collecting statistics and another where statistics are collected by multiple controllers. Simulation results show that the proposed algorithms provide near-optimal solutions with minimal computation time and outperform existing monitoring strategies in terms of monitoring cost and reporting delay.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2023-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42039030","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}

引用次数: 3

Graph neural network‐based virtual network function deployment optimization 基于图神经网络的虚拟网络功能部署优化

IF 1.5 4区计算机科学

International Journal of Network Management Pub Date : 2023-01-01 DOI: 10.1002/nem.2217

Heegon Kim, Suhyun Park, Stanislav Lange, Doyoung Lee, DongNyeong Heo, Heeyoul Choi, Jae-Hyoung Yoo, JamesWon‐Ki Hong

引用次数: 0

Towards optimal synchronization in NFV-based environments 在基于NFV的环境中实现最佳同步

IF 1.5 4区计算机科学

International Journal of Network Management Pub Date : 2022-12-12 DOI: 10.1002/nem.2218

Zakaria Alomari, Mohamed Faten Zhani, Moayad Aloqaily, Ouns Bouachir

{"title":"Towards optimal synchronization in NFV-based environments","authors":"Zakaria Alomari, Mohamed Faten Zhani, Moayad Aloqaily, Ouns Bouachir","doi":"10.1002/nem.2218","DOIUrl":"10.1002/nem.2218","url":null,"abstract":"<p>Network Function Virtualization (NFV) is known for its ability to reduce deployment costs and improve the flexibility and scalability of network functions. Due to processing capacity limitations, the infrastructure provider may need to instantiate multiple instances of the same network function. However, most of network functions are stateful, meaning that the instances of the same function need to keep a common state and hence the need for synchronization among them. In this paper, we address this problem with the goal of identifying the optimal synchronization pattern between the instances in order to minimize the synchronization costs and delay. We propose a novel network function named <i>Synchronization Function</i> able to carry out data collection and further minimize these costs. We first mathematically model this problem as an integer linear program that finds the optimal synchronization pattern and the optimal placement and number of synchronization functions that minimize synchronization costs and ensure a bounded synchronization delay. We also put forward three greedy algorithms to cope with large-scale scenarios of the problem, and we explore the possibility to migrate network function instances to further reduce costs. Extensive simulations show that the proposed algorithms efficiently find near-optimal solutions with minimal computation time and provide better results compared to existing solutions.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"33 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2022-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42796433","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}

引用次数: 1