Research On The Software Architecture And Node Data Of I2P

More and more people begin to pay attention to their information security and use anonymous communication system.One of the most popular anonymous communication systems is I2P,which implements garlic routing and unidirectional tunnel technology to allow peers using I2P to communicate with each other anonymously—both sender and recipient are unidentifiable to each other as well as to third parties.Based on the previous researches,this paper will carry out the work of I2P software architecture and analysis of netDb.Firstly,this paper introduces the background of I2P and its development in recent ten years,and analyzes the pr:inciples of I2P anonymous communication in detail,such as unidirectional tunnel,garlic routing and the structure of distributed netDb.Secondly,this paper analyzes the software architecture of the system on the basis of the principles of I2P anonymous communication,after that,makes a detailed analysis of the main functional modules of the software and the core process during the software operation based on the source code of version 0.9.3 7.At present,the relevant data of nodes in I2P have not been fully studied in the academic circle,aim at this problem,this paper designs and implements a node data analysis system called I2P-RAS,which can passively collect node data named Routerlnfo access network by deploying I2P nodes in the different places,and produce the statistical analysis of the collected data.Thr-ough the analysis of a 10-day experiment,we conclude that the majority of the nodes in a network of sharing the bandwidth is 64-128 KB/s,and the 3 most countries where nodes come from are the United States,Russia and Britain.At last,the k-bucket algorithm in the network database is studied in depth and two improved algorithms based on speed and capacity priority eviction are proposed.First of all,this paper analyzes that the random expulsion algorithm used in I2P to construct k-bucket will biring unstable factors to the system.In order to accord with the requirements of low latency and high performance of I2P system,this paper puts forward and realizes two algorithms based on the speed and capacity of peer profile,with the data collected by I2P-RAS,this paper makes an experimental verification of the proposed algorithms and proves that the improved algorithms can not only ensure the effectiveness of the k-bucket algorithm,but also improve the proportion of high-performance nodes in the k-bucket.