{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:02:05Z","timestamp":1775282525223,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540407249","type":"print"},{"value":"9783540451723","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45172-3_7","type":"book-chapter","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T18:40:01Z","timestamp":1295289601000},"page":"80-87","source":"Crossref","is-referenced-by-count":106,"title":["Simple Load Balancing for Distributed Hash Tables"],"prefix":"10.1007","author":[{"given":"John","family":"Byers","sequence":"first","affiliation":[]},{"given":"Jeffrey","family":"Considine","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced allocations. SIAM Journal on Computing\u00a029(1), 180\u2013200 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Byers, J., Considine, J., Mitzenmacher, M., Rost, S.: Informed content delivery across adaptive overlay networks. In: SIGCOMM, pp. 47\u201360 (2002)","DOI":"10.1145\/964725.633031"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Byers, J.W., Luby, M., Mitzenmacher, M.: Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads. In: INFOCOM, vol.\u00a0(1), pp. 275\u2013283 (1999)","DOI":"10.1109\/INFCOM.1999.749293"},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1145\/52324.52336","volume-title":"ACM SIGCOMM","author":"D. Clark","year":"1988","unstructured":"Clark, D.: The design philosophy of the DARPA internet protocols. In: ACM SIGCOMM, pp. 106\u2013114. ACM Press, New York (1988)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Widearea cooperative storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001), Chateau Lake Louise, Banff, Canada (October 2001)","DOI":"10.1145\/502034.502054"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Lehman, E., Leighton, F.T., Panigrahy, R., Levine, M.S., Lewin, D.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: ACM Symposium on Theory of Computing, May 1997, pp. 654\u2013663 (1997)","DOI":"10.1145\/258533.258660"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Richa, A., Sitaraman, R.: The Power of Two Choices: A Survey of Techniques and Results. Pardalos, P., Rajasekaran, S., Reif, J., Rolim, J. (eds.), pp. 255\u2013312. Kluwer Academic Publishers, Norwell (2001)","DOI":"10.1007\/978-1-4615-0013-1_9"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: ACM SIGCOMM, pp. 161\u2013172 (2001)","DOI":"10.1145\/964723.383072"},{"key":"7_CR9","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, p. 329. Springer, Heidelberg (2001)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM, pp. 149\u2013160 (2001)","DOI":"10.1145\/964723.383071"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: How asymmetry helps load balancing. In: Proceedings of the 40th IEEE-FOCS, pp. 131\u2013140 (1999)","DOI":"10.1109\/SFFCS.1999.814585"},{"key":"7_CR12","unstructured":"Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB\/CSD-01-1141, UC Berkeley (April 2001)"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems II"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45172-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T21:42:35Z","timestamp":1740865355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-45172-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407249","9783540451723"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45172-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}