本文選題：內(nèi)容中心網(wǎng)絡　切入點：命名數(shù)據(jù)網(wǎng)絡　出處：《解放軍信息工程大學》2014年碩士論文　論文類型：學位論文

【摘要】：命名數(shù)據(jù)網(wǎng)絡(Named Data Networking,NDN)作為一種典型的以內(nèi)容為中心的未來互聯(lián)網(wǎng)發(fā)展模式,以其全新的體系架構(gòu)和獨特的設計思路,直接對內(nèi)容進行命名,實現(xiàn)網(wǎng)絡對內(nèi)容的高效分發(fā),在下一代和未來互聯(lián)網(wǎng)研究中具有廣闊的應用前景。但是,由于NDN與現(xiàn)有TCP/IP互聯(lián)網(wǎng)從體系結(jié)構(gòu)上有較大差異,現(xiàn)有移動性支持方案難以支持NDN的新型網(wǎng)絡環(huán)境,主要體現(xiàn)在:1)請求者移動將引入額外通信時延并且可能導致數(shù)據(jù)應答失敗;2)分層的命名結(jié)構(gòu)使數(shù)據(jù)源移動給網(wǎng)絡帶來巨大的更新開銷;3)缺乏對移動NDN環(huán)境下應答包反向路徑失效問題的考慮。為此,本文依托國家973計劃項目“可重構(gòu)信息通信基礎(chǔ)網(wǎng)絡體系研究”,針對命名數(shù)據(jù)網(wǎng)絡中的移動性問題展開研究。本文在深入分析NDN基本工作原理和通信流程的基礎(chǔ)上,對NDN的移動主體進行劃分。然后,針對請求者的移動性、數(shù)據(jù)源的移動性以及移動NDN環(huán)境下的路由問題分別展開研究,分別提出了相應的移動性支持機制。主要工作和研究成果包括:1.提出了一種基于拓撲勢的請求者移動性支持機制(TPB NDN)。該機制通過構(gòu)建內(nèi)容副本的拓撲勢能,從為請求者選擇最優(yōu)數(shù)據(jù)源的角度出發(fā),利用節(jié)點獲取到的拓撲信息,結(jié)合緩存策略及拓撲勢通告,實現(xiàn)對請求者移動性的支持。性能分析表明,該方法減小了內(nèi)容請求時延,有效提高了節(jié)點的緩存命中率。2.提出了一種基于多代理的動態(tài)數(shù)據(jù)源管理機制(MMA NDN)。該方法將數(shù)據(jù)源按移動規(guī)律進行劃分,分別采取不同管理模式在多個代理間協(xié)同管理,并合理進行內(nèi)容緩存,充分利用網(wǎng)絡特性減小數(shù)據(jù)源移動帶來的切換時延,優(yōu)化命名數(shù)據(jù)網(wǎng)絡性能,實現(xiàn)對數(shù)據(jù)源移動性的支持。仿真結(jié)果表明,本方案能有效減小切換時延、降低切換開銷和提高傳輸效率。3.提出了一種移動NDN環(huán)境下基于興趣相似度的概率路由算法(PRAIS NDN)。該算法利用名字路由的特點,在興趣包傳遞過程中選擇興趣相似度更高的節(jié)點進行轉(zhuǎn)發(fā),提高路由發(fā)現(xiàn)效率;在數(shù)據(jù)包回傳的過程中,結(jié)合PIT表項信息和概率路由選擇轉(zhuǎn)發(fā)節(jié)點,并將內(nèi)容在請求者處進行緩存,從而有效減小往返時延、降低網(wǎng)絡開銷率、提高傳遞效率和網(wǎng)絡數(shù)據(jù)傳輸總量,實現(xiàn)NDN在移動環(huán)境中的應用。
[Abstract]:Named Data networking (NDN) is a typical content-centric future Internet development model. With its new architecture and unique design ideas, it names the content directly and realizes the efficient distribution of the content on the network. It has a broad application prospect in the next generation and future Internet research. However, due to the great differences between NDN and existing TCP/IP Internet in architecture, it is difficult for the existing mobility support schemes to support the new network environment of NDN. Mainly reflected in: 1) requester mobile will introduce extra communication delay and may cause data reply failure. The hierarchical naming structure causes data source mobility to bring huge updating overhead to the network. (3) lack of response to mobile NDN environment. Consideration of packet reverse path failure. Based on the National 973 Project "Research on Reconfigurable Information and Communication basic Network Architecture", this paper focuses on the mobility problem in named data network. Based on the in-depth analysis of the basic working principle and communication flow of NDN, Then, the mobility of the requestor, the mobility of the data source and the routing problem in the mobile NDN environment are studied. Corresponding mobility support mechanisms are proposed respectively. The main work and research results include: 1. A mobility support mechanism for requesters based on topological potential is proposed. This mechanism is based on topological potential energy of content replica. From the point of selecting the optimal data source for the requester, using the topology information obtained by the node, combined with the cache policy and the topological potential announcement, the mobility of the requestor is supported. The performance analysis shows that the method reduces the delay of the content request. The cache hit ratio of nodes is improved effectively. 2. A dynamic data source management mechanism based on multi-agent is proposed. The content cache is carried out reasonably, the handoff delay caused by the moving of data source is reduced by the network characteristic, the performance of named data network is optimized, and the mobility of data source is supported. The simulation results show that the scheme can effectively reduce the handoff delay. This paper presents a probabilistic routing algorithm based on interest similarity in mobile NDN environment, which utilizes the characteristics of name routing. In the process of packet transfer, we select the node with higher interest similarity to forward, improve the efficiency of route discovery; in the process of packet return, combine the PIT table item information and probability routing to select the forwarding node. The content is cached at the requester, which can effectively reduce the round-trip delay, reduce the network overhead rate, improve the transmission efficiency and the total amount of network data transmission, and realize the application of NDN in mobile environment.
【學位授予單位】：解放軍信息工程大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.02

【參考文獻】

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

1 饒迎;高德云;羅洪斌;周華春;;CCN網(wǎng)絡中一種基于代理主動緩存的用戶移動性支持方案[J];電子與信息學報;2013年10期

2 謝高崗;張玉軍;李振宇;孫毅;謝應科;李忠誠;劉韻潔;;未來互聯(lián)網(wǎng)體系結(jié)構(gòu)研究綜述[J];計算機學報;2012年06期

3 楊柳;馬少武;王曉湘;;以內(nèi)容為中心的互聯(lián)網(wǎng)體系架構(gòu)研究[J];信息通信技術(shù);2011年06期

4 淦文燕;赫南;李德毅;王建民;;一種基于拓撲勢的網(wǎng)絡社區(qū)發(fā)現(xiàn)方法[J];軟件學報;2009年08期

5 薛建生;萬霖宜;王光興;;基于多播的移動IP位置管理的研究[J];通信學報;2007年11期

6 淦文燕;李德毅;王建民;;一種基于數(shù)據(jù)場的層次聚類方法[J];電子學報;2006年02期

7 田潤濤;謝培山;;色譜指紋圖譜相似度評價方法的規(guī)范化研究(一)[J];中藥新藥與臨床藥理;2006年01期

，

本文編號：1631557