【摘要】：在最近二十多年的時間中，互聯(lián)網(wǎng)，或者稱為“網(wǎng)絡(luò)的網(wǎng)絡(luò)”，通過支持多種多樣的網(wǎng)絡(luò)技術(shù)和應(yīng)用，在現(xiàn)代社會、文化、知識、商業(yè)等與人們的生活息息相關(guān)的行業(yè)中一直扮演著至關(guān)重要的角色。但是，由于它的廣泛應(yīng)用以及multi-provider的性質(zhì)，互聯(lián)網(wǎng)的發(fā)展只是局限于簡單的更新現(xiàn)有設(shè)備或協(xié)議。 網(wǎng)絡(luò)虛擬化技術(shù)就是在這時被提出來的，用以應(yīng)對未來互聯(lián)網(wǎng)發(fā)展的架構(gòu)。網(wǎng)絡(luò)虛擬化能夠提供一個開放的、靈活的網(wǎng)絡(luò)環(huán)境，允許服務(wù)提供商在底層物理網(wǎng)絡(luò)上動態(tài)地組合成多個異構(gòu)的網(wǎng)絡(luò)體系結(jié)構(gòu)，也就是虛擬網(wǎng)絡(luò)�；谶@樣的靈活性的網(wǎng)絡(luò)環(huán)境，能夠促進(jìn)多元化的服務(wù)和應(yīng)用程序的部署。 網(wǎng)絡(luò)虛擬化領(lǐng)域的重要挑戰(zhàn)是虛擬網(wǎng)絡(luò)映射問題，旨在靜態(tài)或者動態(tài)地為虛擬節(jié)點和鏈路分配底層物理網(wǎng)絡(luò)的節(jié)點資源和鏈路資源，還需要同時滿足各自的資源約束。有效的利用物理資源需要高效的虛擬網(wǎng)絡(luò)映射技術(shù)，，本文主要從資源分配的角度出發(fā)，建立相關(guān)模型，并完成了一下工作： (1)前兩個章節(jié)主要敘述了網(wǎng)絡(luò)虛擬化的研究背景、研究現(xiàn)狀以及基本的技術(shù)特征。介紹了網(wǎng)絡(luò)運營模式在網(wǎng)絡(luò)虛擬化技術(shù)和傳統(tǒng)網(wǎng)絡(luò)技術(shù)中的不同，通過圖形給出了虛擬化模型的基本結(jié)構(gòu)。列舉出了影響映射的幾類因素，對虛擬網(wǎng)絡(luò)映射算法進(jìn)行了詳細(xì)的分類。 (2)由于目前網(wǎng)絡(luò)虛擬化研究主要放在網(wǎng)絡(luò)映射上，而對于虛擬網(wǎng)絡(luò)結(jié)構(gòu)的構(gòu)造卻幾近沒有，本文針對這一不足，提出了利用結(jié)構(gòu)優(yōu)化的思想進(jìn)行虛擬網(wǎng)映射的算法，同時進(jìn)行虛擬網(wǎng)絡(luò)的構(gòu)建和映射，在考慮結(jié)構(gòu)優(yōu)化的同時實現(xiàn)虛擬網(wǎng)絡(luò)映射，保證了虛擬網(wǎng)絡(luò)結(jié)構(gòu)在滿足用戶需求的情況下最優(yōu)。具體來說利用雙層規(guī)劃的建模方法，首先虛擬網(wǎng)提供商從最大化自己效用的角度出發(fā)決定虛擬網(wǎng)擴(kuò)展方案，然后用戶以自私的路由策略選擇路由，雙方博弈達(dá)到平衡，將這個stackelberg博弈表示為一個雙層規(guī)劃模型，上層決策者從系統(tǒng)的角度考慮是虛擬網(wǎng)系統(tǒng)優(yōu)化模型，下層從用戶的角度考慮，利用wardrop UE模型來滿足用戶的自私行為，雙層規(guī)劃利用用戶的路由選擇行為將虛擬網(wǎng)絡(luò)映射的兩個部分自然地看成一個整體，通過啟發(fā)式迭代算法獲得了該模型的解。實驗數(shù)據(jù)說明該模型具有較好的虛擬請求接受率、網(wǎng)絡(luò)收益和資源利用率。此外，對該模型進(jìn)行的擴(kuò)展，增加了約束條件，使該算法更具一般性。 (3)利用Stackelberg博弈分析物理網(wǎng)絡(luò)和虛擬網(wǎng)絡(luò)的博弈關(guān)系，建立二者收益函數(shù)的數(shù)學(xué)模型。并在不完全信息的條件下對模型求解，通過證明虛擬網(wǎng)絡(luò)效用函數(shù)的凹性，說明了Nash均衡點的存在性。與以往只考慮鏈路映射的方法不同，本文首次將節(jié)點考慮其中，同時進(jìn)行節(jié)點和鏈路的資源分配，利用轉(zhuǎn)換因子將節(jié)點映射轉(zhuǎn)變成一種特殊的鏈路映射，最后通過仿真模擬，驗證了該算法的有效性。
[Abstract]:In the last twenty years or so, the Internet, or "network of networks," has supported a wide variety of network technologies and applications in modern society, culture, and knowledge. Businesses and other industries that are closely related to people's lives have always played a vital role. However, due to its wide application and the nature of multi-provider, the development of the Internet is limited to simply updating existing devices or protocols. Network virtualization technology is proposed at this time to deal with the future development of the Internet architecture. Network virtualization can provide an open and flexible network environment, allowing service providers to dynamically combine into multiple heterogeneous network architectures on the underlying physical network, that is, virtual network. Based on this flexible network environment, it can facilitate the deployment of diversified services and applications. The important challenge in the field of network virtualization is the problem of virtual network mapping, which aims at allocating node and link resources of the underlying physical network to virtual nodes and links statically or dynamically, as well as satisfying their resource constraints at the same time. Effective use of physical resources requires efficient virtual network mapping technology. This paper mainly from the point of view of resource allocation, establish a related model, The main contents are as follows: (1) the first two chapters mainly describe the research background, research status and basic technical characteristics of network virtualization. This paper introduces the difference of network operation mode between network virtualization technology and traditional network technology, and gives the basic structure of virtualization model through graphics. This paper enumerates several kinds of factors that affect mapping, and classifies the algorithm of virtual network mapping in detail. (2) because the research of network virtualization is mainly focused on network mapping, but the construction of virtual network structure is almost non-existent. In this paper, a virtual network mapping algorithm based on the idea of structural optimization is proposed to construct and map the virtual network, which can realize the virtual network mapping while considering the structure optimization. It ensures that the virtual network structure is optimal in the case of satisfying the needs of users. Specifically, by using the modeling method of bilevel programming, firstly, the virtual network provider decides the virtual network extension scheme from the point of view of maximizing its own utility, and then the user chooses the route with selfish routing strategy, and the game is balanced. The stackelberg game is expressed as a bilevel programming model. The upper level decision makers consider the virtual network system optimization model from the system point of view, the lower layer considers from the user's point of view, and the wardrop UE model is used to satisfy the selfish behavior of the user. The two parts of the virtual network mapping are naturally regarded as a whole by using the routing behavior of the user in the bilevel programming and the solution of the model is obtained by heuristic iterative algorithm. Experimental data show that the model has good virtual request acceptance rate, network revenue and resource utilization. In addition, the expansion of the model increases the constraint conditions, which makes the algorithm more general. (3) the Stackelberg game is used to analyze the game relationship between the physical network and the virtual network, and the mathematical model of the income function of the two networks is established. Under the condition of incomplete information, the existence of Nash equilibrium point is proved by proving the concave of utility function of virtual network. Different from the previous method of only considering link mapping, this paper first considers the node and resource allocation of the node and the link, and transforms the node mapping into a special link mapping by using the conversion factor. Finally, the simulation is done. The validity of the algorithm is verified.
【學(xué)位授予單位】：山東師范大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TP393.01

【參考文獻(xiàn)】

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

1 陳來榮;張嵐;;基于雙層規(guī)劃的擁擠定價模型及算法[J];北京工業(yè)大學(xué)學(xué)報;2006年06期

2 安梅,高自友;提高公共交通需求量的靈敏度分析方法[J];公路交通科技;2000年03期

3 楊宇;陳山枝;李昕;王妍;;虛擬環(huán)境中基于Stackelberg博弈的資源分配[J];華中科技大學(xué)學(xué)報(自然科學(xué)版);2012年S1期

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

5 鄭明春;楊壽保;劉希玉;;基于博弈論的服務(wù)覆蓋網(wǎng)絡(luò)資源定價方法[J];中國科學(xué)技術(shù)大學(xué)學(xué)報;2010年04期

相關(guān)博士學(xué)位論文 前6條

1 呂博;網(wǎng)絡(luò)虛擬化資源管理架構(gòu)與映射算法研究[D];北京郵電大學(xué);2011年

2 劉文志;網(wǎng)絡(luò)虛擬化環(huán)境下資源管理關(guān)鍵技術(shù)研究[D];北京郵電大學(xué);2012年

3 孫罡;虛擬網(wǎng)絡(luò)的映射技術(shù)研究[D];電子科技大學(xué);2012年

4 卿蘇德;網(wǎng)絡(luò)虛擬化映射算法研究[D];北京郵電大學(xué);2013年

5 狄浩;虛擬網(wǎng)絡(luò)的高效和可靠映射算法研究[D];電子科技大學(xué);2013年

6 劉江;虛擬網(wǎng)絡(luò)映射機(jī)制與算法研究[D];北京郵電大學(xué);2012年

本文編號：2170260