Performance Analysis of the Modified Chord Lookup Algorithm on Peer-to-Peer System.

• Main Authors: Guan-Yi Chen, 陳冠億
• Other Authors: Chia-Hsu Kuo
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/46542605578381969528

碩士 === 義守大學 === 資訊工程學系碩士班 === 95 === P2P networks have been paid much attention for the past several years, and more researches are conducted due to an obstacle of client-server network to the scalability. In the existing DHT routing algorithms, we choose the Chord Lookup Algorithm (CLA) proposed by MIT. CLA devised a simple mechanism for existing nodes with the operations of cooperating on P2P networks. We focus on two main tasks. (1) In order to prevent malicious nodes deny object keys and resources on P2P networks, we integrated repetition mechanism for object keys and resources with CLA. The simulated results show that the performance of P1-hop, 1-hop potential probability and average number of Keys per Node are improved and Hopavg is very close to O(1). (2) We also implemented all relevant Application Programming Interfaces (APIs) for building an efficient simulator for CLA system. Based on those developed APIs, we are able to make novel algorithms with additional mechanism on CLA possible in the future.