SFC placement and dynamic resource allocation based on VNF performance-resource function and service requirement in cloud-edge environment

With the continuous development of network func-tions virtualization(NFV)and software-defined networking(SDN)technologies and the explosive growth of network traffic,the requirement for computing resources in the network has risen sharply.Due to the high cost of edge computing resources,coordinating the cloud and edge computing resources to improve the utilization efficiency of edge computing resources is still a considerable challenge.In this paper,we focus on optimiz-ing the placement of network services in cloud-edge environ-ments to maximize the efficiency.It is first proved that,in cloud-edge environments,placing one service function chain(SFC)integrally in the cloud or at the edge can improve the utilization efficiency of edge resources.Then a virtual network function(VNF)performance-resource(P-R)function is proposed to repre-sent the relationship between the VNF instance computing per-formance and the allocated computing resource.To select the SFCs that are most suitable to deploy at the edge,a VNF place-ment and resource allocation model is built to configure each VNF with its particular P-R function.Moreover,a heuristic recur-sive algorithm is designed called the recursive algorithm for max edge throughput(RMET)to solve the model.Through simula-tions on two scenarios,it is verified that RMET can improve the utilization efficiency of edge computing resources.

Service Function Chain Migration in LEO Satellite Networks

With the advancements of software defined network(SDN)and network function virtualization(NFV),service function chain(SFC)placement becomes a crucial enabler for flexible resource scheduling in low earth orbit(LEO)satellite networks.While due to the scarcity of bandwidth resources and dynamic topology of LEO satellites,the static SFC placement schemes may cause performance degradation,resource waste and even service failure.In this paper,we consider migration and establish an online migration model,especially considering the dynamic topology.Given the scarcity of bandwidth resources,the model aims to maximize the total number of accepted SFCs while incurring as little bandwidth cost of SFC transmission and migration as possible.Due to its NP-hardness,we propose a heuristic minimized dynamic SFC migration(MDSM)algorithm that only triggers the migration procedure when new SFCs are rejected.Simulation results demonstrate that MDSM achieves a performance close to the upper bound with lower complexity.

基于深度强化学习的能源高效VNF放置和链接方法

网络功能虚拟化(NFV)技术的出现使得网络功能由虚拟网络功能(VNF)提供,从而提高网络的灵活性,可扩展性和成本效益.然而,NFV面临一个重要挑战是,如何有效地将VNF放置不同的网络位置并链接起来引导流量,同时最大限度减少能源消耗.此外,面对网络服务质量要求,提高服务接受率对于网络性能也是至关重要的.为了解决这些问题,本文研究了NFV中的VNF放置和链接(VNFPC),以最大化服务接受率同时权衡优化能源消耗.因此,在NFV中设计了一种基于Actor-Critic深度强化学习(DRL)的能源高效的VNFPC方法,称为ACDRLVNFPC.该方法应用了适应性共享方案,通过在多服务之间共享同类型VNF和多VNF共享同一个服务器来实现节能.实验结果表明,提出的算法有效权衡了能耗和服务接受率,并且,在执行时间方面也得到了优化.与基准算法相比,ACDRL-VNFPC在服务接受率,能耗和执行时间方面性能分别提高了2.39%,14.93%和16.16%.

SFC Design and VNF Placement Based on Traffic Volume Scaling and VNF Dependency in 5G Networks

The development of Fifth-Generation(5G)mobile communication technology has remarkably promoted the spread of the Internet of Things(IoT)applications.As a promising paradigm for IoT,edge computing can process the amount of data generated by mobile intelligent devices in less time response.Network Function Virtualization(NFV)that decouples network functions from dedicated hardware is an important architecture to implement edge computing,deploying heterogeneous Virtual Network Functions(VNF)(such as computer vision,natural language processing,intelligent control,etc.)on the edge service nodes.With the NFV MANO(Management and Orchestration)framework,a Service Function Chain(SFC)that contains a set of ordered VNFs can be constructed and placed in the network to offer a customized network service.However,the procedure of NFV orchestration faces a technical challenge in minimizing the network cost of VNF placement due to the complexity of the changing effect of traffic volume and the dependency on theVNFrelationship.To this end,we jointly optimize SFC design and VNF placement to minimize resource cost while taking account of VNF dependency and traffic volume scaling.First,the problem is formulated as an Integer Linear Programming(ILP)model and proved NPhard by reduction from Hamiltonian Cycle problem.Then we proposed an efficient heuristic algorithm called Traffic Aware and Interdependent VNF Placement(TAIVP)to solve the problem.Compared with the benchmark algorithms,emulation results show that our algorithm can reduce network cost by 10.2%and increase service request acceptance rate by 7.6%on average.

Adaptive Partial Task Offloading and Virtual Resource Placement in SDN/NFV-Based Network Softwarization

Edge intelligence brings the deployment of applied deep learning(DL)models in edge computing systems to alleviate the core backbone network congestions.The setup of programmable software-defined networking(SDN)control and elastic virtual computing resources within network functions virtualization(NFV)are cooperative for enhancing the applicability of intelligent edge softwarization.To offer advancement for multi-dimensional model task offloading in edge networks with SDN/NFV-based control softwarization,this study proposes a DL mechanism to recommend the optimal edge node selection with primary features of congestion windows,link delays,and allocatable bandwidth capacities.Adaptive partial task offloading policy considered the DL-based recommendation to modify efficient virtual resource placement for minimizing the completion time and termination drop ratio.The optimization problem of resource placement is tackled by a deep reinforcement learning(DRL)-based policy following the Markov decision process(MDP).The agent observes the state spaces and applies value-maximized action of available computation resources and adjustable resource allocation steps.The reward formulation primarily considers taskrequired computing resources and action-applied allocation properties.With defined policies of resource determination,the orchestration procedure is configured within each virtual network function(VNF)descriptor using topology and orchestration specification for cloud applications(TOSCA)by specifying the allocated properties.The simulation for the control rule installation is conducted using Mininet and Ryu SDN controller.Average delay and task delivery/drop ratios are used as the key performance metrics.

Using the Cooperative Game for Service Placement of Virtual Network Functions

To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middleboxes into software-based virtualized function entities.Due to the demands of virtual services placement in NFV network environment, this paper models the service amount placement problem involving with the resources allocation as a cooperative game and proposes the placement policy by Nash Bargaining Solution(NBS). Specifically,we first introduce the system overview and apply the rigorous cooperative game-theoretic guide to build the mathematical model, which can give consideration to both the responding efficiency of service requirements and the allocation fairness.Then a distributed algorithm corresponding to NBS is designed to achieve predictable network performance for virtual instances placement.Finally, with simulations under various scenarios,the results show that our placement approach can achieve high utilization of network through the analysis of evaluation metrics namely the satisfaction degree and fairness index. With the suitable demand amount of services, the average values of two metrics can reach above 90%. And by tuning the base placement, our solution can enable operators to flexibly balance the tradeoff between satisfaction and fairness of resourcessharing in service platforms.

基于探路者算法的VNF放置与调度联合优化

虚拟网络功能放置和虚拟网络功能调度是近年来研究的热点,二者紧密关联缺一不可。将两个环节统一考虑、全局寻优既是技术发展趋势,也是网络功能虚拟化落地面临的艰巨挑战之一。然而,现有研究多将二者分立考虑,仅着眼单一问题的研究缺乏整体观。论文提出了一种动态的放置调度联合优化模型,在满足相关约束下,最小化服务功能链的完成时间。提出了一种改进的探路者算法解决该问题,引入了群体划分的机制增强全局搜索能力避免陷入局部最优。进一步设计了个体交叉和变异机制,减小对个体解的破坏,增强了局部搜索能力以及种群的多样性。此外,精英保留策略加快了算法的收敛。实验数据表明,论文提出的算法相较于各种主流进化算法在服务功能链完成时间评价指标上均有显著优势。

可靠性感知的边缘计算VNF实例放置

为了解决日益增长的延迟敏感型应用程序和用户需求与计算资源受限的冲突,移动边缘计算(Mobile Edge Computing,MEC)已经成为一种很有前途的计算范式。服务提供商通过在边缘环境中部署虚拟化网络功能(Virtual Network Functions,VNF),为用户提供更加高效和可扩展性的服务供应链(Service Function Chain,SFC)来满足用户请求。若在提供服务过程中出现不可靠的服务或严重的服务失败,可能导致用户的巨大损失,所以网络服务提供商必须保证提供持续可靠的服务。针对该问题,考虑了边缘服务器的可靠性,利用计算统一设备架构(Computational Unified Device Architecture,CUDA)支持的门控循环单元(Gate Recurrent Unite,GRU)来预测VNF实例是否可用,通过预测结果,提前对VNF进行备份,避免了过度冗余备份造成的成本过高问题。考虑服务器的存储资源有限,提出了基于VNF实例可用性的放置(RVP)算法,优化服务提供商的成本。最后对提出的算法进行了性能评估,实验结果验证了RVP算法的优越性。

Virtualizing Network and Service Functions: Impact on ICT Transformation and Standardization

Virtualization of network/service functions means time sharing network/service（and affiliated）resources in a hyper speed manner.The concept of time sharing was popularized in the 1970s with mainframe computing.The same concept has recently resurfaced under the guise of cloud computing and virtualized computing.Although cloud computing was originally used in IT for server virtualization,the ICT industry is taking a new look at virtualization.This paradigm shift is shaking up the computing,storage,networking,and ser vice industries.The hope is that virtualizing and automating configuration and service management/orchestration will save both capes and opex for network transformation.A complimentary trend is the separation（over an open interface）of control and transmission.This is commonly referred to as software defined networking（SDN）.This paper reviews trends in network/service functions,efforts to standardize these functions,and required management and orchestration.

Epileptic brain network mechanisms and neuroimaging techniques for the brain network

Epilepsy can be defined as a dysfunction of the brain network,and each type of epilepsy involves different brain-network changes that are implicated diffe rently in the control and propagation of interictal or ictal discharges.Gaining more detailed information on brain network alterations can help us to further understand the mechanisms of epilepsy and pave the way for brain network-based precise therapeutic approaches in clinical practice.An increasing number of advanced neuroimaging techniques and electrophysiological techniques such as diffusion tensor imaging-based fiber tra ctography,diffusion kurtosis imaging-based fiber tractography,fiber ball imagingbased tra ctography,electroencephalography,functional magnetic resonance imaging,magnetoencephalography,positron emission tomography,molecular imaging,and functional ultrasound imaging have been extensively used to delineate epileptic networks.In this review,we summarize the relevant neuroimaging and neuroelectrophysiological techniques for assessing structural and functional brain networks in patients with epilepsy,and extensively analyze the imaging mechanisms,advantages,limitations,and clinical application ranges of each technique.A greater focus on emerging advanced technologies,new data analysis software,a combination of multiple techniques,and the construction of personalized virtual epilepsy models can provide a theoretical basis to better understand the brain network mechanisms of epilepsy and make surgical decisions.

Security Monitoring and Management for the Network Services in the Orchestration of SDN-NFV Environment Using Machine Learning Techniques

Software Defined Network(SDN)and Network Function Virtualization(NFV)technology promote several benefits to network operators,including reduced maintenance costs,increased network operational performance,simplified network lifecycle,and policies management.Network vulnerabilities try to modify services provided by Network Function Virtualization MANagement and Orchestration(NFV MANO),and malicious attacks in different scenarios disrupt the NFV Orchestrator(NFVO)and Virtualized Infrastructure Manager(VIM)lifecycle management related to network services or individual Virtualized Network Function(VNF).This paper proposes an anomaly detection mechanism that monitors threats in NFV MANO and manages promptly and adaptively to implement and handle security functions in order to enhance the quality of experience for end users.An anomaly detector investigates these identified risks and provides secure network services.It enables virtual network security functions and identifies anomalies in Kubernetes(a cloud-based platform).For training and testing purpose of the proposed approach,an intrusion-containing dataset is used that hold multiple malicious activities like a Smurf,Neptune,Teardrop,Pod,Land,IPsweep,etc.,categorized as Probing(Prob),Denial of Service(DoS),User to Root(U2R),and Remote to User(R2L)attacks.An anomaly detector is anticipated with the capabilities of a Machine Learning(ML)technique,making use of supervised learning techniques like Logistic Regression(LR),Support Vector Machine(SVM),Random Forest(RF),Naïve Bayes(NB),and Extreme Gradient Boosting(XGBoost).The proposed framework has been evaluated by deploying the identified ML algorithm on a Jupyter notebook in Kubeflow to simulate Kubernetes for validation purposes.RF classifier has shown better outcomes(99.90%accuracy)than other classifiers in detecting anomalies/intrusions in the containerized environment.

Service Function Chain Deployment Algorithm Based on Multi-Agent Deep Reinforcement Learning

Aiming at the rapid growth of network services,which leads to the problems of long service request processing time and high deployment cost in the deployment of network function virtualization service function chain(SFC)under 5G networks,this paper proposes a multi-agent deep deterministic policy gradient optimization algorithm for SFC deployment(MADDPG-SD).Initially,an optimization model is devised to enhance the request acceptance rate,minimizing the latency and deploying the cost SFC is constructed for the network resource-constrained case.Subsequently,we model the dynamic problem as a Markov decision process(MDP),facilitating adaptation to the evolving states of network resources.Finally,by allocating SFCs to different agents and adopting a collaborative deployment strategy,each agent aims to maximize the request acceptance rate or minimize latency and costs.These agents learn strategies from historical data of virtual network functions in SFCs to guide server node selection,and achieve approximately optimal SFC deployment strategies through a cooperative framework of centralized training and distributed execution.Experimental simulation results indicate that the proposed method,while simultaneously meeting performance requirements and resource capacity constraints,has effectively increased the acceptance rate of requests compared to the comparative algorithms,reducing the end-to-end latency by 4.942%and the deployment cost by 8.045%.

Network Function Virtualization Technology:Progress and Standardization

Network innovation and business transformation are both necessary for telecom operators to adapt to new situations, but operators face challenges in terms of network bearer complexity, business centralization, and IT/CT integration. Network function virtualization （NFV） may inspire new development ideas, but many doubts still exist within industry, especially about how to introduce NFV into an operator＇ s network. This article describes the latest progress in NFV standardization, NFV requirements and hot technology issues, and typical NFV applications in an operator networks.

Optimize the Deployment and Integration for Multicast-Oriented Virtual Network Function Tree

Due to the development of network technology,the number of users is increasing rapidly,and the demand for emerging multicast services is becoming more and more abundant,traffic data is increasing day by day,network nodes are becoming denser,network topology is becoming more complex,and operators’equipment operation and maintenance costs are increasing.Network functions virtualization multicast issues include building a traffic forwarding topology,deploying the required functions,and directing traffic.Combining the two is still a problem to be studied in depth at present,and this paper proposes a two-stage solution where the decisions of these two stages are interdependent.Specifically,this paper decouples multicast traffic forwarding and function delivery.The minimum spanning tree of traffic forwarding is constructed by Steiner tree,and the traffic forwarding is realized by Viterbi-algorithm.Use a general topology network to examine network cost and service performance.Simulation results show that this method can reduce overhead and delay and optimize user experience.

Enhanced Reliability in Network Function Virtualization by Hybrid Hexagon-Cost Efficient Algorithm

In this,communication world, the Network Function Virtualization concept is utilized for many businesses, small services to virtualize the network nodefunction and to build a block that may connect the chain, communication services.Mainly, Virtualized Network Function Forwarding Graph (VNF-FG) has beenused to define the connection between the VNF and to give the best end-to-endservices. In the existing method, VNF mapping and backup VNF were proposedbut there was no profit and reliability improvement of the backup and mapping ofthe primary VNF. As a consequence, this paper offers a Hybrid Hexagon-CostEfficient algorithm for determining the best VNF among multiple VNF and backing up the best VNF, lowering backup costs while increasing dependability. TheVNF is chosen based on the highest cost-aware important measure (CIM) rate,which is used to assess the relevance of the VNF forwarding graph.To achieveoptimal cost-efficiency, VNF with the maximum CIM is selected. After the selection process, updating is processed by three steps which include one backup VNFfrom one SFC, two backup VNF from one Service Function Chain (SFC),and twobackup VNF from different SFC. Finally, this proposed method is compared withCERA, MinCost, MaxRbyInr based on backup cost, number of used PN nodes,SFC request utility, and latency. The simulation result shows that the proposedmethod cuts down the backup cost and computation time by 57% and 45% compared with the CER scheme and improves the cost-efficiency. As a result, this proposed system achieves less backup cost, high reliability, and low timeconsumption which can improve the Virtualized Network Function operation.

基于VNF实例共享的服务功能链部署算法

针对服务功能链(SFC)部署过程中存在虚拟网络功能(VNF)实例部署成本和转发路径成本难以权衡的问题,提出了基于VNF实例共享的SFC部署算法。首先针对多链SFC建立VNF和虚拟链路映射模型,并预估路径部署长度上限,保证SFC时延需求;其次,在路径部署长度限制范围内,尽可能使VNF实例共享最大化,以平衡链路转发成本和VNF部署成本,最终得到SFC部署策略。与已有的SPH(shortest path heuristic)和GUS(greedy on used server)部署算法相比,所提算法所得的总运营成本分别降低6.6%和12.15%,且当SFC数量增多时,该算法的服务接受率可达89.33%。仿真实验结果表明,提出算法可以在保证用户服务质量的同时有效降低SFC部署成本。

An Approach for Network Function Combination Based on Least Busy Placement Algorithm

Recently, integrating Softwaredefined networking(SDN) and network functions virtualization(NFV) are proposed to address the issue that difficulty and cost of hardwarebased and proprietary middleboxes management. However, it lacks of a framework that orchestrates network functions to service chain in the network cooperatively. In this paper, we propose a function combination framework that can dynamically adapt the network based on the integration NFV and SDN. There are two main contributions in this paper. First, the function combination framework based on the integration of SDN and NFV is proposed to address the function combination issue, including the architecture of Service Deliver Network, the port types representing traffic directions and the explanation of terms. Second, we formulate the issue of load balance of function combination as the model minimizing the standard deviations of all servers' loads and satisfying the demand of performance and limit of resource. The least busy placement algorithm is introduced to approach optimal solution of the problem. Finally, experimental results demonstrate that the proposed method can combine functions in an efficient and scalable way and ensure the load balance of the network.

基于特征权重感知的VNF资源需求预测方法

虚拟网络功能(Virtual Network Function,VNF)以服务功能链(Service Function Chain,SFC)的形式提供服务,能够满足不同服务的性能需求。由于网络具有动态性,为VNF实例分配固定资源会导致VNF实例的资源过多或者不足的问题。以往的研究对于VNF配置文件相关网络负载特征的重要性未做区分,因此,提出了一种基于特征权重感知的动态VNF资源需求预测方法。首先,使用ECANet学习VNF特征的权重值,以此来减少无用特征对模型预测结果的消极影响。其次,由于VNF配置文件数据集具有结构化特性,构建VNF资源预测模型时需要考虑以加强特征交互的方式来挖掘特征间深层的相互关系,提出使用深度特征交互网络(Deep Feature-Interactive Network,DIN)增强网络负载特征与VNF性能特征之间的交互能力,提高模型预测精度。最后,在基准数据集上将所提方法与同类方法进行对比实验,发现其在预测的有效性与精确性上更具优势。

基于VNF的网络服务冲突检测与避免机制

针对如何构建服务功能链(Service Function Chain,SFC)并进行资源分配为用户提供满意服务的问题,本文提出了一种包括候选路径构建、依赖冲突检测与避免以及虚拟网络功能(Virtual Network Function,VNF)部署的机制.首先,为了给SFC部署提供充足的资源,提出二级筛选及最优化选取的候选路径构建规则,为服务提供预选路径.其次,在SFC构建过程中,检测复用性与依赖关系之间的冲突,将依赖关系划分二元组后进行冲突判断,若产生冲突则进行等价类划分,给出冲突集合.然后,提出基于冲突集合以及LFGL(Least-First-Greatest-Last)原则的VNF部署规则,以最大化链路剩余带宽,保证端到端延迟.最后,在进行服务递交时,检测VNF流入流出比对数据量的影响,若产生冲突则进行冲突避免,若无法成功避免则执行规避策略.最后基于小型和大型两种网络拓扑对仿真系统进行性能评价.实验结果表明,本文设计的机制在复用率、时延、部署成功率方面所表现出的性能均优于对比算法.

一种面向网络节能的VNF容量调整方法

虚拟网络功能(VNF)容量调整因其能够显著提升网络服务提供过程中的资源利用率而成为研究热点,但该技术在实施时会导致网络能耗的升高。为解决该问题,提出一种面向网络节能的VNF容量调整方法。首先提出一种基于门控循环单元和注意力机制的VNF容量需求预测方法,然后根据VNF容量需求的预测结果,设计了一种基于深度强化学习的VNF容量需求映射方法完成VNF的容量调整,通过集中部署VNF实例和关闭网络中的空闲节点来降低网络能耗。实验结果表明,与经典的ORFA方法相比,所提方法提升了7.72%的资源利用率并降低了10.17%的网络能耗。