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

Recent Advances of Resource Allocation in network function virtualization

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2021年第2期32卷 295-314页

作者： Yang, Song Li, Fan Trajanovski, Stojan Yahyapour, Ramin Fu, Xiaoming Beijing Inst Technol Sch Comp Sci & Technol Beijing 100081 Peoples R China Microsoft London W2 6BD England Univ Gottingen Gesell Wissensch Datenverarbeitung mbH Gottingen D-37077 Gottingen Germany Univ Gottingen Inst Comp Sci D-37077 Gottingen Germany

network function virtualization (NFV) has been emerging as an appealing solution that transforms complex network functions from dedicated hardware implementations to software instances running in a virtualized environment. Due to the numerous advantages such as flexibility, efficiency, scalability, short deployment cycles, and service upgrade, NFV has been widely recognized as the next-generation network service provisioning paradigm. In NFV, the requested service is implemented by a sequence of Virtual network functions (VNF) that can run on generic servers by leveraging the virtualization technology. These VNFs are pitched with a predefined order through which data flows traverse, and it is also known as the Service function Chaining (SFC). In this article, we provide an overview of recent advances of resource allocation in NFV. We generalize and analyze four representative resource allocation problems, namely, (1) the VNF Placement and Traffic Routing problem, (2) VNF Placement problem, (3) Traffic Routing problem in NFV, and (4) the VNF Redeployment and Consolidation problem. After that, we study the delay calculation models and VNF protection (availability) models in NFV resource allocation, which are two important Quality of Service (QoS) parameters. Subsequently, we classify and summarize the representative work for solving the generalized problems by considering various QoS parameters (e.g., cost, delay, reliability, and energy) and different scenarios (e.g., edge cloud, online provisioning, and distributed provisioning). Finally, we conclude our article with a short discussion on the state-of-the-art and emerging topics in the related fields, and highlight areas where we expect high potential for future research.

关键词： Resource management Quality of service Routing Delays virtualization network function virtualization Hardware network function virtualization service function chaining resource allocation QoS placement routing

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Provisioning for Service function Chains to Support Delay-Sensitive Applications in network function virtualization

引用

IEEE INTERNET OF THINGS JOURNAL 2020年第7期7卷 6116-6131页

作者： Sun, Gang Zhou, Run Sun, Jian Yu, Hongfang Vasilakos, Athanasios V. Univ Elect Sci & Technol China Key Lab Opt Fiber Sensing & Commun Minist Educ Chengdu 611731 Peoples R China Peng Cheng Lab Shenzhen 518066 Peoples R China Fuzhou Univ Dept Comp Sci & Technol Fuzhou 350116 Peoples R China Lulea Univ Technol Dept Comp Sci Elect & Space Engn S-97187 Lulea Sweden

The efficient deployment of virtual network functions (VNFs) for network service provisioning is key for achieving network function virtualization (NFV);however, most existing studies address only offline or one-off deployments of service function chains (SFCs) while neglecting the dynamic (i.e., online) deployment and expansion requirements. In particular, many methods of energy/resource cost reduction are achieved by merging VNFs. However, the energy waste and device wear for large-scale collections of servers (e.g., cloud networks and data centers) caused by sporadic request updating are ignored. To solve these problems, we propose an energy-aware routing and adaptive delayed shutdown (EAR-ADS) algorithm for dynamic SFC deployment, which includes the following features: 1) energy-aware routing (EAR): by considering a practical deployment environment, a flexible solution is developed based on reusing open servers and selecting paths with the aims of balancing energy and resources and minimizing the total cost and 2) adaptive delayed shutdown (ADS): the delayed shutdown time of the servers can be flexibly adjusted in accordance with the usage of each device in each time slot, thus eliminating the no-load wait time of the servers and frequent on/off switching. Therefore, the EAR-ADS can achieve dual-energy savings by both decreasing the number of open servers and reducing the idle/switching energy consumption of these servers. The simulation results show that EAR-ADS not only minimizes the cost of energy and resources but also achieves an excellent success rate and stability. Moreover, EAR-ADS is efficient compared with an improved Markov algorithm (SAMA), reducing the average deployment time by more than a factor of 40.

关键词： Servers Energy consumption Internet of Things Hardware network function virtualization Routing Heuristic algorithms Dynamic deployment energy efficient network function virtualization (NFV) service function chain (SFC)

来源：评论

学校读者我要写书评

暂无评论

Low-Latency and Resource-Efficient Service function Chaining Orchestration in network function virtualization

引用

IEEE INTERNET OF THINGS JOURNAL 2020年第7期7卷 5760-5772页

作者： Sun, Gang Xu, Zhu Yu, Hongfang Chen, Xi Chang, Victor Vasilakos, Athanasios V. Univ Elect Sci & Technol China Minist Educ Key Lab Opt Fiber Sensing & Commun Chengdu 611731 Peoples R China Southwest Minzu Univ Sch Comp Sci & Technol Chengdu 610041 Peoples R China Teesside Univ Sch Comp & Digital Technol Middlesbrough TS1 3BX Cleveland England Lulea Univ Technol Dept Comp Sci Elect & Space Engn S-14671 Lulea Sweden Fuzhou Univ Dept Comp Sci & Technol Fuzhou Peoples R China

Recently, network function virtualization (NFV) has been proposed to solve the dilemma faced by traditional networks and to improve network performance through hardware and software decoupling. The deployment of the service function chain (SFC) is a key technology that affects the performance of virtual network function (VNF). The key issue in the deployment of SFCs is proposing effective algorithms to achieve efficient use of resources. In this article, we propose an SFC deployment optimization (SFCDO) algorithm based on a breadth-first search (BFS). The algorithm first uses a BFS-based algorithm to find the shortest path between the source node and the destination node. Then, based on the shortest path, the path with the fewest hops is preferentially chosen to implement the SFC deployment. Finally, we compare the performances with the greedy and simulated annealing (G-SA) algorithm. The experiment results show that the proposed algorithm is optimized in terms of end-to-end delay and bandwidth resource consumption. In addition, we also consider the load rate of the nodes to achieve network load balancing.

关键词： Delays Heuristic algorithms Load management Approximation algorithms Optimization network function virtualization Hardware End-to-end delay network function virtualization (NFV) resource consumption service function chain (SFC)

来源：评论

学校读者我要写书评

暂无评论

Fault Diagnosis in the network function virtualization: A Survey, Taxonomy, and Future Directions

引用

IEEE INTERNET OF THINGS JOURNAL 2024年第11期11卷 19121-19142页

作者： Li, Jiahui Qi, Xiaogang Li, Jiliang Su, Zhou Su, Yuan Liu, Lifang Xidian Univ Sch Math & Stat Xian 710126 Peoples R China Sci & Technol Near Surface Detect Lab Wuxi 214035 Jiangsu Peoples R China Xi An Jiao Tong Univ Sch Cyber Sci & Engn Xian 710049 Peoples R China Xidian Univ Sch Comp Sci & Technol Xian 710126 Peoples R China

The widespread application of ultradense and multivariate Internet of Things (IoT) benefits from network function virtualization (NFV) that provides flexible frameworks and effective management. NFV leverages the virtualization technologies to integrate the existing network functions of devices into standard servers, storages, and switches. Then, the network functions are achieved in software form to displace the private, dedicated, and closed network devices. However, NFV also brings instability and challenges to the network management where the network dynamics, lack of visibility, and high frequency and abundant types of faults will increase the difficulty. Therefore, diagnosing the faults embedded in the generic NFV framework is crucial for the effective adoption of NFV to the IoT environment and thus ensuring the user services. This article summarizes the differences and connections of fault diagnosis between the NFV framework and traditional networks, and introduces the challenges faced by NFV. Moreover, we provide a comprehensive survey of the state-of-the-art fault detection methods for the NFV framework. After an in-depth discussion of the fault propagation characteristics, we further present a detailed taxonomy of the fault localization approaches. Finally, we highlight the future research directions to provide ample space for improvement in applying NFV to the IoT environment.

关键词： Fault diagnosis Internet of Things Surveys network function virtualization virtualization Fault detection Security Fault detection fault diagnosis fault localization Internet of Things (IoT) network function virtualization (NFV)

来源：评论

学校读者我要写书评

暂无评论

SFCSim: a network function virtualization resource allocation simulation platform

引用

CLUSTER COMPUTING-THE JOURNAL OF networkS SOFTWARE TOOLS AND APPLICATIONS 2023年第1期26卷 423-436页

作者： Xu, Lingyi Hu, Hefei Liu, Yuanan Beijing Univ Posts & Telecommun Sch Elect Engn Beijing Peoples R China Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing Peoples R China

As a novel network architecture, network function virtualization greatly improves the flexibility of service deployment but also increases the complexity of network function virtualization resource allocation (NFV-RA). Many scholars have studied the above problems and put forward corresponding schemes. These schemes are often individually designed and are difficult to compare. A general and efficient simulation platform for the NFV-RA problem is conducive to integration, comparison and analysis of these schemes and speeds up research progress. This paper presents a general simulation platform SFCSim for NFV-RA. SFCSim adopts the discrete-time event scheduling engine, which can support the simulation of static and dynamic deployment of service function chain, service migration, mobility management and other scenarios. Finally, a load-balancing shortest path and three heuristic embedding algorithms are implemented in the platform for the service function chain embedding problem can be used as the benchmark algorithm, and SFCSim is fully compared with the Alevin to verify the performance of the platform

关键词： network function virtualization Service function chain Resource allocation NFV orchestration Heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

A Collaborative DDoS Defence Framework Using network function virtualization

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2017年第10期12卷 2483-2497页

作者： Rashidi, Bahman Fung, Carol Bertino, Elisa Virginia Commonwealth Univ Dept Comp Sci Richmond VA 23284 USA Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

High-profile and often destructive distributed denial of service (DDoS) attacks continue to be one of the top security concerns as the DDoS attacks volumes are increasing constantly. Among them, the SYN Flood attack is the most common type. Conventional DDoS defense solutions may not be preferable, since they demand highly capable hardware resources, which induce high cost and long deployment cycle. The emerging of network function virtualization (NFV) technology introduces new opportunities to decrease the amount of proprietary hardware that is needed to launch and operate network services. In this paper, we propose a DDoS defense mechanism named CoFence, which facilitates a "domain-helps-domain" collaboration network among NFV-based domain networks. CoFence allows domain networks to help each other in handling large volume of DDoS attacks through resource sharing. Specifically, we design a dynamic resource allocation mechanism for domains so that the resource allocation is fair, efficient, and incentive-compatible. The resource sharing mechanism is modeled as a multi-leader-follower Stackelberg game. In this game, all domains have a degree of control to maximize their own utility. The resource supplier domains determine the amount of resource to each requesting peer based on optimizing a reciprocal-based utility function. On the other hand, the resource requesting domains decide the level of demand to send to the resource supplier domains in order to reach sufficient support. Our simulation results demonstrate that the designed resource allocation game is effective, incentive compatible, fair, and reciprocal under its Nash equilibrium.

关键词： Software defined networking network function virtualization DDoS collaborative network

来源：评论

学校读者我要写书评

暂无评论

HYPER: A Hybrid High-Performance Framework for network function virtualization

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2017年第11期35卷 2490-2500页

作者： Sun, Chen Bi, Jun Zheng, Zhilong Hu, Hongxin Tsinghua Univ Inst Network Sci & Cyberspace Beijing 100084 Peoples R China Tsinghua Univ Dept Comp Sci Beijing 100084 Peoples R China Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China Clemson Univ Sch Comp Clemson SC 29634 USA

network function virtualization (NFV) offers the potential for both enhancing service delivery flexibility and reducing overall costs by virtualizing network functions that are traditionally implemented in dedicated hardware. However, the flexibility of NFV comes with considerable compromises since virtual machine carried functions could introduce significant performance overhead. In this paper, we present a novel high-performance framework called HYPER, which combines programmable hardware infrastructure and traditional software infrastructure in NFV to achieve both high performance and flexibility for supporting virtualized network functions (VNFs). In HYPER, we design a mediator layer to hide underlying infrastructure heterogeneity from the NFV orchestrator to simplify VNF management. In addition, we design a SLA-aware service chaining algorithm in HYPER to leverage the benefits of the hybrid infrastructure to fulfill both functional and performance requirements from service subscribers (or tenants). To optimize resource utilization efficiency, we also introduce a performance-aware VNF placement algorithm in HYPER, which accommodates both resource and performance requirements in placing VNFs. We implement HYPER in a testbed based on OpenStack and ONetCard. Experimental results show that HYPER reduces the forwarding latency of a service chain by 40% to 67% compared with data plane development kit based implementation, while maintaining the flexibility of VNF management.

关键词： network function virtualization hybrid infrastructure high performance SLA-aware service chaining

来源：评论

学校读者我要写书评

暂无评论

Data-Plane-Assisted State Replication With network function virtualization

引用

IEEE SYSTEMS JOURNAL 2022年第2期16卷 2934-2945页

作者： Lotfimahyari, Iman Sviridov, German Giaccone, Paolo Bianco, Andrea Politecn Torino Dipartimento Elettron & Telecomunicaz I-10129 Turin Italy

Modern 5G networks are capable of providing ultralow-latency and highly scalable network services by employing modern networking paradigms, such as software-defined networking (SDN) and network function virtualization. The latter enables performance-critical network applications to be run in a distributed fashion directly inside the infrastructure. Being distributed, those applications rely on sophisticated state replication algorithms to synchronize states among each other. Nevertheless, current implementations of such algorithms do not fully exploit the potential of the modern infrastructures, thus leading to suboptimal performance. In this article, we propose STARE, a novel state replication system tailored for 5G networks. At its core, STARE exploits stateful SDN to offload replication-related processes to the data plane, ultimately leading to reduced communication delays and processing overhead for virtual network functions. We provide a detailed description of the STARE architecture alongside a publicly-available P4-based implementation. Furthermore, our evaluation shows that STARE is capable of scaling to big networks while introducing low overhead in the network.

关键词： Protocols network function virtualization Partitioning algorithms 5G mobile communication Wireless fidelity Scalability Real-time systems 5G network function virtualization (NFV) programmable data planes publish– subscribe model state sharing

来源：评论

学校读者我要写书评

暂无评论

Optimized Energy Aware 5G network function virtualization

引用

IEEE ACCESS 2019年 7卷 44939-44958页

作者： Al-Quzweeni, Ahmed N. Lawey, Ahmed Q. Elgorashi, Taisir E. H. Elmirghani, Jaafar M. H. Univ Leeds Sch Elect & Elect Engn Leeds LS2 9JT W Yorkshire England

In this paper, network function virtualization (NFV) is identified as a promising key technology, which can contribute to energy-efficiency improvement in 5G networks. An optical network supported architecture is proposed and investigated in this paper to provide the wired infrastructure needed in 5G networks and to support NFV toward an energy efficient 5G network. In this paper, the mobile core network functions, as well as baseband function, are virtualized and provided as VMs. The impact of the total number of active users in the network, backhaul/fronthaul configurations, and VM inter-traffic are investigated. A mixed integer linear programming (MILP) optimization model is developed with the objective of minimizing the total power consumption by optimizing the VMs location and VMs servers' utilization. The MILP model results show that virtualization can result in up to 38% (average 34%) energy saving. The results also reveal how the total number of active users affects the baseband virtual machines (BBUVMs) optimal distribution whilst the core network virtual machines (CNVMs) distribution is affected mainly by the inter-traffic between the VMs. For real-time implementation, two heuristics are developed, an energy efficient NFV without CNVMs inter-traffic (EENFVnoITr) heuristic and an energy efficient NFV with CNVMs inter-traffic (EENFVwithITr) heuristic, both produce comparable results to the optimal MILP results. Finally, a genetic algorithm is developed for further verification of the results.

关键词： 5G networks backhaul BBU energy efficiency fronthaul genetic algorithm IP over WDM network function virtualization NFV

来源：评论

学校读者我要写书评

暂无评论

End to end delay aware service function chain scheduling in network function virtualization enabled networks

引用

PEER-TO-PEER networkING AND APPLICATIONS 2024年第6期17卷 3883-3904页

作者： Dubba, Sudha Killi, Balaprakasa Rao Natl Inst Technol Dept Comp Sci & Engn Warangal 506003 Telangana India

network function virtualization is a key enabling technology for the customization of network services in next-generation networks to support diverse applications. Most enterprise and network services contain specific network functions that are stitched together in a predefined sequence to form a service function chain. The deployment and scheduling of a service function chain onto the substrate network play a vital role in deciding the efficiency of resource utilization and the performance of network management. For a delay-sensitive network service request traversing a service function chain, the end-to-end packet delay is a crucial parameter that indicates the deployment performance. Transmission, propagation, processing, edge queueing, and virtualization delays all impact the order in which virtual network functions execute. Service level agreement violations and incorrect schedules are produced when the controller does not take edge queueing and virtualization delays into account. In this work, we propose a service function chain scheduling problem for the optimization of the end-to-end delay while considering transmission, propagation, queueing, virtualization, and processing delays. Then, we propose a scheduling approach based on the earliest finish times of the physical machines to minimize the end-to-end delay of the service function chain. The performance of the proposed service function chain scheduling approach using the earliest finish time is evaluated in terms of end-to-end delay, service level agreement violation ratio, resource utilization, and acceptance ratio. We compare our proposed algorithm with four existing approaches from the literature. Simulation results show that our proposed approach outperforms existing approaches in terms of end-to-end delay, service level agreement violation ratio, resource utilization, and acceptance ratio.

关键词： network function virtualization Service function chain scheduling End-to-end delay Service level agreement violation ratio

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：