內(nèi)容中心網(wǎng)絡(luò)路由時(shí)延優(yōu)化關(guān)鍵技術(shù)研究
發(fā)布時(shí)間：2018-10-18 16:05
【摘要】：互聯(lián)網(wǎng)內(nèi)容流量的飛速增長(zhǎng)以及用戶QoS需求的不斷提高使得現(xiàn)有TCP/IP網(wǎng)絡(luò)內(nèi)容傳輸技術(shù)乃至架構(gòu)面臨全新挑戰(zhàn)。以內(nèi)容中心網(wǎng)絡(luò)(Content Centric Networks,CCN)為代表的新型網(wǎng)絡(luò)體系結(jié)構(gòu)的研究發(fā)展迅速,越來越得到研究人員的關(guān)注。內(nèi)容中心網(wǎng)絡(luò)的核心思想為“節(jié)點(diǎn)的普遍緩存”以及直接面向數(shù)據(jù)內(nèi)容的路由轉(zhuǎn)發(fā)模式。但作為全新的內(nèi)容路由模型,其命名機(jī)制、轉(zhuǎn)發(fā)策略以及內(nèi)容查詢等方面的不完善也導(dǎo)致了其路由時(shí)延過大。在內(nèi)容中心網(wǎng)絡(luò)中,路由時(shí)延的主要原因有:(1)網(wǎng)絡(luò)傳輸層面:原始的CCN內(nèi)容路由傳輸方法仍采用傳統(tǒng)網(wǎng)絡(luò)的模式,將請(qǐng)求路由到內(nèi)容提供商的源服務(wù)器獲取內(nèi)容,數(shù)據(jù)傳輸路徑過長(zhǎng)造成內(nèi)容獲取時(shí)延增加。(2)節(jié)點(diǎn)處理層面:CCN網(wǎng)絡(luò)直接面向內(nèi)容,名稱具有唯一性且長(zhǎng)度可變,數(shù)據(jù)規(guī)模過大;路由查詢時(shí),傳統(tǒng)的匹配算法與名字長(zhǎng)度線性相關(guān),效率低下。本文研究聚焦在內(nèi)容中心網(wǎng)絡(luò)的路由時(shí)延優(yōu)化關(guān)鍵技術(shù)。首先,以“最快獲取內(nèi)容”為目標(biāo),提出面向鄰近緩存的引導(dǎo)式便捷路由機(jī)制,縮短內(nèi)容請(qǐng)求所經(jīng)歷的“行程”,減小內(nèi)容請(qǐng)求時(shí)延;其次,針對(duì)現(xiàn)有內(nèi)容路由節(jié)點(diǎn)數(shù)據(jù)規(guī)模過大的問題,提出多徑路由聚合算法壓縮路由表項(xiàng);最后,從“優(yōu)化處理時(shí)間”的角度出發(fā),提出基于哈希編碼的內(nèi)容查詢機(jī)制,實(shí)現(xiàn)了路由節(jié)點(diǎn)的快速匹配。本文具體研究如下:1、提出一種面向鄰近緩存的引導(dǎo)式便捷路由機(jī)制路由節(jié)點(diǎn)向其鄰居通告部分活躍內(nèi)容,建立快捷路由表,使節(jié)點(diǎn)知曉“內(nèi)容存儲(chǔ)”的位置,從而選取最優(yōu)節(jié)點(diǎn)獲取內(nèi)容。便捷路由機(jī)制能夠快速探知周圍節(jié)點(diǎn)的緩存,縮短請(qǐng)求的傳輸路徑,優(yōu)化請(qǐng)求轉(zhuǎn)發(fā)時(shí)間。理論分析與仿真結(jié)果表明:相較于其他機(jī)制,該機(jī)制能夠有效利用鄰近節(jié)點(diǎn)緩存,降低拓?fù)渚W(wǎng)絡(luò)用戶平均時(shí)延約5ms,服務(wù)器負(fù)載減少約30%。2、提出一種基于后綴摘要的多可選下一跳轉(zhuǎn)發(fā)信息表聚合算法采用多徑路由思想,針對(duì)每個(gè)聚合前綴都有對(duì)應(yīng)可選多個(gè)下一跳,選擇“最佳路徑”使具有公共路徑的前綴進(jìn)一步聚合,在利用布魯姆過濾解決后綴空洞的前提下壓縮路由表項(xiàng),減少節(jié)點(diǎn)路由查詢數(shù)量。理論分析和仿真實(shí)驗(yàn)表明:將后綴摘要和可選下一跳轉(zhuǎn)發(fā)信息表聚合相結(jié)合,可使路由表項(xiàng)縮減到原來的20%左右;隨著布魯姆過濾器哈希函數(shù)的增多,可使內(nèi)容路由的成功率接近100%。3、提出一種基于哈希編碼的內(nèi)容路由查詢機(jī)制提出一種有效的元素哈希編碼機(jī)制,利用哈希函數(shù)壓縮數(shù)據(jù)名字并采用改進(jìn)的狀態(tài)轉(zhuǎn)換陣列實(shí)現(xiàn)名稱最長(zhǎng)前綴的快速匹配,設(shè)計(jì)一種快速的增量更新機(jī)制以滿足內(nèi)容網(wǎng)絡(luò)轉(zhuǎn)發(fā)過程中頻繁的插入,修改與刪除等操作。仿真結(jié)果表明,本文提出的方法使路由條目壓縮率達(dá)到40%以上,匹配速率提高約10%。
[Abstract]:With the rapid growth of Internet content flow and the increasing demand of QoS, the existing TCP/IP network content transmission technology and architecture are facing new challenges. The research of new network architecture, represented by (Content Centric Networks,CCN), is developing rapidly and has been paid more and more attention by researchers. The core idea of content-centric network is "universal cache of nodes" and direct data content oriented routing and forwarding mode. However, as a new content routing model, its naming mechanism, forwarding strategy and content query are not perfect. In content-centric network, the main reasons of routing delay are as follows: (1) Network transmission: the original CCN content routing method still adopts the traditional network mode, routing the request to the source server of the content provider to obtain the content. The data transmission path is too long to cause the content acquisition delay to increase. (2) Node processing level: CCN network is directly content-oriented, the name is unique and the length is variable, the data scale is too large; when routing query, The traditional matching algorithm is linearly related to the length of the name and is inefficient. This paper studies the key technologies of routing delay optimization focused on content-centric networks. First of all, aiming at "the fastest access to content", a guided and convenient routing mechanism for neighboring cache is proposed to shorten the "journey" of content request and reduce the delay of content request. Aiming at the problem of excessive data size of existing content routing nodes, a multi-path routing aggregation algorithm is proposed to compress routing table items. Finally, from the point of view of "optimal processing time", a content query mechanism based on hash coding is proposed. The fast matching of routing nodes is realized. The specific research in this paper is as follows: 1. A guided and convenient routing mechanism for neighbor cache is proposed. The routing node notifies its neighbors of some active content, establishes a shortcut routing table, and makes the node know the location of "content storage". In order to select the optimal node to get the content. The convenient routing mechanism can quickly detect the cache of the surrounding nodes, shorten the transmission path of requests, and optimize the request forwarding time. Theoretical analysis and simulation results show that compared with other mechanisms, the proposed mechanism can effectively utilize the cache of adjacent nodes. The average delay of users in topology networks is reduced by about 5 msand the server load is reduced by about 30. 2. A multi-optional next-hop forwarding information table aggregation algorithm based on suffix summary is proposed using multipath routing. For each aggregation prefix has corresponding multiple hops, select the "best path" to further aggregate the prefix with common path, and compress the routing table items by using Bloom filter to solve the suffix hole. Reduce the number of node routing queries. Theoretical analysis and simulation experiments show that the routing table items can be reduced to about 20% by combining the suffix summary with the optional next hop forwarding information table aggregation, and with the increase of the hash function of the Bloom filter, The success rate of content routing is close to 100. 3. A content routing query mechanism based on hashing coding is proposed and an effective element hash encoding mechanism is proposed. Using the hash function to compress the data names and use the improved state transformation array to realize the fast matching of the longest prefix, a fast incremental updating mechanism is designed to satisfy the frequent inserts in the process of content network forwarding. Modify and delete operations. The simulation results show that the proposed method can reduce the compression rate of routing entries to more than 40% and increase the matching rate by about 10%.
【學(xué)位授予單位】：解放軍信息工程大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.02
本文編號(hào)：2279643
[Abstract]:With the rapid growth of Internet content flow and the increasing demand of QoS, the existing TCP/IP network content transmission technology and architecture are facing new challenges. The research of new network architecture, represented by (Content Centric Networks,CCN), is developing rapidly and has been paid more and more attention by researchers. The core idea of content-centric network is "universal cache of nodes" and direct data content oriented routing and forwarding mode. However, as a new content routing model, its naming mechanism, forwarding strategy and content query are not perfect. In content-centric network, the main reasons of routing delay are as follows: (1) Network transmission: the original CCN content routing method still adopts the traditional network mode, routing the request to the source server of the content provider to obtain the content. The data transmission path is too long to cause the content acquisition delay to increase. (2) Node processing level: CCN network is directly content-oriented, the name is unique and the length is variable, the data scale is too large; when routing query, The traditional matching algorithm is linearly related to the length of the name and is inefficient. This paper studies the key technologies of routing delay optimization focused on content-centric networks. First of all, aiming at "the fastest access to content", a guided and convenient routing mechanism for neighboring cache is proposed to shorten the "journey" of content request and reduce the delay of content request. Aiming at the problem of excessive data size of existing content routing nodes, a multi-path routing aggregation algorithm is proposed to compress routing table items. Finally, from the point of view of "optimal processing time", a content query mechanism based on hash coding is proposed. The fast matching of routing nodes is realized. The specific research in this paper is as follows: 1. A guided and convenient routing mechanism for neighbor cache is proposed. The routing node notifies its neighbors of some active content, establishes a shortcut routing table, and makes the node know the location of "content storage". In order to select the optimal node to get the content. The convenient routing mechanism can quickly detect the cache of the surrounding nodes, shorten the transmission path of requests, and optimize the request forwarding time. Theoretical analysis and simulation results show that compared with other mechanisms, the proposed mechanism can effectively utilize the cache of adjacent nodes. The average delay of users in topology networks is reduced by about 5 msand the server load is reduced by about 30. 2. A multi-optional next-hop forwarding information table aggregation algorithm based on suffix summary is proposed using multipath routing. For each aggregation prefix has corresponding multiple hops, select the "best path" to further aggregate the prefix with common path, and compress the routing table items by using Bloom filter to solve the suffix hole. Reduce the number of node routing queries. Theoretical analysis and simulation experiments show that the routing table items can be reduced to about 20% by combining the suffix summary with the optional next hop forwarding information table aggregation, and with the increase of the hash function of the Bloom filter, The success rate of content routing is close to 100. 3. A content routing query mechanism based on hashing coding is proposed and an effective element hash encoding mechanism is proposed. Using the hash function to compress the data names and use the improved state transformation array to realize the fast matching of the longest prefix, a fast incremental updating mechanism is designed to satisfy the frequent inserts in the process of content network forwarding. Modify and delete operations. The simulation results show that the proposed method can reduce the compression rate of routing entries to more than 40% and increase the matching rate by about 10%.
【學(xué)位授予單位】：解放軍信息工程大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.02
【參考文獻(xiàn)】
相關(guān)期刊論文 前4條
1 葉潤(rùn)生;徐明偉;;命名數(shù)據(jù)網(wǎng)絡(luò)中的鄰居緩存路由策略[J];計(jì)算機(jī)科學(xué)與探索;2012年07期
2 閔二龍;陳震;許宏峰;梁勇;;內(nèi)容中心網(wǎng)絡(luò)CCN研究進(jìn)展探析[J];信息網(wǎng)絡(luò)安全;2012年02期
3 楊柳;馬少武;王曉湘;;以內(nèi)容為中心的互聯(lián)網(wǎng)體系架構(gòu)研究[J];信息通信技術(shù);2011年06期
4 李曉明,鳳旺森;兩種對(duì)URL的散列效果很好的函數(shù)[J];軟件學(xué)報(bào);2004年02期
，本文編號(hào)：2279643
本文鏈接：http://sikaile.net/guanlilunwen/ydhl/2279643.html
最近更新
教材專著
