{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:05:14Z","timestamp":1743156314803,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_8","type":"book-chapter","created":{"date-parts":[[2009,11,30]],"date-time":"2009-11-30T00:44:01Z","timestamp":1259541841000},"page":"89-100","source":"Crossref","is-referenced-by-count":1,"title":["Non-Sticky Fingers: Policy-Driven Self-optimization for DHTs"],"prefix":"10.1007","author":[{"given":"Matti","family":"Siekkinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vera","family":"Goebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","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: Proceedings of SIGCOMM 2001, pp. 149\u2013160 (2001)","DOI":"10.1145\/383059.383071"},{"key":"8_CR2","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.I.T. Rowstron","year":"2001","unstructured":"Rowstron, A.I.T., 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":"8_CR3","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proceedings of SIGCOMM 2001, pp. 161\u2013172 (2001)","DOI":"10.1145\/383059.383072"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: supporting scalable multi-attribute range queries. In: Proceedings of SIGCOMM 2004, pp. 353\u2013366 (2004)","DOI":"10.1145\/1015467.1015507"},{"key":"8_CR5","first-page":"113","volume-title":"P2P 2007: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing","author":"F. Klemm","year":"2007","unstructured":"Klemm, F., Girdzijauskas, S., Boudec, J.Y.L., Aberer, K.: On routing in distributed hash tables. In: P2P 2007: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing, pp. 113\u2013122. IEEE Computer Society, Los Alamitos (2007)"},{"key":"8_CR6","first-page":"15","volume-title":"Proceedings of SIGCOMM 2004","author":"F. Dabek","year":"2004","unstructured":"Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: a decentralized network coordinate system. In: Proceedings of SIGCOMM 2004, pp. 15\u201326. ACM, New York (2004)"},{"key":"8_CR7","unstructured":"Ramasubramanian, V., Sirer, E.G.: Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays. In: NSDI 2004: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation, p. 8 (2004)"},{"key":"8_CR8","unstructured":"Gupta, A., Liskov, B., Rodrigues, R.: One hop lookups for peer-to-peer overlays. In: Ninth Workshop on Hot Topics in Operating Systems (HotOS-IX), Lihue, Hawaii, pp. 7\u201312 (2003)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_15","volume-title":"Peer-to-Peer Systems II","author":"I. Gupta","year":"2003","unstructured":"Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R.: Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"key":"8_CR10","first-page":"270","volume":"1","author":"B. Leong","year":"2004","unstructured":"Leong, B., Liskov, B., Demaine, E.: EpiChord: parallelizing the chord lookup algorithm with reactive routing state management. Proceedings of ICON\u00a01, 270\u2013276 (2004)","journal-title":"Proceedings of ICON"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-30471-5_4","volume-title":"Web Content Caching and Distribution","author":"K. Tati","year":"2004","unstructured":"Tati, K., Voelker, G.M.: ShortCuts: Using Soft State to Improve DHT Routing. In: Chi, C.-H., van Steen, M., Wills, C. (eds.) WCW 2004. LNCS, vol.\u00a03293, pp. 44\u201362. Springer, Heidelberg (2004)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. In: Proceedings of INFOCOM 2003, vol.\u00a03, pp. 2166\u20132176 (2003)","DOI":"10.1109\/INFCOM.2003.1209237"},{"key":"8_CR13","unstructured":"Manku, G., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: Proceedings of the USITS 2003 (2003)"},{"key":"8_CR14","first-page":"163","volume-title":"STOC 2000: Proceedings of the 32nd annual ACM symposium on Theory of computing","author":"J. Kleinberg","year":"2000","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: STOC 2000: Proceedings of the 32nd annual ACM symposium on Theory of computing, pp. 163\u2013170. ACM, New York (2000)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Siekkinen, M., Goebel, V.: Non-sticky fingers: Policy-driven self-optimization for order-preserving dhts. Technical report, University of Oslo \/ Helsinki University of Technology (2009), http:\/\/www.tkk.fi\/~siekkine\/pub\/siekkinen09nsfingers.pdf","DOI":"10.1007\/978-3-642-10865-5_8"},{"key":"8_CR16","unstructured":"Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: ATEC 2004: Proceedings of the annual conference on USENIX Annual Technical Conference, Berkeley, CA, USA, USENIX Association, p. 10 (2004)"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T23:33:36Z","timestamp":1558654416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10865-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108648","9783642108655"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10865-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}