{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:09:05Z","timestamp":1742400545838},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441793"},{"type":"electronic","value":"9783540457480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45748-8_27","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T12:29:16Z","timestamp":1191932956000},"page":"280-294","source":"Crossref","is-referenced-by-count":21,"title":["Scalable Management and Data Mining Using Astrolabe*"],"prefix":"10.1007","author":[{"given":"Robbert","family":"van Renesse","sequence":"first","affiliation":[]},{"given":"Kenneth","family":"Birman","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Dumitriu","sequence":"additional","affiliation":[]},{"given":"Werner","family":"Vogels","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"D.G. Andersen, H Balakrishnan, M.F. Kaashoek, and R. Morris. Resilient overlay networks. In Proc. of the Eighteenth ACM Symp. on Operating Systems Principles, pages 131\u2013145, Banff, Canada, October 2001.","DOI":"10.1145\/502034.502048"},{"issue":"7","key":"27_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. Bloom","year":"1970","unstructured":"B. Bloom. Space\/time tradeoffs in hash coding with allowable errors. CACM, 13(7):422\u2013426, July 1970.","journal-title":"CACM"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. of the Sixth ACM Symp. on Principles of Distributed Computing, pages 1\u201312, Vancouver, BC, August 1987.","DOI":"10.1145\/41840.41841"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/4236.935182","volume":"5","author":"L. Gong","year":"2001","unstructured":"L. Gong. JXTA: A network programming environment. IEEE Internet Computing, 5(3):88\u201395, May\/June 2001.","journal-title":"IEEE Internet Computing"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"S.D. Gribble, M. Welsh, R. Von Behren, E.A. Brewer, D. Culler, N. Borisov, S. Czerwinski, R. Gummadi, J. Hill, A. Joseph, R.H. Katz, Z.M. Mao, S. Ross, and B. Zhao. The Ninja architecture for robust internet-scale systems and services. To appear in a Special Issue of Computer Networks on Pervasive Computing, 2001.","DOI":"10.1016\/S1389-1286(00)00179-1"},{"key":"27_CR6","unstructured":"A.D. Joseph and J.D. Kubiatowicz. Brocade: Landmark routing on overlay networks. In Proc. of the First International Workshop on Peer-to-Peer Systems, Cambridge, MA, March 2002."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"B. M. Oki, M. Pfluegl, A. Siegel, and D. Skeen. The Information Bus\u2014an architecture for extensible distributed systems. In Proc. of the Fourteenth ACM Symp. on Operating Systems Principles, pages 58\u201368, Asheville, NC, December 1993.","DOI":"10.1145\/168619.168624"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"A. Oram, editor. Peer-To-Peer: Harnessing the Power of Disruptive Technologies. O\u2019Reilly, 2001.","DOI":"10.1145\/375348.377427"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of the Middleware 2001, November 2001.","DOI":"10.1007\/3-540-45518-3_18"},{"key":"27_CR10","unstructured":"I. Stoica, R. Morris, D. Karger, and M.F. Kaashoek. Chord: A scalable peer-topeer lookup service for Internet applications. In Proc. of the\u2019 95 Symp. on Communications Architectures & Protocols, Cambridge, MA, August 1995. ACM SIGCOMM."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"R. van Renesse and K.P. Birman. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Transactions on Computer Systems, 2002. Submitted for review.","DOI":"10.1145\/762483.762485"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. In Proc. of Middleware\u201998, pages 55\u201370. IFIP, September 1998.","DOI":"10.1007\/978-1-4471-1283-9_4"},{"key":"27_CR13","unstructured":"B.Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical Report UCB\/CSD-01-1141, University of California, Berkeley, Computer Science Department, 2001."}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45748-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:49:55Z","timestamp":1556902195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45748-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441793","9783540457480"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45748-8_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}