本文選題：身份與位置分離　切入點(diǎn)：映射系統(tǒng)　出處：《北京交通大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著互聯(lián)網(wǎng)技術(shù)的快速發(fā)展,現(xiàn)有互聯(lián)網(wǎng)也逐漸暴露出在安全性、移動性和路由可擴(kuò)展性等諸多方面的問題。上述問題的根本原因在于傳統(tǒng)互聯(lián)網(wǎng)中IP地址對身份信息與位置信息的綁定。為解決此類問題,新型互聯(lián)網(wǎng)應(yīng)運(yùn)而生。新型互聯(lián)網(wǎng)通過引入接入標(biāo)識和路由標(biāo)識,實(shí)現(xiàn)身份與位置分離映射機(jī)制,并通過映射系統(tǒng)為分離映射機(jī)制實(shí)現(xiàn)映射信息的發(fā)布、查找、更新與刪除機(jī)制。本文依托現(xiàn)有國家973項(xiàng)目,結(jié)合新型互聯(lián)網(wǎng)的特點(diǎn),設(shè)計(jì)出一套層次存儲與分布式存儲相結(jié)合的高效映射系統(tǒng),實(shí)現(xiàn)了映射信息的快速查詢,提高了映射表管理能力,完成了對扁平標(biāo)識和聚合標(biāo)識的靈活支持。本文首先分析了現(xiàn)有標(biāo)識映射系統(tǒng)的優(yōu)缺點(diǎn),在此基礎(chǔ)之上,提出了新型互聯(lián)網(wǎng)接入標(biāo)識與路由標(biāo)識映射系統(tǒng)的需求分析與整體設(shè)計(jì)。新型互聯(lián)網(wǎng)映射系統(tǒng)在邏輯上形成類DNS的樹形結(jié)構(gòu),在每個(gè)葉子節(jié)點(diǎn)中實(shí)現(xiàn)分布式存儲結(jié)構(gòu),而在上層的非葉子節(jié)點(diǎn)中實(shí)現(xiàn)層次存儲結(jié)構(gòu)。其中分布式存儲結(jié)構(gòu)由Chord算法實(shí)現(xiàn)和維護(hù),此種設(shè)計(jì)避免了單純Chord算法維護(hù)的分布式存儲帶來的擴(kuò)展性差問題,提升了系統(tǒng)的可擴(kuò)展性,并實(shí)現(xiàn)了對扁平標(biāo)識及聚合標(biāo)識的靈活支持。此后本文實(shí)現(xiàn)對映射系統(tǒng)的模塊化設(shè)計(jì),并重點(diǎn)闡述了映射系統(tǒng)的消息處理模塊、系統(tǒng)維護(hù)模塊、映射表模塊及緩存模塊的設(shè)計(jì)與實(shí)現(xiàn)過程。其中系統(tǒng)的維護(hù)模塊主要為Chord算法正確性的維護(hù),映射表模塊實(shí)現(xiàn)了映射表對最長前綴匹配的有效支持,并通過實(shí)現(xiàn)高效的Rehash機(jī)制,實(shí)現(xiàn)了映射信息在映射表中的快速查詢。為降低了單一時(shí)間內(nèi)集中Rehash帶來的資源消耗問題,本文同時(shí)設(shè)計(jì)了兩種漸進(jìn)式Rehash機(jī)制,使資源消耗問題得到有效平滑。而緩存模塊則通過實(shí)現(xiàn)高效的有重置自適應(yīng)緩存替換機(jī)制,完成對頻率及時(shí)間的雙重捕獲,為映射信息的快速查詢提供了有效的支持。本文通過搭建新型互聯(lián)網(wǎng)映射系統(tǒng)的原型系統(tǒng),實(shí)現(xiàn)了對映射系統(tǒng)各模塊的測試。測試結(jié)果表明系統(tǒng)的實(shí)現(xiàn)均達(dá)到了映射系統(tǒng)的設(shè)計(jì)目標(biāo)。最后本文對全文進(jìn)行了總結(jié),并對后續(xù)工作做出了展望。
[Abstract]:With the rapid development of Internet technology, the existing Internet is gradually exposed to security. Mobility, routing scalability and many other issues. The root cause of these problems is the binding of IP addresses to identity information and location information in the traditional Internet. The new Internet emerges as the times require. The new Internet realizes identity and location separation mapping mechanism by introducing access identification and routing identification, and the mapping information is published and searched by mapping system. Based on the existing 973 projects and the characteristics of the new Internet, this paper designs an efficient mapping system which combines hierarchical storage with distributed storage, and realizes the fast query of mapping information. The management ability of mapping table is improved, and the flexible support for flat and aggregate identification is completed. Firstly, the advantages and disadvantages of the existing marking mapping system are analyzed. The requirement analysis and overall design of a new type of Internet access identification and routing identification mapping system are proposed. The new type of Internet mapping system logically forms a tree structure like DNS, and implements distributed storage structure in each leaf node. The distributed storage structure is implemented and maintained by the Chord algorithm, which avoids the problem of poor scalability caused by the distributed storage maintained by the simple Chord algorithm. The extensibility of the system is improved, and the flexible support for flat and aggregate marking is realized. Then, the modularization design of the mapping system is realized, and the message processing module and the maintenance module of the mapping system are described. The design and implementation of the mapping table module and the cache module, in which the maintenance module of the system is mainly the maintenance of the correctness of the Chord algorithm. The mapping table module realizes the effective support of the mapping table for the longest prefix matching, and realizes the efficient Rehash mechanism. In order to reduce the resource consumption caused by centralized Rehash in a single time, two kinds of progressive Rehash mechanisms are designed in this paper. The problem of resource consumption is smoothed effectively, and the cache module achieves the double acquisition of frequency and time by implementing an efficient adaptive cache replacement mechanism with reset. It provides an effective support for fast query of mapping information. This paper builds a prototype system of a new type of Internet mapping system. The test results show that the implementation of the system has reached the design goal of the mapping system. Finally, this paper summarizes the full text and makes a prospect for the future work.
【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP393.02

【參考文獻(xiàn)】

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

1 萬明;張宏科;尚文利;沈爍;劉穎;;一體化標(biāo)識網(wǎng)絡(luò)映射緩存DoS攻擊防范方法研究[J];電子學(xué)報(bào);2015年10期

2 游軍玲;葛敬國;李佟;鄂躍鵬;;未來互聯(lián)網(wǎng)試驗(yàn)床關(guān)鍵技術(shù)研究及進(jìn)展[J];計(jì)算機(jī)應(yīng)用;2014年S1期

3 蘇偉;陳佳;周華春;張宏科;;智慧協(xié)同網(wǎng)絡(luò)中的服務(wù)機(jī)理研究[J];電子學(xué)報(bào);2013年07期

4 郜帥;王洪超;王凱;張宏科;;智慧網(wǎng)絡(luò)組件協(xié)同機(jī)制研究[J];電子學(xué)報(bào);2013年07期

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

6 吳建平;林嵩;徐恪;劉瑩;朱敏;;可演進(jìn)的新一代互聯(lián)網(wǎng)體系結(jié)構(gòu)研究進(jìn)展[J];計(jì)算機(jī)學(xué)報(bào);2012年06期

7 蘇偉;劉琪;張宏科;;一體化標(biāo)識網(wǎng)絡(luò)體系及關(guān)鍵技術(shù)[J];中興通訊技術(shù);2011年02期

8 萬長勝;胡愛群;;移動IPv4的快速重認(rèn)證協(xié)議[J];計(jì)算機(jī)工程;2011年03期

9 吳建平;劉瑩;吳茜;;新一代互聯(lián)網(wǎng)體系結(jié)構(gòu)理論研究進(jìn)展[J];中國科學(xué)(E輯:信息科學(xué));2008年10期

10 吳建平;吳茜;徐恪;;下一代互聯(lián)網(wǎng)體系結(jié)構(gòu)基礎(chǔ)研究及探索[J];計(jì)算機(jī)學(xué)報(bào);2008年09期

相關(guān)博士學(xué)位論文 前1條

1 李曉倩;一體化標(biāo)識網(wǎng)絡(luò)身份與位置映射關(guān)鍵技術(shù)研究[D];北京交通大學(xué);2013年

，

本文編號：1622669