{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T05:18:24Z","timestamp":1672291104084},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2006,9]]},"abstract":"<jats:p>Recent measurement studies [8] have shown that peer-to-peer (P2P) file sharing applications are the major traffic source in the Internet. P2P applications, such as eDonkey, Kazaa, or BitTorrent, form overlay networks on the application layer and offer its peers to download and share their files with other peers in a highly distributed way. As a consequence, peers act simultaneously as both clients and servers. For a comprehensive survey of P2P technology, we refer to [7].<\/jats:p>","DOI":"10.1145\/1168134.1168137","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"3-4","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Extinction probability in peer-to-peer file diffusion"],"prefix":"10.1145","volume":"34","author":[{"given":"Sophie","family":"Hautphenne","sequence":"first","affiliation":[{"name":"Universite Libre de Bruxelles, Bruxelles, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenji","family":"Leibnitz","sequence":"additional","affiliation":[{"name":"Osaka University, Suita, Osaka, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Ange","family":"Remiche","sequence":"additional","affiliation":[{"name":"Universite Libre de Bruxelles, Bruxelles, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Algorithms for determining the probability of eventual extinctio= n of a Markovian binary tree. Technical report","author":"Bean N. G.","year":"2004","unstructured":"N. G. Bean , N. Kontoleon , and P. G. Taylor . Algorithms for determining the probability of eventual extinctio= n of a Markovian binary tree. Technical report , University of Adelaide & University of Melbourne , 2004 . N. G. Bean, N. Kontoleon, and P. G. Taylor. Algorithms for determining the probability of eventual extinctio= n of a Markovian binary tree. Technical report, University of Adelaide & University of Melbourne, 2004."},{"key":"e_1_2_1_2_1","unstructured":"eDonkey2000. http:\/\/www.eDonkey2000.com\/.  eDonkey2000. http:\/\/www.eDonkey2000.com\/."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"Harris T. E.","year":"1963","unstructured":"T. E. Harris . The Theory of Branching Processes . Dover , New- York , 1963 . T. E. Harris. The Theory of Branching Processes. Dover, New-York, 1963."},{"key":"e_1_2_1_4_1","volume-title":"Universit\u00e9 Libre de Bruxelles","author":"Hautphenne S.","year":"2005","unstructured":"S. Hautphenne . Processus de branchement et mod\u00e8les de phases. M\u00e9moire de fin d'\u00e9tudes , Universit\u00e9 Libre de Bruxelles , Belgium , June 2005 . S. Hautphenne. Processus de branchement et mod\u00e8les de phases. M\u00e9moire de fin d'\u00e9tudes, Universit\u00e9 Libre de Bruxelles, Belgium, June 2005."},{"key":"e_1_2_1_5_1","volume-title":"Australian Telecommunication Networks and Applications Conference (ATNAC 04)","author":"Ho\u00dffeld T.","year":"2004","unstructured":"T. Ho\u00dffeld , K. Leibnitz , R. Pries , K. Tutschku , P. Tran-Gia , and K. Pawlikowski . Information diffusion in edonkey filesharing networks . In Australian Telecommunication Networks and Applications Conference (ATNAC 04) , Sydney, Australia , 2004 . T. Ho\u00dffeld, K. Leibnitz, R. Pries, K. Tutschku, P. Tran-Gia, and K. Pawlikowski. Information diffusion in edonkey filesharing networks. In Australian Telecommunication Networks and Applications Conference (ATNAC 04), Sydney, Australia, 2004."},{"key":"e_1_2_1_6_1","volume-title":"Introduction to Matrix Geometric Methods in Stochastic Modeling. ASASIAM Series on Statistics and Applied Probability","author":"Latouche G.","year":"1999","unstructured":"G. Latouche and V. Ramaswami . Introduction to Matrix Geometric Methods in Stochastic Modeling. ASASIAM Series on Statistics and Applied Probability . SIAM , Philadelphia, PA , 1999 . G. Latouche and V. Ramaswami. Introduction to Matrix Geometric Methods in Stochastic Modeling. ASASIAM Series on Statistics and Applied Probability. SIAM, Philadelphia, PA, 1999."},{"key":"e_1_2_1_7_1","volume-title":"IEEE Surveys and Tutorials","author":"Keong Lua E.","year":"2004","unstructured":"E. Keong Lua , J. Crowcroft , M. Pias , R. Sharma , and S. Lim . A survey and comparison of peer-to-peer overlay network schemes . IEEE Surveys and Tutorials , March 2004 . E. Keong Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim. A survey and comparison of peer-to-peer overlay network schemes. IEEE Surveys and Tutorials, March 2004."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24668-8_2"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1168134.1168137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T21:16:30Z","timestamp":1672262190000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1168134.1168137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["10.1145\/1168134.1168137"],"URL":"https:\/\/doi.org\/10.1145\/1168134.1168137","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2006,9]]},"assertion":[{"value":"2006-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}