面向可生存性的虚拟网络映射算法研究
发布时间：2019-03-07 11:48
【摘要】：为了应对网络“臃肿”问题,同时为了给网络创新架构提供实验环境,网络虚拟化技术受到越来越多的关注。为了实现高效的虚拟化,需要设计相应的虚拟网络映射算法。但是在现阶段的虚拟网络映射算法,大多是从如何提高对底层网络的利用率、降低算法的时间复杂度等角度出发,而对虚拟网络的可生存性的研究就非常的少。本文主要是从虚拟网络的可生存性出发,设计了面向可生存性的虚拟网络映射算法。首先是面向全局可生存性的算法研究,即当底层网络发生故障失效时,通过可生存性算法得出映射方案的请求,受到失效影响的数量更少。本文利用复杂网络的k-core理论,设计基于k-core理论的虚拟网络映射算法。该算法能够把复杂的虚拟网络进行分解,将其变换成shell结构组成的网络,然后再对其进行映射。同时,在基于k-core理论的虚拟网络映射算法中,引入了负载均衡的思想。在链路映射阶段,将虚拟链路和物理链路进行切片化处理,使得虚拟请求能够被均匀的映射到底层网络。通过仿真结果证明,基于k-core理论的虚拟网络映射算法不仅从全局出发提高了虚拟网络的可生存性,同时还能提升单位底层资源的收益。然后从一个虚拟网络的可生存性角度出发,即当该虚拟请求占用的底层网络发生故障时,能够继续工作的能力,设计基于链路自备份的虚拟网络映射算法。该算法借助于最小深度生成树算法,对虚拟请求链路和带宽进行将拓展,然后再对其进行映射。最后通过仿真结果证明,基于链路自备份的虚拟网络映射算法能够有效降低备份资源,提高了收益。
[Abstract]:In order to deal with the problem of network bloated, and to provide experimental environment for network innovation architecture, network virtualization technology has attracted more and more attention. In order to achieve efficient virtualization, the corresponding virtual network mapping algorithm needs to be designed. However, at present, most of the virtual network mapping algorithms are based on how to improve the utilization of the underlying network and reduce the time complexity of the algorithm, but the research on the survivability of the virtual network is very little. In this paper, based on the survivability of virtual network, a survivability-oriented mapping algorithm for virtual network is designed. Firstly, the global survivability-oriented algorithm is studied, that is, when the underlying network fails, the request of mapping scheme is obtained by the survivability algorithm, and the number of the mapping schemes is less affected by the failure. In this paper, the k-core theory of complex networks is used to design a virtual network mapping algorithm based on k-core theory. The algorithm can decompose the complex virtual network, transform it into a network composed of shell structure, and then map it. At the same time, in the virtual network mapping algorithm based on k-core theory, the idea of load balancing is introduced. In the link mapping phase, the virtual link and the physical link are segmented, so that the virtual request can be evenly mapped to the underlying network. The simulation results show that the virtual network mapping algorithm based on the k-core theory not only improves the survivability of the virtual network from the global perspective, but also improves the profit of the unit bottom resource. Then from the point of view of survivability of a virtual network, that is, the ability to continue working when the underlying network occupied by the virtual request fails, a virtual network mapping algorithm based on link-self-backup is designed. With the help of the minimum depth spanning tree algorithm, the virtual request link and bandwidth will be expanded and then mapped. Finally, the simulation results show that the virtual network mapping algorithm based on link-self-backup can effectively reduce the backup resources and improve the revenue.
【学位授予单位】：北京邮电大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP393.0
[Abstract]:In order to deal with the problem of network bloated, and to provide experimental environment for network innovation architecture, network virtualization technology has attracted more and more attention. In order to achieve efficient virtualization, the corresponding virtual network mapping algorithm needs to be designed. However, at present, most of the virtual network mapping algorithms are based on how to improve the utilization of the underlying network and reduce the time complexity of the algorithm, but the research on the survivability of the virtual network is very little. In this paper, based on the survivability of virtual network, a survivability-oriented mapping algorithm for virtual network is designed. Firstly, the global survivability-oriented algorithm is studied, that is, when the underlying network fails, the request of mapping scheme is obtained by the survivability algorithm, and the number of the mapping schemes is less affected by the failure. In this paper, the k-core theory of complex networks is used to design a virtual network mapping algorithm based on k-core theory. The algorithm can decompose the complex virtual network, transform it into a network composed of shell structure, and then map it. At the same time, in the virtual network mapping algorithm based on k-core theory, the idea of load balancing is introduced. In the link mapping phase, the virtual link and the physical link are segmented, so that the virtual request can be evenly mapped to the underlying network. The simulation results show that the virtual network mapping algorithm based on the k-core theory not only improves the survivability of the virtual network from the global perspective, but also improves the profit of the unit bottom resource. Then from the point of view of survivability of a virtual network, that is, the ability to continue working when the underlying network occupied by the virtual request fails, a virtual network mapping algorithm based on link-self-backup is designed. With the help of the minimum depth spanning tree algorithm, the virtual request link and bandwidth will be expanded and then mapped. Finally, the simulation results show that the virtual network mapping algorithm based on link-self-backup can effectively reduce the backup resources and improve the revenue.
【学位授予单位】：北京邮电大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP393.0
【相似文献】
相关期刊论文 前10条
1 ;虚拟网络剑指“铜须”事件[J];信息网络安全;2006年08期
2 柴振荣;虚拟网络:过去·现在·未来[J];管理科学文摘;1995年08期
3 葛晨阳,徐维朴;虚拟网络教学[J];现代计算机(专业版);2001年08期
4 柏杏丽;虚拟网络技术及应用[J];郑州经济管理干部学院学报;2002年04期
5 李东辉;你是一个网民吗?[J];管理工程师;2002年02期
6 王磊;周淑华;袁坚;任勇;山秀明;;虚拟网络行为对互联网整体特性的影响[J];物理学报;2007年01期
7 景卉;周维刚;;计算主义下虚拟网络复杂性探究[J];系统科学学报;2008年01期
8 ;凹凸科技:给虚拟网络一个真实的安全环境[J];计算机安全;2008年06期
9 王晓梅;;在线虚拟网络实验平台的设计与实现[J];计算机教育;2009年18期
10 秦培荣;;测试虚拟网络:您准备好了吗[J];电信网技术;2010年05期
相关会议论文 前10条
1 刘辉邦;罗萱;黄保青;金耀辉;;云计算中虚拟网络服务的性能测量及运营实践[A];中国高等教育学会教育信息化分会第十二次学术年会论文集[C];2014年
2 王颖;熊文成;李文t，
本文编号：2436088
本文链接：https://www.wllwen.com/guanlilunwen/ydhl/2436088.html
