{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:37:09Z","timestamp":1742387829072},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240532"},{"type":"electronic","value":"9783540258407"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25840-7_6","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T20:45:13Z","timestamp":1283546713000},"page":"47-58","source":"Crossref","is-referenced-by-count":34,"title":["A Robust and Scalable Peer-to-Peer Gossiping Protocol"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Voulgaris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1rk","family":"Jelasity","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"van Steen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2001","unstructured":"Albert, R., Barabasi, A.-L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics\u00a074(1), 47\u201397 (2001)","journal-title":"Reviews of Modern Physics"},{"key":"6_CR2","unstructured":"Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting Network Proximity in Peer-to-Peer Overlay Networks. Technical Report MSR-TR-2002-82, Microsoft Research, Cambridge, UK (June 2002)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/41840.41841","volume-title":"Proc. Sixth Symp. on Principles of Distributed Computing","author":"A. Demers","year":"1987","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic Algorithms for Replicated Database Management. In: Proc. Sixth Symp. on Principles of Distributed Computing, pp. 1\u201312. ACM Press, New York (1987)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/DSN.2001.941428","volume-title":"Proc. Second Int\u2019l Conf. Dependable Systems and Networks","author":"P. Eugster","year":"2001","unstructured":"Eugster, P., Guerraoui, R., Handurukande, S., Kermarrec, A.-M., Kouznetsov, P.: Lightweight Probabilistic Broadcast. In: Proc. Second Int\u2019l Conf. Dependable Systems and Networks, pp. 443\u2013452. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"6_CR5","volume-title":"Proc. Int\u2019l Conf. Dependable Systems and Networks","author":"P.T. Eugster","year":"2002","unstructured":"Eugster, P.T., Guerraoui, R.: Probabilistic Multicast. In: Proc. Int\u2019l Conf. Dependable Systems and Networks, IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-45546-9_4","volume-title":"Networked Group Communication","author":"A. Ganesh","year":"2001","unstructured":"Ganesh, A., Kermarrec, A.-M., Massouli\u00e9, L.: Scamp: Peer-to-Peer Lightweight Membership Servic for Large-Scale Group Communication. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol.\u00a02233, pp. 44\u201356. Springer, Heidelberg (2001)"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TC.2003.1176982","volume":"52","author":"A. Ganesh","year":"2003","unstructured":"Ganesh, A., Kermarrec, A.-M., Massouli\u00e9, L.: Peer-to-Peer Membership Management for Gossip-based Protocols. IEEE Trans. Comp.\u00a052(2), 139\u2013149 (2003)","journal-title":"IEEE Trans. Comp."},{"key":"6_CR8","unstructured":"Jelasity, M., van Steen, M.: Large-Scale Newscast Computing on the Internet. Technical Report IR-503, Vrije Universiteit, Department of Computer Science (October 2002)"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/TPDS.2003.1189583","volume":"14","author":"A.-M. Kermarrec","year":"2003","unstructured":"Kermarrec, A.-M., Massouli\u00e9, L., Ganesh, A.: Probabilistic Reliable Dissemination in Large-Scale Systems. IEEE Trans. Par. Distr. Syst.\u00a014(3), 248\u2013258 (2003)","journal-title":"IEEE Trans. Par. Distr. Syst."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S.P.: A Scalable Content Addressable Network. PhD thesis, University of California at Berkeley (October 2002)","DOI":"10.1145\/383059.383072"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"6_CR12","volume-title":"Proc. SIGCOMM","author":"I. Stoica","year":"2001","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proc. SIGCOMM, ACM, New York (2001)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. IEEE\/ACM Trans. Netw. (2003) (to appear)","DOI":"10.1109\/TNET.2002.808407"},{"key":"6_CR14","doi-asserted-by":"crossref","DOI":"10.1515\/9780691188331","volume-title":"Small Worlds, The Dynamics of Networks between Order and Randomness","author":"D.J. Watts","year":"1999","unstructured":"Watts, D.J.: Small Worlds, The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)"},{"key":"6_CR15","volume-title":"Proc. 19th Int\u2019l Conf. Data Engineering","author":"B. Yang","year":"2003","unstructured":"Yang, B., Garcia-Molina, H.: Designing a Super-Peer Network. In: Proc. 19th Int\u2019l Conf. Data Engineering, IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"6_CR16","unstructured":"Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report CSD-01-1141, Computer Science Division, University of California, Berkeley (April 2001)"}],"container-title":["Lecture Notes in Computer Science","Agents and Peer-to-Peer Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25840-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T09:14:11Z","timestamp":1559553251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25840-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240532","9783540258407"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25840-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}