Notes On the Peer-to-Peer Data Dissemination Problem


We consider the problem to disseminate a file to all peers on a peer-to-peer network. We prove the file dissemination problem is NP-hard for arbitrary networks (modeled as undirected graphs) while polynomial time solvable if the network topology is a tree. We also provide an optimal algorithm for disseminate a file on Chord-like graphs. One salient feature of this algorithm is that it fully makes use of Chords routing table and can be complete decentralized while the optimality is preserved.

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Li2008NotesOT, title={Notes On the Peer-to-Peer Data Dissemination Problem}, author={Jian Li}, year={2008} }