{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:16:11Z","timestamp":1763662571589},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290681"},{"type":"electronic","value":"9783540319061"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558989_20","type":"book-chapter","created":{"date-parts":[[2005,11,2]],"date-time":"2005-11-02T03:51:51Z","timestamp":1130903511000},"page":"217-225","source":"Crossref","is-referenced-by-count":30,"title":["Dynamic Load Balancing in Distributed Hash Tables"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Korzeniowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm Meyer auf","family":"der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Adler, M., Halperin, E., Karp, R., Vazirani, V.: A stochastic process on the hypercube with applications to peer-to-peer networks. In: Proc. of the 35th ACM Symp. on Theory of Computing (STOC), pp. 575\u2013584 (June 2003)","DOI":"10.1145\/780542.780626"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Scheideler, C.: Group spreading: A protocol for provably secure distributed name service. In: Proc. of the 31st Int. Colloquium on Automata, Languages, and Programming (ICALP), pp. 183\u2013195 (July 2004)","DOI":"10.1007\/978-3-540-27836-8_18"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-45172-3_7","volume-title":"Peer-to-Peer Systems II","author":"J. Byers","year":"2003","unstructured":"Byers, J., Considine, J., Mitzenmacher, M.: Simple load balancing for distributed hash tables. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, pp. 80\u201387. Springer, Heidelberg (2003)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Godfrey, B., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in dynamic structured P2P systems. In: 23rd Conference of the IEEE Communications Society (INFOCOM) (March 2004)","DOI":"10.1109\/INFCOM.2004.1354648"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed object location in a dynamic network. In: Proc. of the 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 41\u201352 (August 2002)","DOI":"10.1145\/564870.564877"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: Proc. of the 29th ACM Symp. on Theory of Computing (STOC), pp. 654\u2013663 (May 1997)","DOI":"10.1145\/258533.258660"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-540-30183-7_13","volume-title":"Peer-to-Peer Systems III","author":"D.R. Karger","year":"2005","unstructured":"Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 131\u2013140. Springer, Heidelberg (2005)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: Proc. of the 16th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 36\u201343 (June 2004)","DOI":"10.1145\/1007912.1007919"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Manku, G.S.: Balanced binary trees for id management and load balance in distributed hash tables. In: Proc. of the 23rd annual ACM symposium on Principles of Distributed Computing (PODC), pp. 197\u2013205 (2004)","DOI":"10.1145\/1011767.1011797"},{"key":"20_CR10","volume-title":"Handbook of Randomized Computing","author":"M. Mitzenmacher","year":"2000","unstructured":"Mitzenmacher, M., Richa, A.W., Sitaraman, R.: The power of two random choices: A survey of techniques and results. In: Pardalos, P., Rajasekaran, S., Rolim, J. (eds.) Handbook of Randomized Computing. Kluwer, Dordrecht (2000)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Proc. of the 15th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 50\u201359 (June 2003)","DOI":"10.1145\/777412.777421"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_8","volume-title":"Peer-to-Peer Systems II","author":"M. Naor","year":"2003","unstructured":"Naor, M., Wieder, U.: A simple fault tolerant distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_6","volume-title":"Peer-to-Peer Systems II","author":"A. Rao","year":"2003","unstructured":"Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in structured P2P systems. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"20_CR14","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, decentralized 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":"20_CR15","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. of the ACM SIGCOMM, pp. 149\u2013160 (2001)","DOI":"10.1145\/383059.383071"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558989_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T12:09:10Z","timestamp":1586520550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558989_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290681","9783540319061"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11558989_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}