{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:31:26Z","timestamp":1761647486217,"version":"3.41.0"},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,3,20]],"date-time":"2007-03-20T00:00:00Z","timestamp":1174348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2007,3,20]]},"abstract":"<jats:p>In this paper, we discuss the current situation with respect to simulation usage in P2P research, testing the available P2P simulators against a proposed set of requirements, and surveying over 280 papers to discover what simulators are already being used. We found that no simulator currently meets all our requirements, and that simulation results are generally reported in the literature in a fashion that precludes any reproduction of results. We hope that this paper will give rise to further discussion and knowledge sharing among those of the P2P and network simulation research communities, so that a simulator that meets the needs of rigorous P2P research can be developed<\/jats:p>","DOI":"10.1145\/1232919.1232932","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:52:18Z","timestamp":1175802738000},"page":"95-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":74,"title":["The state of peer-to-peer simulators and simulations"],"prefix":"10.1145","volume":"37","author":[{"given":"S.","family":"Naicken","sequence":"first","affiliation":[{"name":"University of Sussex, Brighton, U.K."}]},{"given":"B.","family":"Livingston","sequence":"additional","affiliation":[{"name":"University of Sussex, Brighton, U.K."}]},{"given":"A.","family":"Basu","sequence":"additional","affiliation":[{"name":"University of Sussex, Brighton, U.K."}]},{"given":"S.","family":"Rodhetbhai","sequence":"additional","affiliation":[{"name":"University of Sussex, Brighton, U.K."}]},{"given":"I.","family":"Wakeman","sequence":"additional","affiliation":[{"name":"University of Sussex, Brighton, U.K."}]},{"given":"D.","family":"Chalmers","sequence":"additional","affiliation":[{"name":"University of Sussex, Brighton, U.K."}]}],"member":"320","published-online":{"date-parts":[[2007,3,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.242"},{"key":"e_1_2_1_2_1","volume-title":"Proc. IPTPS","author":"Dabek F.","year":"2003","unstructured":"F. Dabek , B. Zhao , P. Druschel , J. Kubiatowicz , and I. Stoica . Towards a common API for structured peer-to-peer overlays . In Proc. IPTPS , volume 58 . Springer , 2003 . F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica. Towards a common API for structured peer-to-peer overlays. In Proc. IPTPS, volume 58. Springer, 2003."},{"key":"e_1_2_1_3_1","volume-title":"1st Workshop on Economics of Peer-to-Peer Systems","author":"Feldman M.","year":"2003","unstructured":"M. Feldman , K. Lai , J. Chaung , and I. Stoica . Quantifying disincentives in peer-to-peer networks . In 1st Workshop on Economics of Peer-to-Peer Systems , June 2003 . M. Feldman, K. Lai, J. Chaung, and I. Stoica. Quantifying disincentives in peer-to-peer networks. In 1st Workshop on Economics of Peer-to-Peer Systems, June 2003."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11407386_10"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141277.1141437"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1096166.1096174"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024591915518"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/776322.776347"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099384.1099390"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/986858.986876"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080793.1080799"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143549.1143776"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1232919.1232932","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1232919.1232932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:51Z","timestamp":1750258311000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1232919.1232932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,20]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3,20]]}},"alternative-id":["10.1145\/1232919.1232932"],"URL":"https:\/\/doi.org\/10.1145\/1232919.1232932","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2007,3,20]]},"assertion":[{"value":"2007-03-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}