{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:47:47Z","timestamp":1768564067256,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0140-3664(02)00250-5","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T09:52:27Z","timestamp":1046771547000},"page":"1159-1167","source":"Crossref","is-referenced-by-count":39,"title":["Cost-effective broadcast for fully decentralized peer-to-peer networks"],"prefix":"10.1016","volume":"26","author":[{"given":"Marius","family":"Portmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aruna","family":"Seneviratne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(02)00250-5_BIB4","first-page":"46135","article-title":"Search in power-law networks","volume":"E64","author":"Adamic","year":"2001","journal-title":"Physical Review"},{"key":"10.1016\/S0140-3664(02)00250-5_BIB5","first-page":"203","article-title":"Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology","author":"Hong","year":"2001"},{"key":"10.1016\/S0140-3664(02)00250-5_BIB6","doi-asserted-by":"crossref","DOI":"10.1145\/316188.316229","article-title":"On power-law relationships of the internet topology","author":"Faloutsos","year":"1999","journal-title":"ACM SIGCOMM'99, Boston"},{"key":"10.1016\/S0140-3664(02)00250-5_BIB7","article-title":"A random graph model for massive graphs","author":"Aiello","year":"2000","journal-title":"32nd Annual Symposium in Theory of Computing"},{"key":"10.1016\/S0140-3664(02)00250-5_BIB8","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"October","author":"Bar\u00e1basi","year":"1999","journal-title":"Science"},{"key":"10.1016\/S0140-3664(02)00250-5_BIB9","article-title":"BRITE: an approach to universal topology generation","volume":"August","author":"Medina","year":"2001","journal-title":"Proceedings of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems\u2014MASCOTS'01, Cincinnati, OH"},{"key":"10.1016\/S0140-3664(02)00250-5_BIB10","first-page":"1","article-title":"Epidemic algorithms for replicated database maintenance","volume":"August","author":"Demers","year":"1987","journal-title":"Proceedings of the ACM Symposium on the Principles of Distributed Computing"},{"key":"10.1016\/S0140-3664(02)00250-5_BIB11","doi-asserted-by":"crossref","unstructured":"K.P. Birman, M. Hagden, O. OzKasap, Z. Xiao, M. Budiu, Y. Minsky, Bimodal Multicase, ACM Transactions on Computer Systems Vol 17 pp. 41\u201388 May 1999.","DOI":"10.1145\/312203.312207"},{"key":"10.1016\/S0140-3664(02)00250-5_BIB12","first-page":"55","article-title":"A gossip-style failure detection service","volume":"September","author":"van Renesse","year":"1998","journal-title":"Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distrubuted Processing (Middleware '(98)), The Lake District, England"},{"key":"10.1016\/S0140-3664(02)00250-5_BIB13","doi-asserted-by":"crossref","unstructured":"K. Guo, M. Hayden, R. van Renesse, W. Vogels, K.P. Birman, GSGC: an efficient gossip-style garbage collection scheme for scalable realiable multicast, Cornell Universtiy, Departement of Computer Science Technical Report, TR-97-1656 December 3, 1997.","DOI":"10.21236\/ADA542422"},{"key":"10.1016\/S0140-3664(02)00250-5_BIB14","unstructured":"M.-J. Lin, K. Marzullo, S. Masini, Gossip versus deterministic flooding: Low message overhead and high reliability for broadcasting on small networks, Technical Report CS1999-0637, University of California, San Diego, Computer Science and Engineering, 1999."},{"key":"10.1016\/S0140-3664(02)00250-5_BIB15","series-title":"LNCS 2009","article-title":"Freenet: A Distributed Anonymous Information Storage and Retrieval System","author":"Clarke","year":"2001"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002505?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002505?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T09:04:08Z","timestamp":1583917448000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366402002505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":12,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0140366402002505"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(02)00250-5","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}