網(wǎng)絡(luò)虛擬化中的高效映射與流量管理研究
發(fā)布時間：2018-09-01 13:30
【摘要】：網(wǎng)絡(luò)虛擬化是推動互聯(lián)網(wǎng)體系結(jié)構(gòu)創(chuàng)新的有效途徑，其發(fā)展面臨著虛擬網(wǎng)高效映射和物理網(wǎng)流量管理的雙重挑戰(zhàn)。一方面，虛擬網(wǎng)覆蓋范圍廣，涉及物理網(wǎng)絡(luò)自治域多，設(shè)計(jì)全局優(yōu)化映射決策困難，數(shù)據(jù)中心虛擬網(wǎng)資源需求描述復(fù)雜，要求虛擬網(wǎng)映射機(jī)制不僅滿足虛擬網(wǎng)的資源需求，還要提高物理資源的利用效率。另一方面，流量超線性增長，物理網(wǎng)絡(luò)擁塞風(fēng)險(xiǎn)增大，網(wǎng)絡(luò)不斷擴(kuò)容造成能耗持續(xù)攀升，要求流量管理機(jī)制不僅能夠優(yōu)化網(wǎng)絡(luò)性能，還可以降低網(wǎng)絡(luò)能耗。 針對上述挑戰(zhàn)，本文圍繞提高虛擬網(wǎng)映射效率和增強(qiáng)物理網(wǎng)流量管理能力兩大核心目標(biāo)，分別從跨域虛擬網(wǎng)映射、數(shù)據(jù)中心虛擬資源分配、最優(yōu)流量工程泛化路由框架、節(jié)能路由機(jī)制等4方面進(jìn)行了研究和創(chuàng)新。本文的主要貢獻(xiàn)包括： 1.設(shè)計(jì)了跨域虛擬網(wǎng)映射機(jī)制。針對映射過程中信息不對稱的難題，本文提出了涉及多個物理網(wǎng)絡(luò)域的有限信息共享機(jī)制，進(jìn)而將映射問題建模為整數(shù)規(guī)劃問題，并設(shè)計(jì)了可以在多項(xiàng)式時間求解的高效在線映射算法。實(shí)驗(yàn)表明，該算法的映射成功率和物理資源利用率均可達(dá)到理想情況下最優(yōu)值的80% 90%。 2.設(shè)計(jì)了支持帶寬保證的數(shù)據(jù)中心資源分配機(jī)制。針對數(shù)據(jù)中心虛擬資源需求描述難的現(xiàn)狀，提出了任務(wù)資源需求解耦和的思路，設(shè)計(jì)了支持帶寬保證的Dual Hose模型，以及與該模型相適應(yīng)的虛擬機(jī)分配算法和帶寬分配算法。實(shí)驗(yàn)表明，該機(jī)制的任務(wù)接受率比現(xiàn)有最佳方案提高了5.3%。 3.提出了實(shí)現(xiàn)最優(yōu)流量工程的泛化路由框架。為了滿足流量工程優(yōu)化目標(biāo)和實(shí)現(xiàn)方式的多樣化需求，本文基于網(wǎng)絡(luò)效用最大化理論提出了一種泛化路由框架和一類通用負(fù)載均衡效用函數(shù)，設(shè)計(jì)了實(shí)現(xiàn)最優(yōu)路由的鏈路狀態(tài)路由協(xié)議SPEF，并分析了基于MPLS的實(shí)現(xiàn)方式。實(shí)驗(yàn)表明，SPEF可將OSPF的網(wǎng)絡(luò)效用提高10% 40%，基于MPLS的實(shí)現(xiàn)方式路徑變化率僅為6.67%，路由穩(wěn)定性好。 4.設(shè)計(jì)了高魯棒性節(jié)能路由機(jī)制ROD。針對流量管理中性能、節(jié)能和魯棒性互相制約的難題，ROD采用了分層組合優(yōu)化的策略：首先建立以性能和節(jié)能為目標(biāo)的聯(lián)合優(yōu)化模型，，得到滿足特定約束的最優(yōu)路由，然后優(yōu)化該路由的魯棒性，使其可以應(yīng)對任意單鏈路故障的情形。實(shí)驗(yàn)表明，ROD可以按照流量管理需求，靈活地調(diào)整三個目標(biāo)之間的關(guān)系，得到對應(yīng)的路由結(jié)果。
[Abstract]:Network virtualization is an effective way to promote the innovation of Internet architecture. Its development is facing the dual challenges of virtual network efficient mapping and physical network traffic management. On the one hand, the virtual network covers a wide range, involves many autonomous domains of physical network, it is difficult to design global optimal mapping decision, and the data center virtual network resource requirement description is complex, which requires the virtual network mapping mechanism not only to meet the virtual network resource needs. It is also necessary to improve the efficiency of the utilization of physical resources. On the other hand, because of the super-linear growth of traffic, the increase of physical network congestion risk, and the continuous expansion of the network, energy consumption continues to rise, which requires that the traffic management mechanism can not only optimize the network performance, but also reduce the network energy consumption. Aiming at the above challenges, this paper focuses on the two core goals of improving the efficiency of virtual network mapping and enhancing the traffic management capability of physical networks, respectively from cross-domain virtual network mapping, data center virtual resource allocation, and optimal traffic engineering generalization routing framework. Energy-saving routing mechanism and other four aspects of research and innovation. The main contributions of this paper are as follows: 1. The mapping mechanism of cross-domain virtual network is designed. In order to solve the problem of information asymmetry in mapping process, a finite information sharing mechanism involving multiple physical network domains is proposed in this paper, and then the mapping problem is modeled as an integer programming problem. An efficient online mapping algorithm is designed, which can be solved in polynomial time. Experiments show that the mapping success rate and physical resource utilization rate of the algorithm can reach 80% 90% of the optimal value in ideal conditions. A data center resource allocation mechanism supporting bandwidth guarantee is designed. In view of the difficulty in describing the requirement of virtual resource in the data center, this paper proposes the idea of decoupling the resource requirement of the task, and designs the Dual Hose model which supports bandwidth guarantee, and the allocation algorithm of virtual machine and the bandwidth allocation algorithm which are suitable for the model. Experiments show that the task acceptance rate of the mechanism is 5.3. 3% higher than that of the best scheme available. A generalized routing framework for optimal traffic engineering is proposed. In order to meet the diverse requirements of traffic engineering optimization objectives and implementation methods, this paper proposes a generalized routing framework and a class of general load balancing utility functions based on the network utility maximization theory. A link state routing protocol (SPEF,) for optimal routing is designed and the implementation based on MPLS is analyzed. The experimental results show that the network utility of OSPF can be increased by 10% or 40%, the path change rate of the realization mode based on MPLS is only 6.67, and the route stability is good. 4. A robust energy-saving routing mechanism ROD. is designed. Aiming at the problem that performance, energy saving and robustness restrict each other in flow management, ROD adopts the strategy of hierarchical combinatorial optimization. Firstly, a joint optimization model is established to meet the specific constraints. Then the robustness of the route is optimized so that it can deal with any single link failure. Experiments show that ROD can flexibly adjust the relationship between the three objectives according to the requirements of traffic management and obtain the corresponding routing results.
【學(xué)位授予單位】：清華大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2014
【分類號】：TP393.01
本文編號：2217354
[Abstract]:Network virtualization is an effective way to promote the innovation of Internet architecture. Its development is facing the dual challenges of virtual network efficient mapping and physical network traffic management. On the one hand, the virtual network covers a wide range, involves many autonomous domains of physical network, it is difficult to design global optimal mapping decision, and the data center virtual network resource requirement description is complex, which requires the virtual network mapping mechanism not only to meet the virtual network resource needs. It is also necessary to improve the efficiency of the utilization of physical resources. On the other hand, because of the super-linear growth of traffic, the increase of physical network congestion risk, and the continuous expansion of the network, energy consumption continues to rise, which requires that the traffic management mechanism can not only optimize the network performance, but also reduce the network energy consumption. Aiming at the above challenges, this paper focuses on the two core goals of improving the efficiency of virtual network mapping and enhancing the traffic management capability of physical networks, respectively from cross-domain virtual network mapping, data center virtual resource allocation, and optimal traffic engineering generalization routing framework. Energy-saving routing mechanism and other four aspects of research and innovation. The main contributions of this paper are as follows: 1. The mapping mechanism of cross-domain virtual network is designed. In order to solve the problem of information asymmetry in mapping process, a finite information sharing mechanism involving multiple physical network domains is proposed in this paper, and then the mapping problem is modeled as an integer programming problem. An efficient online mapping algorithm is designed, which can be solved in polynomial time. Experiments show that the mapping success rate and physical resource utilization rate of the algorithm can reach 80% 90% of the optimal value in ideal conditions. A data center resource allocation mechanism supporting bandwidth guarantee is designed. In view of the difficulty in describing the requirement of virtual resource in the data center, this paper proposes the idea of decoupling the resource requirement of the task, and designs the Dual Hose model which supports bandwidth guarantee, and the allocation algorithm of virtual machine and the bandwidth allocation algorithm which are suitable for the model. Experiments show that the task acceptance rate of the mechanism is 5.3. 3% higher than that of the best scheme available. A generalized routing framework for optimal traffic engineering is proposed. In order to meet the diverse requirements of traffic engineering optimization objectives and implementation methods, this paper proposes a generalized routing framework and a class of general load balancing utility functions based on the network utility maximization theory. A link state routing protocol (SPEF,) for optimal routing is designed and the implementation based on MPLS is analyzed. The experimental results show that the network utility of OSPF can be increased by 10% or 40%, the path change rate of the realization mode based on MPLS is only 6.67, and the route stability is good. 4. A robust energy-saving routing mechanism ROD. is designed. Aiming at the problem that performance, energy saving and robustness restrict each other in flow management, ROD adopts the strategy of hierarchical combinatorial optimization. Firstly, a joint optimization model is established to meet the specific constraints. Then the robustness of the route is optimized so that it can deal with any single link failure. Experiments show that ROD can flexibly adjust the relationship between the three objectives according to the requirements of traffic management and obtain the corresponding routing results.
【學(xué)位授予單位】：清華大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2014
【分類號】：TP393.01
【共引文獻(xiàn)】
相關(guān)期刊論文 前10條
1 杜荔,楊琳,李軍;流量工程中一種權(quán)重配置動態(tài)路由選擇算法[J];東北大學(xué)學(xué)報(bào);2005年08期
2 杜荔;李軍;宋建銘;黨愛民;;MPLS網(wǎng)絡(luò)流量工程中的動態(tài)在線路由算法[J];東北大學(xué)學(xué)報(bào);2006年09期
3 劉亞萍;何俊峰;龔正虎;;ATIE:一種自適應(yīng)的可調(diào)域間出口選擇算法[J];國防科技大學(xué)學(xué)報(bào);2008年02期
4 趙喜求;黃寶座;;基于成本最優(yōu)的IP路由算法[J];電腦知識與技術(shù);2012年29期
5 趙喜求;黃寶座;;基于成本最優(yōu)的IP路由算法[J];廣東通信技術(shù);2012年10期
6 郭智恩;薛海偉;戴一奇;;一種基于多目標(biāo)微粒群優(yōu)化的虛擬網(wǎng)絡(luò)映射方法[J];國防科技大學(xué)學(xué)報(bào);2013年05期
7 葛敬國;賀鵬;楊建華;張建華;;通用平臺虛擬路由器轉(zhuǎn)發(fā)性能測試與改進(jìn)[J];電子科技大學(xué)學(xué)報(bào);2014年01期
8 劉光遠(yuǎn);蘇森;;面向底層單節(jié)點(diǎn)失效的輕量級可靠虛擬網(wǎng)絡(luò)映射算法[J];電子與信息學(xué)報(bào);2013年11期
9 黃勝;吳川川;楊曉非;王輝;張衛(wèi);;一種基于臨近原則的虛擬網(wǎng)絡(luò)映射算法[J];電信科學(xué);2013年12期
10 林海卓;王繼龍;張程亮;;基于Olive的大型網(wǎng)絡(luò)管理訓(xùn)練平臺設(shè)計(jì)與開發(fā)[J];東北大學(xué)學(xué)報(bào)(自然科學(xué)版);2014年03期
本文編號：2217354
本文鏈接：http://sikaile.net/guanlilunwen/ydhl/2217354.html
最近更新
教材專著
