A taxonomy for locality algorithms on peer-to-peer networks
|Title||A taxonomy for locality algorithms on peer-to-peer networks|
|Publication Type||Conference Proceedings|
|Year of Publication||2009|
|Authors||Miers, C., M. Simplício, D. GALLO, T. C. M. B. CARVALHO, and G. BRESSAN|
|Corporate Authors||Souza, Victor, Karlsson, Per, and Damola, Ayodele|
|Conference Name||I2TS 2009|
The continuous growth of peer-to-peer networks has made them responsible for a considerable portion of the current Internet traffic. For this reason, improvements in P2P network resources usage are of central importance. One effective approach for addressing this issue is the deployment of locality algorithms, which allow the system to optimize the peers' selection policy for different network situations and, thus, maximize performance. To date, several locality algorithms have been proposed for use in P2P networks. However, they usually adopt heterogeneous criteria for measuring the proximity between peers, which hinders a coherent comparison between the different solutions. In this paper, we develop a thoroughly review of popular locality algorithms, based on three main characteristics: the adopted network architecture, distance metric, and resulting peer selection algorithm. As result of this study, we propose a novel and generic taxonomy for locality algorithms in peer-to-peer networks, aiming to enable a better and more coherent evaluation of any individual locality algorithm.