本文選題：CCN + 域間訪問��； 參考：《北京交通大學(xué)》2014年碩士論文

【摘要】：隨著互聯(lián)網(wǎng)技術(shù)的快速發(fā)展,內(nèi)容服務(wù)和信息共享已經(jīng)成為互聯(lián)網(wǎng)的重要組成部分。為了更好地為用戶提供服務(wù),內(nèi)容為中心的網(wǎng)絡(luò)(CCN)技術(shù)逐漸成為了研究熱點(diǎn)。和傳統(tǒng)網(wǎng)絡(luò)中“面向主機(jī)”的設(shè)計(jì)理念不同,CCN采用一種“面向資源”的設(shè)計(jì)方案,通過采用新型7層協(xié)議棧和新型路由節(jié)點(diǎn)完成興趣包和數(shù)據(jù)包的傳輸,在新型路由節(jié)點(diǎn)內(nèi)部采用內(nèi)容存儲(chǔ)(CS)、未決表(PIT)以及轉(zhuǎn)發(fā)表(FIB)實(shí)現(xiàn)包交換及轉(zhuǎn)發(fā)過程。 本文在CCN網(wǎng)絡(luò)原有路由策略的基礎(chǔ)上,提出一種新型路由優(yōu)化方案,實(shí)現(xiàn)CCN網(wǎng)絡(luò)的域間通信以及CCN網(wǎng)絡(luò)與IP網(wǎng)絡(luò)的相互通信,同時(shí)通過對(duì)轉(zhuǎn)發(fā)端口度量進(jìn)行路徑優(yōu)化,提高網(wǎng)絡(luò)傳輸效率。具體工作包括： 首先,簡要介紹了內(nèi)容中心網(wǎng)絡(luò)的研究背景及國內(nèi)外研究現(xiàn)狀,并對(duì)現(xiàn)階段CCN體系架構(gòu)進(jìn)行了說明,包括資源的命名方式、安全機(jī)制以及資源緩存方案等內(nèi)容,著重分析了其路由策略中無法進(jìn)行域間通信、無法與IP網(wǎng)絡(luò)相互通信以及傳輸效率低等問題,引出本文的研究動(dòng)機(jī)。 其次,針對(duì)上述問題提出了一種路由優(yōu)化方案,并闡述了本方案的設(shè)計(jì)思想及實(shí)現(xiàn)方式,詳細(xì)介紹了各模塊中主要數(shù)據(jù)包(如Interest包、Data包等)的格式,同時(shí)對(duì)各類網(wǎng)絡(luò)節(jié)點(diǎn)的信息交互過程進(jìn)行了說明。本方案在保留原始CCN網(wǎng)絡(luò)基于CS、PIT、FIB表設(shè)計(jì)的節(jié)點(diǎn)處理體系基礎(chǔ)上,著重開展了三個(gè)方面的研究工作：1)引入中心節(jié)點(diǎn)作為CCN網(wǎng)絡(luò)自治域的控制節(jié)點(diǎn),記錄本自治域及其他自治域的資源信息,通過查詢計(jì)算為域內(nèi)節(jié)點(diǎn)提供傳輸路徑,實(shí)現(xiàn)CCN網(wǎng)絡(luò)域間通信；2)引入邊界節(jié)點(diǎn)作為CCN網(wǎng)絡(luò)與IP網(wǎng)絡(luò)的連接點(diǎn),實(shí)現(xiàn)兩種網(wǎng)絡(luò)的相互通信；3)引入蟻群算法標(biāo)記轉(zhuǎn)發(fā)端口質(zhì)量,優(yōu)化傳輸路徑,減少網(wǎng)絡(luò)冗余流量。 第三,在NS-3仿真平臺(tái)上對(duì)本方案進(jìn)行功能驗(yàn)證。編寫仿真模塊進(jìn)行本方案的功能實(shí)現(xiàn),并搭建測試拓?fù)溥M(jìn)行相關(guān)的功能及性能測試。通過運(yùn)行修改后的代碼,驗(yàn)證了本方案可以實(shí)現(xiàn)CCN網(wǎng)絡(luò)的域間通信、CCN網(wǎng)絡(luò)與IP網(wǎng)絡(luò)間的通信,同時(shí)引入蟻群算法優(yōu)化了傳輸策略,減少了網(wǎng)絡(luò)冗余流量,降低了網(wǎng)絡(luò)吞吐量,提高了網(wǎng)絡(luò)傳輸效率。 最后,本文對(duì)所做工作進(jìn)行了總結(jié),并提出了下一步的研究方向。
[Abstract]:With the rapid development of Internet technology, content service and information sharing have become an important part of the Internet. In order to provide better service to users, CCN technology has gradually become a research hotspot. Different from the "host oriented" design concept in the traditional network, CCN adopts a "resource-oriented" design scheme, which uses a new seven-layer protocol stack and a new routing node to complete the transmission of interest packets and packets. Content storage (CS), pending table (bit) and forwarding table (FIB) are used to realize packet switching and forwarding in the new routing node. Based on the original routing strategy of CCN network, a new route optimization scheme is proposed in this paper, which realizes inter-domain communication of CCN network and the mutual communication between CCN network and IP network, and optimizes the path of forwarding port measurement. Improve the transmission efficiency of the network. The main works are as follows: firstly, the research background of content center network and the current research situation at home and abroad are briefly introduced, and the CCN architecture, including the naming method of resources, is explained. The security mechanism and the resource cache scheme are analyzed in detail. The problems of the routing strategy such as the inability to communicate between domains, the inability to communicate with IP networks and the low transmission efficiency are analyzed, which leads to the research motivation of this paper. Secondly, a route optimization scheme is proposed to solve the above problems, and the design idea and implementation method of this scheme are described. The format of main data packets (such as interest packet and data packet) in each module is introduced in detail. At the same time, the information exchange process of all kinds of network nodes is explained. On the basis of retaining the node processing system of the original CCN network based on CSPIT-FIB table, this scheme focuses on three aspects of research work: 1) introducing the central node as the control node in the autonomous domain of the CCN network. This paper records the resource information of the autonomous domain and other autonomous domains, provides the transmission path for the nodes in the domain through query calculation, realizes the communication between the CCN network domains and 2) introduces the boundary node as the connection point between the CCN network and the IP network. Ant colony algorithm is introduced to mark forwarding port quality, optimize transmission path and reduce network redundant traffic. Thirdly, the function of this scheme is verified on NS-3 simulation platform. The simulation module is written to realize the function of this scheme, and the test topology is built to test the function and performance. By running the modified code, it is verified that this scheme can realize the communication between CCN and IP networks. Ant colony algorithm is introduced to optimize the transmission strategy, reduce network redundant traffic and reduce network throughput. The network transmission efficiency is improved. Finally, this paper summarizes the work done, and puts forward the next research direction.
【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN915.0

【共引文獻(xiàn)】

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

1 王俠;程乃偉;;蟻群算法在動(dòng)態(tài)疏散路徑優(yōu)化過程中的應(yīng)用[J];安防科技;2009年10期

2 陳任;鄧清勇;鄺利丹;李鳳姣;;基于Blackfin的鋰電池管理系統(tǒng)[J];兵工自動(dòng)化;2011年12期

3 方錫邦;王國慶;;基于Simulink模型的靜態(tài)優(yōu)化和動(dòng)態(tài)優(yōu)化[J];北京汽車;2010年05期

4 張玉潔;孟祥武;;利用蟻群算法求解電信客戶初始信用評(píng)分問題[J];北京郵電大學(xué)學(xué)報(bào);2010年01期

5 穆朋剛;趙美英;陳鵬飛;萬小朋;;基于蟻群算法的復(fù)合材料層合板的鋪層順序優(yōu)化[J];玻璃鋼/復(fù)合材料;2007年06期

6 楊海;王洪國;侯魯男;孫向群;;混沌蟻群算法及其在智能交通中的應(yīng)用[J];成都大學(xué)學(xué)報(bào)(自然科學(xué)版);2007年04期

7 高大利;;基于混沌蟻群算法的物流配送路徑問題仿真研究[J];赤峰學(xué)院學(xué)報(bào)(自然科學(xué)版);2011年01期

8 嚴(yán)小燕;李e，

本文編號(hào)：2074209