{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T05:03:40Z","timestamp":1736744620452,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540482734"},{"type":"electronic","value":"9783540482765"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11915072_52","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T23:53:24Z","timestamp":1164844404000},"page":"1470-1479","source":"Crossref","is-referenced-by-count":3,"title":["Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Gramoli","sequence":"first","affiliation":[]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[]},{"given":"Achour","family":"Mostefaoui","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Sericola","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"52_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00446-005-0139-2","volume":"18","author":"I. Abraham","year":"2005","unstructured":"Abraham, I., Malkhi, D.: Probabilistic quorum systems for dynamic systems. Distributed Computing\u00a018(2), 113\u2013124 (2005)","journal-title":"Distributed Computing"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Castro, M., Costa, M., Rowstron, A.: Performance and dependability of structured peer-to-peer overlays. In: Proc. Int\u2019l IEEE Conference on Dependable Systems and Networks (DSN), Florence (Italy), pp. 9\u201318 (2004)","DOI":"10.1109\/DSN.2004.1311872"},{"key":"52_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/11795490_27","volume-title":"Principles of Distributed Systems","author":"G. Chockler","year":"2006","unstructured":"Chockler, G., Gilbert, S., Gramoli, V., Musial, P.M., Shvartsman, A.A.: Reconfigurable distributed storage for dynamic networks. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 351\u2013365. Springer, Heidelberg (2006)"},{"key":"52_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/633025.633043","volume-title":"Proc. of ACM SIGCOMM","author":"E. Cohen","year":"2002","unstructured":"Cohen, E., Shenker, S.: Replication strategies in unstructured peer-to-peer networks. In: Proc. of ACM SIGCOMM, pp. 177\u2013190. ACM Press, New York (2002)"},{"issue":"4","key":"52_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/945506.945507","volume":"21","author":"P.T.. Eugster","year":"2003","unstructured":"Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kermarrec, A.-M., Kouznetsov, P.: Lightweight probabilistic broadcast. ACM Trans. on Comp. Systems\u00a021(4), 341\u2013374 (2003)","journal-title":"ACM Trans. on Comp. Systems"},{"issue":"2","key":"52_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TC.2003.1176982","volume":"52","author":"A.J. Ganesh","year":"2003","unstructured":"Ganesh, A.J., Kermarrec, A.-M., Massouli\u00e9, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Trans. on Computers\u00a052(2), 139\u2013149 (2003)","journal-title":"IEEE Trans. on Computers"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/800215.806583","volume-title":"Proc. 7th Int\u2019l ACM Symposium on Operating Systems Principles (SOSP)","author":"D.K. Gifford","year":"1979","unstructured":"Gifford, D.K.: Weighted voting for replicated data. In: Proc. 7th Int\u2019l ACM Symposium on Operating Systems Principles (SOSP), pp. 150\u2013162. ACM Press, New York (1979)"},{"key":"52_CR8","series-title":"Reading in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0819-8","volume-title":"The pleasure of probabilities","author":"R. Isaac","year":"1995","unstructured":"Isaac, R.: The pleasure of probabilities. Reading in Mathematics. Springer, Heidelberg (1995)"},{"key":"52_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-30229-2_5","volume-title":"Middleware 2004","author":"M. Jelasity","year":"2004","unstructured":"Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol.\u00a03231, pp. 79\u201398. Springer, Heidelberg (2004)"},{"key":"52_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/571825.571863","volume-title":"Proceedings of the twenty-first annual symposium on Principles of distributed computing (PODC)","author":"D. Liben-Nowell","year":"2002","unstructured":"Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: Proceedings of the twenty-first annual symposium on Principles of distributed computing (PODC), pp. 233\u2013242. ACM Press, New York (2002)"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Lynch, N., Shvartsman, A.: RAMBO: A reconfigurable atomic memory service for dynamic networks. In: Proc. of 16th International Symposium on Distributed Computing, pp. 173\u2013190 (2002)","DOI":"10.1007\/3-540-36108-1_12"},{"issue":"2","key":"52_CR12","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/inco.2001.3054","volume":"170","author":"D. Malkhi","year":"2001","unstructured":"Malkhi, D., Reiter, M., Wool, A., Wright, R.: Probabilistic quorum systems. Information and Computation\u00a0170(2), 184\u2013206 (2001)","journal-title":"Information and Computation"},{"issue":"1","key":"52_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TPDS.2006.2","volume":"17","author":"K. Miura","year":"2006","unstructured":"Miura, K., Tagawa, T., Kakugawa, H.: A quorum-based protocol for searching objects in peer-to-peer networks. IEEE Trans. on Parallel and Distributed Systems\u00a017(1), 25\u201337 (2006)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"52_CR14","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Raynal, M., Travers, C., Peterson, S., Abbadi, A.E., Agrawal, D.: From static distributed systems to dynamic systems. In: Proc. 24th IEEE Symposium on Reliable Distributed Systems (SRDS), pp. 109\u2013119 (2005)","DOI":"10.1109\/RELDIS.2005.19"},{"key":"52_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/383059.383072","volume-title":"Proc. of ACM SIGCOMM","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proc. of ACM SIGCOMM, San Diego, CA, pp. 161\u2013172. ACM Press, New York (2001)"},{"key":"52_CR16","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":"52_CR17","doi-asserted-by":"crossref","unstructured":"Saroiu, S., Gummadi, P., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Computing and Networking (2002)","DOI":"10.1117\/12.449977"},{"key":"52_CR18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/383059.383071","volume-title":"Proc. of ACM 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. of ACM SIGCOMM, San Diego (CA), pp. 149\u2013160. ACM Press, New York (2001)"},{"issue":"2","key":"52_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1145\/320071.320076","volume":"4","author":"R.H. Thomas","year":"1979","unstructured":"Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. on Database Systems\u00a04(2), 180\u2013209 (1979)","journal-title":"ACM Trans. on Database Systems"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11915072_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:53:28Z","timestamp":1736661208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11915072_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540482734","9783540482765"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11915072_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}