Optimal file distribution in peer-to-peer networks

Authors:
Kai-Simon Goetzmann;Tobias Harks;Max Klimm;Konstantin Miller
Affiliations:
Institut für Mathematik, Technische Universität Berlin, Germany;Institut für Mathematik, Technische Universität Berlin, Germany;Institut für Mathematik, Technische Universität Berlin, Germany;Telecommunication Networks Group, Technische Universität Berlin, Germany
Venue:
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Year:
2011

Citing 9
Cited 0

Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2

Information Processing Letters
Message Multicasting in Heterogeneous Networks

SIAM Journal on Computing
Modeling and performance analysis of BitTorrent-like peer-to-peer networks

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A survey of peer-to-peer content distribution technologies

ACM Computing Surveys (CSUR)
The impact and implications of the growth in residential user-to-user traffic

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Broadcasting in Heterogeneous Networks

Algorithmica
Optimal scheduling of peer-to-peer file dissemination

Journal of Scheduling
Rapid rumor ramification: approximating the minimum broadcast time

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A survey and comparison of peer-to-peer overlay network schemes

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of distributing a file initially located at a server among a set of peers. Peers who downloaded the file can upload it to other peers. The server and the peers are connected to each other via a core network. The upload and download rates to and from the core are constrained by user and server specific upload and download capacities. Our objective is to minimize the makespan. We derive exact polynomial time algorithms for the case when upload and download capacities per peer and among peers are equal. We show that the problem becomes strongly NP-hard for equal upload and download capacities per peer that may differ among peers. For this case we devise a polynomial time $(1+2\!\sqrt{2})$-approximation algorithm. To the best of our knowledge, neither NP-hardness nor approximation algorithms were known before for this problem.