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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Androutsellis-Theotokis, S., Spinellis, D.: A survey of peer-to-peer content distribution technologies. ACM Comput. Surveys 36, 335–371 (2004)
Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Message multicasting in heterogeneous networks. SIAM J. Comput. 30(2), 347–358 (2000)
Cho, K., Fukuda, K., Esaki, H., Kato, A.: The impact and implications of the growth in residential user-to-user traffic. In: Proc. ACM SIGCOMM Conf. Applications, Technologies, Architectures and Protocols for Computer Comm. (2006)
Ezovski, G., Tang, A., Andrew, L.: Minimizing average finish time in P2P networks. In: Proc. 30th IEEE Internat. Conf. Computer Comm., INFOCOM (2009)
Garey, M., Johnson, D.: Computers and Intractability (1979)
Hedetniemi, S.T., Hedetniemi, S.M., Liestman, A.: A survey of gossiping and broadcasting in communication networks. Networks 18, 129–134 (1998)
Khuller, S., Kim, Y.-A.: Broadcasting in heterogeneous networks. Algorithmica 48(1), 1–21 (2007)
Kumar, R., Ross, K.: Peer assisted file distribution: The minimum distribution time. In: Proc. 1st IEEE Workshop on Hot Topics in Web Syst. and Technologies (2006)
Li, J.: On peer-to-peer (P2P) content delivery. Peer-to-Peer Netw. Appl. 1, 45–63 (2008)
Lua, E., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Comm. Surveys and Tutorials 7, 72–93 (2005)
Mehyar, M., Gu, W., Low, S., Effros, M., Ho, T.: Optimal strategies for efficient peer-to-peer file sharing. In: Proc. IEEE Internat. Conf. on Acoustics Speech and Signal Proc., ICASSP (2007)
Middendorf, M.: Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2. Inf. Process. Lett. 46(6), 281–287 (1993)
Mundinger, J., Weber, R., Weiss, G.: Optimal scheduling of peer-to-peer file dissemination. J. of Scheduling 11, 105–120 (2008)
Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In: Proc. ACM SIGCOMM Conf. Applications, Technologies, Architectures and Protocols for Computer Comm. (2004)
Ravi, R.: Rapid rumor ramification: Approximating the minimum broadcast time. In: Proc. 35th Annual IEEE Sympos. Foundations Comput. Sci., pp. 202–213 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goetzmann, KS., Harks, T., Klimm, M., Miller, K. (2011). Optimal File Distribution in Peer-to-Peer Networks. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-25591-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25590-8
Online ISBN: 978-3-642-25591-5
eBook Packages: Computer ScienceComputer Science (R0)