{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:07:18Z","timestamp":1742915238381,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108648"},{"type":"electronic","value":"9783642108655"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-10865-5_9","type":"book-chapter","created":{"date-parts":[[2009,11,30]],"date-time":"2009-11-30T05:44:01Z","timestamp":1259559841000},"page":"101-112","source":"Crossref","is-referenced-by-count":1,"title":["Passive\/Active Load Balancing with Informed Node Placement in DHTs"],"prefix":"10.1007","author":[{"given":"Mikael","family":"H\u00f6gqvist","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nico","family":"Kruber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/1294261.1294281","volume-title":"SOSP","author":"G. DeCandia","year":"2007","unstructured":"DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazon\u2019s highly available key-value store. In: SOSP, pp. 205\u2013220. ACM, New York (2007)"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/1080091.1080102","volume-title":"SIGCOMM","author":"S.C. Rhea","year":"2005","unstructured":"Rhea, S.C., Godfrey, B., Karp, B., Kubiatowicz, J., Ratnasamy, S., Shenker, S., Stoica, I., Yu, H.: Opendht: a public dht service and its uses. In: SIGCOMM, pp. 73\u201384. ACM, New York (2005)"},{"key":"9_CR3","unstructured":"Reinefeld, A., Schintke, F., Sch\u00fctt, T., Haridi, S.: Transactional data store for future internet services. Towards the Future Internet - A European Research Perspective (2009)"},{"key":"9_CR4","unstructured":"Blake, C., Rodrigues, R.: High availability, scalable storage, dynamic peer networks: Pick two. In: HotOS, USENIX, pp. 1\u20136 (2003)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Ghodsi, A., Alima, L.O., Haridi, S.: Symmetric replication for structured peer-to-peer systems. In: DBISP2P, pp. 74\u201385 (2005)","DOI":"10.1007\/978-3-540-71661-7_7"},{"key":"9_CR6","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: SIGCOMM, pp. 149\u2013160 (2001)","DOI":"10.1145\/383059.383071"},{"key":"9_CR7","unstructured":"Vishnumurthy, V., Francis, P.: A comparison of structured and unstructured p2p approaches to heterogeneous random peer selection. In: USENIX, pp. 309\u2013322 (2007)"},{"key":"9_CR8","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)"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TNET.2007.893881","volume":"15","author":"X. Wang","year":"2007","unstructured":"Wang, X., Loguinov, D.: Load-balancing performance of consistent hashing: asymptotic analysis of random node join. IEEE\/ACM Trans. Netw.\u00a015(4), 892\u2013905 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Karger, D., 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: ACM Symposium on Theory of Computing, May 1997, pp. 654\u2013663 (1997)","DOI":"10.1145\/258533.258660"},{"key":"9_CR11","first-page":"444","volume-title":"VLDB","author":"P. Ganesan","year":"2004","unstructured":"Ganesan, P., Bawa, M., Garcia-Molina, H.: Online balancing of range-partitioned data with applications to peer-to-peer systems. In: VLDB, pp. 444\u2013455. Morgan Kaufmann, San Francisco (2004)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Kirsch, J., Krishnamurthy, A.: Load balancing and locality in range-queriable data structures. In: PODC, pp. 115\u2013124 (2004)","DOI":"10.1145\/1011767.1011785"},{"key":"9_CR13","first-page":"271","volume-title":"NCA","author":"M. Charpentier","year":"2005","unstructured":"Charpentier, M., Padiou, G., Qu\u00e9innec, P.: Cooperative mobile agents to gather global information. In: NCA, pp. 271\u2013274. IEEE Computer Society, Los Alamitos (2005)"},{"key":"9_CR14","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.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, pp. 80\u201387. Springer, Heidelberg (2003)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11687238_11","volume-title":"Advances in Database Technology - EDBT 2006","author":"T. Pitoura","year":"2006","unstructured":"Pitoura, T., Ntarmos, N., Triantafillou, P.: Replication, load balancing and efficient range query processing in dhts. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., B\u00f6hm, K., Kemper, A., Grust, T., B\u00f6hm, C. (eds.) EDBT 2006. LNCS, vol.\u00a03896, pp. 131\u2013148. Springer, Heidelberg (2006)"},{"key":"9_CR16","first-page":"1419","volume-title":"INFOCOM","author":"J. Ledlie","year":"2005","unstructured":"Ledlie, J., Seltzer, M.I.: Distributed, secure load balancing with skew, heterogeneity and churn. In: INFOCOM, pp. 1419\u20131430. IEEE, Los Alamitos (2005)"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/1073814.1073872","volume-title":"PODC","author":"G. Giakkoupis","year":"2005","unstructured":"Giakkoupis, G., Hadzilacos, V.: A scheme for load balancing in heterogenous distributed hash tables. In: PODC, pp. 302\u2013311. ACM, New York (2005)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Manku, G.S.: Balanced binary trees for id management and load balance in distributed hash tables. In: PODC, pp. 197\u2013205 (2004)","DOI":"10.1145\/1011767.1011797"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/1073970.1073990","volume-title":"SPAA","author":"K. Kenthapadi","year":"2005","unstructured":"Kenthapadi, K., Manku, G.S.: Decentralized algorithms using both local and random probes for p2p load balancing. In: SPAA, pp. 135\u2013144. ACM, New York (2005)"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/1015467.1015507","volume-title":"SIGCOMM","author":"A.R. Bharambe","year":"2004","unstructured":"Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: supporting scalable multi-attribute range queries. In: SIGCOMM, pp. 353\u2013366. ACM, New York (2004)"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-71661-7_25","volume-title":"Databases, Information Systems, and Peer-to-Peer Computing","author":"S. Girdzijauskas","year":"2006","unstructured":"Girdzijauskas, S., Datta, A., Aberer, K.: Oscar: Small-world overlay for realistic key distributions. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2005 and DBISP2P 2006. LNCS, vol.\u00a04125, pp. 247\u2013258. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Self-Organizing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10865-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T18:23:37Z","timestamp":1685211817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10865-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108648","9783642108655"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10865-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}