GA_CHORD: AN IMPROVEMENT TO CHORD ALGORITHM BASED ON GROUP AUTONOMY IN STRUCTED P2P NETWORK
As a classical structed P2P model, Chord offers many salient features. The key issue of strengthening the system is how to deal with the influence from the frequent change of the nodes and promote the query efficiency. To advance the Chord performance, we propose a new model based on group autonomy which is called GA_Chord. A new table is added to differentiate all nodes into many neighbor groups. At the same time, system selects a more stable neighbor group to be leader nodes which manage to distribute resources. Each node only maintains the insidegroup Finger Table and the Neighbor Table. Compared with the traditional Chord, GA_Chord greatly improves the query efficiency. Simultaneously, the model decreases the system cost caused by nodes’ frequent change.
Group Autonomy Neighbor Table Bi-Dimensional
Chao Fan Qing Liao Jingling Zhao
School of Information and Communication Engneering,Beijing University of Post and Telecommunications School of Information and Communication Engneering, Beijing University of Post and Telecommunication
国际会议
北京
英文
1001-1004
2010-10-26（万方平台首次上网日期，不代表论文的发表时间）