本文選題：網(wǎng)絡(luò)虛擬化 + 虛擬網(wǎng)絡(luò)映射��； 參考：《北京郵電大學(xué)》2014年博士論文

【摘要】：網(wǎng)絡(luò)虛擬化是克服當(dāng)前互聯(lián)網(wǎng)發(fā)展和創(chuàng)新“僵化”困局的有效途徑,并不斷地得到新技術(shù)、新應(yīng)用的支持,吸引了越來(lái)越多的關(guān)注。網(wǎng)絡(luò)虛擬化的目標(biāo)是要通過(guò)抽象、分配和重構(gòu)等方法在公共的底層物理網(wǎng)絡(luò)之上構(gòu)建出完全虛擬化的網(wǎng)絡(luò)環(huán)境。在虛擬網(wǎng)絡(luò)環(huán)境中,虛擬化平臺(tái)屏蔽底層基礎(chǔ)網(wǎng)絡(luò)的具體實(shí)現(xiàn),在其之上構(gòu)建虛擬網(wǎng)絡(luò)環(huán)境,控制可用的虛擬資源,根據(jù)業(yè)務(wù)和需求定制網(wǎng)絡(luò)架構(gòu)和網(wǎng)絡(luò)協(xié)議并實(shí)時(shí)地、動(dòng)態(tài)地調(diào)用和調(diào)節(jié)底層網(wǎng)絡(luò)資源。作為實(shí)現(xiàn)未來(lái)網(wǎng)絡(luò)的關(guān)鍵技術(shù),網(wǎng)絡(luò)虛擬化技術(shù)有助于解決當(dāng)代網(wǎng)絡(luò)的現(xiàn)有問(wèn)題,并將新技術(shù)的實(shí)驗(yàn)和應(yīng)用成為可能,具有很大的靈活性。網(wǎng)絡(luò)虛擬化技術(shù)對(duì)于未來(lái)網(wǎng)絡(luò)的發(fā)展有著重要的意義：其一、它通過(guò)創(chuàng)建未來(lái)網(wǎng)絡(luò)的實(shí)驗(yàn)平臺(tái),能夠支持更加有效地驗(yàn)證最新提出的新技術(shù)和新架構(gòu),使得多種創(chuàng)新型的網(wǎng)絡(luò)架構(gòu)可以在同一個(gè)共享的物理基礎(chǔ)設(shè)施上并行運(yùn)行而互不干擾；其二,它能夠?qū)崿F(xiàn)數(shù)據(jù)平面和控制平面的分離,這體現(xiàn)了其本質(zhì)特征是要對(duì)物理資源和行為進(jìn)行抽象化,這種特征也正在逐漸成為未來(lái)網(wǎng)絡(luò)體系結(jié)構(gòu)的一個(gè)基本功能。 虛擬網(wǎng)絡(luò)映射問(wèn)題是指,將從不同用戶收集到的虛擬網(wǎng)絡(luò)請(qǐng)求有效、高效和健壯的分配到給定的實(shí)體網(wǎng)絡(luò)上,并且能夠滿足這些虛擬請(qǐng)求對(duì)于物理資源(比如節(jié)點(diǎn)計(jì)算能力、鏈路帶寬等)的要求。虛擬網(wǎng)絡(luò)映射算法的性能和效果對(duì)于網(wǎng)絡(luò)虛擬化技術(shù)的實(shí)用化和產(chǎn)業(yè)化有學(xué)術(shù)上的指導(dǎo)意義,具有重要的研究?jī)r(jià)值。本文將對(duì)虛擬網(wǎng)絡(luò)的映射策略和映射算法進(jìn)行專題的研究和探討,以虛擬網(wǎng)絡(luò)請(qǐng)求的接受率、實(shí)體網(wǎng)絡(luò)資源利用率、算法實(shí)時(shí)性等指標(biāo)作為評(píng)價(jià)指標(biāo),提出有效和高效的新算法,并擴(kuò)展應(yīng)用到更加實(shí)際的網(wǎng)絡(luò)環(huán)境中,推進(jìn)不斷的改進(jìn)和優(yōu)化,進(jìn)而構(gòu)建一個(gè)包含多種算法的虛擬網(wǎng)絡(luò)映射研究平臺(tái)和一整套有效、高效、健壯和可行的虛擬網(wǎng)絡(luò)映射解決方案,利于開(kāi)展進(jìn)一步的研究工作。本文的主要?jiǎng)?chuàng)新包括以下幾個(gè)方面： 1)虛擬網(wǎng)絡(luò)映射的目標(biāo)是有效地、高效地和健壯地將虛擬網(wǎng)絡(luò)請(qǐng)求的虛擬節(jié)點(diǎn)和虛擬鏈路映射到實(shí)體網(wǎng)絡(luò)的資源上。以前的研究側(cè)重于設(shè)計(jì)基于啟發(fā)式算法或嘗試通過(guò)兩個(gè)階段解決方案求解,節(jié)點(diǎn)映射是第一階段,鏈路映射是第二階段。我提出一個(gè)新的基于整數(shù)規(guī)劃的虛擬網(wǎng)絡(luò)映射算法。通過(guò)建立一個(gè)增強(qiáng)的實(shí)體網(wǎng)絡(luò)模型來(lái)將虛擬網(wǎng)絡(luò)映射問(wèn)題定義為由一個(gè)目標(biāo)函數(shù)和一些約束組成的整形規(guī)劃問(wèn)題,求解這個(gè)數(shù)學(xué)問(wèn)題就可以得到最優(yōu)化的映射結(jié)果。一個(gè)拓?fù)湎嚓P(guān)的因子將被添加到目標(biāo)函數(shù)中。此方法在一個(gè)步驟內(nèi)解決了虛擬網(wǎng)絡(luò)映射問(wèn)題。仿真結(jié)果清楚地表明,這個(gè)算法大大提高了性能的接受率,增加了收益/成本比和收益的同時(shí)減少了虛擬網(wǎng)絡(luò)映射的成本。 2)基于整數(shù)規(guī)劃的虛擬網(wǎng)絡(luò)映射算法是一個(gè)有效和高效的映射算法。但這個(gè)算法的的應(yīng)用場(chǎng)景沒(méi)有考慮物理網(wǎng)絡(luò)資源可能發(fā)生故障的情形,這就是所謂可生存的虛擬網(wǎng)絡(luò)嵌入問(wèn)題。過(guò)去的網(wǎng)絡(luò)虛擬化的可生存策略,通過(guò)提供預(yù)先備份的物理資源,并將所有類型的物理故障作為一個(gè)或者多個(gè)鏈路故障處理。在本文中,我提出了動(dòng)態(tài)恢復(fù)(Dynamic Recovery)方法并來(lái)解決可生存的虛擬網(wǎng)絡(luò)映射問(wèn)題,這個(gè)方法是基于整數(shù)規(guī)劃的虛擬網(wǎng)絡(luò)嵌入算法之上運(yùn)用的。首先,動(dòng)態(tài)恢復(fù)算法不需要提前備份物理資源,使得在嵌入的時(shí)候有更多的物理資源可以使用。其次,只有當(dāng)物理故障發(fā)生時(shí)動(dòng)態(tài)恢復(fù)過(guò)程才會(huì)被激活。最后,它分別使用不同的算法來(lái)恢復(fù)節(jié)點(diǎn)故障和鏈路故障。仿真結(jié)果表明,該方法能夠成功地通過(guò)尋找替代節(jié)點(diǎn)和路徑恢復(fù)絕大多數(shù)的物理故障,而且它的各項(xiàng)性能非常接近不考慮物理故障的純虛擬網(wǎng)絡(luò)映射的試驗(yàn)結(jié)果。 3)為了提高虛擬網(wǎng)絡(luò)映射算法的適應(yīng)性,節(jié)省計(jì)算時(shí)間和計(jì)算空間并提高虛擬網(wǎng)絡(luò)映射的成功率,我提出了一個(gè)將大的虛擬網(wǎng)絡(luò)請(qǐng)求提前進(jìn)行分割為多個(gè)子網(wǎng)絡(luò)然后再依次進(jìn)行映射的虛擬網(wǎng)絡(luò)映射改進(jìn)策略。首先,說(shuō)明提出改進(jìn)策略的動(dòng)機(jī)。其次,對(duì)于達(dá)到一定規(guī)模的虛擬網(wǎng)絡(luò)圖形進(jìn)行分割為數(shù)個(gè)虛擬網(wǎng)絡(luò)子圖subVNs。最后,分別對(duì)每個(gè)子圖進(jìn)行虛擬網(wǎng)絡(luò)嵌入操作并合并得到的結(jié)果。仿真結(jié)果表明,該方法提高了虛擬網(wǎng)絡(luò)嵌入的接受率,節(jié)省了運(yùn)算時(shí)間。通過(guò)分割網(wǎng)絡(luò)拓?fù)?使得將較大較復(fù)雜的虛擬網(wǎng)絡(luò)請(qǐng)求更容易映射成功,甚至可以滿足虛擬節(jié)點(diǎn)數(shù)大于實(shí)體節(jié)點(diǎn)數(shù)的虛擬網(wǎng)絡(luò)映射條件。因此,分割大的虛擬網(wǎng)絡(luò)圖形再進(jìn)行虛擬嵌入的方式是虛擬網(wǎng)絡(luò)映射一個(gè)可以參考的改進(jìn)方向。
[Abstract]:Network virtualization is an effective way to overcome the "rigid" dilemma of the current Internet development and innovation, and the support of new technologies and new applications has attracted more and more attention. The goal of network virtualization is to build a completely virtualized network on the public underlying physical network through the methods of abstraction, distribution and reconstruction. In the virtual network environment, the virtualization platform shields the concrete realization of the underlying underlying network, constructs a virtual network environment on it, controls the available virtual resources, customize the network architecture and network protocols according to business and requirements, and dynamically invoke and adjust the underlying network resources in real time as the key to the realization of the future network. Technology, network virtualization technology can help solve the existing problems of contemporary network, and make the experiment and application of new technology possible. It has great flexibility. The network virtualization technology has important significance for the development of the future network. First, it can support more effective verification by creating the experimental platform of the future network. The latest technology and new architecture make a variety of innovative network architectures run parallel to the same shared physical infrastructure and do not interfere with each other; secondly, it can separate the data plane from the control plane, which embodies the essence of the abstraction of physical resources and behavior. It is becoming a basic function of network architecture in the future.
Virtual network mapping problem is that virtual network requests collected from different users are effective, efficient and robust on a given entity network, and can meet the requirements of these virtual requests for physical resources such as node computing power, link bandwidth, etc. the performance and effect of the virtual network mapping algorithm are on the network. The practical and industrialization of virtualization technology has academic guiding significance. It has important research value. This paper will study and discuss the mapping strategy and mapping algorithm of virtual network, take the acceptance rate of the virtual network request, the utilization rate of the entity network resources, the real time of calculation and so on as the evaluation index, and put forward the effectiveness. And high efficient new algorithms, and extended to a more practical network environment, and promote continuous improvement and optimization, and then build a virtual network mapping research platform containing a variety of algorithms and a set of effective, efficient, robust and feasible virtual network mapping solutions for further research. This paper is the main part of this paper. The innovation includes the following aspects:
1) the goal of virtual network mapping is to effectively and effectively map virtual nodes and virtual links of virtual networks to the resources of the entity network. The previous research focused on the design based on heuristic algorithms or attempts to solve the solution through two stages. The node mapping is the first stage and the link mapping is the second order. I propose a new virtual network mapping algorithm based on integer programming. By establishing an enhanced entity network model, the virtual network mapping problem is defined as a plastic planning problem composed of a target function and some constraints. The optimal mapping results can be obtained by solving this mathematical problem. A topology phase can be obtained. The relational factor will be added to the target function. This method solves the virtual network mapping problem in one step. The simulation results clearly show that the algorithm greatly improves the performance acceptance rate, increases the revenue / cost ratio and the revenue, and reduces the cost of the virtual network mapping.
2) the virtual network mapping algorithm based on integer programming is an efficient and efficient mapping algorithm. However, the application scenario of this algorithm does not take into account the possible failure of physical network resources. This is the so-called survivable virtual network embedding problem. The survivability strategy of the past network virtualization is provided by providing pre backup. In this paper, I proposed the dynamic recovery (Dynamic Recovery) method to solve the survivable virtual network mapping problem. This method is based on the virtual network embedding algorithm based on integer programming. First, dynamic recovery. The algorithm does not need to backup physical resources in advance, so that more physical resources can be used when embedded. Secondly, only the dynamic recovery process will be activated only when the physical failure occurs. Finally, it uses different algorithms to restore node failure and link fault. Finding alternative nodes and paths to restore most of the physical failures, and its performance is very close to the test results of a pure virtual network mapping that does not consider physical failures.
3) in order to improve the adaptability of the virtual network mapping algorithm, save computing time and computing space and improve the success rate of virtual network mapping, I propose an improved strategy for the virtual network mapping of a large virtual network request to be divided into multiple subnetworks in advance and then mapping in turn. First, the improvement strategy is presented. Secondly, the virtual network graph which reaches a certain scale is divided into several virtual network subgraphs subVNs. at the end, and each subgraph is embedded in the virtual network and the results are merged respectively. The simulation results show that the method improves the acceptance rate of the virtual network embedded and saves the operation time. Through the segmentation network, the simulation results show that the method can save the operation time. Topology makes it easier to map the larger and more complex virtual network requests more easily, and can even satisfy the virtual network mapping condition that the number of virtual nodes is larger than the number of entity nodes. Therefore, the way of virtual network embedding of large virtual network graphics is an improved direction for virtual network mapping.
【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.01

【參考文獻(xiàn)】

相關(guān)期刊論文 前7條

1 ;A new algorithm based on the proximity principle for the virtual network embedding problem[J];Journal of Zhejiang University-Science C(Computers & Electronics);2011年11期

2 Bo LU;Jian-ya CHEN;Hong-yan CUI;Tao HUANG;Yun-jie LIU;;A virtual network mapping algorithm based on integer programming[J];Journal of Zhejiang University-Science C(Computers and Electronics);2013年12期

3 房秉毅;張?jiān)朴?陳清金;賈興華;;云計(jì)算網(wǎng)絡(luò)虛擬化技術(shù)[J];信息通信技術(shù);2011年01期

4 程祥;張忠寶;蘇森;楊放春;;虛擬網(wǎng)絡(luò)映射問(wèn)題研究綜述[J];通信學(xué)報(bào);2011年10期

5 劉江;陸明泉;王忠勇;;RBUKF算法在GPS實(shí)時(shí)定位解算中的應(yīng)用[J];系統(tǒng)工程與電子技術(shù);2009年11期

6 ;New algorithm for hub-and-spoke topological virtual networks embedding problem[J];The Journal of China Universities of Posts and Telecommunications;2012年01期

7 ;Adaptive scheme based on status feedback for virtual network mapping[J];The Journal of China Universities of Posts and Telecommunications;2011年05期

，

本文編號(hào)：1949994