{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T20:10:19Z","timestamp":1741983019072,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_23","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"210-219","source":"Crossref","is-referenced-by-count":5,"title":["Optimal File Distribution in Peer-to-Peer Networks"],"prefix":"10.1007","author":[{"given":"Kai-Simon","family":"Goetzmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Harks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Klimm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantin","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/1041680.1041681","volume":"36","author":"S. Androutsellis-Theotokis","year":"2004","unstructured":"Androutsellis-Theotokis, S., Spinellis, D.: A survey of peer-to-peer content distribution technologies. ACM Comput. Surveys\u00a036, 335\u2013371 (2004)","journal-title":"ACM Comput. Surveys"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1137\/S0097539798347906","volume":"30","author":"A. Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Message multicasting in heterogeneous networks. SIAM J. Comput.\u00a030(2), 347\u2013358 (2000)","journal-title":"SIAM J. Comput."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1159913.1159938"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Ezovski, G., Tang, A., Andrew, L.: Minimizing average finish time in P2P networks. In: Proc. 30th IEEE Internat. Conf. Computer Comm., INFOCOM (2009)","DOI":"10.1109\/INFCOM.2009.5061966"},{"key":"23_CR5","unstructured":"Garey, M., Johnson, D.: Computers and Intractability (1979)"},{"key":"23_CR6","first-page":"129","volume":"18","author":"S.T. Hedetniemi","year":"1998","unstructured":"Hedetniemi, S.T., Hedetniemi, S.M., Liestman, A.: A survey of gossiping and broadcasting in communication networks. Networks\u00a018, 129\u2013134 (1998)","journal-title":"Networks"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-006-1227-9","volume":"48","author":"S. Khuller","year":"2007","unstructured":"Khuller, S., Kim, Y.-A.: Broadcasting in heterogeneous networks. Algorithmica\u00a048(1), 1\u201321 (2007)","journal-title":"Algorithmica"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/HOTWEB.2006.355259"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s12083-007-0003-1","volume":"1","author":"J. Li","year":"2008","unstructured":"Li, J.: On peer-to-peer (P2P) content delivery. Peer-to-Peer Netw. Appl.\u00a01, 45\u201363 (2008)","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/COMST.2005.1610546","volume":"7","author":"E. Lua","year":"2005","unstructured":"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\u00a07, 72\u201393 (2005)","journal-title":"IEEE Comm. Surveys and Tutorials"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/ICASSP.2007.367325"},{"issue":"6","key":"23_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(93)90066-I","volume":"46","author":"M. Middendorf","year":"1993","unstructured":"Middendorf, M.: Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2. Inf. Process. Lett.\u00a046(6), 281\u2013287 (1993)","journal-title":"Inf. Process. Lett."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10951-007-0017-9","volume":"11","author":"J. Mundinger","year":"2008","unstructured":"Mundinger, J., Weber, R., Weiss, G.: Optimal scheduling of peer-to-peer file dissemination. J. of Scheduling\u00a011, 105\u2013120 (2008)","journal-title":"J. of Scheduling"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1015467.1015508"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Ravi, R.: Rapid rumor ramification: Approximating the minimum broadcast time. In: Proc. 35th Annual IEEE Sympos. Foundations Comput. Sci., pp. 202\u2013213 (1994)","DOI":"10.1109\/SFCS.1994.365693"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T19:31:50Z","timestamp":1741980710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}