Peer-to-Peer systems become popular applications but suffer from insufficient resource availability which is caused by free-riders and inefficient lookup algorithms. To address the first cause, a number of recent works have focused on providing appropriate incentive mechanisms to encourage participants to contribute their resources to the P2P systems. To improve the lookup efficiency, locality-awareness has been introduced into the research community. However, existing proposals attempt to optimize the service performance during the data transmission period mostly after performing the neighboring lookup, which cannot address the fundamental concern of reducing lookup traffic. Therefore, this paper proposes interest-based peer-to-peer management (IPM) protocol to facilitate the peering lookup. Our design philosophy differs from existing work that IPM is a client-only approach and can be represented as either an alternative or a complementary to current proposals. With additional locality-awareness considerations, IPM can reduce the lookup overhead while optimizing the system performance. The simulation results essentially state that IPM can largely improve the efficiency and reliability of P2P media distribution systems through reducing control overhead by 50% on average and reduces average packet loss rate up to 34.7%. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Lei, J., & Fu, X. (2009). Interest-based peer-to-peer group management. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5630 LNCS, pp. 107–118). https://doi.org/10.1007/978-3-642-02472-6_10
Mendeley helps you to discover research relevant for your work.