{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:07:45Z","timestamp":1761401265486,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005,1]]},"abstract":"<jats:p>\n            Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive nature of P2P networks is that it is not trivial to aggregate and broadcast global information efficiently. We believe that this aggregation\/broadcast functionality is a fundamental service that should be layered over existing Distributed Hash Tables (DHTs), and in this work, we design a novel algorithm for this purpose. Specifically, we build an aggregation\/broadcast tree in a bottom-up fashion by mapping nodes to their parents in the tree with a\n            <jats:italic>parent function.<\/jats:italic>\n            The particular parent function family we propose allows the efficient construction of multiple interior-node-disjoint trees, thus preventing single points of failure in tree structures. In this way, we provide DHTs with an ability to collect and disseminate information efficiently on a global scale. Simulation results demonstrate that our algorithm is efficient and robust.\n          <\/jats:p>","DOI":"10.1145\/1052812.1052813","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T19:28:32Z","timestamp":1131391712000},"page":"81-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Implementing aggregation and broadcast over Distributed Hash Tables"],"prefix":"10.1145","volume":"35","author":[{"given":"Ji","family":"Li","sequence":"first","affiliation":[{"name":"MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karen","family":"Sollins","sequence":"additional","affiliation":[{"name":"MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dah-Yoh","family":"Lim","sequence":"additional","affiliation":[{"name":"MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,1]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Napster \"http:\/\/www.napster.com \".]]  Napster \"http:\/\/www.napster.com \".]]"},{"key":"e_1_2_1_2_1","unstructured":"Gnutella \"http:\/\/gnutella.wego.com \".]]  Gnutella \"http:\/\/gnutella.wego.com \".]]"},{"key":"e_1_2_1_3_1","unstructured":"KaZaA \"http:\/\/www.kazaa.com \".]]  KaZaA \"http:\/\/www.kazaa.com \".]]"},{"key":"e_1_2_1_4_1","volume-title":"Hong, \"Freenet: A distributed anonymous information storage and retrieval system,\" Lecture Notes in Computer Science","author":"Clarke Ian","year":"2001","unstructured":"Ian Clarke , Oskar Sandberg , Brandon Wiley , and Theodore W . Hong, \"Freenet: A distributed anonymous information storage and retrieval system,\" Lecture Notes in Computer Science , vol. 2009 , pp. 46+, 2001 .]] Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong, \"Freenet: A distributed anonymous information storage and retrieval system,\" Lecture Notes in Computer Science, vol. 2009, pp. 46+, 2001.]]"},{"key":"e_1_2_1_5_1","volume-title":"A read\/write peer-to-peer file system,\" in Proceedings of 5th Symposium on Operating Systems Design and Implementation","author":"Muthitacharoen Athicha","year":"2002","unstructured":"Athicha Muthitacharoen , Robert Morris , Thomer M. Gil , and Benjie Chen , \"Ivy : A read\/write peer-to-peer file system,\" in Proceedings of 5th Symposium on Operating Systems Design and Implementation , 2002 .]] Athicha Muthitacharoen, Robert Morris, Thomer M. Gil, and Benjie Chen, \"Ivy: A read\/write peer-to-peer file system,\" in Proceedings of 5th Symposium on Operating Systems Design and Implementation, 2002.]]"},{"key":"e_1_2_1_6_1","first-page":"951","volume-title":"USA","author":"Paechter Ben","year":"2000","unstructured":"Ben Paechter , T. Baeck , M. Schoenauer , A. E. Eiben , and J. Merelo , \" A distributed resource evolutionary algorithm machine,\" in Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), San Diego , USA , 2000 , IEEE, pp. 951 -- 958 , IEEE Press.]] Ben Paechter, T. Baeck, M. Schoenauer, A. E. Eiben, and J. Merelo, \"A distributed resource evolutionary algorithm machine,\" in Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), San Diego, USA, 2000, IEEE, pp. 951--958, IEEE Press.]]"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571857"},{"key":"e_1_2_1_8_1","volume-title":"March","author":"Manku Gurmeet","year":"2003","unstructured":"Gurmeet Manku , Mayank Bawa , and Prabhakar Raghavan , \"Symphony : Distributed hashing in a small world,\" in Proceedings of 4th USENIX Symposium on Internet Technologies and Systems , March 2003 .]] Gurmeet Manku, Mayank Bawa, and Prabhakar Raghavan, \"Symphony: Distributed hashing in a small world,\" in Proceedings of 4th USENIX Symposium on Internet Technologies and Systems, March 2003.]]"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_2_1_12_1","first-page":"329","author":"Rowstron Antony","year":"2001","unstructured":"Antony Rowstron and Peter Druschel , \"Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems,\" in IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware) , Nov. 2001 , pp. 329 -- 350 .]] Antony Rowstron and Peter Druschel, \"Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems,\" in IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware), Nov. 2001, pp. 329--350.]]","journal-title":"IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware)"},{"key":"e_1_2_1_13_1","volume-title":"USA","author":"Saroiu Stefan","year":"2002","unstructured":"Stefan Saroiu , P. Krishna Gummadi , and Steven D . Gribble, \"A measurement study of peer-to-peer file sharing systems,\" in Proceedings of Multimedia Computing and Networking 2002 (MMCN '02), San Jose, CA , USA , January 2002 .]] Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble, \"A measurement study of peer-to-peer file sharing systems,\" in Proceedings of Multimedia Computing and Networking 2002 (MMCN '02), San Jose, CA, USA, January 2002.]]"},{"key":"e_1_2_1_15_1","volume-title":"Special Issue on Ubiquitous Computing","author":"Portmann M.","year":"2002","unstructured":"M. Portmann and A. Seneviratne , \" Cost-effective broadcast for fully decentralized peer-to-peer networks,\" Computer Communication, vol . Special Issue on Ubiquitous Computing , Elsevier Science , 2002 .]] M. Portmann and A. Seneviratne, \"Cost-effective broadcast for fully decentralized peer-to-peer networks,\" Computer Communication, vol. Special Issue on Ubiquitous Computing, Elsevier Science, 2002.]]"},{"key":"e_1_2_1_16_1","volume-title":"Per Brand, and Seif Haridi, \"Efficient broadcast in structured P2P networks,\" in 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03)","author":"El-Ansary Sameh","year":"2003","unstructured":"Sameh El-Ansary , Luc Onana Alima , Per Brand, and Seif Haridi, \"Efficient broadcast in structured P2P networks,\" in 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03) , Berkeley , CA , 2003 .]] Sameh El-Ansary, Luc Onana Alima, Per Brand, and Seif Haridi, \"Efficient broadcast in structured P2P networks,\" in 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), Berkeley, CA, 2003.]]"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/507670.507687"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/648089.747486"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/378344.378347"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Sylvia Ratnasamy Mark Handley Richard Karp and Scott Shenker \"Application-level multicast using content-addressable networks \" in 3rd International Workshop on Networked Group Communication November 2001.]]   Sylvia Ratnasamy Mark Handley Richard Karp and Scott Shenker \"Application-level multicast using content-addressable networks \" in 3rd International Workshop on Networked Group Communication November 2001.]]","DOI":"10.1007\/3-540-45546-9_2"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/776322.776349"},{"key":"e_1_2_1_22_1","volume-title":"Estimating aggregates on a peer-to-peer network,\" in Submitted for publication","author":"Bawa M.","year":"2003","unstructured":"M. Bawa , H. Garcia-Molina , A. Gionis , and R. Motwani , \" Estimating aggregates on a peer-to-peer network,\" in Submitted for publication , 2003 .]] M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani, \"Estimating aggregates on a peer-to-peer network,\" in Submitted for publication, 2003.]]"},{"key":"e_1_2_1_23_1","volume-title":"the continuous-discrete approach,\" www.wisdom.weizmann.ac.il\/uwieder","author":"Naor Moni","year":"2002","unstructured":"Moni Naor and Udi Wieder , \" Novel architectures for P2P applications : the continuous-discrete approach,\" www.wisdom.weizmann.ac.il\/uwieder , 2002 .]] Moni Naor and Udi Wieder, \"Novel architectures for P2P applications: the continuous-discrete approach,\" www.wisdom.weizmann.ac.il\/uwieder, 2002.]]"},{"key":"e_1_2_1_24_1","first-page":"2","volume-title":"Self-organized metadata overlay for resource management","author":"Zhang Zheng","year":"2003","unstructured":"Zheng Zhang , Shu-Ming Shi , and Jing Zhu , \"Somo : Self-organized metadata overlay for resource management in p 2 p dht,\" in 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), Berkeley, CA , 2003 .]] Zheng Zhang, Shu-Ming Shi, and Jing Zhu, \"Somo: Self-organized metadata overlay for resource management in p2p dht,\" in 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), Berkeley, CA, 2003.]]"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/507670.507695"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945474"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1052812.1052813","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1052812.1052813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:42Z","timestamp":1750262862000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1052812.1052813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["10.1145\/1052812.1052813"],"URL":"https:\/\/doi.org\/10.1145\/1052812.1052813","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2005,1]]},"assertion":[{"value":"2005-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}