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.展开更多
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. Howev...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.展开更多
针对服务功能链(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部署成本。展开更多
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.展开更多
组播在支持日益增长的多媒体应用方面具有广阔的应用前景,面向组播的虚拟网络功能放置是网络功能虚拟化中不可避免的研究趋势.然而,对于该问题的大多数研究都聚焦于静态网络环境,难以应对网络中的各种资源随着时间动态变化,组播服务功能...组播在支持日益增长的多媒体应用方面具有广阔的应用前景,面向组播的虚拟网络功能放置是网络功能虚拟化中不可避免的研究趋势.然而,对于该问题的大多数研究都聚焦于静态网络环境,难以应对网络中的各种资源随着时间动态变化,组播服务功能链(Service Function Chaining,SFC)请求动态到达的真实场景.本文提出一种基于组播SFC请求预测的足球联赛竞争算法,以Informer模型为基础,预测即将到达的组播SFC请求.基于足球联赛竞争的组播虚拟网络功能放置算法,设计多维个体编码策略,一次性求解所有活动组播组的SFC映射方案,提前部署预测的请求.针对预测结果与真实结果不一致的情况,提出一种由正向搜索与反向搜索组成的快速修复策略以完成对请求的快速响应.仿真结果表明,对比其它两种预测模型,Informer在组播SFC请求预测上取得了更低的均方误差与平均绝对误差.此外,与七种经典的启发式算法和深度强化学习算法相比,提出的算法在端到端时延和计算资源消耗方面达到更优性能的同时,取得了更低的组播SFC请求响应时间.展开更多
为解决移动边缘计算中面向用户的服务功能链(Service Function Chain,SFC)部署成本开销过大、时延过长问题,提出了针对SFC的支出成本与时延联合自适应优化的部署策略。首先,在虚拟网络功能(Virtualized Network Function,VNF)节点选取阶...为解决移动边缘计算中面向用户的服务功能链(Service Function Chain,SFC)部署成本开销过大、时延过长问题,提出了针对SFC的支出成本与时延联合自适应优化的部署策略。首先,在虚拟网络功能(Virtualized Network Function,VNF)节点选取阶段,考虑路径损耗这一无线信道衰落问题,根据有线用户与无线用户的位置情况,选择当前最佳节点以降低SFC的响应时延。其次,在服务节点配置阶段,根据用户请求处理的数据内容的新鲜度记录,自适应动态增加和删减相应的缓存,利用资源感知算法在保证数据传递可靠性的同时,减少服务节点的配置个数,降低配置开销。最后,在SFC部署阶段,利用基于KSP(K-shortest Paths)的功耗感知算法确定最佳节点映射排序与通信链路,在减少通信链路重映射的同时还能保证部署的SFC的低成本与低时延。实验仿真结果表明,相比于已有方案,该方法能够有效降低部署成本与时延,并能对不同用户的SFC部署做到自适应优化,提高了SFC的部署成功率。展开更多
软件定义网络(software-defined networking,SDN)和网络功能虚拟化(network function virtualization,NFV)为电力物联网业务编排提供了实现方法。针对电力物联网时延敏感业务编排问题,首先,提出基于SDN/NFV的电力物联网业务编排架构,满...软件定义网络(software-defined networking,SDN)和网络功能虚拟化(network function virtualization,NFV)为电力物联网业务编排提供了实现方法。针对电力物联网时延敏感业务编排问题,首先,提出基于SDN/NFV的电力物联网业务编排架构,满足定制化需求。然后,考虑多虚拟网络功能(virtual network function,VNF)嵌入、服务功能链(service function chain,SFC)有序性、以及电磁干扰影响,提出基于升价匹配的多阶段多对一VNF嵌入(pricing matching-based multi-phase many to one VNF embedding,PMVE)算法,在每个阶段实现不同SFC链上排序相同的VNF集合与物理节点集合间的匹配,从而最小化业务服务总时延。最后,通过算例验证了方法的可行性和有效性,仿真结果表明,相较于传统的双边匹配算法,所提算法可降低业务服务总时延29.9%、降低平均等待时延36.1%,保障电力物联网时延敏感业务需求。展开更多
基金supported in part by the National Natural Science Foundation of China(NSFC)under grant numbers U22A2007 and 62171010the Open project of Satellite Internet Key Laboratory in 2022(Project 3:Research on Spaceborne Lightweight Core Network and Intelligent Collaboration)the Beijing Natural Science Foundation under grant number L212003.
文摘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.
基金supported by the Foundation for Innovative Research Groups of the National Science Foundation of China (Grant No.61521003)The National Basic Research Program of China(973)(Grant No.2012CB315901,2013CB329104)+1 种基金The National Natural Science Foundation of China(Grant No.61372121,61309019,61309020)The National High Technology Research and Development Program of China(863)(Grant No.2015AA016102,2013AA013505)
文摘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.
文摘针对服务功能链(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部署成本。
基金This work was supported by the Key Research and Development(R&D)Plan of Heilongjiang Province of China(JD22A001).
文摘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 Chaining,SFC)请求动态到达的真实场景.本文提出一种基于组播SFC请求预测的足球联赛竞争算法,以Informer模型为基础,预测即将到达的组播SFC请求.基于足球联赛竞争的组播虚拟网络功能放置算法,设计多维个体编码策略,一次性求解所有活动组播组的SFC映射方案,提前部署预测的请求.针对预测结果与真实结果不一致的情况,提出一种由正向搜索与反向搜索组成的快速修复策略以完成对请求的快速响应.仿真结果表明,对比其它两种预测模型,Informer在组播SFC请求预测上取得了更低的均方误差与平均绝对误差.此外,与七种经典的启发式算法和深度强化学习算法相比,提出的算法在端到端时延和计算资源消耗方面达到更优性能的同时,取得了更低的组播SFC请求响应时间.
文摘软件定义网络(software-defined networking,SDN)和网络功能虚拟化(network function virtualization,NFV)为电力物联网业务编排提供了实现方法。针对电力物联网时延敏感业务编排问题,首先,提出基于SDN/NFV的电力物联网业务编排架构,满足定制化需求。然后,考虑多虚拟网络功能(virtual network function,VNF)嵌入、服务功能链(service function chain,SFC)有序性、以及电磁干扰影响,提出基于升价匹配的多阶段多对一VNF嵌入(pricing matching-based multi-phase many to one VNF embedding,PMVE)算法,在每个阶段实现不同SFC链上排序相同的VNF集合与物理节点集合间的匹配,从而最小化业务服务总时延。最后,通过算例验证了方法的可行性和有效性,仿真结果表明,相较于传统的双边匹配算法,所提算法可降低业务服务总时延29.9%、降低平均等待时延36.1%,保障电力物联网时延敏感业务需求。
