Dynamic routing mechanism of chord based on requests statistics
Ji‐Xiang Du · 2011
Peers have a limited view of global resources distribution in P2P networks which consequently leads to decreased query efficiency.It presented a dynamic routing mechanism of chord in order to extend the finger table of peers to cover the whole resources space.The fingers of hot spots were dynamically included into finger table of peers based on requests statistics,whereas those of low requests statistics were excluded from it.As a result,the system maintained high query efficiency with rather low cache consumption.The experiment results show the cache consumption of the finger table of DChord approximates to that of chord,the average query path length of it roughly ranges from 3 to 4 hops,and it can decrease the system routing loads efficiently.