共查询到19条相似文献,搜索用时 46 毫秒
1.
2.
虚拟网络映射是网络虚拟化的关键问题之一,其目的是在满足虚拟网络资源需求的前提下,为该虚拟网络分配合适的底层网络节点和链路资源,从而在共享的物理网络基础设施之上构建彼此隔离的多重异构虚拟网络,为网络基础创新研究提供实验环境和平台,为网络新应用提供承载服务。论述了虚拟网络映射模型和映射算法,并提出基于最小割集理论设计VN映射算法。 相似文献
3.
4.
5.
该文针对现有的虚拟网络映射算法对网络中节点的拓扑属性考虑不够周到,导致其请求接受率和收益开销比较低的问题,将物理学里的场论思想引入了虚拟网络映射,并提出一种基于拓扑势的虚拟网络映射算法。该算法在节点映射阶段,通过计算节点的拓扑势、节点的资源能力、待映射节点与已映射节点之间的距离,将虚拟节点映射至最佳的物理节点。在链路映射阶段,通过计算物理路径的可用带宽和路径跳数,将虚拟链路映射至最佳的物理路径。仿真实验表明,该算法在多种虚拟网络到达强度下的请求接受率和收益开销比均优于当前的虚拟网络映射算法。 相似文献
6.
7.
针对透明弹性光网络环境下虚拟光链路映射过长和频谱碎片问题,该文提出一种节点重要性感知的协同映射算法。在节点映射阶段,设计节点重要性度量准则,评估未映射节点和已映射节点的邻近性,以及光路的频谱紧密度,以缓解链路频谱碎片和增强节点映射的紧凑性。同时,为了降低节点映射成功而链路映射失败的概率,提出一种节点-链路协同映射算法,当成功映射一对相邻虚拟节点时,立即映射他们之间的虚拟光链路,并分配频谱资源,最小化虚拟光链路所映射物理光路跳数。仿真结果表明,所提算法能够使用更少的频谱资源传输更多的虚拟光网络业务,且缩短了虚拟光链路映射长度。 相似文献
8.
9.
10.
11.
Virtual network (VN) mapping which deals with the allocation of network resources from the shared physical substrate to individual VNs is one of the key challenges for the application of realizing network virtualization. While a variety of state-of-the-art algorithms have attempted to address this issue from different aspects, the challenge still remains for mapping virtual link with hop count constraint. This paper presents a fast approximation path mapping algorithm to address this issue by formulating such virtual link mapping problem as a path-flow mathematical programming model, which aims to minimize the maximum link load factor. Through the use of the primal–dual method, a fully polynomial time approximation algorithm is proposed to solve this model. The experimental results show that the proposed algorithm can effectively solve the problem of path mapping with hop limit. 相似文献
12.
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 sub- algorithms, which are optimized for specific topologies. We develop star, tree, and ring topology algorithms as examples, other sub- algorithms 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.
Virtual network embedding (VNE) is a crucial technology for network virtualization to allocate network resource. Virtual network request in which node and link resource have great disparity will lead to unbal- anced resource distribution and lower acceptance ratio of virtual network requests. In this paper, we provide a vir- tual network embedding algorithm for load balance with various requests. It maps virtual nodes to substrate nodes of which node link residual resource ratio is closest to that of virtual nodes, and then maps the virtual link to physical path using shortest path first algorithm with the link node residual resource ratio constraint. Simulation shows that the provided algorithm can get higher acceptance ratio and network resource utilization for load balance. 相似文献
15.
针对现有异构网络嵌入方法导致的捕获关系冗余和模糊的问题,提出了一种基于孪生神经网络的深度异构网络嵌入模型。首先,基于面向关系的深度嵌入(Relation-Oriented Deep Embedding,RODE)框架构建了异构网络嵌入模型,以区分同型节点和异型节点之间的关系;其次,将同型节点与异类节点之间的相似性近似到低维空间,通过构建多任务的孪生神经网络来实现节点之间结构和语义关系的深度嵌入;最后,选取四个数据集执行典型网络挖掘任务,并与其他六种算法进行实验对比分析。实验结果表明,保持相同类型节点之间的相似性有助于提高节点分类效率,且损失函数在提高异构网络嵌入质量方面具有良好的优越性;RODE模型能够有效提高稀疏网络的嵌入质量,且具有良好的稳定性和鲁棒性。 相似文献
16.
17.
18.
针对虚拟网映射算法环境适应度低、拓扑关联性较差且映射开销较大的问题,该文提出一种环境自适应的拓扑联合感知虚拟网映射算法。首先提出一种加权相对熵排序方法对具有多指标的节点进行量化处理,依环境变化赋予节点指标不同的权值;在虚拟节点排序阶段采用加权相对熵和广度优先搜索算法双重排序,物理节点排序中引入就近度与加权相对熵算法配合使用,实现了对虚拟拓扑和物理拓扑的联合感知;最后利用k-最短路径算法完成虚拟链路映射。仿真结果表明,该算法依据环境变化自适应调整指标权值,提高了虚拟网映射成功率和收益开销比。 相似文献
19.
虚拟网映射是网络虚拟化研究中亟待解决的问题,针对已有映射算法中存在的对于网络拓扑信息利用不足的现状,该文提出了基于资源区域聚集度的虚拟网映射算法(RCI-VNE)。在映射预处理阶段,根据局部拓扑信息和区域资源聚集度提出节点区域资源聚集评价算法。在节点映射阶段,提出一种基于节点区域资源聚集排名的2-近邻聚集映射算法,该算法将虚拟网节点集中映射到底层网络中可用资源丰富的区域,减小承载链路的长度。实验结果表明,该算法降低了虚拟网映射开销,且具有较高的虚拟网请求接受率和较低的平均执行时间。 相似文献