{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:49:28Z","timestamp":1648831768185},"reference-count":18,"publisher":"Engineering and Technology Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"DOI":"10.4304\/jcm.7.4.349-356","type":"journal-article","created":{"date-parts":[[2012,4,25]],"date-time":"2012-04-25T20:21:47Z","timestamp":1335385307000},"source":"Crossref","is-referenced-by-count":2,"title":["An Effective Replication Technique Using Rateless Codes for Unstructured P2P Networks"],"prefix":"10.12720","volume":"7","author":[{"given":"Keiichi","family":"Endo","sequence":"first","affiliation":[]},{"given":"Ryosuke","family":"Hamabe","sequence":"additional","affiliation":[]},{"given":"Dai","family":"Okano","sequence":"additional","affiliation":[]},{"given":"Kaname","family":"Amano","sequence":"additional","affiliation":[]}],"member":"4977","published-online":{"date-parts":[[2012,4,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2005.1610546"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/383059.383071","article-title":"Chord: A scalable peer-to-peer lookup service for Internet applications","volume-title":"Proc. SIGCOMM '01","author":"Stoica","year":"2001"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/383059.383072","article-title":"A scalable content-addressable network","volume-title":"Proc. SIGCOMM '01","author":"Ratnasamy","year":"2001"},{"key":"ref4","first-page":"329","article-title":"Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems","volume":"2001","author":"Rowstron","year":"2001","journal-title":"Proc. Middleware"},{"key":"ref5","article-title":"Search and replication in unstructured peer-to-peer networks","volume-title":"Proc. ACM ICS","volume":"02","author":"Lv","year":"2002"},{"key":"ref6","first-page":"2P","article-title":"Modeling and analysis of random walk search algorithms","volume-title":"Proc. HOT","author":"Bisnik","year":"2005"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050237"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1119"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2008.06.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1275"},{"key":"ref12","volume-title":"Proceedings of the 43rd Symposium on Foundations of Computer Science","author":"Luby","year":"2002"},{"key":"ref13","volume-title":"Information theory, inference, and learning algorithms","author":"MacKay","year":"2003"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11558989_21"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.036123"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.057102"}],"container-title":["Journal of Communications"],"original-title":[],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T17:52:32Z","timestamp":1497981152000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=38&id=83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,1]]},"references-count":18,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2012,4,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jcm.7.4.349-356","relation":{},"ISSN":["1796-2021"],"issn-type":[{"value":"1796-2021","type":"print"}],"subject":[],"published":{"date-parts":[[2012,4,1]]}}}