【摘要】：近年來,網(wǎng)絡(luò)云業(yè)務(wù)發(fā)展迅速,導(dǎo)致互聯(lián)網(wǎng)流量出現(xiàn)了指數(shù)級增長。傳統(tǒng)光網(wǎng)絡(luò)體系架構(gòu)在可擴(kuò)展性和靈活性方面的問題凸顯,網(wǎng)絡(luò)“僵化”的問題越來越突出。為有效解決該問題,研究人員提出光網(wǎng)絡(luò)虛擬化技術(shù)。該技術(shù)基于抽象、分區(qū)與聚合等機(jī)制,在共享的底層網(wǎng)絡(luò)上構(gòu)建多個具有異構(gòu)性、共享性和隔離性等特點的虛擬網(wǎng)絡(luò)(VN),以此滿足網(wǎng)絡(luò)云業(yè)務(wù)的異構(gòu)化網(wǎng)絡(luò)需求。然而,VN必須依靠底層光網(wǎng)絡(luò)資源才有意義,因此VN到底層光網(wǎng)絡(luò)資源的映射問題成為了當(dāng)前的一個研究熱點。研究發(fā)現(xiàn),網(wǎng)絡(luò)云業(yè)務(wù)對底層光網(wǎng)絡(luò)資源需求的主要特點是具有動態(tài)性。因而如何動態(tài)、高效的將VN映射到底層光網(wǎng)絡(luò)資源上,成為了決定網(wǎng)絡(luò)云業(yè)務(wù)服務(wù)質(zhì)量的關(guān)鍵。本文首先對基于SOA的網(wǎng)絡(luò)云業(yè)務(wù)模型的虛擬化層進(jìn)行了模塊化設(shè)計,并將其作為后續(xù)映射算法的驗證環(huán)境,使本文研究的驗證環(huán)境更加接近真實的網(wǎng)絡(luò)云業(yè)務(wù)環(huán)境。而后,基于光網(wǎng)絡(luò)虛擬化面臨的主要挑戰(zhàn),對面向資源需求量增加和單節(jié)點失效兩種情況下的動態(tài)VN映射問題展開研究。在面向資源需求量增加的動態(tài)VN映射算法研究中,研究了虛擬節(jié)點資源需求量增加和虛擬節(jié)點數(shù)量增加兩種情況,利用混合整數(shù)線性規(guī)劃(MILP)方法建模。在啟發(fā)式算法設(shè)計中,采用最小節(jié)點壓力優(yōu)先方法,充分考慮了重配置過程中底層物理節(jié)點的負(fù)載均衡。仿真結(jié)果顯示,相比對比算法,該算法能夠有效降低重配置成本,同時實現(xiàn)較好的物理節(jié)點負(fù)載均衡。在面向單節(jié)點失效的動態(tài)VN映射算法研究中,主要研究單物理節(jié)點失效情況下,其上承載虛擬節(jié)點的重配置問題,利用整數(shù)線性規(guī)劃(ILP)方法建模。啟發(fā)式算法設(shè)計中,綜合考慮虛擬網(wǎng)絡(luò)拓?fù)浜偷讓游锢砉?jié)點的連通性問題,并根據(jù)連通性計算結(jié)果,選擇最佳的候選節(jié)點進(jìn)行映射。仿真結(jié)果顯示,本算法雖相比對比算法消耗較多的映射時間,但提升了失效VN的恢復(fù)率以及降低了底層物理節(jié)點的負(fù)載強(qiáng)度,因此具有可用性。
[Abstract]:In recent years, network cloud business has developed rapidly, resulting in exponential growth of Internet traffic. The problems of scalability and flexibility of traditional optical network architecture are highlighted, and the problem of "rigid" network is becoming more and more prominent. In order to solve this problem effectively, the researchers put forward the virtualization technology of optical network. Based on the mechanisms of abstraction, partition and aggregation, a number of virtual network (VN), with the characteristics of isomerism, sharing and isolation are constructed on the shared underlying network to meet the needs of the isomerization network of network cloud services. However, VN has to rely on the underlying optical network resources to make sense, so the mapping from VN to the underlying optical network resources has become a hot research topic. It is found that the main feature of the network cloud service is the dynamic nature of the underlying optical network resource demand. Therefore, how to dynamically and efficiently map VN to the underlying optical network resources has become the key to determine the quality of service of network cloud services. Firstly, the virtualization layer of network cloud service model based on SOA is modularized and used as the verification environment of the subsequent mapping algorithm, which makes the verification environment of this paper closer to the real network cloud service environment. Then, based on the main challenges faced by optical network virtualization, the dynamic VN mapping problem in the case of increasing resource demand and single node failure is studied. In the research of dynamic VN mapping algorithm for increasing resource demand, the resource demand of virtual nodes and the number of virtual nodes are studied. The mixed integer linear programming (MILP) method is used to model the model. In the design of heuristic algorithm, the minimum node pressure first method is used to fully consider the load balancing of the underlying physical nodes in the process of reconfiguration. Simulation results show that the proposed algorithm can effectively reduce the cost of reconfiguration and achieve better load balancing of physical nodes compared with the contrast algorithm. In the research of dynamic VN mapping algorithm for single node failure, the reconfiguration of virtual nodes on the single physical node is studied, and the integer linear programming (ILP) method is used to model it. In the design of heuristic algorithm, the topology of the virtual network and the connectivity of the underlying physical nodes are considered synthetically, and according to the results of connectivity calculation, the optimal candidate nodes are selected for mapping. The simulation results show that the proposed algorithm consumes more mapping time than the contrast algorithm, but it improves the recovery rate of the VN failure and reduces the load intensity of the underlying physical nodes, so it is available.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TN929.1

【參考文獻(xiàn)】

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

1 朱強(qiáng);王慧強(qiáng);馬春光;馮光升;呂宏武;;虛擬網(wǎng)絡(luò)可生存的啟發(fā)式可靠映射算法[J];通信學(xué)報;2015年07期

2 李明;張引發(fā);任帥;王鯨魚;廖曉敏;;面向云計算的下一代光網(wǎng)絡(luò)技術(shù)研究進(jìn)展[J];激光與光電子學(xué)進(jìn)展;2015年07期

3 耿永強(qiáng);;光網(wǎng)絡(luò)虛擬化技術(shù)[J];硅谷;2012年23期

4 張曉娟;易明巍;;基于云計算與SOA的企業(yè)集成架構(gòu)及實現(xiàn)[J];計算機(jī)系統(tǒng)應(yīng)用;2011年09期

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

1 秦攀科;面向云業(yè)務(wù)的光傳送網(wǎng)動態(tài)路由等關(guān)鍵技術(shù)研究[D];北京郵電大學(xué);2015年

2 丁健;網(wǎng)絡(luò)虛擬化中的虛擬網(wǎng)絡(luò)映射技術(shù)研究[D];北京郵電大學(xué);2015年

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

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

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

1 李星;虛擬網(wǎng)絡(luò)映射算法研究[D];中國科學(xué)技術(shù)大學(xué);2015年

2 羅丹;虛擬網(wǎng)絡(luò)請求的構(gòu)建和映射[D];電子科技大學(xué);2015年

3 郝爽;基于SDN的光網(wǎng)絡(luò)虛擬化技術(shù)研究[D];北京郵電大學(xué);2015年

4 楊燁;面向云計算的彈性光網(wǎng)絡(luò)虛擬化技術(shù)研究[D];北京郵電大學(xué);2015年

5 高玲;光網(wǎng)絡(luò)虛擬化帶寬調(diào)度技術(shù)研究[D];南京郵電大學(xué);2015年

6 熊盼;虛擬網(wǎng)絡(luò)映射技術(shù)研究[D];南京郵電大學(xué);2015年

7 潘丹;光網(wǎng)絡(luò)虛擬拓?fù)湓O(shè)計研究[D];北京郵電大學(xué);2015年

8 張葆;虛擬網(wǎng)絡(luò)映射算法研究[D];西安電子科技大學(xué);2014年

9 李濤;基于SOA的云計算框架模型研究[D];重慶大學(xué);2014年

10 姚青;網(wǎng)絡(luò)虛擬化的關(guān)鍵技術(shù)研究[D];南京郵電大學(xué);2013年

，

本文編號：2401513