發(fā)布時間：2018-02-28 06:48

  本文關鍵詞： 可重構柔性網(wǎng)絡 服務承載網(wǎng) 虛擬網(wǎng)絡映射 遺傳算法 粒子群優(yōu)化算法 網(wǎng)絡中心性分析 K-核分解　出處：《解放軍信息工程大學》2014年碩士論文　論文類型：學位論文

【摘要】：多年來,互聯(lián)網(wǎng)應用上的創(chuàng)新層出不窮,大量個性化、小規(guī)模業(yè)務不斷涌現(xiàn),并逐步從小規(guī)模個性化應用向規(guī)�；瘧冒l(fā)展。單一網(wǎng)絡體系架構或者服務模式支撐多樣化網(wǎng)絡業(yè)務運營需求顯得非常困難。為此,可重構柔性網(wǎng)絡技術體系通過構建服務承載網(wǎng)(Service Carrying Network,SCN)的方式,同時支持多個異質網(wǎng)絡并存,從而為用戶提供多樣化的網(wǎng)絡服務。因此SCN的構建機制必然成為可重構柔性網(wǎng)絡技術研究的關鍵問題之一。論文依托國家863項目“可重構路由構件組研制”、“可重構柔性試驗網(wǎng)組網(wǎng)設備工程化實施”子課題。主要針對項目提出的三種聚類后的服務承載網(wǎng)特點及構建要求進行歸納總結。并分別針對三類服務承載網(wǎng)的構建算法展開了深入研究。具體研究工作如下:1.公共服務承載網(wǎng)具有常態(tài)性存在、規(guī)模大、管理簡單、容易聚類的特點,針對上述特點本文提出了基于混合群智能優(yōu)化的服務承載網(wǎng)構建算法。該算法利用群智能優(yōu)化使映射節(jié)點方案在不斷向最優(yōu)方案接近的同時克服局部最優(yōu)現(xiàn)象,通過帶寬均衡分布的多商品流算法克服了節(jié)點間連通性問題。通過仿真表明,該算法具有較高的構建成功率,和算法D-ViNE-SP、D-ViNE-LB和VNE-R-PSO相比,底層網(wǎng)絡收益開銷比分別提高了55%、23%和6%,增加了可重構柔性網(wǎng)絡的收益。2.個性服務承載網(wǎng)具有長期租用、規(guī)�？煽亍⒂刑厥夤δ芤蟮奶攸c。本文研究承載提供服務的分布式系統(tǒng)的個性服務承載網(wǎng),在構建此類承載網(wǎng)時要求降低構建開銷,增加外節(jié)點接入帶寬。針對上述要求提出了基于網(wǎng)絡中心性分析服務承載網(wǎng)構建算法。該算法量化了節(jié)點在全局內(nèi)與其他節(jié)點的連通情況和路徑被映射占用的可能性,為增加外節(jié)點接入帶寬提供了參考。并依據(jù)最大最小匹配原則構建服務承載網(wǎng)。通過仿真表明,與算法VNE-ICC和算法VNE-Greedy相比,算法外節(jié)點的接入帶寬增加了14%和32%,提高了分布式系統(tǒng)的服務質量。3.即時服務承載網(wǎng)具有建網(wǎng)時間和存在時間短、用戶規(guī)模小等特點,針對上述特點本文提出了基于K-核分解的服務承載網(wǎng)構建算法。算法通過一個K-核分解類似過程構建中繼傳輸子網(wǎng),壓縮了解空間。候選節(jié)點通過連接中繼傳輸子網(wǎng)進而構建承載網(wǎng)。通過仿真表明,該算法服務承載網(wǎng)構建時間僅為算法VNE-R-PSO的50%,D-ViNE-LB的23%,D-ViNE-SP的27%,提高了服務承載網(wǎng)構建的即時性。
[Abstract]:Over the years, innovations in Internet applications have sprung up, a large number of personalization, and small-scale businesses have sprung up. And gradually from small-scale personalized applications to large-scale applications. A single network architecture or service model to support the diversified network business operation requirements is very difficult. The reconfigurable flexible network technology architecture supports the coexistence of multiple heterogeneous networks through the construction of Service Carrying Network (SCNs). Therefore, the construction mechanism of SCN must become one of the key problems in the research of reconfigurable flexible network technology. This paper relies on the national 863 project, "Research and development of reconfigurable routing component group", "reconfigurable routing component group", "reconfigurable routing component group" and "reconfigurable routing component group". Construction of flexible test network construction equipment engineering implementation "sub-project. Mainly in view of the project proposed three kinds of clustering service carrying network characteristics and construction requirements are summarized, and respectively for the construction of three types of service carrying network calculation." The concrete research work is as follows: 1.The public service carrying network has the normal existence. Large scale, simple management, easy clustering, In view of the above characteristics, this paper proposes a service carrying network construction algorithm based on hybrid swarm intelligence optimization, which uses swarm intelligence optimization to make the mapping node scheme approach to the optimal scheme and overcome the local optimal phenomenon. The problem of connectivity between nodes is overcome by a multi-commodity flow algorithm with balanced bandwidth distribution. The simulation results show that the algorithm has a high success rate, compared with D-ViNE-SPND-ViNE-LB and VNE-R-PSO. The ratio of income to expense of the bottom network increases by 55% and 6% respectively, and the income of the reconfigurable flexible network is increased. 2. The personalized service carrying network has long-term rental and controllable scale. This paper studies the individualized service carrying network of distributed system which provides service, and it is necessary to reduce the cost of building this kind of service network. In order to increase the access bandwidth of external nodes, an algorithm based on network centrality analysis service bearer network is proposed. The algorithm quantifies the connectivity between nodes and other nodes in the global context and the possibility that the path is occupied by mapping. It provides a reference for increasing the access bandwidth of external nodes, and constructs the service carrying network according to the principle of maximum and minimum matching. The simulation results show that, compared with the algorithm VNE-ICC and algorithm VNE-Greedy, The access bandwidth of the nodes outside the algorithm is increased by 14% and 32, and the quality of service of the distributed system is improved .3.Instant service carrying network has the characteristics of short time of network construction, short time of existence, small scale of users, etc. In view of the above characteristics, this paper proposes a service carrying network construction algorithm based on K- kernel decomposition, which constructs relay transmission subnet through a similar process of K- kernel decomposition. The candidate nodes construct the carrier network by connecting the relay transmission subnet. The simulation results show that the construction time of the service carrying network is only the 235D ViNE-LB of VNE-R-PSO, and the 27th of D-ViNE-SP, which improves the instantaneity of the construction of the service bearer network.
【學位授予單位】：解放軍信息工程大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.09;TP18

【參考文獻】

相關期刊論文 前10條

1 程祥;張忠寶;蘇森;楊放春;;虛擬網(wǎng)絡映射問題研究綜述[J];通信學報;2011年10期

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

3 ;Providing personalized converged services based on flexible network reconfiguration[J];Science China(Information Sciences);2011年02期

4 王文彬;孫其博;趙新超;楊放春;;基于非均衡變異離散粒子群算法的QoS全局最優(yōu)Web服務選擇方法[J];電子學報;2010年12期

5 齊寧;汪斌強;郭佳;;邏輯承載網(wǎng)構建方法的研究[J];計算機學報;2010年09期

6 王浩學;汪斌強;于婧;姜明;;一體化承載網(wǎng)絡體系架構研究[J];計算機學報;2009年03期

7 吳建平;吳茜;徐恪;;下一代互聯(lián)網(wǎng)體系結構基礎研究及探索[J];計算機學報;2008年09期

8 李玉峰;邱菡;蘭巨龍;;可重構路由器研究的現(xiàn)狀與展望[J];中國工程科學;2008年07期

9 榮莉莉;郭天柱;王建偉;;復雜網(wǎng)絡節(jié)點中心性[J];上海理工大學學報;2008年03期

10 張宏科;蘇偉;;新網(wǎng)絡體系基礎研究——一體化網(wǎng)絡與普適服務[J];電子學報;2007年04期

，

本文編號：1546217