共查询到16条相似文献,搜索用时 187 毫秒
1.
2.
3.
4.
5.
6.
7.
虚拟网络映射是网络虚拟化的关键问题之一,其目的是在满足虚拟网络资源需求的前提下,为该虚拟网络分配合适的底层网络节点和链路资源,从而在共享的物理网络基础设施之上构建彼此隔离的多重异构虚拟网络,为网络基础创新研究提供实验环境和平台,为网络新应用提供承载服务。论述了虚拟网络映射模型和映射算法,并提出基于最小割集理论设计VN映射算法。 相似文献
8.
提出了一个新的动态透明的虚拟网络嵌入(VNE)算法。该算法基于弹性光传输基础设施,同时考虑节点映射和链路映射,用于光正交频分复用(O-0FDM)的网络虚拟化。对每一个虚拟光网络(VON)的请求,该算法首先根据各光纤链路的频谱使用将底层光网络转化成一个分层辅助图,然后在该辅助图的单层上应用一个考虑了所有底层节点的本地信息的节点映射完成链接映射。仿真结果表明,该算法考虑了O-OFDM网络的独特性,并且由于算法提供较低的VON阻塞概率,优于直接应用VNE的参考算法。实际拓扑结构的仿真结果也表明,嵌入的底层路径的平均距离很好地被控制在O-OFDM信号的典型传输范围内。 相似文献
9.
10.
11.
Zhiguo Liu Lingyu Qin Qingli Liu Junmei Liu Yuanming Ding 《International Journal of Satellite Communications and Networking》2019,37(3):224-233
The virtual resource management architecture for satellite networks currently suffers from a very poor virtual network mapping success rate. This arises because of the need to map multiple heterogeneous virtual networks to the underlying satellite network. Most heuristic algorithms divide virtual network mapping into node mapping and link mapping, which aims to reduce the complexity of the problem. However, this approach is not well suited to highly dynamic satellite networks. In this paper, we propose a hybrid virtual network mapping algorithm that is based on threshold load. This takes the overall load for the nodes as its optimization objective, and combines the idea of backtracking contained in 1‐stage mapping methods and the idea of global optimization contained in 2‐stage mapping methods. The algorithm reduces the complexity of backtracking computation, while avoiding any incompleteness that might result from separating nodes and link mapping. The success rate for virtual network mapping is thus improved, as is the utilization rate for satellite network resources. 相似文献
12.
为解决采用单个虚拟网特征重配置导致虚拟网接受率低的问题,基于资源竞争特征重构底层网络模型,并基于此构建虚拟网映射线性规划模型。设计了无划分的随机舍入优化算法和有划分的随机舍入优化算法,为每个虚拟网分配全局最优的底层网络资源。与现有算法相比,该算法下虚拟网请求的平均接受率提升11%,节点资源平均利用率提升61%,链路资源平均利用率提升27%。 相似文献
13.
The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SDN flows,onto a shared substrate network automatically and efficiently.Previous researches mainly focus on developing heuristic algorithms for general topology virtual network.In practice however,the virtual network is usually generated with specific topology for specific purpose.Thus,it is a challenge to optimize the heuristic algorithms with these topology information.In order to deal with this problem,we propose a topology-cognitive algorithm framework,which is composed of a guiding principle for topology algorithm developing and a compound algorithm.The compound algorithm is composed of several subalgorithms,which are optimized for specific topologies.We develop star,tree,and ring topology algorithms as examples,other subalgorithms can be easily achieved following the same framework.The simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms,and the developed compound algorithm greatly enhances the performance of the Revenue/Cost(R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem. 相似文献
14.
针对无线网络链路可靠性差影响无线虚拟网络的分配这一问题,提出了一种基于链路可靠性的无线虚拟网络分配算法(WVNEA-LR)。该算法通过物理网络拓扑预处理和允许同一个虚拟请求中的多个虚拟节点映射到同一个物理节点上的方法,提高了Vn构建成功率和节约了物理链路资源。利用Q因子改善了因拓扑分配稀疏时Vn构建成功率低的问题。此外,WVNEA-LR的节点分配为链路分配作了准备,并通过选择可靠性高的承载路径保证了分配后的Vn具有高可靠性。仿真结果表明, WVNEA-LR获得较好的虚拟网络构建成功率、较高的收益成本比和资源利用率。 相似文献
15.
The virtual network embedding/mapping problem is a core issue of the network virtualization.It's mainly concerned with how to map virtual network requests to the substrate network efficiently.Previous ... 相似文献
16.
In order to solve the problem of virtual network mapping,a mapping method based on ant colony hybrid genetic algorithm was put forward under SDN environment,which established a linear programming model for virtual network mapping,and divided the mapping process into node mapping and link mapping.Firstly,the fusion algorithm was adopted,in which virtual nodes were mapped to physical nodes.Then the shortest path algorithm was used to map the virtual link to a physical link.On this basis,the acceptance ratio of virtual network requests can be improved.Simulation experiment results show that acceptance rate of virtual network requests can be increased by 10% efficiently using the ant colony hybrid genetic algorithm,compared with existing mapping algorithms D-ViNE,RW-BFS and R-ViNE.Further more,proposed method can greatly improve the average utilization rate of nodes and links and the ratio of the mapping income to cost. 相似文献