检索结果-内蒙古大学图书馆

NFV Anomaly Detection: Case Study through a Security Module

IEEE COMMUNICATIONS MAGAZINE 2022年第2期60卷 18-24页

作者： Bondan, Lucas Wauter, Tim Volckaert, Bruno De Turck, Filip Granville, Lisandro Zambenedetti UFRGS INF Porto Alegre RS Brazil UGent IMEC Ghent Belgium

network function virtualization (NFV) is a key networking concept whose benefits include scalability, flexibility, and cost-effective service provisioning. In NFV, service function chains (SFCs) adaptable to customers' needs are created by chaining virtualized network functions (VNFs). VNFs and SFCs are sensitive elements that, if compromised, would affect network security. The detection of compromised VNFs and SFCs is imperative, and although anomaly detection can be used in such a context, there is a lack of research work on the use of anomaly detection in NFV. In this article, we exploit the use of anomaly detection mechanisms to identify suspicious VNFs and SFCs. We introduce, into a widely accepted NFV architecture, an NFV security module (NSM) that, by analyzing VNFs and SFCs' operations, detects anomalies possibly resulting from security attacks. To prove the concept, three mechanisms have been implemented and deployed in NSM to observe how anomaly detection performs, given quantitative and qualitative information. We found out that anomaly detection is effective for VNF and SFC security and, in the case of using entropy as anomaly detection technique, it presents accuracy of up to 98 percent without harming NFV environment operations.

关键词： Service function chaining Scalability network security Entropy network function virtualization Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Improving Open Virtual Switch Performance Through Tuple Merge Relaxation in Software Defined networks

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2022年第3期19卷 2078-2091页

作者： Zhang, Xinyi Salamatian, Kave Xie, Gaogang Chinese Acad Sci Comp Network Informat Ctr Beijing 100864 Peoples R China Univ Savoie Mt Blanc LISTIC F-74940 Annecy France Univ Chinese Acad Sci Sch Comp Sci & Technol Beijing 101408 Peoples R China

Open vSwitch (OVS) is a widely used virtual switch designed to provide virtual network capabilities in virtualized environments. As the core of OVS, the packet classification task is time-consuming with the implementation of Tuple Space Search (TSS), a classical hash table-based algorithm that can achieve fast rule updating but at the cost of the reduced packet classification throughput. However, because of the central role of OVS in a virtualized environment, its performance is of utmost importance and we need mechanisms that can achieve high update rate along with high packet classification throughput. In this paper, we compare the performance of several classification algorithms and show that Tuple Merge Relaxation (TMR) is able to achieve the highest sustainable classification throughput while dealing with updates. After integrating it into OVS and evaluating its in vivo performance, we observe that TMROVS can achieve up to 24.7x higher throughput compared with native OVS. Moreover, we show that TMR-OVS is also effective against Tuple Space Explosion attack effectively and maintains OVS throughput under this attack.

关键词： Software defined networking network function virtualization virtual switches packet classification

来源：评论

学校读者我要写书评

暂无评论

KPI Guarantees in network Slicing

引用

IEEE-ACM TRANSACTIONS ON networkING 2022年第2期30卷 655-668页

作者： Martin-Perez, Jorge Malandrino, Francesco Chiasserini, Carla Fabiana Groshev, Milan Bernardos, Carlos J. Univ Carlos III Madrid Telemat Engn Getafe 28903 Spain CNR IEIIT I-10129 Turin Italy Politecn Torino Dept Elect & Telecommun I-10129 Turin Italy

Thanks to network slicing, mobile networks can now support multiple and diverse services, each requiring different key performance indicators (KPIs). In this new scenario, it is critical to allocate network and computing resources efficiently and in such a way that all KPIs targeted by a service are met. Accounting for all sorts of KPIs (e.g., availability and reliability, besides the more traditional throughput and latency) is an aspect that has been scarcely addressed so far and that requires tailored models and solution strategies. We address this issue by proposing a novel methodology and resource orchestration scheme, named OKpi, which provides high-quality decisions on VNF (Virtual network function) placement and data routing, including the selection of radio points of attachment. Importantly, OKpi has polynomial computational complexity and accounts for all KPIs required by each service, and for any resource available from the fog to the cloud. We prove several properties of OKpi and demonstrate that it performs very closely to the optimum under real-world scenarios. We also implement OKpi in a testbed supporting a robot-based, smart factory service, and we present some field tests that further confirm the ability of OKpi to make high-quality decisions.

关键词： Reliability Cloud computing network slicing Smart manufacturing Costs Robot sensing systems Monitoring network slicing network function virtualization service orchestration multidimensional graphs

来源：评论

学校读者我要写书评

暂无评论

Energy and Cost Efficient Resource Allocation for Blockchain-Enabled NFV

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2022年第4期15卷 2328-2341页

作者： Taskou, Shiva Kazemi Rasti, Mehdi Nardelli, Pedro H. J. Amirkabir Univ Technol Dept Comp Engn Tehran *** Iran Lappeenranta Lahti Univ Technol Lappeenranta 53850 Finland

network function virtualization (NFV) is a promising technology to make 5G networks flexible and agile. NFV decreases operators' OPEX and CAPEX by decoupling the physical hardware from the functions they perform. In NFV, users' service request can be viewed as a service function chain (SFC) consisting of several virtual network functions (VNFs) which are connected through virtual links. Resource allocation in NFV is done through a centralized authority called NFV Orchestrator (NFVO). This centralized authority suffers from some drawbacks such as single point of failure and security. Blockchain (BC) technology is able to address these problems by decentralizing resource allocation. The drawbacks of NFVO in NFV architecture and the exceptional BC characteristics to address these problems motivate us to focus on NFV resource allocation to users' SFCs without the need for an NFVO. To this end, we assume there are two types of users: users who send SFC requests (SFC requesting users) and users who perform mining process (miner users). For SFC requesting users, we formulate NFV resource allocation (NFV-RA) problem as a multi-objective problem to minimize the energy consumption and utilized resource cost, simultaneously. To address this problem, we propose an Approximation-based Resource Allocation algorithm (ARA) using Majorization-Minimization approximation method to convexify NFV-RA problem. Furthermore, due to the high complexity of ARA algorithm, we propose a low complexity Hungarian-based Resource Allocation (HuRA) algorithm using Hungarian algorithm for server allocation. Through the simulation results, we show that our proposed ARA and HuRA algorithms achieve near-optimal performance with lower computational complexity. Also, ARA algorithm outperforms the existing algorithms in terms of number of active servers, energy consumption, and average latency. Moreover, the mining process is the foundation of BC technology. In wireless networks, mining is performed by reso

关键词： Delays Servers Resource management Energy consumption Smart contracts Data centers Computer architecture network function virtualization blockchain virtual network function consensus mechanism mining

来源：评论

学校读者我要写书评

暂无评论

network function Virtualisation in Software-Defined networking using Openstack Environment 4

Network Function Virtualisation in Software-Defined Networki...

引用

4th International Conference on Intelligent Technologies, CONIT 2024

作者： Singh, Sonia H Veena, S. Pes University Dept. of Computer Applications Bengaluru India

ISBN: (纸本)9798350349900

The existing networking hardwares present challenges in meeting diverse user demands and adapting to changing network requirements. Traditional networking's dependency on the networking hardware hampers adaptability. network function Virtualisation (NFV) presents a solution by migrating networking functions to software. This paper aims to demonstrate the implementation of Dynamic Host Configuration Protocol(DHCP) as the virtualised network function in Software defined networking (SDN) as the proof of concept. DHCP virtual instances are designed to serve as server which dynamically assigns IP addresses to the DHCP virtual instances that are clients, enabling adaptability to changing network demands. NFV and SDN incredibly present a vital approach by virtualising network functions offering various benefits like dynamic networking, scalability, and efficiency. © 2024 IEEE.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Byways: High-Performance, Isolated network functions for Multi-Tenant Cloud Servers 15

Byways: High-Performance, Isolated Network Functions for Mul...

引用

15th Annual ACM Symposium on Cloud Computing, SoCC 2024

作者： Han, Xinyu Gao, Yuan Parmer, Gabriel Wood, Timothy The George Washington University WashingtonDC United States

ISBN: (纸本)9798400712869

network functions (NFs) have become pervasive in data centers as a means to monitor and transform traffic as it flows between services. Softwarization of the network has further added to the diversity of functions that can be deployed, yet managing the performance, efficiency, tenant-customizability, and security of these functions remains a major challenge. We present Byways, an abstraction that provides facilitates to safely deploy NFs alongside end-host VMs in a multi-tenant cloud environment. Byways guarantee strict isolation between the host system, the network functions, and VM-based cloud applications, while still maintaining high performance. A Byway manages a specific set of services, and an associated NF only processes flows associated with those services, using per-byway resources (e.g., processing time). This separation of end-host traffic across Byways provides strong fault isolation - a failing NF does not impact other services. Byways augment this isolation with per-Byway access rights that restrict a NFs access (e.g., read, write, drop) to the flow, limiting the impact of a faulty NF on even its own services. We have implemented BywayOS, a μ-kernel instantiation of Byways, and evaluated its performance, efficiency, and isolation properties compared to state of the art virtual machine networking technologies. A Byway processing memcached traic through an isolated NF demonstrates throughput and latency competitive with, and often better than, Linux host performance (i.e., without a NF nor a VM), and throughput 1.25x-6.43x higher than other host NF+VM technologies, while offering stronger isolation and a trusted computing base (TCB) more than 20x smaller. © 2024 ACM.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Dynamic Backup Sharing Scheme of Service function Chains in NFV

引用

China Communications 2022年第5期19卷 178-190页

作者： Dong Zhang Zhifan Zheng Xiang Lin Xiang Chen Chunming Wu College of Computer and Data Science Fuzhou UniversityFuzhou 350108China College of Computer Science and Technology Zhejiang UniversityHangzhou 310058China

Service function chains(SFC)mapping takes the responsibility for managing virtual network functions(VNFs).In SFC mapping,existing solutions duplicate VNFs with redundant instances to provide high availability in response to ***,as a compromise,these solutions result in high resource consumption due to device *** this paper,we propose a novel method named dynamic backup sharing(DBS)that allows SFCs to dynamically share backups to reduce resource *** formulates the problem of sharing backups among different VNFs as an integer linear programming(ILP).Thereafter,we design a novel online algorithm based on dynamic programming to solve the *** experimental results indicate that DBS outperforms state-ofthe-art works by reducing resource consumption and improving the number of accepted requests.

关键词： network function virtualization service function chain mapping reliability backup sharing

来源：评论

学校读者我要写书评

暂无评论

Cost-Effective Service Chain Construction with VNF Sharing Model Based on Finite Capacity Queue

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2022年第11期E105B卷 1361-1371页

作者： Amaya, Daisuke Tachibana, Takuji Univ Fukui Grad Sch Engn Fukui 9108507 Japan

Service chaining is attracting attention as a promising tech-nology for providing a variety of network services by applying virtual net-work functions (VNFs) that can be instantiated on commercial off-the-shelf servers. The data transmission for each service chain has to satisfy the quality of service (QoS) requirements in terms of the loss probability and transmission delay, and hence the amount of resources for each VNF is expected to be sufficient for satisfying the QoS. However, the increase in the amount of VNF resources results in a high cost for improving the QoS. To reduce the cost of utilizing a VNF, sharing VNF instances through multiple service chains is an effective approach. However, the number of packets arriving at the VNF instance is increased, resulting in a degradation of the QoS. It is therefore important to select VNF instances shared by multiple service chains and to determine the amount of resources for the selected VNFs. In this paper, we propose a cost-effective service chain construction with a VNF sharing model. In the proposed method, each VNF is mod-eled as an M/M/1/K queueing model to evaluate the relationship between the amount of resources and the loss probability. The proposed method determines the VNF sharing, the VNF placement, the amount of resources for each VNF, and the transmission route of each service chain. For the optimization problem, these are applied according to our proposed heuristic algorithm. We evaluate the performance of the proposed method through a simulation. From the numerical examples, we show the effectiveness of the proposed method under certain network topologies.

关键词： network function virtualization virtual network function ser-vice chaining queueing theory M 1 K queueing model optimization problem

来源：评论

学校读者我要写书评

暂无评论

Dynamic Controller/Switch Mapping: A Service Oriented Assignment Approach

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2022年第10期33卷 2482-2495页

作者： Chuan Pham Duong Tuan Nguyen Kim-Khoa Nguyen Tran, Nguyen H. Cheriet, Mohamed Univ Quebec Synchromedia Ecole Technol Super Quebec City PQ H2C 1K3 Canada Univ Sydney Sch Comp Sci Sydney NSW 2006 Australia

With the capability of decoupling the control plane and the data plane of networks, Software-Defined network (SDN) enables flexible and efficient implementations in networks. In addition, network function virtualization (NFV) with Virtual network function (VNF) service chain capabilities provides high-performance networks with greater scalability, elasticity, and adaptability. Such an elastic deployment of service chains results in different Service Level Agreements (SLA) and resource requirements on the control plane. In this work, we illustrate the impact of service chains on the control plane and formulate the dynamic controller/switch mapping (DCSM) problem in NFV networks in order to reduce the operational cost. We address the combinatorial optimization problem, DCSM, by designing a novel mechanism to relax DCSM into a tractable problem based on the Penalty Successive Upper Bound Minimization (PSUM) method. In doing so, we conduct several simulation scenarios to evaluate the performance. The experimental results show that our proposed algorithms can achieve a near-optimal result and reduce the operational cost up to 31.7% and 28.3% compared to K-Mean and the matching game-based approaches, respectively.

关键词： Control systems Routing Costs Resilience Reliability Optimization Process control Software-defined network network function virtualization service chain

来源：评论

学校读者我要写书评

暂无评论

SAFE-ME: Scalable and Flexible Policy Enforcement in Middlebox networks

引用

IEEE-ACM TRANSACTIONS ON networkING 2022年第5期30卷 2246-2261页

作者： Xu, Hongli Xi, Peng Zhao, Gongming Liu, Jianchun Qian, Chen Huang, Liusheng Univ Sci & Technol China Sch Comp Sci & Technol Hefei 230027 Anhui Peoples R China Suzhou Univ Sci & Technol Suzhou Inst Adv Study Suzhou 215123 Jiangsu Peoples R China Anhui Normal Univ Sch Educ Sci Wuhu 241000 Anhui Peoples R China Univ Calif Santa Cruz Dept Comp Sci & Engn Santa Cruz CA 95064 USA

The past decades have seen a proliferation of middlebox deployment in various scenarios, including backbone networks and cloud networks. Since flows have to traverse specific service function chains (SFCs) for security and performance enhancement, it becomes much complex for SFC routing due to routing loops, traffic dynamics and scalability requirement. The existing SFC routing solutions may consume many resources (e.g., TCAM) on the data plane and lead to massive overhead on the control plane, which decrease the scalability of middlebox networks. Due to SFC requirement and potential routing loops, solutions like traditional default paths (e.g., using ECMP) that are widely used in non-middlebox networks will no longer be feasible. In this paper, we present and implement a scalable and flexible middlebox policy enforcement (SAFE-ME) system to minimize the TCAM usage and control overhead. To this end, we design the smart tag operations for construction of default SFC paths with less TCAM rules in the data plane, and present lightweight SFC routing update with less control overhead for dealing with traffic dynamics in the control plane. We implement our solution and evaluate its performance with experiments on both physical platform (Pica8) and Programming Protocol-independent Packet Processors (P4) based data plane, as well as large-scale simulations. Both experimental and simulation results show that SAFE-ME can greatly improve scalability (e.g., TCAM cost, update delay, and control overhead) in middlebox networks, especially for large-scale clouds. For example, our system can reduce the control traffic overhead by about 85% while achieving almost the similar middlebox load, compared with state-of-the-art solutions.

关键词： Routing Noise measurement Middleboxes Scalability Control systems Servers Process control Middlebox networks network function virtualization scalability default path tag

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：