Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems

Abstract : A peer-to-peer file sharing system includes a lookup and a content distribution protocol. Very efficient peer-to-peer protocols exist for content distribution, but efficient indexing is still an open problem. Numerous work on structured overlay networks such as distributed hash tables offer a promising framework. However, balancing the load of publishing, storing indexes and answering request still remains a challenging task. We sketch a general architecture frame-work for solving these problems in the case of a file sharing application. Our design goals include reducing the work of file providers (they should not bare all the publishing process) and enabling keyword searching based on the assumption that few words are associated with each file.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00471717
Contributor : Laurent Viennot <>
Submitted on : Thursday, April 8, 2010 - 5:52:45 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Friday, October 19, 2012 - 11:26:27 AM

File

iciw06.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Anh-Tuan Gai, Laurent Viennot. Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems. Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT-ICIW), Feb 2006, Guadeloupe, France. pp.111-115, ⟨10.1109/AICT-ICIW.2006.145⟩. ⟨inria-00471717⟩

Share

Metrics

Record views

171

Files downloads

206