【摘要】：近些年來(lái)，隨著網(wǎng)絡(luò)中越來(lái)越多的分布式應(yīng)用和新興網(wǎng)絡(luò)技術(shù)的出現(xiàn)，互聯(lián)網(wǎng)體系結(jié)構(gòu)“僵化”問(wèn)題已經(jīng)成為其發(fā)展的重要桎梏。網(wǎng)絡(luò)虛擬化技術(shù)允許多個(gè)異構(gòu)網(wǎng)絡(luò)同時(shí)在同一個(gè)基礎(chǔ)物理網(wǎng)絡(luò)架構(gòu)上存在，并且相互獨(dú)立，互不干涉，其在一定程度上緩解了互聯(lián)網(wǎng)體系結(jié)構(gòu)“僵化”問(wèn)題給網(wǎng)絡(luò)技術(shù)發(fā)展帶來(lái)的阻礙。而網(wǎng)絡(luò)虛擬化技術(shù)實(shí)現(xiàn)的最大挑戰(zhàn)就是,在最大化利用底層物理資源和提高基礎(chǔ)架構(gòu)提供商利益的條件下，如何更加有效地為盡可能多的虛擬網(wǎng)絡(luò)分配合適的底層物理資源，即虛擬網(wǎng)絡(luò)映射問(wèn)題。 為了解決虛擬網(wǎng)絡(luò)映射問(wèn)題，本文以底層物理網(wǎng)絡(luò)資源利用率最大化為目標(biāo)，建立了在控制轉(zhuǎn)發(fā)分離網(wǎng)絡(luò)構(gòu)架下基于用戶優(yōu)先級(jí)的虛擬網(wǎng)絡(luò)映射整數(shù)線性規(guī)劃模型，并提出了一種基于離散空間的改進(jìn)粒子群算法。該算法以底層物理網(wǎng)絡(luò)剩余資源為適度函數(shù)，對(duì)于粒子群算法中粒子的位置、速度和相關(guān)操作進(jìn)行了重新定義，使得其在迭代的過(guò)程中，粒子進(jìn)化更具方向性，同時(shí)引進(jìn)不同粒子位置互斥性用以解決粒子群算法易早熟陷入局部最優(yōu)解的缺陷。通過(guò)仿真實(shí)驗(yàn)的數(shù)據(jù)，我們可以分析得出改進(jìn)粒子群算法在解決虛擬網(wǎng)絡(luò)問(wèn)題的可行性和高效性。 為了將虛擬網(wǎng)絡(luò)映射功能真正應(yīng)用于實(shí)際，，本文針對(duì)以O(shè)penflow交換機(jī)搭建的底層物理網(wǎng)絡(luò)，設(shè)計(jì)并開(kāi)發(fā)了虛擬網(wǎng)絡(luò)部署系統(tǒng)。該系統(tǒng)通過(guò)Web Service技術(shù)將虛擬網(wǎng)絡(luò)映射算法封裝成Web服務(wù)，滿足不同用戶使用需求。系統(tǒng)通過(guò)獲取用戶應(yīng)用需求，自動(dòng)生成虛擬網(wǎng)絡(luò)并完成映射，將映射結(jié)果返回給用戶，并且轉(zhuǎn)化為交換機(jī)配置信息交給底層網(wǎng)絡(luò)，真正將虛擬網(wǎng)絡(luò)成功部署到底層網(wǎng)絡(luò)。
[Abstract]:In recent years, with more and more distributed applications and emerging network technologies in the network, the problem of "rigid" Internet architecture has become an important shackles of its development. Network virtualization technology allows multiple heterogeneous networks to exist simultaneously on the same physical network architecture, independent of each other and non-interference with each other. To some extent, it alleviates the hindrance to the development of network technology caused by the "rigidity" of Internet architecture. The biggest challenge of network virtualization is how to allocate appropriate physical resources to as many virtual networks as possible under the conditions of maximizing the use of underlying physical resources and improving the benefits of infrastructure providers. That is, virtual network mapping problem. In order to solve the problem of virtual network mapping, an integer linear programming model of virtual network mapping based on user priority is established in order to maximize the utilization of the underlying physical network resources. An improved particle swarm optimization algorithm based on discrete space is proposed. The algorithm takes the remaining resources of the underlying physical network as the appropriate function, and redefines the position, velocity and related operations of the particles in the particle swarm optimization algorithm, which makes the evolution of particles more directional in the iterative process. At the same time, the mutual exclusion of different particle positions is introduced to solve the problem that particle swarm optimization algorithm is prone to premature falling into local optimal solution. The feasibility and efficiency of the improved particle swarm optimization (PSO) algorithm in solving the virtual network problem can be analyzed by the data of simulation experiment. In order to truly apply the virtual network mapping function to practice, this paper designs and develops a virtual network deployment system for the underlying physical network based on Openflow switch. The system encapsulates the virtual network mapping algorithm into Web service through Web Service technology to meet the needs of different users. By obtaining the user's application requirements, the system automatically generates the virtual network and completes the mapping, returns the mapping result to the user, and converts the configuration information of the switch to the underlying network, and truly deploys the virtual network to the underlying network successfully.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TP393.01

【參考文獻(xiàn)】

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

1 李文;吳春明;陳鍵;平玲娣;;節(jié)點(diǎn)可重復(fù)映射和鏈路可分流的虛擬網(wǎng)映射算法[J];電信科學(xué);2010年10期

2 程祥;張忠寶;蘇森;楊放春;;基于粒子群優(yōu)化的虛擬網(wǎng)絡(luò)映射算法[J];電子學(xué)報(bào);2011年10期

3 陳曉梅;黨崗;蘇金樹(shù);;引入價(jià)格因素的網(wǎng)絡(luò)資源分配模型與算法實(shí)現(xiàn)[J];國(guó)防科技大學(xué)學(xué)報(bào);2007年06期

4 黃彬彬;林榮恒;彭凱;鄒華;楊放春;;基于粒子群優(yōu)化的負(fù)載均衡的虛擬網(wǎng)絡(luò)映射[J];電子與信息學(xué)報(bào);2013年07期

5 周慶國(guó);張寶山;陳文波;張耀南;荊濤;;基于LLCBench的PlanetLab計(jì)算平臺(tái)測(cè)試[J];計(jì)算機(jī)工程與應(yīng)用;2006年17期

6 王楠;劉心雄;陳和平;;Web Service技術(shù)研究[J];計(jì)算機(jī)與數(shù)字工程;2006年07期

7 李小玲;郭長(zhǎng)國(guó);李小勇;王懷民;;一種基于約束優(yōu)化的虛擬網(wǎng)絡(luò)映射方法[J];計(jì)算機(jī)研究與發(fā)展;2012年08期

8 魏曉輝;鄒磊;李洪亮;;基于優(yōu)化的同構(gòu)子圖搜索的虛擬網(wǎng)絡(luò)映射算法[J];吉林大學(xué)學(xué)報(bào)(工學(xué)版);2013年01期

9 劉新剛;懷進(jìn)鵬;高慶一;沃天宇;;一種保持結(jié)點(diǎn)緊湊的虛擬網(wǎng)絡(luò)映射方法[J];計(jì)算機(jī)學(xué)報(bào);2012年12期

10 蔡志平;劉強(qiáng);呂品;肖儂;王志英;;虛擬網(wǎng)絡(luò)映射模型及其優(yōu)化算法[J];軟件學(xué)報(bào);2012年04期

本文編號(hào)：2392955