Research On Resource Discovery And Topology Measurement In Anonymous P2P Network

Nowadays, Internet privacy becomes more and more important and sensitive, and has been one of the latest buzz words to hit the Internet world. In response to protect the privacy of Internet users, a variety of privacy enhancing technologies (PETs) has emerged. As one of privacy enhancing technologies, anonymous communication has been extensively studied by researchers from various aspects, and has developed many architectures and systems which are different from node resource discovery, node resource selection, and so on. Existing research focuses on solving problems and challenges in these systems and architectures, especially the issues of anonymity and performance. It’s the current trend that center anonymous communication system will be replaced by P2P architecture.Anonymous P2P network (such as Crowds and Tarzan) is composed of thousands of nodes, so many problems are caused by node resources. For example, the performance of each node is different from each other, the node which has worst performance in anonymous path decides the efficiency of anonymous path based on cask principle. Moreover, because node frequently enters and exit anonymous system, the number of anonymous node resource is changing and network topology is corresponding dynamic, then it’s difficult to maintain a stable network topology, therefore it cannot be guaranteed that the system’s anonymiry and stability. Of these, the issues of limited resource and routing efficiency are the core problem. Based on the core issue, this paper comprehensively analyzes topology mechanism in modern anonymous P2P network. Firstly, this paper investigates existing main organizations which study anonymous communication from the perspective of node resource discovery and topology measure, and its research status, presents a research framework of node resource discovery and network topology in anonymous network so that subsequent scholars can clearly catch a anonymous network topology and its core modules. Because the issue of node resource is the core part of anonymous P2P network, and routing algorithm is the core algorithm which affects the anonymous system performance, this paper focuses on the study of node resource selection to find the more suitable for constructing an anonymous path. This paper analyzes the existing node selection algorithms. Then, we propose and implement a new node resource selection algorithm based on Dijkstra algorithm, named NSDA algorithm. The algorithm can combine node properties with link properties to select node resource, which can adjust the system performance and anonymity. In order to evaluate the NSDA algorithm, we have done experiments in Network Simulator. According to the results of experiments, we analyze the characteristics of the algorithm. Finally, some related problems are presented to be studied deeply in future.