{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:47:25Z","timestamp":1743029245332,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662446010"},{"type":"electronic","value":"9783662446027"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_3","type":"book-chapter","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T21:18:40Z","timestamp":1408742320000},"page":"27-38","source":"Crossref","is-referenced-by-count":1,"title":["Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks"],"prefix":"10.1007","author":[{"given":"Fei","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xiaowei","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","first-page":"961","volume-title":"SODA 2006","author":"D. Arthur","year":"2006","unstructured":"Arthur, D., Panigrahy, R.: Analyzing bittorrent and related peer-to-peer networks. In: SODA 2006, pp. 961\u2013969. ACM, New York (2006)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B. Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica\u00a024(1), 5\u201334 (2004)","journal-title":"Combinatorica"},{"key":"3_CR4","volume-title":"STOC 2012","author":"K. Censor-Hillel","year":"2012","unstructured":"Censor-Hillel, K., Haeupler, B., Kelner, J., Maymounkov, P.: Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. In: STOC 2012. ACM, New York (2012)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-540-72870-2_36","volume-title":"Algorithmic Aspects in Information and Management","author":"H.-L. Chan","year":"2007","unstructured":"Chan, H.-L., Lam, T.-W., Wong, P.W.H.: Efficiency of data distribution in bitTorrent-like systems. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol.\u00a04508, pp. 378\u2013388. Springer, Heidelberg (2007)"},{"issue":"SI","key":"3_CR6","first-page":"2486","volume":"14","author":"S. Deb","year":"2006","unstructured":"Deb, S., M\u00e9dard, M., Choute, C.: Algebraic gossip: a network coding approach to optimal multiple rumor mongering. IEEE\/ACM Trans. Netw.\u00a014(SI), 2486\u20132507 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"3_CR7","volume-title":"PODC 1987","author":"A. Demers","year":"1987","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: PODC 1987. ACM Press, New York (1987)"},{"key":"3_CR8","volume-title":"STOC 2011","author":"B. Doerr","year":"2011","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: STOC 2011. ACM, New York (2011)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-52921-7_62","volume-title":"Algorithms","author":"U. Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol.\u00a0450, pp. 128\u2013137. Springer, Heidelberg (1990)"},{"key":"3_CR10","first-page":"2552","volume-title":"INFOCOM 2010","author":"N. Fountoulakis","year":"2010","unstructured":"Fountoulakis, N., Huber, A., Panagiotou, K.: Reliable broadcasting in random networks and the effect of density. In: INFOCOM 2010, pp. 2552\u20132560. IEEE Press, Piscataway (2010)"},{"key":"3_CR11","first-page":"57","volume-title":"STACS 2011","author":"G. Giakkoupis","year":"2011","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: STACS 2011, vol.\u00a09, pp. 57\u201368. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2011)"},{"key":"3_CR12","first-page":"293","volume-title":"STOC 2011","author":"B. Haeupler","year":"2011","unstructured":"Haeupler, B.: Analyzing network coding gossip made easy. In: STOC 2011, pp. 293\u2013302. ACM, New York (2011)"},{"key":"3_CR13","first-page":"565","volume-title":"FOCS 2000","author":"R. Karp","year":"2000","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: FOCS 2000, p. 565. IEEE Computer Society, Washington, DC (2000)"},{"key":"3_CR14","first-page":"163","volume-title":"STOC 2001","author":"D. Kempe","year":"2001","unstructured":"Kempe, D., Kleinberg, J., Demers, A.: Spatial gossip and resource location protocols. In: STOC 2001, pp. 163\u2013172. ACM, New York (2001)"},{"key":"3_CR15","first-page":"471","volume-title":"FOCS 2002","author":"D. Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J.M.: Protocols and impossibility results for gossip-based communication mechanisms. In: FOCS 2002, pp. 471\u2013480. IEEE Computer Society, Washington, DC (2002)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Pittel, B.: On spreading a rumor. SIAM J. Appl. Math.\u00a047(1) (March 1987)","DOI":"10.1137\/0147013"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:50:00Z","timestamp":1558306200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662446010","9783662446027"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}