基于CCN的路由優(yōu)化策略研究
發(fā)布時間:2018-06-27 14:26
本文選題:CCN + 域間訪問。 參考:《北京交通大學》2014年碩士論文
【摘要】:隨著互聯(lián)網技術的快速發(fā)展,內容服務和信息共享已經成為互聯(lián)網的重要組成部分。為了更好地為用戶提供服務,內容為中心的網絡(CCN)技術逐漸成為了研究熱點。和傳統(tǒng)網絡中“面向主機”的設計理念不同,CCN采用一種“面向資源”的設計方案,通過采用新型7層協(xié)議棧和新型路由節(jié)點完成興趣包和數據包的傳輸,在新型路由節(jié)點內部采用內容存儲(CS)、未決表(PIT)以及轉發(fā)表(FIB)實現包交換及轉發(fā)過程。 本文在CCN網絡原有路由策略的基礎上,提出一種新型路由優(yōu)化方案,實現CCN網絡的域間通信以及CCN網絡與IP網絡的相互通信,同時通過對轉發(fā)端口度量進行路徑優(yōu)化,提高網絡傳輸效率。具體工作包括: 首先,簡要介紹了內容中心網絡的研究背景及國內外研究現狀,并對現階段CCN體系架構進行了說明,包括資源的命名方式、安全機制以及資源緩存方案等內容,著重分析了其路由策略中無法進行域間通信、無法與IP網絡相互通信以及傳輸效率低等問題,引出本文的研究動機。 其次,針對上述問題提出了一種路由優(yōu)化方案,并闡述了本方案的設計思想及實現方式,詳細介紹了各模塊中主要數據包(如Interest包、Data包等)的格式,同時對各類網絡節(jié)點的信息交互過程進行了說明。本方案在保留原始CCN網絡基于CS、PIT、FIB表設計的節(jié)點處理體系基礎上,著重開展了三個方面的研究工作:1)引入中心節(jié)點作為CCN網絡自治域的控制節(jié)點,記錄本自治域及其他自治域的資源信息,通過查詢計算為域內節(jié)點提供傳輸路徑,實現CCN網絡域間通信;2)引入邊界節(jié)點作為CCN網絡與IP網絡的連接點,實現兩種網絡的相互通信;3)引入蟻群算法標記轉發(fā)端口質量,優(yōu)化傳輸路徑,減少網絡冗余流量。 第三,在NS-3仿真平臺上對本方案進行功能驗證。編寫仿真模塊進行本方案的功能實現,并搭建測試拓撲進行相關的功能及性能測試。通過運行修改后的代碼,驗證了本方案可以實現CCN網絡的域間通信、CCN網絡與IP網絡間的通信,同時引入蟻群算法優(yōu)化了傳輸策略,減少了網絡冗余流量,降低了網絡吞吐量,提高了網絡傳輸效率。 最后,本文對所做工作進行了總結,并提出了下一步的研究方向。
[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.
【學位授予單位】:北京交通大學
【學位級別】:碩士
【學位授予年份】:2014
【分類號】:TN915.0
【共引文獻】
相關期刊論文 前10條
1 王俠;程乃偉;;蟻群算法在動態(tài)疏散路徑優(yōu)化過程中的應用[J];安防科技;2009年10期
2 陳任;鄧清勇;鄺利丹;李鳳姣;;基于Blackfin的鋰電池管理系統(tǒng)[J];兵工自動化;2011年12期
3 方錫邦;王國慶;;基于Simulink模型的靜態(tài)優(yōu)化和動態(tài)優(yōu)化[J];北京汽車;2010年05期
4 張玉潔;孟祥武;;利用蟻群算法求解電信客戶初始信用評分問題[J];北京郵電大學學報;2010年01期
5 穆朋剛;趙美英;陳鵬飛;萬小朋;;基于蟻群算法的復合材料層合板的鋪層順序優(yōu)化[J];玻璃鋼/復合材料;2007年06期
6 楊海;王洪國;侯魯男;孫向群;;混沌蟻群算法及其在智能交通中的應用[J];成都大學學報(自然科學版);2007年04期
7 高大利;;基于混沌蟻群算法的物流配送路徑問題仿真研究[J];赤峰學院學報(自然科學版);2011年01期
8 嚴小燕;李e,
本文編號:2074209
本文鏈接:http://sikaile.net/kejilunwen/wltx/2074209.html
最近更新
教材專著