期刊文献+
共找到200篇文章
< 1 2 10 >
每页显示 20 50 100
SFC placement and dynamic resource allocation based on VNF performance-resource function and service requirement in cloud-edge environment
1
作者 HAN Yingchao MENG Weixiao FAN Wentao 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2024年第4期906-921,共16页
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 netw... 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. 展开更多
关键词 cloud-edge environment virtual network function(vnf)performance-resource(P-R)function edge resource allo-cation
下载PDF
Service Function Chain Migration in LEO Satellite Networks
2
作者 Geng Yuhui Wang Niwei +5 位作者 Chen Xi Xu Xiaofan Zhou Changsheng Yang Junyi Xiao Zhenyu Cao Xianbin 《China Communications》 SCIE CSCD 2024年第3期247-259,共13页
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)sat... 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. 展开更多
关键词 network function virtualization(NFV) resource allocation satellite networks service function chain(SFC) SFC migration SFC placement soft-ware defined network(SDN)
下载PDF
Adaptive Resource Allocation Algorithm for 5G Vehicular Cloud Communication
3
作者 Huanhuan Li Hongchang Wei +1 位作者 Zheliang Chen Yue Xu 《Computers, Materials & Continua》 SCIE EI 2024年第8期2199-2219,共21页
The current resource allocation in 5G vehicular networks for mobile cloud communication faces several challenges,such as low user utilization,unbalanced resource allocation,and extended adaptive allocation time.We pro... The current resource allocation in 5G vehicular networks for mobile cloud communication faces several challenges,such as low user utilization,unbalanced resource allocation,and extended adaptive allocation time.We propose an adaptive allocation algorithm for mobile cloud communication resources in 5G vehicular networks to address these issues.This study analyzes the components of the 5G vehicular network architecture to determine the performance of different components.It is ascertained that the communication modes in 5G vehicular networks for mobile cloud communication include in-band and out-of-band modes.Furthermore,this study analyzes the single-hop and multi-hop modes in mobile cloud communication and calculates the resource transmission rate and bandwidth in different communication modes.The study also determines the scenario of one-way and two-way vehicle lane cloud communication network connectivity,calculates the probability of vehicle network connectivity under different mobile cloud communication radii,and determines the amount of cloud communication resources required by vehicles in different lane scenarios.Based on the communication status of users in 5G vehicular networks,this study calculates the bandwidth and transmission rate of the allocated channels using Shannon’s formula.It determines the adaptive allocation of cloud communication resources,introduces an objective function to obtain the optimal solution after allocation,and completes the adaptive allocation process.The experimental results demonstrate that,with the application of the proposed method,the maximum utilization of user communication resources reaches approximately 99%.The balance coefficient curve approaches 1,and the allocation time remains under 2 s.This indicates that the proposed method has higher adaptive allocation efficiency. 展开更多
关键词 5G vehicular networks mobile cloud communication resource allocation channel capacity network connectivity communication radius objective function
下载PDF
Two-Stage Resource Allocation Scheme for Three-Tier Ultra-Dense Network 被引量:5
4
作者 Junwei Huang Pengguang Zhou +2 位作者 Kai Luo Zhiming Yang Gongcheng He 《China Communications》 SCIE CSCD 2017年第10期118-129,共12页
In 5 G Ultra-dense Network(UDN), resource allocation is an efficient method to manage inter-small-cell interference. In this paper, a two-stage resource allocation scheme is proposed to supervise interference and reso... In 5 G Ultra-dense Network(UDN), resource allocation is an efficient method to manage inter-small-cell interference. In this paper, a two-stage resource allocation scheme is proposed to supervise interference and resource allocation while establishing a realistic scenario of three-tier heterogeneous network architecture. The scheme consists of two stages: in stage I, a two-level sub-channel allocation algorithm and a power control method based on the logarithmic function are applied to allocate resource for Macrocell and Picocells, guaranteeing the minimum system capacity by considering the power limitation and interference coordination; in stage II, an interference management approach based on K-means clustering is introduced to divide Femtocells into different clusters. Then, a prior sub-channel allocation algorithm is employed for Femtocells in diverse clusters to mitigate the interference and promote system performance. Simulation results show that the proposed scheme contributes to the enhancement of system throughput and spectrum efficiency while ensuring the system energy efficiency. 展开更多
关键词 ultra-dense network resource allocation logarithmic function K-means
下载PDF
SFC Design and VNF Placement Based on Traffic Volume Scaling and VNF Dependency in 5G Networks
5
作者 Zhihao Zeng Zixiang Xia +1 位作者 Xiaoning Zhang Yexiao 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第3期1791-1814,共24页
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 amoun... 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. 展开更多
关键词 network function virtualization virtual network function service function chain resource allocation routing
下载PDF
A dynamic and resource sharing virtual network mapping algorithm
6
作者 Xiancui Xiao Xiangwei Zheng +2 位作者 Ji Bian Cun Ji Xinchun Cui 《Digital Communications and Networks》 SCIE CSCD 2023年第5期1101-1112,共12页
Network virtualization can effectively establish dedicated virtual networks to implement various network functions.However,the existing research works have some shortcomings,for example,although computing resource pro... Network virtualization can effectively establish dedicated virtual networks to implement various network functions.However,the existing research works have some shortcomings,for example,although computing resource properties of individual nodes are considered,node storage properties and the network topology properties are usually ignored in Virtual Network(VN)modelling,which leads to the inaccurate measurement of node availability and priority.In addition,most static virtual network mapping methods allocate fixed resources to users during the entire life cycle,and the users’actual resource requirements vary with the workload,which results in resource allocation redundancy.Based on the above analysis,in this paper,we propose a dynamic resource sharing virtual network mapping algorithm named NMA-PRS-VNE,first,we construct a new,more realistic network framework in which the properties of nodes include computing resources,storage resources and topology properties.In the node mapping process,three properties of the node are used to measure its mapping ability.Second,we consider the resources of adjacent nodes and links instead of the traditional method of measuring the availability and priority of nodes by considering only the resource properties,so as to more accurately select the physical mapping nodes that meet the constraints and conditions and improve the success rate of subsequent link mapping.Finally,we divide the resource requirements of Virtual Network Requests(VNRs)into basic subrequirements and variable sub-variable requirements to complete dynamic resource allocation.The former represents monopolizing resource requirements by the VNRs,while the latter represents shared resources by many VNRs with the probability of occupying resources,where we keep a balance between resource sharing and collision among users by calculating the collision probability.Simulation results show that the proposed NMAPRS-VNE can increase the average acceptance rate and network revenue by 15%and 38%,and reduce the network cost and link pressure by 25%and 17%. 展开更多
关键词 network virtualization VNRs network frameworks Dynamic resource allocation resource sharing
下载PDF
基于深度强化学习的能源高效VNF放置和链接方法
7
作者 赵耀鹏 徐九韵 脱颖超 《计算机系统应用》 2024年第7期230-238,共9页
网络功能虚拟化(NFV)技术的出现使得网络功能由虚拟网络功能(VNF)提供,从而提高网络的灵活性,可扩展性和成本效益.然而,NFV面临一个重要挑战是,如何有效地将VNF放置不同的网络位置并链接起来引导流量,同时最大限度减少能源消耗.此外,面... 网络功能虚拟化(NFV)技术的出现使得网络功能由虚拟网络功能(VNF)提供,从而提高网络的灵活性,可扩展性和成本效益.然而,NFV面临一个重要挑战是,如何有效地将VNF放置不同的网络位置并链接起来引导流量,同时最大限度减少能源消耗.此外,面对网络服务质量要求,提高服务接受率对于网络性能也是至关重要的.为了解决这些问题,本文研究了NFV中的VNF放置和链接(VNFPC),以最大化服务接受率同时权衡优化能源消耗.因此,在NFV中设计了一种基于Actor-Critic深度强化学习(DRL)的能源高效的VNFPC方法,称为ACDRLVNFPC.该方法应用了适应性共享方案,通过在多服务之间共享同类型VNF和多VNF共享同一个服务器来实现节能.实验结果表明,提出的算法有效权衡了能耗和服务接受率,并且,在执行时间方面也得到了优化.与基准算法相比,ACDRL-VNFPC在服务接受率,能耗和执行时间方面性能分别提高了2.39%,14.93%和16.16%. 展开更多
关键词 网络功能虚拟化 虚拟网络功能放置 服务功能链 能源高效
下载PDF
基于探路者算法的VNF放置与调度联合优化
8
作者 田耕 李娜 《舰船电子工程》 2024年第1期124-128,195,共6页
虚拟网络功能放置和虚拟网络功能调度是近年来研究的热点,二者紧密关联缺一不可。将两个环节统一考虑、全局寻优既是技术发展趋势,也是网络功能虚拟化落地面临的艰巨挑战之一。然而,现有研究多将二者分立考虑,仅着眼单一问题的研究缺乏... 虚拟网络功能放置和虚拟网络功能调度是近年来研究的热点,二者紧密关联缺一不可。将两个环节统一考虑、全局寻优既是技术发展趋势,也是网络功能虚拟化落地面临的艰巨挑战之一。然而,现有研究多将二者分立考虑,仅着眼单一问题的研究缺乏整体观。论文提出了一种动态的放置调度联合优化模型,在满足相关约束下,最小化服务功能链的完成时间。提出了一种改进的探路者算法解决该问题,引入了群体划分的机制增强全局搜索能力避免陷入局部最优。进一步设计了个体交叉和变异机制,减小对个体解的破坏,增强了局部搜索能力以及种群的多样性。此外,精英保留策略加快了算法的收敛。实验数据表明,论文提出的算法相较于各种主流进化算法在服务功能链完成时间评价指标上均有显著优势。 展开更多
关键词 网络功能虚拟化 vnf放置与调度 动态模型 探路者算法
下载PDF
Position-aware packet loss optimization on service function chain placement
9
作者 Wenjie Liang Chengxiang Li +1 位作者 Lin Cui Fung Po Tso 《Digital Communications and Networks》 SCIE CSCD 2024年第4期1057-1067,共11页
The advent of Network Function Virtualization(NFV)and Service Function Chains(SFCs)unleashes the power of dynamic creation of network services using Virtual Network Functions(VNFs).This is of great interest to network... The advent of Network Function Virtualization(NFV)and Service Function Chains(SFCs)unleashes the power of dynamic creation of network services using Virtual Network Functions(VNFs).This is of great interest to network operators since poor service quality and resource wastage can potentially hurt their revenue in the long term.However,the study shows with a set of test-bed experiments that packet loss at certain positions(i.e.,different VNFs)in an SFC can cause various degrees of resource wastage and performance degradation because of repeated upstream processing and transmission of retransmitted packets.To overcome this challenge,this study focuses on resource scheduling and deployment of SFCs while considering packet loss positions.This study developed a novel SFC packet dropping cost model and formulated an SFC scheduling problem that aims to minimize overall packet dropping cost as a Mixed-Integer Linear Programming(MILP)and proved that it is NP-hard.In this study,Palos is proposed as an efficient scheme in exploiting the functional characteristics of VNFs and their positions in SFCs for scheduling resources and deployment to optimize packet dropping cost.Extensive experiment results show that Palos can achieve up to 42.73%improvement on packet dropping cost and up to 33.03%reduction on average SFC latency when compared with two other state-of-the-art schemes. 展开更多
关键词 network function virtualization resource scheduling SFC deployment Packet loss
下载PDF
可靠性感知的边缘计算VNF实例放置
10
作者 梁晶语 马博闻 黄霁崴 《计算机科学》 CSCD 北大核心 2024年第S01期759-764,共6页
为了解决日益增长的延迟敏感型应用程序和用户需求与计算资源受限的冲突,移动边缘计算(Mobile Edge Computing,MEC)已经成为一种很有前途的计算范式。服务提供商通过在边缘环境中部署虚拟化网络功能(Virtual Network Functions,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算法的优越性。 展开更多
关键词 边缘计算 服务供应链 虚拟化网络功能 可靠性 vnf实例放置
下载PDF
面向SDN/NFV架构的VNF硬件加速资源编排机制 被引量:9
11
作者 段通 兰巨龙 +1 位作者 胡宇翔 范宏伟 《通信学报》 EI CSCD 北大核心 2018年第6期98-108,共11页
SDN/NFV架构中虚拟网络功能(VNF,virtual network function)的性能受限问题,使VNF的硬件加速机制成为研究热点。在部署硬件加速资源后,如何实现对硬件加速资源的统一管控和最优编排是亟待解决的问题。首先,提出了基于分离式控制的硬件... SDN/NFV架构中虚拟网络功能(VNF,virtual network function)的性能受限问题,使VNF的硬件加速机制成为研究热点。在部署硬件加速资源后,如何实现对硬件加速资源的统一管控和最优编排是亟待解决的问题。首先,提出了基于分离式控制的硬件加速资源统一管控架构;然后,将传统网络资源和硬件加速资源统一到网络模型中,并将硬件加速资源编排问题建模成基于线性约束的多目标优化问题;最后,设计了加速卡优先部署的启发式算法对问题进行求解。实验结果表明,与现有研究相比,所提机制能有效整合硬件加速资源,降低了近30%的处理时延。 展开更多
关键词 SDN/NFV 虚拟网络功能 硬件加速 资源编排
下载PDF
基于特征选择的VNF资源需求预测方法 被引量:5
12
作者 武静雯 江凌云 刘祥军 《计算机应用研究》 CSCD 北大核心 2021年第10期3131-3136,3142,共7页
针对在网络切片场景下以往的VNF(虚拟网络功能)资源分配策略无法满足动态的资源需求,很容易导致资源分配不足或过度分配的问题,提出了一种基于两阶段算法(two-stage algorithm,TSA)的VNF资源需求预测方法。该方法首先基于数据特征筛选... 针对在网络切片场景下以往的VNF(虚拟网络功能)资源分配策略无法满足动态的资源需求,很容易导致资源分配不足或过度分配的问题,提出了一种基于两阶段算法(two-stage algorithm,TSA)的VNF资源需求预测方法。该方法首先基于数据特征筛选出与预测目标高度相关的候选特征集,然后利用贪婪式前向搜索策略对候选特征集进一步筛选获得最优特征集,最终训练出不同类型的预测模型。仿真结果表明,基于该方法所训练的模型可以获得更好的预测性能,同时该方法的可扩展性较好,训练好的模型可以直接集成到现有的VNF部署算法中应用。 展开更多
关键词 网络切片 网络功能虚拟化 vnf资源分配 特征选择
下载PDF
基于VNF实例共享的服务功能链部署算法 被引量:2
13
作者 王媛滔 舒兆港 +2 位作者 钟一文 邱彩钰 田佳霖 《计算机应用研究》 CSCD 北大核心 2023年第6期1806-1811,共6页
针对服务功能链(SFC)部署过程中存在虚拟网络功能(VNF)实例部署成本和转发路径成本难以权衡的问题,提出了基于VNF实例共享的SFC部署算法。首先针对多链SFC建立VNF和虚拟链路映射模型,并预估路径部署长度上限,保证SFC时延需求;其次,在路... 针对服务功能链(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部署成本。 展开更多
关键词 服务功能链 虚拟网络功能 vnf实例共享 成本优化
下载PDF
业务流的VNF动态资源分配研究与设计
14
作者 刘敏 《玉林师范学院学报》 2020年第3期108-114,共7页
为了研究业务流的VNF动态资源分配和数据中心网络NFV化的能耗,本文设计业务流的动态资源分配和数据中心间网络中NFV化的数据中心能耗。在承载VNF受限下,建立数学动态模型;最小化成本和延迟为目标,提出一种资源分配启发式算法;全面考虑... 为了研究业务流的VNF动态资源分配和数据中心网络NFV化的能耗,本文设计业务流的动态资源分配和数据中心间网络中NFV化的数据中心能耗。在承载VNF受限下,建立数学动态模型;最小化成本和延迟为目标,提出一种资源分配启发式算法;全面考虑承载的VNF资源完成VNFs映射,另外,利用剩余链路带宽实现链路虚拟映射。仿真实验结果表明,该方法能有效地降低成本和延迟。NFV技术的引入,使分配资源降低能耗和提高利用率。构建分配功能链资源能耗模型,对模型算法提出求解,选出最短的K条路径,再采用遗传算法部署VNFs。仿真结果表明,所提算法减少服务功能链的延迟,降低能耗和提高利用率。 展开更多
关键词 资源分配 服务功能链 能耗 数据中心网络 网络功能虚拟化
下载PDF
A highly reliable embedding algorithm for airborne tactical network virtualization 被引量:2
15
作者 MIAO Jingcheng LYU Na +2 位作者 CHEN Kefan CHEN Zhuo GAO Weiting 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第6期1364-1374,共11页
The evolution of airborne tactical networks(ATNs)is impeded by the network ossification problem.As a solution,network virtualization(NV)can provide a flexible and scalable architecture where virtual network embedding(... The evolution of airborne tactical networks(ATNs)is impeded by the network ossification problem.As a solution,network virtualization(NV)can provide a flexible and scalable architecture where virtual network embedding(VNE)is a key part.However,existing VNE algorithms cannot be optimally adopted in the virtualization of ATN due to the complex interference in aircombat field.In this context,a highly reliable VNE algorithm based on the transmission rate for ATN virtualization(TR-ATVNE)is proposed to adapt well to the specific electromagnetic environment of ATN.Our algorithm coordinates node and link mapping.In the node mapping,transmission-rate resource is firstly defined to effectively evaluate the ranking value of substrate nodes under the interference of both environmental noises and enemy attacks.Meanwhile,a feasible splitting rule is proposed for path splitting in the link mapping,considering the interference between wireless links.Simulation results reveal that our algorithm is able to improve the acceptance ratio of virtual network requests while maintaining a high revenue-to-cost ratio under the complex electromagnetic interference. 展开更多
关键词 airborne tactical network(ATN) network virtualization(NV) resource allocation virtual network embedding(VNE) transmission rate
下载PDF
基于VNF组合的服务功能链设计及映射算法 被引量:4
16
作者 朱国晖 刘璐 雷兰洁 《计算机工程》 CAS CSCD 北大核心 2020年第4期183-188,197,共7页
为优化网络功能虚拟化中服务功能链的设计和映射过程,提高物理资源利用率,提出一种基于虚拟网络功能(VNF)组合的服务功能链设计及映射算法A-VNFC.使用整数线性规划(ILP)模型,在小规模物理网络中求出目标函数总带宽消耗(TBC)的最优解,寻... 为优化网络功能虚拟化中服务功能链的设计和映射过程,提高物理资源利用率,提出一种基于虚拟网络功能(VNF)组合的服务功能链设计及映射算法A-VNFC.使用整数线性规划(ILP)模型,在小规模物理网络中求出目标函数总带宽消耗(TBC)的最优解,寻找可组合的VNF,并利用VNF决策树检查所有组合策略,通过迭代和优化降低TBC.仿真结果表明,A-VNFC算法可在不同场景下有效降低带宽消耗,其TBC数值接近ILP模型获得的最小带宽消耗值. 展开更多
关键词 网络功能虚拟化 服务功能链 虚拟网络功能 整数线性规划 带宽消耗
下载PDF
基于特征权重感知的VNF资源需求预测方法
17
作者 王怀芹 骆健 王海艳 《计算机科学》 CSCD 北大核心 2023年第9期331-336,共6页
虚拟网络功能(Virtual Network Function,VNF)以服务功能链(Service Function Chain,SFC)的形式提供服务,能够满足不同服务的性能需求。由于网络具有动态性,为VNF实例分配固定资源会导致VNF实例的资源过多或者不足的问题。以往的研究对... 虚拟网络功能(Virtual Network Function,VNF)以服务功能链(Service Function Chain,SFC)的形式提供服务,能够满足不同服务的性能需求。由于网络具有动态性,为VNF实例分配固定资源会导致VNF实例的资源过多或者不足的问题。以往的研究对于VNF配置文件相关网络负载特征的重要性未做区分,因此,提出了一种基于特征权重感知的动态VNF资源需求预测方法。首先,使用ECANet学习VNF特征的权重值,以此来减少无用特征对模型预测结果的消极影响。其次,由于VNF配置文件数据集具有结构化特性,构建VNF资源预测模型时需要考虑以加强特征交互的方式来挖掘特征间深层的相互关系,提出使用深度特征交互网络(Deep Feature-Interactive Network,DIN)增强网络负载特征与VNF性能特征之间的交互能力,提高模型预测精度。最后,在基准数据集上将所提方法与同类方法进行对比实验,发现其在预测的有效性与精确性上更具优势。 展开更多
关键词 资源预测 服务功能链 虚拟网络功能 高效通道注意力网络 特征交互
下载PDF
一种面向网络节能的VNF容量调整方法
18
作者 朱棣 申涓 +1 位作者 李丹 兰巨龙 《信息工程大学学报》 2023年第2期183-189,共7页
虚拟网络功能(VNF)容量调整因其能够显著提升网络服务提供过程中的资源利用率而成为研究热点,但该技术在实施时会导致网络能耗的升高。为解决该问题,提出一种面向网络节能的VNF容量调整方法。首先提出一种基于门控循环单元和注意力机制... 虚拟网络功能(VNF)容量调整因其能够显著提升网络服务提供过程中的资源利用率而成为研究热点,但该技术在实施时会导致网络能耗的升高。为解决该问题,提出一种面向网络节能的VNF容量调整方法。首先提出一种基于门控循环单元和注意力机制的VNF容量需求预测方法,然后根据VNF容量需求的预测结果,设计了一种基于深度强化学习的VNF容量需求映射方法完成VNF的容量调整,通过集中部署VNF实例和关闭网络中的空闲节点来降低网络能耗。实验结果表明,与经典的ORFA方法相比,所提方法提升了7.72%的资源利用率并降低了10.17%的网络能耗。 展开更多
关键词 虚拟网络功能 容量调整 资源利用率 能耗
下载PDF
资源碎片感知的服务功能链映射算法
19
作者 孙素云 唐彩虹 《计算机工程与设计》 北大核心 2024年第11期3264-3270,共7页
针对网络虚拟化环境中资源碎片问题,提出一种资源碎片感知的服务功能链路由算法。提出一种资源碎片化度量模型,用于定量地测量物理节点和物理链路的资源碎片化程度,将服务功能链映射问题转化为以最小化资源碎片为优化目标的整数线性规... 针对网络虚拟化环境中资源碎片问题,提出一种资源碎片感知的服务功能链路由算法。提出一种资源碎片化度量模型,用于定量地测量物理节点和物理链路的资源碎片化程度,将服务功能链映射问题转化为以最小化资源碎片为优化目标的整数线性规划模型,使用分步优化方法,解决动态网络环境中服务功能链映射问题。实验结果表明,与同类算法进行对比,SFC-RFA有效降低了资源碎片率,服务功能链请求接受率提高了12%~26%,资源利用率提高了7%~17%,取得了较好的负载均衡性能。 展开更多
关键词 网络功能虚拟化 软件定义网络 服务功能链 虚拟网络功能 资源碎片 网络资源 负载均衡
下载PDF
基于资源感知的多域服务功能链编排成本优化
20
作者 徐九韵 脱颖超 +1 位作者 赵耀鹏 李世宝 《计算机系统应用》 2024年第5期178-186,共9页
网络功能虚拟化技术的兴起使得实例化为服务功能链(SFC)的网络服务能够共享基底网络,缓解了传统网络体系结构僵化的问题.然而,网络中大量服务请求给多域SFC编排带来了新的挑战.首先由于域内网络资源信息及内部策略的保密性,使得多域SFC... 网络功能虚拟化技术的兴起使得实例化为服务功能链(SFC)的网络服务能够共享基底网络,缓解了传统网络体系结构僵化的问题.然而,网络中大量服务请求给多域SFC编排带来了新的挑战.首先由于域内网络资源信息及内部策略的保密性,使得多域SFC的编排更为复杂.其次多域SFC编排要确定最佳候选编排域集,先前的研究较少考虑域间负载的均衡性,对服务接受率造成了消极影响.此外跨网络域编排服务请求对服务的成本和响应时间提出了更严格的要求.为解决上述挑战,在本文中,我们首先针对多域网络隐私性需求,提出了域级图的构造方法;然后基于域间负载均衡提出了域权重的计算方法进行SFC编排域的选择;最后,针对多域网络成本和响应时间需求,提出编排算法.实验结果表明,提出的算法有效地权衡了平均服务成本和接受率,并且在服务平均响应时间方面也得到了优化. 展开更多
关键词 网络功能虚拟化 多域网络 服务功能链编排 资源感知编排 成本优化
下载PDF
上一页 1 2 10 下一页 到第
使用帮助 返回顶部