本文選題：內(nèi)容中心網(wǎng)絡(luò) + 轉(zhuǎn)發(fā)引擎　； 參考：《西安電子科技大學(xué)》2014年碩士論文

【摘要】：內(nèi)容中心網(wǎng)絡(luò)旨在重新設(shè)計(jì)當(dāng)今的網(wǎng)絡(luò)架構(gòu):使用我們所需要內(nèi)容的名字代替IP地址來(lái)定位終端,從而實(shí)現(xiàn)提高數(shù)據(jù)傳輸效率的目標(biāo)。和IP網(wǎng)絡(luò)不同的是,內(nèi)容中心網(wǎng)絡(luò)使用名字來(lái)路由轉(zhuǎn)發(fā)網(wǎng)絡(luò)中的包。一個(gè)內(nèi)容中心網(wǎng)絡(luò)的名字包括一個(gè)可變長(zhǎng)度的字符串,這導(dǎo)致了名字的長(zhǎng)度可以包括有幾十個(gè)甚至上百個(gè)字符。因此,內(nèi)容中心網(wǎng)絡(luò)的路由表可能比當(dāng)前IP網(wǎng)絡(luò)的路由表大幾個(gè)數(shù)量級(jí)。這種復(fù)雜的名字的結(jié)構(gòu)加上大容量的路由表對(duì)路由中名字的查找提出了巨大的挑戰(zhàn)。為了克服這種巨大的挑戰(zhàn),我們提出了哈希表與分塊前綴樹結(jié)合的轉(zhuǎn)發(fā)引擎算法,并將之與其他內(nèi)容中心網(wǎng)絡(luò)結(jié)點(diǎn)的轉(zhuǎn)發(fā)引擎方法做了對(duì)比。我們將內(nèi)容中心網(wǎng)絡(luò)中的單個(gè)結(jié)點(diǎn)的PIT表、FIB及CS表的查找合并到同一個(gè)哈希表中,簡(jiǎn)化了CCN的結(jié)構(gòu),通過(guò)實(shí)驗(yàn)幾種內(nèi)容中心網(wǎng)絡(luò)的轉(zhuǎn)發(fā)引擎方案來(lái)探究其不同的性能表現(xiàn)。本文系統(tǒng)地研究了內(nèi)容中心網(wǎng)絡(luò)結(jié)點(diǎn)的轉(zhuǎn)發(fā)引擎,所獲得的主要成果如下:1.對(duì)內(nèi)容中心網(wǎng)絡(luò)的開源實(shí)現(xiàn)CCNx進(jìn)行了研究。學(xué)習(xí)使用了CCNx的相關(guān)知識(shí),掌握了科學(xué)系統(tǒng)的研究方法。通過(guò)對(duì)CCNx的安裝、學(xué)習(xí)和使用,深入了解了CCNx的系統(tǒng)結(jié)構(gòu),并在此基礎(chǔ)上進(jìn)行了模擬實(shí)驗(yàn)及對(duì)比測(cè)試,獲得了科研數(shù)據(jù)。2.對(duì)內(nèi)容中心網(wǎng)絡(luò)的底層實(shí)現(xiàn)進(jìn)行了研究。提出了一種底層實(shí)現(xiàn)的內(nèi)容中心網(wǎng)絡(luò)方式,并與在上層實(shí)現(xiàn)的內(nèi)容中心網(wǎng)絡(luò)進(jìn)行了比較與分析。通過(guò)修改以太網(wǎng)幀和網(wǎng)卡模式,從底層實(shí)現(xiàn)了內(nèi)容中心網(wǎng)絡(luò)的基本架構(gòu),并且與通過(guò)在現(xiàn)有網(wǎng)絡(luò)基礎(chǔ)上模擬的內(nèi)容中心網(wǎng)絡(luò)架構(gòu)進(jìn)行了對(duì)比,獲得了效率方面的對(duì)比結(jié)構(gòu)。3.對(duì)名字部分編碼算法進(jìn)行了研究。對(duì)NCE方案進(jìn)行了透徹的研究與分析,深入理解了其算法的原理,并對(duì)其進(jìn)行了實(shí)現(xiàn)模擬。同時(shí)通過(guò)測(cè)試數(shù)據(jù)進(jìn)行了實(shí)驗(yàn)驗(yàn)證和對(duì)比,了解了其性能與效率情況。4.本文提出一種基于樹與哈希表的內(nèi)容中心網(wǎng)絡(luò)轉(zhuǎn)發(fā)引擎算法。將PIT和CS以及FIB存儲(chǔ)在一個(gè)結(jié)構(gòu)中,使轉(zhuǎn)發(fā)查找到結(jié)構(gòu)化簡(jiǎn),節(jié)省了存儲(chǔ)空間。通過(guò)實(shí)驗(yàn)對(duì)比,該策略在內(nèi)存空間占用等方面優(yōu)于傳統(tǒng)的轉(zhuǎn)發(fā)引擎策略,但是在查找效率上稍微遜色于其他方案,但是這也由于筆者的水平有限所致。在未來(lái)的研究中,將對(duì)該算法進(jìn)行進(jìn)一步的改進(jìn),使其轉(zhuǎn)發(fā)引擎的查找和處理效率進(jìn)一步提高。
[Abstract]:Content-centric network aims at redesigning today's network architecture: using the name of the content we need instead of IP address to locate the terminal, thus achieving the goal of improving the efficiency of data transmission.Unlike IP networks, content-centric networks use names to route and forward packets in the network.The name of a content-centric network includes a variable length string, which can include dozens or even hundreds of characters.Therefore, the routing table of the content-centric network may be several orders of magnitude larger than that of the current IP network.The structure of the complex names and the bulk routing table pose a great challenge to the search of the names in the routing.In order to overcome this huge challenge, we propose a forwarding engine algorithm which combines hash table and block prefix tree, and compare it with the forwarding engine method of other content center network nodes.We combine the PIT table and the CS table of a single node in the content-centric network into the same hash table, which simplifies the structure of the CCN, and explores its different performance by experimenting with several forwarding engine schemes of the content-centric network.In this paper, the forwarding engine of content center network node is studied systematically. The main results are as follows: 1.The open source implementation of content center network (CCNx) is studied.Learn to use the relevant knowledge of CCNx, master the scientific system research methods.Through the installation, study and use of CCNx, the system structure of CCNx is deeply understood, and on the basis of this, the simulation experiment and contrast test are carried out, and the scientific research data. 2. 2.The bottom realization of content center network is studied.This paper presents a kind of content center network which is implemented in the bottom layer and compares it with the content center network implemented in the upper layer.By modifying the Ethernet frame and network card mode, the basic architecture of the content-centric network is realized from the bottom layer, and compared with the content-centric network architecture simulated on the basis of the existing network, the contrasting structure of efficiency. 3.Part of the name coding algorithm is studied.The NCE scheme is studied and analyzed thoroughly, the principle of its algorithm is deeply understood, and the simulation is carried out.At the same time, through the test data for experimental verification and comparison, understand its performance and efficiency. 4. 4.This paper presents an algorithm for forwarding engine of content center network based on tree and hash table.The PIT, CS and FIB are stored in a single structure, which can save the storage space.The experimental results show that the proposed strategy is superior to the traditional forwarding engine strategy in terms of memory footprint, but is slightly less efficient than other schemes in terms of search efficiency, but this is also due to the limited level of the author.In the future research, the algorithm will be further improved to improve the efficiency of the search and processing of the forwarding engine.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.02

【參考文獻(xiàn)】

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

1 王振興,張彥肖,孫亞民,鄔江興;基于前綴范圍對(duì)分搜索的高性能路由查找[J];計(jì)算機(jī)學(xué)報(bào);2004年05期

，

本文編號(hào)：1752202