匿名P2P網(wǎng)絡(luò)中資源發(fā)現(xiàn)與拓?fù)錅y(cè)量研究
發(fā)布時(shí)間：2018-03-09 19:42
本文選題：匿名通信 切入點(diǎn)：拓?fù)?/strong> 出處：《北京郵電大學(xué)》2015年碩士論文 論文類型：學(xué)位論文
【摘要】：如今,互聯(lián)網(wǎng)隱私變得越來越重要和敏感,已成為科研領(lǐng)域的研究熱點(diǎn)。為保護(hù)互聯(lián)網(wǎng)用戶的隱私,隱私保護(hù)技術(shù)應(yīng)運(yùn)而生。匿名通信是一種隱私保護(hù)技術(shù),研究者已從各方面著手對(duì)其研究,并開發(fā)了各種從節(jié)點(diǎn)資源發(fā)現(xiàn)、節(jié)點(diǎn)資源選擇到傳輸信息等相區(qū)別的匿名通信架構(gòu)及系統(tǒng)�，F(xiàn)有的研究著重于解決這些系統(tǒng)及架構(gòu)面臨的問題及挑戰(zhàn),特別是匿名性和性能問題。值得一提的是,當(dāng)前的中心化匿名通信系統(tǒng)架構(gòu)將被P2P架構(gòu)取代。 匿名P2P網(wǎng)絡(luò)(如Crowds、Tarzan等)是由成千上萬(wàn)個(gè)節(jié)點(diǎn)組成的,從而匿名網(wǎng)絡(luò)的許多問題歸根結(jié)底皆是由節(jié)點(diǎn)資源問題引起的。例如節(jié)點(diǎn)的性能不一,基于木桶原理,匿名路徑的性能取決于最差節(jié)點(diǎn)的性能。而且節(jié)點(diǎn)的頻繁出入會(huì)導(dǎo)致匿名系統(tǒng)中節(jié)點(diǎn)資源的數(shù)目不穩(wěn)定,網(wǎng)絡(luò)拓?fù)潆S之不斷變化,從而匿名集大小不斷變化,系統(tǒng)的匿名性及穩(wěn)定性也將無法保證。其中,匿名P2P網(wǎng)絡(luò)中節(jié)點(diǎn)有限和路由效率問題都是目前的核心問題。本文圍繞這一核心問題,全面分析了目前匿名P2P網(wǎng)絡(luò)中的拓?fù)錂C(jī)制。首先本文調(diào)研了國(guó)內(nèi)外針對(duì)節(jié)點(diǎn)資源發(fā)現(xiàn)及拓?fù)錅y(cè)量方面研究的主要機(jī)構(gòu)及其研究現(xiàn)狀,提出了匿名網(wǎng)絡(luò)節(jié)點(diǎn)資源發(fā)現(xiàn)及拓?fù)溲芯靠蚣?以方便后續(xù)學(xué)者可一目了然得撲捉到匿名網(wǎng)絡(luò)拓?fù)涞募軜?gòu)及核心模塊。由于節(jié)點(diǎn)資源問題是匿名P2P網(wǎng)絡(luò)的核心問題,且路由算法是影響匿名系統(tǒng)性能的核心算法,本文就此著重于節(jié)點(diǎn)資源選擇的研究,進(jìn)而發(fā)現(xiàn)較適合于構(gòu)建匿名路徑的節(jié)點(diǎn)。對(duì)此,本文分析了現(xiàn)有的節(jié)點(diǎn)資源選擇算法,提出并實(shí)現(xiàn)了一種基于Dijkstra算法的NSDA節(jié)點(diǎn)資源選擇算法。該算法結(jié)合了節(jié)點(diǎn)屬性與鏈路屬性,可靈活得調(diào)節(jié)系統(tǒng)性能和匿名性。為評(píng)估所提NSDA算法的性能,本文在NS仿真環(huán)境下進(jìn)行了實(shí)驗(yàn),并對(duì)實(shí)驗(yàn)結(jié)果進(jìn)行了分析。最后,指出了未來需要深入研究解決的問題。
[Abstract]:Today, the Internet privacy becomes more and more important and sensitive, has become a hot research topic in research field. In order to protect the privacy of Internet users, privacy protection technology came into being. Anonymous communication is a kind of privacy protection technology, researchers from different aspects of the research, and developed a variety of findings from the node resources, anonymous communication framework and system resource selection to transmit information is different. The existing research focuses on solving problems and challenges and the architecture of the system, especially the anonymity and performance problems. It is worth mentioning that the center of the anonymous communication system architecture P2P architecture will be replaced.
The anonymous P2P network (such as Crowds, Tarzan etc.) is composed of tens of thousands of nodes, many problems which are after all anonymous networks is caused by node resource problems. For example the node performance, based on the principle of the wooden barrel, the performance of anonymous path depends on the worst performance of nodes. Nodes and frequent access will be increase the number of node resources in anonymity system is not stable, the network topology changes, thus changing the size of anonymity set, anonymity system and stability will not be guaranteed. The anonymous P2P network node finite and the routing efficiency problem is the core issue. This paper focuses on the core issues, comprehensive analysis the anonymous topology mechanism in P2P network. Firstly, the research at home and abroad for the node resource discovery and Topological Study on the main body measurement research and its status quo, puts forward you A network node topology and resource discovery framework to facilitate subsequent scholars can clearly get Puzhuo to anonymous network topology architecture and core module. Because the node resource is the core problem of anonymous P2P network, and the routing algorithm is the core algorithm of anonymous system performance, this paper focuses on the research of node resource selection, and that node is suitable for constructing anonymous path. In this regard, this paper analyzes the existing resource node selection algorithm is proposed and implemented a selection algorithm of NSDA node resources based on Dijkstra algorithm. The algorithm combines the node attributes and link attributes, flexible adjustment of system performance and anonymity. In order to evaluate the performance of the proposed NSDA algorithm, the experiments were carried out in the NS simulation environment, and the experimental results are analyzed. Finally, points out that the future need further research to solve problems.
【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TP393.02
【參考文獻(xiàn)】
相關(guān)期刊論文 前1條
1 陸天波;方濱興;孫毓忠;程學(xué)旗;;點(diǎn)對(duì)點(diǎn)匿名通信協(xié)議WonGoo的性能分析[J];計(jì)算機(jī)工程;2006年02期
，本文編號(hào)：1589978
本文鏈接：http://sikaile.net/guanlilunwen/ydhl/1589978.html
最近更新
教材專著
