{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:53Z","timestamp":1750307753095,"version":"3.41.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"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":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2007,10]]},"abstract":"<jats:p>Most proposed gossip-based systems use an ad-hoc design. We observe a low degree of reutilization among this proposals. We present how this limits both the systematic development of gossip-based applications and the number of applications that can benefit from gossip-based construction. We posit that these reinvent-the-wheel approaches poses a significant barrier to the spread and usability of gossip protocols.<\/jats:p>\n          <jats:p>\n            This paper advocates a conceptual design framework based upon aggregating basic and predefined building blocks (B\n            <jats:sup>2<\/jats:sup>\n            ). We show how to compose building blocks within our framework to construct more complex blocks to be used in gossip-based applications. The concept is further depicted with two gossip-based applications described using our building blocks.\n          <\/jats:p>","DOI":"10.1145\/1317379.1317387","type":"journal-article","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T15:57:07Z","timestamp":1195228627000},"page":"43-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Compositional gossip"],"prefix":"10.1145","volume":"41","author":[{"given":"\u00c9tienne","family":"Rivi\u00e8re","sequence":"first","affiliation":[{"name":"IRISA \/ Rennes 1 Univ., France"}]},{"given":"Roberto","family":"Baldoni","sequence":"additional","affiliation":[{"name":"Roma Univ. \"La Sapienza\", Italy"}]},{"given":"Harry","family":"Li","sequence":"additional","affiliation":[{"name":"Univ. of Texas at Austin"}]},{"given":"Jos\u00e9","family":"Pereira","sequence":"additional","affiliation":[{"name":"Univ. of Minho, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2007,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073871"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151374.1151379"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1266894.1266898"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759076.1759083"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/312203.312207"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_45"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1317379.1317388"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015471"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/945506.945507"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1297243"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2006.19"},{"key":"e_1_2_1_14_1","unstructured":"K. Guo. Scalable Message Stability Detection Protocols. PhD thesis Cornell University Computer Science Department May 1998.   K. Guo. Scalable Message Stability Detection Protocols . PhD thesis Cornell University Computer Science Department May 1998."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/829526.831137"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.876186"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1045658.1045666"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2006.25"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082469.1082470"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2006.105"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142395"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2005.15"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.79"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146402"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2005.4"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2006.38"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032662.1034367"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/774763.774784"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/998674.999375"},{"key":"e_1_2_1_33_1","volume-title":"IPTPS'06: the fifth International Workshop on Peer-to-Peer Systems","author":"Voulgaris S.","year":"2006","unstructured":"S. Voulgaris , \u00c9. Rivi\u00e8re, A.-M. Kermarrec , and M. van Steen . Sub-2-sub : Self-organizing content-based publish and subscribe for dynamic and large scale collaborative networks . In IPTPS'06: the fifth International Workshop on Peer-to-Peer Systems , Santa Barbara, USA , Feb. 2006 . S. Voulgaris, \u00c9. Rivi\u00e8re, A.-M. Kermarrec, and M. van Steen. Sub-2-sub: Self-organizing content-based publish and subscribe for dynamic and large scale collaborative networks. In IPTPS'06: the fifth International Workshop on Peer-to-Peer Systems, Santa Barbara, USA, Feb. 2006."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39671-0_5"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_125"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832218"}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1317379.1317387","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1317379.1317387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:17Z","timestamp":1750253957000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1317379.1317387"}},"subtitle":["a conceptual architecture for designing gossip-based applications"],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,10]]}},"alternative-id":["10.1145\/1317379.1317387"],"URL":"https:\/\/doi.org\/10.1145\/1317379.1317387","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2007,10]]},"assertion":[{"value":"2007-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}