{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:06Z","timestamp":1750307706772,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["519907"],"award-info":[{"award-number":["519907"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2008,11]]},"abstract":"<jats:p>\n            A goal of peer-to-peer applications is to share files between users themselves rather than downloading files from file servers. Self-downloading protocols have the property that, eventually, every user downloads only from other users. Self-downloading is problematic if users disconnect from the system upon completing file downloading, because they only share with other users while connected. Yet, if users continue to arrive at a sufficient rate, self-downloading protocols are possible. One vulnerability of file sharing between users is the possibility that files or segments could be counterfeit or corrupt. Protocols that are\n            <jats:italic>d<\/jats:italic>\n            -safe tolerate some number of instances of faulty segments in a file being downloaded, because each segment is downloaded\n            <jats:italic>d<\/jats:italic>\n            times before being shared. This article shows that\n            <jats:italic>d<\/jats:italic>\n            -safe self-downloading is possible for a sufficiently large arrival rate of users to the system. Upper and lower connectivity and sharing bounds are given for\n            <jats:italic>d<\/jats:italic>\n            = 2, and simulation results show effects of relaxing assumptions about arrival rates and bandwidth.\n          <\/jats:p>","DOI":"10.1145\/1452001.1452009","type":"journal-article","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T15:32:31Z","timestamp":1228923151000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Safe peer-to-peer self-downloading"],"prefix":"10.1145","volume":"3","author":[{"given":"Kajari Ghosh","family":"Dastidar","sequence":"first","affiliation":[{"name":"University of Iowa"}]},{"given":"Ted","family":"Herman","sequence":"additional","affiliation":[{"name":"University of Iowa"}]},{"given":"Colette","family":"Johnen","sequence":"additional","affiliation":[{"name":"University of Bordeaux 1"}]}],"member":"320","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Adler S. 1999. The slashdot effect an analysis of three internet publications. Linux Gaz. 38.  Adler S. 1999. The slashdot effect an analysis of three internet publications. Linux Gaz. 38."},{"volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industries and Applied Mathematics","author":"Aspnes J.","key":"e_1_2_1_2_1","unstructured":"Aspnes , J. and Shah , G . 2003. Skip graphs . In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industries and Applied Mathematics , Philadelphia, PA, 284--393. Aspnes, J. and Shah, G. 2003. Skip graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industries and Applied Mathematics, Philadelphia, PA, 284--393."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/GRID.2005.1542745"},{"volume-title":"Proceedings of the 6th Workshop on Distributed Data and Structures (WDAS). Carleton Scientific.","author":"Bickson D.","key":"e_1_2_1_4_1","unstructured":"Bickson , D. , Dolev , D. , and Weiss , Y . 2004. Efficient peer-to-peer content rib . In Proceedings of the 6th Workshop on Distributed Data and Structures (WDAS). Carleton Scientific. Bickson, D., Dolev, D., and Weiss, Y. 2004. Efficient peer-to-peer content rib. In Proceedings of the 6th Workshop on Distributed Data and Structures (WDAS). Carleton Scientific."},{"volume-title":"Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society","author":"Byers J.","key":"e_1_2_1_5_1","unstructured":"Byers , J. , Luby , M. , and Mitzenmacher , M . 1999. Accessing multiple mirror sites in parallel: using tornado codes to speed up downloads . In Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society , Los Alamitos, CA, 275--284. Byers, J., Luby, M., and Mitzenmacher, M. 1999. Accessing multiple mirror sites in parallel: using tornado codes to speed up downloads. In Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society, Los Alamitos, CA, 275--284."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945474"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11508380_79"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 1st Workshop on Economics of Peer-to-Peer Systems. http:\/\/www.sims.berkeley.edu\/research\/conferences\/p2pecon.","author":"Cohen B.","year":"2004","unstructured":"Cohen , B. 2004 . Incentives build robustness in BitTorrent . In Proceedings of the 1st Workshop on Economics of Peer-to-Peer Systems. http:\/\/www.sims.berkeley.edu\/research\/conferences\/p2pecon. Cohen, B. 2004. Incentives build robustness in BitTorrent. In Proceedings of the 1st Workshop on Economics of Peer-to-Peer Systems. http:\/\/www.sims.berkeley.edu\/research\/conferences\/p2pecon."},{"volume-title":"Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05)","author":"Gkantsidis C.","key":"e_1_2_1_9_1","unstructured":"Gkantsidis , C. and Rodriguez , P . 2005. Network coding for large scale content distribution . In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05) . IEEE Computer Society, Los Alamitos, CA, 2235--2245. Gkantsidis, C. and Rodriguez, P. 2005. Network coding for large scale content distribution. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05). IEEE Computer Society, Los Alamitos, CA, 2235--2245."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.02.012"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080192.1080199"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328671.1328674"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1269899.1254919"},{"volume-title":"Proceedings of the 13th GI\/ITG Conference on Measurement, Modeling, and Evaluation of Computer and Communication Systems (MMB). 285--302","author":"Leibnitz K.","key":"e_1_2_1_14_1","unstructured":"Leibnitz , K. , Ho\u00dffeld , T. , Wakamiya , N. , and Murata , M . 2006. On pollution in eDonkey-like peer-to-peer file-sharing networks . In Proceedings of the 13th GI\/ITG Conference on Measurement, Modeling, and Evaluation of Computer and Communication Systems (MMB). 285--302 . Leibnitz, K., Ho\u00dffeld, T., Wakamiya, N., and Murata, M. 2006. On pollution in eDonkey-like peer-to-peer file-sharing networks. In Proceedings of the 13th GI\/ITG Conference on Measurement, Modeling, and Evaluation of Computer and Communication Systems (MMB). 285--302."},{"volume-title":"Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association","author":"Li H.","key":"e_1_2_1_15_1","unstructured":"Li , H. , Clement , A. , Wong , E. , Napper , J. , Roy , I. , Alvisi , L. , and Dahlin , M . 2007. BAR gossip . In Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association , Berkeley, CA, 191--204. Li, H., Clement, A., Wong, E., Napper, J., Roy, I., Alvisi, L., and Dahlin, M. 2007. BAR gossip. In Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, Berkeley, CA, 191--204."},{"key":"e_1_2_1_16_1","unstructured":"Marciniak P. Liogkas N. Legout A. and Kohler E. 2008. Small is not always beautiful. Tech. rep. CoRR abs\/0802.1015.  Marciniak P. Liogkas N. Legout A. and Kohler E. 2008. Small is not always beautiful. Tech. rep. CoRR abs\/0802.1015."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168134.1168138"},{"volume-title":"Proceedings of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society","author":"Sherwood R.","key":"e_1_2_1_18_1","unstructured":"Sherwood , R. , Braud , R. , and Bhattacharjee , B . 2004. Slurpie: a cooperative bulk data transfer protocol . In Proceedings of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society , Los Alamitos, CA, 941--951. Sherwood, R., Braud, R., and Bhattacharjee, B. 2004. Slurpie: a cooperative bulk data transfer protocol. In Proceedings of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society, Los Alamitos, CA, 941--951."},{"key":"e_1_2_1_19_1","unstructured":"Wang C. and Li B. 2003. Peer-to-peer overlay networks: a survey. Tech. rep. Department of Computer Science Hong Kong University.  Wang C. and Li B. 2003. Peer-to-peer overlay networks: a survey. Tech. rep. Department of Computer Science Hong Kong University."},{"key":"e_1_2_1_20_1","volume-title":"Multimedia Computing and Networking","volume":"6071","author":"Wu G.","unstructured":"Wu , G. and Chiueh , T . 2006. How efficient is BitTorrent&quest; In Proceedings of the IS&T\/SPIE Symposium on Electronic Imaging . Multimedia Computing and Networking , vol. 6071 . SPIE Press, Bellingham, WA. Wu, G. and Chiueh, T. 2006. How efficient is BitTorrent&quest; In Proceedings of the IS&T\/SPIE Symposium on Electronic Imaging. Multimedia Computing and Networking, vol. 6071. SPIE Press, Bellingham, WA."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.13"},{"volume-title":"Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society","author":"Zhang X.","key":"e_1_2_1_22_1","unstructured":"Zhang , X. , Liu , J. , Li , B. , and Yum , T . 2005. CoolStreaming\/DONet: a data-driven overlay network for efficient live media streaming . In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society , Los Alamitos, CA. 2102--2111. Zhang, X., Liu, J., Li, B., and Yum, T. 2005. CoolStreaming\/DONet: a data-driven overlay network for efficient live media streaming. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE Computer Society, Los Alamitos, CA. 2102--2111."}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1452001.1452009","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1452001.1452009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:06Z","timestamp":1750253406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1452001.1452009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["10.1145\/1452001.1452009"],"URL":"https:\/\/doi.org\/10.1145\/1452001.1452009","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"type":"print","value":"1556-4665"},{"type":"electronic","value":"1556-4703"}],"subject":[],"published":{"date-parts":[[2008,11]]},"assertion":[{"value":"2007-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}