loading...
Adaptive Search Radius - Lowering Internet P2P File-Sharing Traffic through Self-Restraint
Cambridge, Massachusetts July 12-July 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NCA.2007.6Sixth IEEE International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ricardo Lopes Pereira, IST/INESC-ID, Portugal
Teresa Vaz?o, IST/INESC-ID, Portugal
Rodrigo Rodrigues, IST/INESC-ID, Portugal
Peer-to-peer (P2P) file sharing accounts for a very significant part of the Internet?s traffic, translating into significant peering costs for ISPs. It has been noticed that, just like WWW traffic, P2P file sharing traffic shows locality properties, which are not exploited by current P2P file sharing protocols. We propose a novel peer selection algorithm, Adaptive Search Radius (ASR), whose primary goal is to reduce ISPs? peering costs, where peers exploit locality by only downloading from those other peers which are nearest (in network hops). Simulation studies, using the eMule protocol, show that ASR benefits both ISPs, by globally reducing P2P file sharing traffic, and users, who experience faster downloads.
Citation:
Ricardo Lopes Pereira, Teresa Vaz?o, Rodrigo Rodrigues, "Adaptive Search Radius - Lowering Internet P2P File-Sharing Traffic through Self-Restraint," nca, pp.253-256, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.