{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:01:50Z","timestamp":1725465710392},"publisher-location":"Boston","reference-count":11,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"0387308156"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-31170-x_18","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T00:43:22Z","timestamp":1149641002000},"page":"247-254","source":"Crossref","is-referenced-by-count":2,"title":["Exploiting the Overhead in a DHT to Improve Lookup Latency"],"prefix":"10.1007","author":[{"given":"Gerald","family":"Kunzmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"Schollmeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Binzenh\u00f6fer, A., Staehle, D., and Henjes, R. (2004).\u201cOn the Stability of Chord-based P2P Systems,\u201d University of W\u00fcrzburg 347, Nov 2004.","DOI":"10.1109\/GLOCOM.2005.1577765"},{"key":"18_CR2","unstructured":"BitTorrent (2004). Incentives to Build Robustness in BitTorrent, bitconjurer.org\/BitTorrent\/bittorrentecon.pdf, 2004"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L., Hammar, M., Negro, A., and Scarano, V. (2004). \u201cF-Chord: Improved Uniform Routing on Chord,\u201d presented at Structural Information and Communication Complexity: 11th International Colloquium, SIROCCO 2004.","DOI":"10.1007\/978-3-540-27796-5_9"},{"key":"18_CR4","unstructured":"Gnutella (2002) Gnutella 0.6 RFC, http:\/\/rfc-gnutella.sourceforge.net\/draft.txt, 2002"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Gummadi, K. et al. (2003). \u201cThe Impact of DHT Routing Geometry on Resilience and Proximity,\u201d presented at ACM SIGCOMM 2003.","DOI":"10.1145\/863955.863998"},{"key":"18_CR6","unstructured":"Kazaa (2003) Kazaa homepage, http:\/\/www.kazaa.com\/us\/index.htm"},{"key":"18_CR7","unstructured":"Mesaros, V.A., Carton, B., and Roy P.V. (2003). \u201cS-Chord: Using Symmetry to Improve Lookup Efficiency in Chord,\u201d presented at 2003 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA\u201903)."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S., (2001). \u201cA Scalable Content-Addressable Network,\u201d presented at ACM SIGCOMM Conference.","DOI":"10.1145\/383059.383072"},{"key":"18_CR9","unstructured":"Schollmeier, R. and Dumanois, A. (2003).\u201cPeer-to-Peer Traffic Characteristics\u201d UNICE2003"},{"key":"18_CR10","unstructured":"Skype (2004) homepage, http:\/\/www.skype.com\/. 2004"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M. and Balakrishnan, H. (2001). \u201cChord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,\u201d presented at ACM SIGCOMM Conference.","DOI":"10.1145\/383059.383071"}],"container-title":["IFIP International Federation for Information Processing","EUNICE 2005: Networks and Applications Towards a Ubiquitously Connected World"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-31170-X_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:08:57Z","timestamp":1619500137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-31170-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387308156"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/0-387-31170-x_18","relation":{},"subject":[]}}