{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:25:56Z","timestamp":1725575156988},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240136"},{"type":"electronic","value":"9783540305019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30501-9_152","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T02:42:17Z","timestamp":1294972937000},"page":"778-781","source":"Crossref","is-referenced-by-count":2,"title":["An Adaptive Proximity Route Selection Scheme in DHT-Based Peer to Peer Systems"],"prefix":"10.1007","author":[{"given":"Jiyoung","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungyong","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jihoon","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"152_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., et al.: Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE\/ACM Transactions on Networking\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"152_CR2","doi-asserted-by":"crossref","unstructured":"Gummadi, K., et al.: The impact of DHT Routing Geometry on Resilience and Proximity. In: Proc. of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 381\u2013394 (2003)","DOI":"10.1145\/863955.863998"},{"key":"152_CR3","doi-asserted-by":"crossref","unstructured":"Dabek, F., et al.: Wide-area cooperative storage with CFS. In: Proc. of the 18th ACM Symposium on Operating Systems Principles, pp. 202\u2013215 (2001)","DOI":"10.1145\/502034.502054"},{"key":"152_CR4","unstructured":"Boyan, J., Littman, M.: Packet routing in dynamically changing networks: A reinforcement learning approach. In: Proc. of Neural Information Processing Systems, pp. 982\u2013988 (1994)"},{"key":"152_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, H., Goel, A., Gobindan, R.: Incrementally Improving Lookup Latency in Distributed Hash Table. In: Proc. of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 114\u2013125 (2003)","DOI":"10.1145\/781027.781042"},{"key":"152_CR6","unstructured":"Chord Simulator, \n                      \n                        http:\/\/pdos.lcs.mit.edu\/cgi-bin\/cvsweb.cgi\/sfsnet\/simulator"},{"key":"152_CR7","unstructured":"GT-ITM, \n                      \n                        http:\/\/www.isi.edu\/nsnam\/ns\/ns-topogen.html"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing: Applications and Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30501-9_152.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:25:06Z","timestamp":1620012306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30501-9_152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240136","9783540305019"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30501-9_152","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}