發(fā)布時間：2018-04-16 00:28

  本文選題：SDN + ForCES��； 參考：《浙江大學》2014年博士論文

【摘要】：SDN是當前網(wǎng)絡領域的研究熱點,被業(yè)界認為是下一代互聯(lián)網(wǎng)發(fā)展方向而備受關注。服務部署對SDN北向接口來說至關重要,而網(wǎng)絡虛擬化更是SDN實現(xiàn)網(wǎng)絡可編程的基礎,它們一直來都是研究者重點關注的對象�，F(xiàn)有的網(wǎng)絡虛擬化研究,往往都是就虛擬化而虛擬化,并未過多考慮SDN的實際需求。目前為止,SDN的成功應用案例尚不多見,SDN中服務部署相關的研究更是少之又少。而ForCES作為可編程網(wǎng)絡的典型代表,其轉(zhuǎn)發(fā)與控制分離的思想與SDN一脈相承,且ForCES在模型控制和數(shù)據(jù)平面虛擬化等方面優(yōu)勢明顯,因此本文結合可編程網(wǎng)絡內(nèi)有關服務部署的研究成果,將ForCES引入到SDN的研究。 本文從服務部署和網(wǎng)絡虛擬化的角度,提出一種基于ForCES的SDN新型體系架構,研究SDN下的服務部署和網(wǎng)絡虛擬化,進而探索服務部署過程中的優(yōu)化問題。 基于上述分析,本文的主要研究內(nèi)容如下： 1)分析比較現(xiàn)有SDN體系架構設計和實現(xiàn)的不足,結合ForCES在模型控制方面的優(yōu)勢,提出一種基于ForCES的新型SDN體系架構設計。 2)構建一個基于ForCES的網(wǎng)絡虛擬化平臺,提出一種ForCES-in-ForCES的網(wǎng)絡虛擬化方法,并在網(wǎng)絡虛擬化平臺構建過程中,針對ForCES體系架構中的“FE瓶頸”問題,引入了一個專門用于轉(zhuǎn)發(fā)平面接口和交換管理的組件SE,簡化了網(wǎng)絡虛擬化過程中的資源分配和管理。 3)研究SDN下的服務部署模型,針對服務部署的代價計算問題,提出了一種基于網(wǎng)絡功能副本的部署代價優(yōu)化算法,該優(yōu)化算法通過為每個服務組件創(chuàng)建一個網(wǎng)絡功能副本,基于網(wǎng)絡功能副本選擇虛邊組合,計算可能的轉(zhuǎn)移矩陣,從而排除了一些不必要的轉(zhuǎn)移矩陣計算,降低了部署代價計算的復雜度。 4)針對服務請求,研究虛擬網(wǎng)中的路徑發(fā)現(xiàn),提出了一種“最小F(.)最短”的路徑選評價方法,采用該方法進行路徑選擇,可以在同一個虛擬網(wǎng)中為更多的服務請求分配路徑；設計了一種F(.)最小的路徑查找算法,運行該算法可以確保所找到的路徑總是非環(huán)且F(.)最��；針對虛擬網(wǎng)調(diào)整過程,提出了一種“優(yōu)化方法”,該方法在不增加任何查詢開銷的情況下,擴張?zhí)摂M網(wǎng),提供更多的可用路徑,進一步提高服務請求的成功率。 5)研究節(jié)點查詢過程的優(yōu)化問題,針對查詢過程中的每種查詢方式提出一種基于策略的查詢代價計算方法,該方法通過分析策略中節(jié)點的出現(xiàn)概率,評估該種查詢方式下的查詢代價;為降低整個查詢過程的查詢代價、減少查詢過程中可行策略的數(shù)量,論文進而又提出一種策略枚舉樹的修剪算法,該算法通過去除策略枚舉樹上多余的等價子樹和較差子樹,減少了可行策略被執(zhí)行的次數(shù),降低了整個查詢過程所帶來的資源開銷。
[Abstract]:SDN is a research hotspot in network field, which is regarded by the industry as the development direction of next generation Internet.Service deployment is very important to the northward interface of SDN, and network virtualization is the foundation of SDN to implement network programming, which has always been the focus of attention of researchers.The existing research of network virtualization is usually based on virtualization, without considering the actual demand of SDN.Up to now, the successful application cases of SDN are few and far from the research of service deployment in SDN.As a typical representative of programmable network, ForCES's idea of separation of forwarding and control is the same as SDN, and ForCES has obvious advantages in model control and data plane virtualization.Therefore, this paper introduces ForCES into the research of SDN based on the research results of service deployment in programmable network.From the point of view of service deployment and network virtualization, a new SDN architecture based on ForCES is proposed in this paper. The service deployment and network virtualization under SDN are studied, and the optimization problems in the process of service deployment are explored.Based on the above analysis, the main contents of this paper are as follows:1) analyzing and comparing the shortcomings of existing SDN architecture design and implementation, and combining the advantages of ForCES in model control, a new SDN architecture design based on ForCES is proposed.2) build a network virtualization platform based on ForCES, propose a network virtualization method of ForCES-in-ForCES, and in the process of constructing network virtualization platform, aim at the "FE bottleneck" problem in ForCES architecture.This paper introduces a special component SEE for forwarding flat interface and exchange management, which simplifies resource allocation and management in network virtualization.3) the service deployment model under SDN is studied, and a deployment cost optimization algorithm based on network function replica is proposed to solve the problem of service deployment cost calculation. This optimization algorithm creates a network function copy for each service component.The virtual edge combination is selected based on the replica of the network function, and the possible transfer matrix is calculated, thus eliminating some unnecessary transfer matrix calculations and reducing the complexity of the deployment cost calculation.4) for the service request, the path discovery in the virtual network is studied, and a kind of "minimum FN" is proposed.The shortest "path selection and evaluation method, which is used for path selection, can be used to assign paths for more service requests in the same virtual network.The smallest path lookup algorithm, which is run to ensure that the path found is always off-loop and FG.)Aiming at the adjustment process of virtual network, this paper proposes an "optimization method", which expands the virtual network without adding any query overhead, provides more available paths, and further improves the success rate of service requests.5) the optimization problem of node query process is studied, and a policy-based query cost calculation method is proposed for each query mode in the query process, which analyzes the occurrence probability of nodes in the strategy.In order to reduce the query cost of the whole query process and reduce the number of feasible strategies in the query process, a pruning algorithm of the strategy enumeration tree is proposed.By removing the redundant equivalent and inferior subtrees of the enumeration tree, the algorithm reduces the number of feasible strategies being executed, and reduces the resource overhead brought by the whole query process.
【學位授予單位】：浙江大學
【學位級別】：博士
【學位授予年份】：2014
【分類號】：TP393.09

【參考文獻】

相關期刊論文 前4條

1 呂高鋒;孫志剛;李韜;毛健彪;楊安;;LabelCast:一種普適的SDN轉(zhuǎn)發(fā)平面抽象[J];計算機學報;2012年10期

2 王偉明;董黎剛;諸葛斌;;開放可重構路由器協(xié)議標準及軟件架構技術方案探討[J];信息工程大學學報;2009年01期

3 諸葛斌;楊尚大;王偉明;;ForCES路由器中傳輸匹配層性能分析與優(yōu)化[J];信息工程大學學報;2009年01期

4 袁博;汪斌強;陳強;胥繼勇;;可重構柔性網(wǎng)絡體系結構和基本形態(tài)[J];中國科技論文;2012年10期

，

本文編號：1756501