面向可生存性的虛擬網(wǎng)絡(luò)映射算法研究
[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.
【學(xué)位授予單位】:北京郵電大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2017
【分類號】:TP393.0
【相似文獻(xiàn)】
相關(guān)期刊論文 前10條
1 ;虛擬網(wǎng)絡(luò)劍指“銅須”事件[J];信息網(wǎng)絡(luò)安全;2006年08期
2 柴振榮;虛擬網(wǎng)絡(luò):過去·現(xiàn)在·未來[J];管理科學(xué)文摘;1995年08期
3 葛晨陽,徐維樸;虛擬網(wǎng)絡(luò)教學(xué)[J];現(xiàn)代計(jì)算機(jī)(專業(yè)版);2001年08期
4 柏杏麗;虛擬網(wǎng)絡(luò)技術(shù)及應(yīng)用[J];鄭州經(jīng)濟(jì)管理干部學(xué)院學(xué)報(bào);2002年04期
5 李東輝;你是一個網(wǎng)民嗎?[J];管理工程師;2002年02期
6 王磊;周淑華;袁堅(jiān);任勇;山秀明;;虛擬網(wǎng)絡(luò)行為對互聯(lián)網(wǎng)整體特性的影響[J];物理學(xué)報(bào);2007年01期
7 景卉;周維剛;;計(jì)算主義下虛擬網(wǎng)絡(luò)復(fù)雜性探究[J];系統(tǒng)科學(xué)學(xué)報(bào);2008年01期
8 ;凹凸科技:給虛擬網(wǎng)絡(luò)一個真實(shí)的安全環(huán)境[J];計(jì)算機(jī)安全;2008年06期
9 王曉梅;;在線虛擬網(wǎng)絡(luò)實(shí)驗(yàn)平臺的設(shè)計(jì)與實(shí)現(xiàn)[J];計(jì)算機(jī)教育;2009年18期
10 秦培榮;;測試虛擬網(wǎng)絡(luò):您準(zhǔn)備好了嗎[J];電信網(wǎng)技術(shù);2010年05期
相關(guān)會議論文 前10條
1 劉輝邦;羅萱;黃保青;金耀輝;;云計(jì)算中虛擬網(wǎng)絡(luò)服務(wù)的性能測量及運(yùn)營實(shí)踐[A];中國高等教育學(xué)會教育信息化分會第十二次學(xué)術(shù)年會論文集[C];2014年
2 王穎;熊文成;李文t,
本文編號:2436088
本文鏈接:http://sikaile.net/guanlilunwen/ydhl/2436088.html