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.展开更多
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.展开更多
针对服务功能链(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部署成本。展开更多
The combination of network function virtualization and software-defined networking allows various network functions to process flows according to their characteristics and requirements.Due to the highly dynamic nature...The combination of network function virtualization and software-defined networking allows various network functions to process flows according to their characteristics and requirements.Due to the highly dynamic nature of the workload,the network infrastructure needs to properly schedule the underlying resources in order to respond to workload changes in a timely manner.However,the existing NFV platform lacks a comprehensive solution for how to scale under workload variation,which may seriously hurt the overall system performance.To improve the scalability of the NFV platform and ensure consistent high performance under dynamic workloads,we propose AdaptNF,a novel NFV platform designed to support a combination of course-grained and fine-grained resource scheduling strategies.To deal with resource imbalance,which is the essential scheduling problem that leads to insufficient NFV performance,AdaptNF adopts a novel algorithm that can efficiently balance the workload among multiple network function instances through stateless flow migration.Our controlled experiments show that the AdaptNF scheme can optimize resource allocation and ensure outstanding performance after scaling.In terms of network throughput and latency,AdaptNF significantly improves the performance of the underlying NFV platform.展开更多
基金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.
基金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.
文摘针对服务功能链(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部署成本。
基金supported by the Guangdong Province Key Area R&D Program under grant No.2018B010113001National Key Research and Development Program of China under Grant No.2018YFB1804704+1 种基金National Natural Science Foundation of China under grant No.61902171the Shenzhen Key Lab of Software Defined Networking under grant No.ZDSYS20140509172959989.
文摘The combination of network function virtualization and software-defined networking allows various network functions to process flows according to their characteristics and requirements.Due to the highly dynamic nature of the workload,the network infrastructure needs to properly schedule the underlying resources in order to respond to workload changes in a timely manner.However,the existing NFV platform lacks a comprehensive solution for how to scale under workload variation,which may seriously hurt the overall system performance.To improve the scalability of the NFV platform and ensure consistent high performance under dynamic workloads,we propose AdaptNF,a novel NFV platform designed to support a combination of course-grained and fine-grained resource scheduling strategies.To deal with resource imbalance,which is the essential scheduling problem that leads to insufficient NFV performance,AdaptNF adopts a novel algorithm that can efficiently balance the workload among multiple network function instances through stateless flow migration.Our controlled experiments show that the AdaptNF scheme can optimize resource allocation and ensure outstanding performance after scaling.In terms of network throughput and latency,AdaptNF significantly improves the performance of the underlying NFV platform.
