天堂国产午夜亚洲专区-少妇人妻综合久久蜜臀-国产成人户外露出视频在线-国产91传媒一区二区三区

當(dāng)前位置:主頁 > 科技論文 > 信息工程論文 >

基于NFV的網(wǎng)絡(luò)中虛擬服務(wù)功能鏈的部署和遷移

發(fā)布時(shí)間:2018-09-04 06:34
【摘要】:隨著通信網(wǎng)絡(luò)的迅猛發(fā)展,用戶數(shù)量以及用戶對業(yè)務(wù)的流量需求也急劇增加,但網(wǎng)絡(luò)部署復(fù)雜、網(wǎng)絡(luò)架構(gòu)垂直且封閉以及電信業(yè)務(wù)總量與收入不匹配等諸多問題使得當(dāng)今的網(wǎng)絡(luò)面臨著巨大挑戰(zhàn)。網(wǎng)絡(luò)功能虛擬化(Network Function Virtualization,NFV)技術(shù)的出現(xiàn)和發(fā)展極大推進(jìn)了通信網(wǎng)絡(luò)架構(gòu)的演進(jìn),在基于NFV技術(shù)的網(wǎng)絡(luò)中,網(wǎng)絡(luò)功能將不再依賴于專用的硬件設(shè)備,而是通過軟件技術(shù)加以實(shí)現(xiàn),從而部署在商用的硬件平臺(tái)上。服務(wù)功能鏈(Service Function Chain,SFC)的應(yīng)用作為NFV技術(shù)的一個(gè)重要用途,能夠靈活地管理特定服務(wù)以及應(yīng)用的流量,并且SFC支持網(wǎng)絡(luò)中細(xì)粒度和彈性的服務(wù)交付、服務(wù)功能的修改以及負(fù)載的移動(dòng),因此受到了國內(nèi)外研究界的廣泛關(guān)注。本文關(guān)注點(diǎn)就是在引入NFV技術(shù)的網(wǎng)絡(luò)中的虛擬服務(wù)功能鏈的部署和遷移問題。在NFV網(wǎng)絡(luò)中,因物理資源本身的限制而可能產(chǎn)生資源碎片,造成網(wǎng)絡(luò)中資源總量足夠,但每臺(tái)主機(jī)上資源不足而無法部署服務(wù)功能鏈,降低網(wǎng)絡(luò)中可部署的服務(wù)功能鏈的數(shù)目。因此針對上述問題,我們以最大化資源受限的網(wǎng)絡(luò)中服務(wù)的SFCs的數(shù)目為目標(biāo),在滿足網(wǎng)絡(luò)服務(wù)請求端到端時(shí)延要求的前提下,建立了數(shù)學(xué)模型,提出基于貪心算法的虛擬服務(wù)功能鏈的部署方案并進(jìn)行仿真驗(yàn)證,結(jié)果表明該部署方案能夠有效的保證最大化資源受限的網(wǎng)絡(luò)中服務(wù)的SFCs的數(shù)目,在充分的利用網(wǎng)絡(luò)中物理主機(jī)和物理交換機(jī)的資源的同時(shí)也達(dá)到了兼顧網(wǎng)絡(luò)性能的目的。接下來,出于用戶的移動(dòng)性以及網(wǎng)絡(luò)中負(fù)載均衡的考慮,實(shí)現(xiàn)資源的有效分配和網(wǎng)絡(luò)的靈活性,研究虛擬服務(wù)功能鏈的遷移工作是十分必要的,但目前關(guān)于虛擬SFC的遷移的工作并不多。本文中特別考慮了實(shí)際網(wǎng)絡(luò)功能的特性,針對SFCs的遷移重配置問題,將網(wǎng)絡(luò)性能和網(wǎng)絡(luò)中資源的合理利用這兩個(gè)重要因素納入考察,建立了數(shù)學(xué)模型,提出一種面向時(shí)延優(yōu)化的服務(wù)功能鏈重配置策略,即基于改進(jìn)遺傳算法的SFCs遷移重配置方案,進(jìn)行仿真驗(yàn)證。通過與基于貪心的遷移重配置算法以及隨機(jī)遷移重配置算法等的對比,說明了基于改進(jìn)遺傳算法的虛擬服務(wù)功能鏈遷移重配置方案在有效的保證了網(wǎng)絡(luò)性能的同時(shí)兼顧網(wǎng)絡(luò)物理資源。本文對NFV技術(shù)以及服務(wù)功能鏈的總結(jié)分析,設(shè)計(jì)了NFV網(wǎng)絡(luò)中虛擬服務(wù)功能鏈的部署和遷移重配置方案,為NFV網(wǎng)絡(luò)中服務(wù)功能鏈的部署和遷移問題提供了新的思路。
[Abstract]:With the rapid development of communication network, the number of users and the traffic demand of users have increased rapidly, but the network deployment is complex. Many problems, such as vertical and closed network architecture and mismatch between the total amount of telecom services and revenue, make today's network face great challenges. The emergence and development of network function virtualization (Network Function Virtualization,NFV) technology has greatly promoted the evolution of communication network architecture. In the network based on NFV technology, network function will no longer depend on special hardware devices, but will be realized through software technology. It is then deployed on commercial hardware platforms. As an important use of NFV technology, service function chain (Service Function Chain,SFC) can flexibly manage specific services and application traffic, and SFC supports fine-grained and flexible service delivery in a network. The modification of service function and the movement of load have attracted wide attention from domestic and foreign researchers. This paper focuses on the deployment and migration of virtual service function chain in the network with NFV technology. In NFV network, due to the limitation of physical resources, the resource fragmentation may occur, which results in the sufficient amount of resources in the network, but the insufficient resources on each host can not deploy the service functional chain, thus reducing the number of deployable service functional chains in the network. Therefore, in order to maximize the number of SFCs services in resource-constrained networks, we establish a mathematical model on the premise of satisfying the end-to-end delay requirements of network service requests. A deployment scheme of virtual service functional chain based on greedy algorithm is proposed and verified by simulation. The results show that the proposed deployment scheme can effectively guarantee the maximum number of SFCs of services in resource-constrained networks. The resource of the physical host and the physical switch in the network is fully utilized, and the network performance is also taken into account at the same time. Then, considering the mobility of users and the load balance in the network, it is necessary to study the migration of virtual service function chain to realize the effective allocation of resources and the flexibility of the network. However, there is not much work on the migration of virtual SFC. In this paper, the characteristics of the actual network function are specially considered. Aiming at the problem of migration and reconfiguration of SFCs, two important factors, network performance and rational utilization of resources in the network, are taken into account, and the mathematical model is established. A delay-oriented reconfiguration strategy for service function chain is proposed, that is, the SFCs migration reconfiguration scheme based on improved genetic algorithm, which is verified by simulation. Compared with greedy transfer reconfiguration algorithm and random migration reconfiguration algorithm, It is shown that the virtual service function chain migration and reconfiguration scheme based on improved genetic algorithm can effectively guarantee the network performance and take into account the network physical resources at the same time. In this paper, the NFV technology and service function chain are summarized and analyzed, and the deployment and migration reconfiguration scheme of virtual service function chain in NFV network is designed, which provides a new idea for the deployment and migration of service function chain in NFV network.
【學(xué)位授予單位】:電子科技大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2017
【分類號(hào)】:TN915.0

【參考文獻(xiàn)】

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

1 鄭舒;王曉東;;基于NFV架構(gòu)的IMS核心網(wǎng)實(shí)現(xiàn)方案[J];電信工程技術(shù)與標(biāo)準(zhǔn)化;2016年05期

2 蔣銘;于益俊;;NFV與VNF架構(gòu)演進(jìn)與網(wǎng)絡(luò)架構(gòu)未來[J];信息通信技術(shù);2016年01期

3 劉鎏;虞紅芳;;基于資源拆分的虛擬網(wǎng)絡(luò)功能服務(wù)鏈映射算法[J];計(jì)算機(jī)應(yīng)用研究;2016年08期

4 薛海強(qiáng);張昊;;網(wǎng)絡(luò)功能虛擬化及其標(biāo)準(zhǔn)化[J];中興通訊技術(shù);2015年02期

5 王殿君;;基于改進(jìn)A~*算法的室內(nèi)移動(dòng)機(jī)器人路徑規(guī)劃[J];清華大學(xué)學(xué)報(bào)(自然科學(xué)版);2012年08期

6 劉鯖潔;陳桂明;劉小方;;基于矩陣編碼的遺傳算法研究[J];計(jì)算機(jī)工程;2011年13期

7 余有明;劉玉樹;閻光偉;;遺傳算法的編碼理論與應(yīng)用[J];計(jì)算機(jī)工程與應(yīng)用;2006年03期

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

1 呂晨;網(wǎng)絡(luò)服務(wù)功能鏈拓?fù)湓O(shè)計(jì)及映射研究[D];電子科技大學(xué);2016年

,

本文編號(hào):2221298

資料下載
論文發(fā)表

本文鏈接:http://sikaile.net/kejilunwen/xinxigongchenglunwen/2221298.html


Copyright(c)文論論文網(wǎng)All Rights Reserved | 網(wǎng)站地圖 |

版權(quán)申明:資料由用戶189b8***提供,本站僅收錄摘要或目錄,作者需要?jiǎng)h除請E-mail郵箱bigeng88@qq.com