On neighbor-selection strategy in hybrid peer-to-peer networks

  • Authors:
  • Simon G. M. Koo;Karthik Kannan;C. S. George Lee

  • Affiliations:
  • Department of Mathematics and Computer Science, University of San Diego, CA;Krannert School of Management, Purdue University, West Lafayette, IN;School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN

  • Venue:
  • Future Generation Computer Systems - Systems performance analysis and evaluation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, computer users have increased their interests in downloading large-volume contents like movies and software from the Internet, and a new generation of peer-to-peer (P2P) file-swapping applications that aims at improving the efficiency of transfer are gaining popularity. In these P2P applications, a central "tracker" decides about which peer becomes a neighbor to which other peers. This decision critically dictates the distribution efficiency. In this paper, we investigate the neighbor-selection process in this new category of P2P networks, and we propose an efficient neighbor-selection strategy that performs better than the existing ones. We show that by increasing the content availability of peers from their immediate neighbors, it can significantly improve system performance without trading off users' satisfaction. We also show that the proposed strategy is incentive-compatible and is suitable for real-time deployment.