The P2P network relative to CS mode network to the center of the advantages of scalability, robustness, high performance, and load balancing. This article describes the four kinds of DHT-based P2P algorithm: Chord, Can, Pastry, Tapestry. A detailed analysis of the organizational structure of the algorithm, the way to find, insert exit node, routing method and the performance and efficiency of their algorithm were compared.

基于DHT的几种P2P算法研究.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．