An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry

  • Authors:
  • Gisik Kwon;Kyung D. Ryu

  • Affiliations:
  • -;-

  • Venue:
  • SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many Peer-to-Peer (P2P) file sharing systems havebeen proposed to take advantage of high scalability andabundant resources at end-user machines. Previousapproaches adopted either simple flooding or routingwith complex structures, such as Distributed HashingTables (DHT). However, these approaches did notconsider the heterogeneous nature of the machines andthe hierarchy of networks on the Internet. This paperpresents Peer-to-peer Asymmetric file Sharing System(PASS), a novel approach to P2P file sharing, whichaccounts for the different capabilities and networklocations of the participating machines. Our systemselects only a portion of high-capacity machines(supernodes) for routing support, and organizes thenetwork by using location information. We show that ourkey-coverage based directory replication improves the filesearch performance to a small constant number of routinghops, regardless of the network size.