In a structured P2P system, peers maintain information about what resources neighbor peers offer. Chord is one of well-known structured P2P systems to efficiently support resource finding based on the hashing approach. However, in Chord, most of data keys may be assigned to the same peer, since it uses the static hashing scheme, resulting in the case that the load of Chord is unbalanced. Therefore, we propose a strategy which uses the dynamic hashing scheme to locate the data key based on the Chord architecture, and to maintain the load balance. From our simulation results, we show that the load of the P2P system based on our strategy is much more balanced than that based on the original strategy used in Chord.
['Ye-In Chang', 'Hue-Ling Chen', 'Sih-Ning Li', 'Hung-Ze Liu']
A Dynamic Hashing Approach to Supporting Load Balance in P2P Systems