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

virtual network function placement and resource optimization in NFV and edge computing enabled networks

COMPUTER networkS 2019年第Apr.7期152卷 12-24页

作者： Li, Defang Hong, Peilin Xue, Kaiping Pei, Jianing Univ Sci & Technol China Dept Elect Engn & Informat Sci Hefei 230027 Anhui Peoples R China

network function virtualization (NFV) and edge computing (EC) are two promising and innovative technologies to accelerate 5G networks. However, placing the service function chains (SFC), each of which consists of a series of ordered virtual network functions (VNFs), into the EC enabled networks is an intractable issue and some new challenges shall arise. Firstly, EC is a hierarchical and geo-distributed structure, which will influence the form of SFCs and make the VNF placement location-related. Secondly, the data processing in EC is hierarchical too, which incurs different latency requirements. In this paper, we study the VNF placement problem considering users' SFC requests (SFCr) in NFV and EC enabled networks. Apart from the above new challenges, the implementation method and chaining of VNFs are also considered, which will raise the need of tradeoff between node resource consumption and bandwidth consumption when placing VNFs. Then the above problem is formulated as an integer linear programming (ILP) model mathematically aiming to minimize the total resource consumption, which is proven to be NP-hard. We get the optimal results when the number of SFCrs is small taking advantage of optimization solver and propose a polynomial time heuristic when the problem scale is large. Simulation results show that the resource consumption derived by our heuristic solution is near to the optimal solution and its performance is very much superior to the contrastive schemes. (C) 2019 Elsevier B.V. All rights reserved.

关键词： virtual network function placement Edge computing Resource optimization

来源：评论

学校读者我要写书评

暂无评论

virtual network function placement Considering Resource Optimization and SFC Requests in Cloud Datacenter

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2018年第7期29卷 1664-1677页

作者： Li, Defang Hong, Peilin Xue, Kaiping Pei, Jianing Univ Sci & Technol China Chinese Acad Sci Sch Informat Sci & Technol Key Lab Wireless Opt Commun 96 Jinzhai Rd Hefei 230026 Anhui Peoples R China

network function virtualization (NFV) brings great conveniences and benefits for the enterprises to outsource their network functions to the cloud datacenter. In this paper, we address the virtual network function (VNF) placement problem in cloud datacenter considering users' service function chain requests (SFCRs). To optimize the resource utilization, we take two less-considered factors into consideration, which are the time-varying workloads, and the basic resource consumptions (BRCs) when instantiating VNFs in physical machines (PMs). Then the VNF placement problem is formulated as an integer linear programming (ILP) model with the aim of minimizing the number of used PMs. Afterwards, a Two-StAge heurisTic solution (T-SAT) is designed to solve the ILP. T-SAT consists of a correlation-based greedy algorithm for SFCR mapping (first stage) and a further adjustment algorithm for virtual network function requests (VNFRs) in each SFCR (second stage). Finally, we evaluate T-SAT with the artificial data we compose with Gaussian function and trace data derived from Google's datacenters. The simulation results demonstrate that the number of used PMs derived by T-SAT is near to the optimal results and much smaller than the benchmarks. Besides, it improves the network resource utilization significantly.

关键词： virtual network function placement resource optimization service function chain time-varying workloads multi-tenancy basic resource consumptions correlation-based algorithm

来源：评论

学校读者我要写书评

暂无评论

virtual network function placement Model Considering Both Availability and Probabilistic Protection for Service Delay

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2023年第10期E106B卷 891-902页

作者： Horimoto, Shinya Oki, Eiji Kyoto Univ Kyoto 6068501 Japan

This paper proposes a virtual network function (VNF) placement model considering both availability and probabilistic protection for the service delay to minimize the service deployment cost. Both availability and service delay are key requirements of services;a service provider handles the VNF placement problem with the goal of minimizing the service deployment cost while meeting these and other requirements. The previous works do not consider the delay of each route which the service can take when considering both availability and delay in the VNF placement problem;only the maximum delay was considered. We introduce probabilistic protection for service delay to minimize the service deployment cost with availability. The proposed model considers that the probability that the service delay, which consists of networking delay between hosts and processing delay in each VNF, exceeds its threshold is constrained within a given value;it also considers that the availability is constrained within a given value. We develop a two-stage heuristic algorithm to solve the VNF placement problem;it decides primary VNF placement by solving mixed-integer second-order cone programming in the first stage and backup VNF placement in the second stage. We observe that the proposed model reduces the service deployment cost compared to a baseline that considers the maximum delay by up to 12%, and that it obtains a feasible solution while the baseline does not in some examined situations.

关键词： network function virtualization virtual network function placement service delay availability

来源：评论

学校读者我要写书评

暂无评论

virtual network function placement: Towards Minimizing network Latency and Lead Time 9

Virtual Network Function Placement: Towards Minimizing Netwo...

引用

9th IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

作者： Cho, Daewoong Taheri, Javid Zomaya, Albert Y. Wang, Lizhe Univ Sydney Sydney NSW Australia Karlstad Univ Karlstad Sweden China Univ Geosci Beijing Peoples R China

ISBN: (纸本)9781538606926

network function virtualization (NFV) is an emerging network architecture to increase flexibility and agility within operator's networks by placing virtualized services on demand in Cloud data centers (CDCs). One of the main challenges for the NFV environment is how to efficiently allocate virtual network functions (VNF) to virtual Machines (VMs). Although a significant amount of work/research has been already conducted for the generic VNF placement problem, network latency among various network components has not been comprehensively considered yet. To address this concern, in this article, we design a more comprehensive model based on real measurements to capture network latency among VNFs with more granularity to optimize placement of VNFs in CDCs. Experimental results are promising and indicate that our approach, namely VNF Low-Latency placement (VNF-LLP), can reduce network latency by up to 64.24% (50.33% in average) compared with two generic algorithms. Furthermore, it has a lower lead time (time to find a suitable VM to host a VNF) as compared with two classic approaches.

关键词： network function virtualization virtual network function virtual network function placement

来源：评论

学校读者我要写书评

暂无评论

virtual network function placement with function Decomposition for virtual network Slice

Virtual Network Function Placement with Function Decompositi...

引用

IEEE Conference on Standards for Communications and networking (IEEE CSCN)

作者： Li, Defang Hong, Peilin Wang, Wenzhe Pei, Jianing Univ Sci & Technol China Chinese Acad Sci Sch Informat Sci & Technol Key Lab Wireless Opt Commun Hefei 230027 Anhui Peoples R China

ISBN: (纸本)9781538681466

virtual network functions (VNFs) are placed across the network to complete the required network performance of virtual network slice (vNS), and the placement of VNFs is flexible and problematic. Besides, a VNF can be decomposed into multiple sub-functions, and the same type of sub-function can be re-used by multiple VNFs. Therefore, the resources of sub-functions in different vNS requests can be shared and the cost of the substrate network is reduced. So, function decomposition makes the VNF placement problem more flexible and challenging. In this paper, we study the VNF placement problem with function decomposition for vNS, and formulate it as an integer linear programming (ILP) aiming to minimize the total cost of the substrate network. Then, an approach named placement algorithm based on function Decomposition (P-FD) is proposed to get a near-optimal solution of this problem. Finally, simulation results show that P-FD can achieve less total cost compared with algorithms in existing.

关键词： virtual network function placement function decomposition resource sharing network slicing

来源：评论

学校读者我要写书评

暂无评论

virtual network function placement Model Considering Both Service Delay and Availability 23

Virtual Network Function Placement Model Considering Both Se...

引用

23rd Asia-Pacific network Operations and Management Symposium (APNOMS)

作者： Horimoto, Shinya Oki, Eiji Kyoto Univ Kyoto Japan

ISBN: (数字)9784885523397

ISBN: (纸本)9784885523397

This paper proposes a virtual network function (VNF) placement model considering both availability and probabilistic protection for service delay to minimize the service deployment cost. Both availability and service delay are key requirements of services;a service provider handles the VNF placement problem with the goal of minimizing the service deployment cost while meeting these and other requirements. The previous works do not consider the delay of each route which the service can take when considering both availability and delay in the VNF placement problem;only the maximum delay was considered. We introduce probabilistic protection for service delay to minimize the service deployment cost with availability. The proposed model considers that the probability that the service delay, which consists of networking delay between hosts and processing delay in each VNF, exceeds its threshold is constrained within a given value;it also considers that the availability is constrained within a given value. We develop a two-stage heuristic algorithm to solve the VNF placement problem;it decides primary VNF placement by solving mixed-integer second-order cone programming in the first stage and backup VNF placement in the second stage. We observe that the proposed model reduces the service deployment cost compared to a baseline by up to 10%, and that it obtains a feasible solution while the baseline does not in some examined situations.

关键词： network function virtualization virtual network function placement service delay availability

来源：评论

学校读者我要写书评

暂无评论

A two-stage approach for multicast-oriented virtual network function placement

引用

APPLIED SOFT COMPUTING 2021年 112卷 107798-107798页

作者： Wang, Xinhan Xing, Huanlai Zhan, Dawei Luo, Shouxi Dai, Penglin Iqbal, Muhammad Azhar Southwest Jiaotong Univ Sch Comp & Artificial Intelligence Chengdu Peoples R China

network function virtualization (NFV) is an emerging network paradigm that decouples softwarized network functions from proprietary hardware. Nowadays, resource allocation has become one of the hot topics in the NFV domain. In this paper, we formulate a service function chain (SFC) mapping problem in the context of multicast, which is also referred to as the multicast-oriented virtual network function placement (MVNFP) problem. The objective function considers end-to-end delay as well as compute resource consumption, with bandwidth requirements met. A two-stage approach is proposed to address this problem. In the first stage, Dijkstra's algorithm is adopted to construct a multicast tree. In the second stage, a novel estimation of distribution algorithm (nEDA) is developed to map a given SFC over the multicast tree. Simulation results show that the proposed two-stage approach outperforms a number of state-of-the-art evolutionary, approximation, and heuristic algorithms, in terms of the solution quality. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Estimation of distribution algorithm Multicast network function virtualization virtual network function placement

来源：评论

学校读者我要写书评

暂无评论

Efficient virtual network function placement strategies for Cloud Radio Access networks

引用

COMPUTER COMMUNICATIONS 2018年第Sep.期127卷 50-60页

作者： Bhamare, Deval Erbad, Aiman Jain, Raj Zolanvari, Maede Samaka, Mohammed Qatar Univ Dept Comp Sci & Engn Doha Qatar Washington Univ Dept Comp Sci & Engn St Louis MO 63130 USA

The new generation of 5G mobile services place stringent requirements for cellular network operators in terms of latency and costs. The latest trend in radio access networks (RANs) is to pool the baseband units (BBUs) of multiple radio base stations and to install them in a centralized infrastructure, such as a cloud, for statistical multiplexing gains. The technology is known as Cloud Radio Access network (CRAN). Since cloud computing is gaining significant traction and virtualized data centers are becoming popular as a cost-effective infrastructure in the telecommunication industry, CRAN is being heralded as a candidate technology to meet the expectations of radio access networks for 5G. In CRANs, low energy base stations (BSs) are deployed over a small geographical location and are connected to a cloud via finite capacity backhaul links. Baseband processing unit (BBU) functions are implemented on the virtual machines (VMs) in the cloud over commodity hardware. Such functions, built in software, are termed as virtual functions (VFs). The optimized placement of VFs is necessary to reduce the total delays and minimize the overall costs to operate CRANs. Our study considers the problem of optimal VF placement over distributed virtual resources spread across multiple clouds, creating a centralized BBU cloud. We propose a combinatorial optimization model and the use of two heuristic approaches, which are, branch-and-bound (BnB) and simulated annealing (SA) for the proposed optimal placement. In addition, we propose enhancements to the standard BnB heuristic and compare the results with standard BnB and SA approaches. The proposed enhancements improve the quality of the solution in terms of latency and cost as well as reduce the execution complexity significantly. We also determine the optimal number of clouds, which need to be deployed so that the total links delays, as well as the service migration delays, are minimized, while the total cloud deployment cost is within

关键词： Cloud radio access network network function virtualization Software defined networking virtual network function placement

来源：评论

学校读者我要写书评

暂无评论

Resource Optimization and Delay Guarantee virtual network function placement for Mapping SFC Requests in Cloud networks

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2021年第2期18卷 1508-1523页

作者： Yue, Yi Cheng, Bo Liu, Xuan Wang, Meng Li, Biyi Chen, Junliang Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

Since the advent of network function virtualization (NFV), cloud service providers (CSPs) can implement traditional dedicated network devices as software and flexibly instantiate network functions (NFs) on common off-the-shelf servers. NFV technology enables CSPs to deploy their NFs to a cloud data center in the form of virtual network functions (VNFs) without costly capital expenditures and operating expenses. However, it is an essential but intractable issue for CSPs to devise a suitable VNF placement scheme to optimize network resource consumption and improve network performance. In this article, we focus on the VNF placement problem for mapping users' service function chain requests (SFCRs) in cloud networks. To enhance network resource utilization, we consider the fundamental resource overheads and implementation method of VNFs. The VNF placement problem is formulated as an integer linear programming model with the aim of minimizing the total network resource consumption while guaranteeing the delay requirements of SFCRs. We devise a two-phase optimization solution (TPOS) to solve the problem. TPOS contains a mapping phase to map SFCRs on servers and an adjustment phase to optimize the placement of VNFs and VNF requests. Evaluation results demonstrate that TPOS can derive near-optimal server resource consumption and significantly enhance network resource utilization. TPOS can guarantee the delay requirements of SFCRs and outperform contrastive schemes in terms of activated servers, SFCR acceptance ratio, and average VNF utilization.

关键词： Servers Delays Optimization Resource management Cloud computing Bandwidth Routing network function virtualization resource optimization virtual network function placement SFC delay guarantee

来源：评论

学校读者我要写书评

暂无评论

Resource Optimization and Delay-aware virtual network function placement for Mapping SFC Requests in NFV-enabled networks 13

Resource Optimization and Delay-aware Virtual Network Functi...

引用

IEEE 13th International Conference on Cloud Computing (CLOUD)

作者： Yue, Yi Cheng, Bo Liu, Xuan Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China

ISBN: (纸本)9781728187808

network function virtualization (NFV) enables cloud service providers (CSPs) to flexibly place their network functions on common off-the-shelf servers in the form of virtual network functions (VNF), without incurring costly capital and operating expenses (CAPEX/OPEX). In the NFV-enabled network, service function chains (SFCs) are responsible for accomplishing users' service requests by steering traffic through a set of VNFs in a specified order. Therefore, it is an important but intractable issue for CSPs to devise an optimal VNF placement scheme to enhance network performance and profits. In this paper, we focus on the VNF placement problem for mapping SFC requests (SFCRs) in NFV-enabled networks, considering the delay requirement of SFCRs. To improve resource utilization, we consider the basic resource overheads and sharability of VNF instances. Then we formulate the problem as an integer linear programming (ILP) model, with the purpose of total resource consumption minimization. Afterward, the novel SFCR mapping algorithm (SMA) and VNF request adjustment algorithm (VAA) are proposed to map SFCRs and optimize the placement of VNF requests. Simulation results show that our approach is near-optimal in terms of node resource consumption. Besides, it provides higher performance in terms of node resource consumption, average VNF utilization and the number of activated servers compared with the benchmarks.

关键词： network function virtualization cloud computing resource optimization virtual network function placement delay-aware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：