{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:32:12Z","timestamp":1725478332923},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540363217"},{"type":"electronic","value":"9783540363224"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11795490_29","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T07:25:18Z","timestamp":1169537118000},"page":"381-395","source":"Crossref","is-referenced-by-count":0,"title":["Bounding Communication Cost in Dynamic Load Balancing of 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"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Lehman, E., Leighton, F.T., Levine, M.S., 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 (1997)","DOI":"10.1145\/258533.258660"},{"key":"29_CR2","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"},{"key":"29_CR3","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 (2002)","DOI":"10.1145\/564870.564877"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. LNCS, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"29_CR5","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":"29_CR6","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 (2003)","DOI":"10.1145\/777412.777421"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-Area Cooperative Storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP) (2001)","DOI":"10.1145\/502034.502054"},{"key":"29_CR8","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.M., Stoica, I.: Load Balancing in Structured P2P Systems. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Godfrey, B., Lakshminarayanan, K., Surana, S., Karp, R.M., Stoica, I.: Load Balancing in Dynamic Structured P2P Systems. In: 23rd Conference of the IEEE Communications Society (INFOCOM) (2004)","DOI":"10.1109\/INFCOM.2004.1354648"},{"key":"29_CR10","volume-title":"Handbook of Randomized Computing","author":"M. Mitzenmacher","year":"2000","unstructured":"Mitzenmacher, M., Andr\u00e9a, W., Richa, R.K.S.: 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":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_7","volume-title":"Peer-to-Peer Systems II","author":"J.W. Byers","year":"2003","unstructured":"Byers, J.W., Considine, J., Mitzenmacher, M.: Simple Load Balancing for Distributed Hash Tables. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Adler, M., Halperin, E., Karp, R.M., 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 (2003)","DOI":"10.1145\/780542.780626"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","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. Springer, Heidelberg (2005)"},{"key":"29_CR14","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 (2004)","DOI":"10.1145\/1007912.1007919"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-27836-8_18","volume-title":"Automata, Languages and Programming","author":"B. Awerbuch","year":"2004","unstructured":"Awerbuch, B., Scheideler, C.: Group Spreading: A protocol for provably secure distributed name service. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 183\u2013195. Springer, Heidelberg (2004)"},{"key":"29_CR16","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":"29_CR17","doi-asserted-by":"crossref","unstructured":"Kenthapadi, K., Manku, G.S.: Decentralized Algorithms Using Both Local and Random Probes for P2P Load Balancing. In: Proc. of the 17th ACM Symp. on Parallel Algorithms and Architectures (SPAA) (2005)","DOI":"10.1145\/1073970.1073990"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11558989_20","volume-title":"Peer-to-Peer Systems IV","author":"M. Bienkowski","year":"2005","unstructured":"Bienkowski, M., Korzeniowski, M., Meyer auf der Heide, F.: Dynamic Load Balancing in Distributed Hash Tables. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol.\u00a03640, pp. 217\u2013225. Springer, Heidelberg (2005)"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Balakrishnan, H., Karger, D.R.: Analysis of the Evolution of Peer-to-Peer Systems. In: Proc. of the 21st annual ACM symposium on Principles of Distributed Computing (PODC), pp. 233\u2013242 (2002)","DOI":"10.1145\/571825.571863"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Pandurangan, G., Raghavan, P., Upfal, E.: Building Low-Diameter Peer-to-Peer Networks. In: Proc. of the 42nd IEEE symposium on Foundations of Computer Science (FOCS), pp. 492\u2013499 (2001)","DOI":"10.1109\/SFCS.2001.959925"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:59:26Z","timestamp":1556045966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11795490_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}