面向异构资源的虚拟抽象化映射算法

发布时间：2018-03-22 16:19

本文选题：虚拟化　切入点：映射算法　出处：《北京邮电大学》2017年硕士论文　论文类型：学位论文

【摘要】：网络虚拟化技术对于研究网络的发展具有非常大的意义。面向异构资源的网络虚拟化抽象映射是目前解决目前互联网发展瓶颈的一个重要途径,当前的网络体系架构比较的臃肿,不利于灵活的管理,合理的操控,并且整个网络扩展操作不容易实现。这也在很大程度上解决了网络体系架构的瓶颈问题。本文对虚拟化相关技术和面向异构资源的虚拟化映射算法进行了研究,主要的研究工作与所取得的成果有,本文主要研究了面向异构资源的网络虚拟化相关技术以及为虚拟化技术服务的虚拟化映射算法问题。从节点映射到链路映射,分别提出了不同的映射算法,提高映射过程中的对于底层物理网络的资源利用率。并且深入研究虚拟网络映射技术,其中包括由虚拟网络请求到底层物理链路的节点映射算法和链路映射算法。首先剖析了当前的网络虚拟化映射中的节点映射算法的局限性,然后提出了基于网页超链接的搜索算法,HITS算法拥有两种主要属性,一个是权威度属性,一个是枢纽度属性,这种算法的最大优势就是能够反映整个网络拓扑结构的资源情况,并且做到在整个网络拓扑的基础上合理分配资源。这种算法的两种属性之间也会相互制约、相互影响。最后通过仿真实现基于网页超链接搜索算法中对节点的一一映射,为从整体上合理分配资源打下基础。在链路映射阶段,主要研究了路径分割算法。通过比对一些其他链路映射算法,会发现路径分割算法这种链路映射算法,会在很大程度上提高资源的利用率,这种算法的最大优势就是将特定的需求分割到不同的底层物理链路上,充分利用资源。通过仿真,在节点映射的基础上,能够找到合适的链路映射。当链路映射失败时,通过节点重映射可以更好节点寻求合适的链路。
[Abstract]:Network virtualization technology is of great significance for studying the development of network. The abstract mapping of network virtualization oriented to heterogeneous resources is an important way to solve the bottleneck of Internet development at present. The current network architecture is bloated, which is not conducive to flexible management and reasonable manipulation. And the whole network extension operation is not easy to realize. This also solves the bottleneck problem of the network architecture to a great extent. This paper studies the virtualization related technology and the virtualization mapping algorithm for heterogeneous resources. The main research work and achievements are as follows: this paper mainly studies the network virtualization related technology for heterogeneous resources and the virtualization mapping algorithm for the virtualization technology, from node mapping to link mapping. Different mapping algorithms are proposed to improve the resource utilization of the underlying physical network, and the virtual network mapping technology is deeply studied. It includes node mapping algorithm and link mapping algorithm from virtual network request to underlying physical link. Firstly, the limitations of the current node mapping algorithm in network virtualization mapping are analyzed. Then, the paper proposes a hyperlink based search algorithm named hits algorithm, which has two main attributes, one is the authority attribute, the other is the hinge degree attribute. The biggest advantage of this algorithm is that it can reflect the resources of the whole network topology. The two attributes of this algorithm also restrict each other and affect each other. Finally, the mapping of nodes in the hyperlink search algorithm based on web pages is realized through simulation. In the stage of link mapping, the path segmentation algorithm is mainly studied. By comparing some other link mapping algorithms, we find that the path segmentation algorithm is a link mapping algorithm. It will greatly improve the utilization of resources. The biggest advantage of this algorithm is to divide specific requirements into different underlying physical links and make full use of resources. When the link mapping fails, the node remapping can better find the appropriate link.
【学位授予单位】：北京邮电大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP393.0

【相似文献】