面向ICN的可擴(kuò)展名字路由機(jī)理研究
發(fā)布時(shí)間：2019-03-12 13:35
【摘要】：內(nèi)容分發(fā)和獲取已成為互聯(lián)網(wǎng)的主要應(yīng)用,而網(wǎng)絡(luò)體系結(jié)構(gòu)依然沿用主機(jī)為中心的端到端設(shè)計(jì)。為徹底解決應(yīng)用需求和體系結(jié)構(gòu)間的矛盾,新型網(wǎng)絡(luò)體系結(jié)構(gòu)-信息中心網(wǎng)絡(luò)(Information-Centric Networking,ICN)被提出。ICN以內(nèi)容作為網(wǎng)絡(luò)的首要對象,以高效地內(nèi)容分發(fā)和獲取為目標(biāo),已成為未來網(wǎng)絡(luò)研究的熱點(diǎn)之一。名字路由作為ICN的核心,通過內(nèi)容名字而非地址獲取內(nèi)容。然而,由于海量內(nèi)容名字以及內(nèi)容命名的位置無關(guān)設(shè)計(jì),導(dǎo)致ICN名字路由在規(guī)模和性能兩方面均面臨嚴(yán)峻的可擴(kuò)展問題挑戰(zhàn)。本文從可擴(kuò)展路由理論出發(fā),基于幾何路由從名字解析角度探索可行的可擴(kuò)展名字路由方案,主要從可擴(kuò)展名字路由設(shè)計(jì)和基于幾何路由的可擴(kuò)展優(yōu)化兩方面展開研究。(1)從overlay角度解決ICN路由可擴(kuò)展問題。雖然ICN名字解析路由多采用overlay設(shè)計(jì),但面臨兩方面問題:底層拓?fù)洳捎脗鹘y(tǒng)路由,本身存在可擴(kuò)展問題;覆蓋網(wǎng)拓?fù)渑c底層拓?fù)洳灰恢?易產(chǎn)生長路徑。針對以上問題,本文提出基于overlay的幾何名字路由方案,分別在網(wǎng)絡(luò)拓?fù)浜兔臻g拓?fù)渖辖鉀Q以上問題。針對底層路由可擴(kuò)展問題,提出通用幾何路由框架,適用于任意幾何路由。針對長路徑問題,提出基于雙層群組劃分策略的名字解析系統(tǒng),至多兩跳完成名字解析,通過與幾何路由框架結(jié)合,保證總能找到較近解析節(jié)點(diǎn)。理論分析和實(shí)驗(yàn)結(jié)果均表明該方案達(dá)到了規(guī)模和性能可擴(kuò)展的折中。(2)從underlay角度解決ICN路由可擴(kuò)展問題。通過分析幾何路由度量空間和DHT鍵值空間的特性,提出基于underlay的幾何名字路由方案,將幾何路由和基于DHT的名字解析系統(tǒng)置于相同度量空間,保證拓?fù)湟恢滦�。首�?基于符號空間層次劃分思想提出基于樹的度量空間T;然后,基于T提出了貪心嵌入和名字映射方案。內(nèi)容名字直接映射為度量空間坐標(biāo),以內(nèi)容坐標(biāo)為目的通過貪心轉(zhuǎn)發(fā)實(shí)現(xiàn)名字發(fā)布或解析,有效降低了路徑延展度和路由表規(guī)模。同時(shí),針對解析信息分布不均衡問題,提出不等概率編碼和注冊轉(zhuǎn)發(fā)的負(fù)載均衡策略,顯著提高了節(jié)點(diǎn)解析負(fù)載均衡。(3)動(dòng)態(tài)拓?fù)淇赡軐?dǎo)致路由更新可擴(kuò)展問題。對于幾何路由,節(jié)點(diǎn)加入或刪除可能引起大量節(jié)點(diǎn)甚至整個(gè)拓?fù)渲匦虑度?導(dǎo)致大規(guī)模坐標(biāo)更新;對于基于underlay的幾何名字路由,坐標(biāo)更新和拓?fù)渥兓赡軐?dǎo)致大規(guī)模解析信息更新。針對以上問題,本文提出支持動(dòng)態(tài)拓?fù)涞膸缀温酚珊蛶缀蚊致酚�。首�?分析幾何路由動(dòng)態(tài)問題的原因,提出維度擴(kuò)展在線嵌入策略,基于該策略進(jìn)一步提出比特串前綴嵌入以實(shí)現(xiàn)動(dòng)態(tài)幾何路由,有效避免了節(jié)點(diǎn)坐標(biāo)更新,繼而避免由坐標(biāo)更新導(dǎo)致的解析更新;隨后,提出基于粗粒度拓?fù)湫畔⒌拿钟成湟灾С只趗nderlay的動(dòng)態(tài)幾何名字路由,實(shí)現(xiàn)了拓?fù)錈o關(guān)性和解析負(fù)載均衡的折中,滿足解析負(fù)載均衡同時(shí),減少了拓?fù)渥兓瘜?dǎo)致的解析更新。(4)雖然幾何路由路由表只保存鄰居坐標(biāo),但其面臨坐標(biāo)長度可擴(kuò)展問題,即簡潔貪心嵌入問題。長坐標(biāo)使得數(shù)據(jù)包頭部過大,造成網(wǎng)絡(luò)資源浪費(fèi)。針對這一問題,本文提出一種簡潔前綴嵌入方案,通過壓縮關(guān)鍵路徑上節(jié)點(diǎn)坐標(biāo)保證簡潔性。首先,提出了重路徑分解和寬路徑分解兩種路徑分解方法,自底向上地從生成樹中尋找關(guān)鍵路徑;然后,提出壓縮嵌入方法,基于關(guān)鍵路徑自頂向下地實(shí)現(xiàn)生成樹簡潔嵌入。理論分析和實(shí)驗(yàn)均表明方案同時(shí)滿足貪心特性和簡潔特性。對于任意拓?fù)?貪心嵌入后坐標(biāo)長度上界為多項(xiàng)式對數(shù)比特。
[Abstract]:Content distribution and access have become the primary application of the Internet, and the network architecture continues to follow the host-centric end-to-end design. In order to thoroughly solve the contradiction between application requirements and architecture, a new network architecture-information-center networking (ICN) is proposed. ICN, as the primary object of the network, has become one of the hot spots of future network research. The name route is the core of the ICN, and the content is not obtained by the content name instead of the address. However, due to the massive content name and the location-independent design of the content naming, the ICN's name routing is faced with a severe and scalable challenge in both scale and performance. Based on the theory of the extensible route, this paper, based on the geometric routing, explores the feasible extensible name routing scheme from the name resolution angle, which is mainly based on the extensible name route design and the extensible optimization based on the geometric routing. (1) The problem of ICN routing can be solved by the overlay angle. Although the ICN's name resolution route is more than the overlay design, it faces two problems: the underlying topology adopts the traditional route, and there is an extension problem in itself; the overlay network topology is not consistent with the bottom layer topology, and the long path is easy to be generated. In view of the above problems, this paper proposes a geometric name routing scheme based on overlay, which solves the above problems in the network topology and the name space topology, respectively. This paper presents a general-purpose geometric routing framework for arbitrary geometric routing, aiming at the problem of the scalability of the bottom-layer routing. In order to solve the problem of long path, a name resolution system based on a two-layer group partition strategy is proposed. At most two hops complete the name resolution, and by combining with the geometric routing framework, it is ensured that the closer analytical nodes can always be found. Both the theoretical analysis and the experimental results show that the scheme has reached the trade-off of scale and performance. (2) The problem of ICN routing can be solved from the underlay angle. By analyzing the characteristics of the geometric routing metric space and the DHT key value space, a geometric name routing scheme based on the underlay is proposed, and the geometric routing and the DHT-based name resolution system are placed in the same metric space to ensure the topological consistency. First, a tree-based metric space T is proposed based on the symbol-space-level partitioning concept; then, the greedy embedding and the name mapping scheme are proposed based on the T. The content name is directly mapped to the coordinate of the metric space, and the name distribution or resolution is realized by the greedy forwarding based on the content coordinates, so that the path extension and the size of the routing table are effectively reduced. At the same time, aiming at the problem of unbalanced information distribution, the load balancing strategy of unequal probability coding and registration and forwarding is proposed, and the load balance of the node analysis is obviously improved. (3) The dynamic topology may cause the routing update to be extended. For geometric routing, the addition or deletion of a node may cause a large number of nodes and even the entire topology to be re-embedded, resulting in large-scale coordinate updates; for the underlay-based geometric name routing, the coordinate update and the topology change may result in large-scale resolution information updating. In view of the above problems, this paper proposes to support the geometric routing and the geometric name routing of the dynamic topology. firstly, the reason of the dynamic problem of the geometric routing is analyzed, the on-line embedding strategy of the dimension extension is proposed, the bit string prefix embedding is further proposed based on the strategy, the dynamic geometric routing is realized, the node coordinate updating is effectively avoided, the analytical update caused by the coordinate updating is avoided, The name mapping based on the coarse-grained topology information is proposed to support the dynamic geometric name routing based on the underlay, and the compromise between the topology independence and the analysis load balance is realized, and the analysis load balancing is satisfied, and the analytical update caused by the topology change is reduced. (4) Although the geometry routing table only saves the neighbor coordinates, it faces the problem of the extension of the coordinate length, that is, the simple greedy embedding problem. The long coordinates cause the head of the data packet to be too large to cause the waste of network resources. In order to solve this problem, this paper proposes a simple prefix embedding scheme, which guarantees the simplicity by compressing the coordinates of the nodes on the critical path. First, two path decomposition methods of re-path decomposition and wide path decomposition are proposed, and the key path is searched from the bottom up in the spanning tree; then, the compression embedding method is put forward, and the generation tree is simple and embedded based on the key path top-down. Both the theoretical analysis and the experiment show that the scheme can satisfy the greedy character and the simple character at the same time. For any topology, the upper bound of the coordinate length after the greedy embedding is a polynomial log bit.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2016
【分類號】：TP393.02
本文編號：2438830
[Abstract]:Content distribution and access have become the primary application of the Internet, and the network architecture continues to follow the host-centric end-to-end design. In order to thoroughly solve the contradiction between application requirements and architecture, a new network architecture-information-center networking (ICN) is proposed. ICN, as the primary object of the network, has become one of the hot spots of future network research. The name route is the core of the ICN, and the content is not obtained by the content name instead of the address. However, due to the massive content name and the location-independent design of the content naming, the ICN's name routing is faced with a severe and scalable challenge in both scale and performance. Based on the theory of the extensible route, this paper, based on the geometric routing, explores the feasible extensible name routing scheme from the name resolution angle, which is mainly based on the extensible name route design and the extensible optimization based on the geometric routing. (1) The problem of ICN routing can be solved by the overlay angle. Although the ICN's name resolution route is more than the overlay design, it faces two problems: the underlying topology adopts the traditional route, and there is an extension problem in itself; the overlay network topology is not consistent with the bottom layer topology, and the long path is easy to be generated. In view of the above problems, this paper proposes a geometric name routing scheme based on overlay, which solves the above problems in the network topology and the name space topology, respectively. This paper presents a general-purpose geometric routing framework for arbitrary geometric routing, aiming at the problem of the scalability of the bottom-layer routing. In order to solve the problem of long path, a name resolution system based on a two-layer group partition strategy is proposed. At most two hops complete the name resolution, and by combining with the geometric routing framework, it is ensured that the closer analytical nodes can always be found. Both the theoretical analysis and the experimental results show that the scheme has reached the trade-off of scale and performance. (2) The problem of ICN routing can be solved from the underlay angle. By analyzing the characteristics of the geometric routing metric space and the DHT key value space, a geometric name routing scheme based on the underlay is proposed, and the geometric routing and the DHT-based name resolution system are placed in the same metric space to ensure the topological consistency. First, a tree-based metric space T is proposed based on the symbol-space-level partitioning concept; then, the greedy embedding and the name mapping scheme are proposed based on the T. The content name is directly mapped to the coordinate of the metric space, and the name distribution or resolution is realized by the greedy forwarding based on the content coordinates, so that the path extension and the size of the routing table are effectively reduced. At the same time, aiming at the problem of unbalanced information distribution, the load balancing strategy of unequal probability coding and registration and forwarding is proposed, and the load balance of the node analysis is obviously improved. (3) The dynamic topology may cause the routing update to be extended. For geometric routing, the addition or deletion of a node may cause a large number of nodes and even the entire topology to be re-embedded, resulting in large-scale coordinate updates; for the underlay-based geometric name routing, the coordinate update and the topology change may result in large-scale resolution information updating. In view of the above problems, this paper proposes to support the geometric routing and the geometric name routing of the dynamic topology. firstly, the reason of the dynamic problem of the geometric routing is analyzed, the on-line embedding strategy of the dimension extension is proposed, the bit string prefix embedding is further proposed based on the strategy, the dynamic geometric routing is realized, the node coordinate updating is effectively avoided, the analytical update caused by the coordinate updating is avoided, The name mapping based on the coarse-grained topology information is proposed to support the dynamic geometric name routing based on the underlay, and the compromise between the topology independence and the analysis load balance is realized, and the analysis load balancing is satisfied, and the analytical update caused by the topology change is reduced. (4) Although the geometry routing table only saves the neighbor coordinates, it faces the problem of the extension of the coordinate length, that is, the simple greedy embedding problem. The long coordinates cause the head of the data packet to be too large to cause the waste of network resources. In order to solve this problem, this paper proposes a simple prefix embedding scheme, which guarantees the simplicity by compressing the coordinates of the nodes on the critical path. First, two path decomposition methods of re-path decomposition and wide path decomposition are proposed, and the key path is searched from the bottom up in the spanning tree; then, the compression embedding method is put forward, and the generation tree is simple and embedded based on the key path top-down. Both the theoretical analysis and the experiment show that the scheme can satisfy the greedy character and the simple character at the same time. For any topology, the upper bound of the coordinate length after the greedy embedding is a polynomial log bit.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2016
【分類號】：TP393.02
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 芮蘭蘭;彭昊;黃豪球;邱雪松;史瑞昌;;基于內(nèi)容流行度和節(jié)點(diǎn)中心度匹配的信息中心網(wǎng)絡(luò)緩存策略[J];電子與信息學(xué)報(bào);2016年02期
2 曾宇晶;靳明雙;羅洪斌;;基于內(nèi)容分塊流行度分級的信息中心網(wǎng)絡(luò)緩存策略[J];電子學(xué)報(bào);2016年02期
3 劉宗海;王鵬;張校輝;金飛蔡;;內(nèi)容中心網(wǎng)絡(luò)中基于溫度場的路由算法[J];電信科學(xué);2015年12期
4 王永功;李振宇;武慶華;謝高崗;;信息中心網(wǎng)絡(luò)內(nèi)緩存替換算法性能分析與優(yōu)化[J];計(jì)算機(jī)研究與發(fā)展;2015年09期
5 DUAN Jie;WANG Xiong;WANG Sheng;XU Shizhong;;HHR:Hierarchical Hybrid Routing Scheme for Information-Centric Network[J];中國通信;2015年06期
6 曹健;王興偉;張金宏;黃敏;;數(shù)據(jù)驅(qū)動(dòng)的信息中心網(wǎng)絡(luò)認(rèn)知路由協(xié)議[J];計(jì)算機(jī)研究與發(fā)展;2015年04期
7 孫欣欣;王興偉;李潔;黃敏;;一種ICN中的啟發(fā)式路由機(jī)制[J];計(jì)算機(jī)科學(xué);2014年12期
8 劉外喜;余順爭;蔡君;高鷹;;ICN中的一種協(xié)作緩存機(jī)制[J];軟件學(xué)報(bào);2013年08期
9 唐明董;張國清;楊景;張國強(qiáng);;互聯(lián)網(wǎng)可擴(kuò)展路由[J];軟件學(xué)報(bào);2010年10期
10 唐明董;張國清;楊景;;大規(guī)模網(wǎng)絡(luò)上基于圖嵌入的可擴(kuò)展路由方法[J];計(jì)算機(jī)研究與發(fā)展;2010年07期
，本文編號：2438830
本文鏈接：http://sikaile.net/shoufeilunwen/xxkjbs/2438830.html
最近更新
教材專著
