匿名P2P网络中资源发现与拓扑测量研究

发布时间：2018-03-09 19:42

本文选题：匿名通信　切入点：拓扑　出处：《北京邮电大学》2015年硕士论文　论文类型：学位论文

【摘要】：如今,互联网隐私变得越来越重要和敏感,已成为科研领域的研究热点。为保护互联网用户的隐私,隐私保护技术应运而生。匿名通信是一种隐私保护技术,研究者已从各方面着手对其研究,并开发了各种从节点资源发现、节点资源选择到传输信息等相区别的匿名通信架构及系统。现有的研究着重于解决这些系统及架构面临的问题及挑战,特别是匿名性和性能问题。值得一提的是,当前的中心化匿名通信系统架构将被P2P架构取代。匿名P2P网络(如Crowds、Tarzan等)是由成千上万个节点组成的,从而匿名网络的许多问题归根结底皆是由节点资源问题引起的。例如节点的性能不一,基于木桶原理,匿名路径的性能取决于最差节点的性能。而且节点的频繁出入会导致匿名系统中节点资源的数目不稳定,网络拓扑随之不断变化,从而匿名集大小不断变化,系统的匿名性及稳定性也将无法保证。其中,匿名P2P网络中节点有限和路由效率问题都是目前的核心问题。本文围绕这一核心问题,全面分析了目前匿名P2P网络中的拓扑机制。首先本文调研了国内外针对节点资源发现及拓扑测量方面研究的主要机构及其研究现状,提出了匿名网络节点资源发现及拓扑研究框架,以方便后续学者可一目了然得扑捉到匿名网络拓扑的架构及核心模块。由于节点资源问题是匿名P2P网络的核心问题,且路由算法是影响匿名系统性能的核心算法,本文就此着重于节点资源选择的研究,进而发现较适合于构建匿名路径的节点。对此,本文分析了现有的节点资源选择算法,提出并实现了一种基于Dijkstra算法的NSDA节点资源选择算法。该算法结合了节点属性与链路属性,可灵活得调节系统性能和匿名性。为评估所提NSDA算法的性能,本文在NS仿真环境下进行了实验,并对实验结果进行了分析。最后,指出了未来需要深入研究解决的问题。
[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.

【学位授予单位】：北京邮电大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TP393.02

【参考文献】