{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:04:32Z","timestamp":1729659872214,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/ngi.2011.5985863","type":"proceedings-article","created":{"date-parts":[[2011,8,16]],"date-time":"2011-08-16T15:29:05Z","timestamp":1313508545000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["ChordNet: A Chord-based self-organizing super-peer network"],"prefix":"10.1109","author":[{"given":"Dennis","family":"Schwerdel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Priebe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Muller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863998"},{"key":"2","first-page":"176","article-title":"Optimal routing in Chord","author":"ganesan","year":"2004","journal-title":"SODA"},{"journal-title":"ChordNet Protocol Specification and Analysis","year":"2009","author":"schwerdel","key":"10"},{"key":"1","first-page":"410","article-title":"Bchord: Bidirectional routing DHT based on Chord","author":"chen","year":"2008","journal-title":"CSCWD"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92157-8_3"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007368"},{"key":"5","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/11547686_25","article-title":"Bichord: An improved approach for lookup routing in Chord","volume":"3631","author":"jiang","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2008.42"},{"key":"9","first-page":"1","article-title":"A fast joining operation for highly dynamic Chord system","author":"ren","year":"2007","journal-title":"ICPADS"},{"key":"8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/978-3-540-30183-7_26","article-title":"Know thy neighbor's neighbor: Better routing for skip-graphs and small worlds","volume":"3279","author":"naor","year":"2004","journal-title":"Lecture Notes in Computer Science"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080103"}],"event":{"name":"2011 7th EURO-NGI Conference on Next Generation Internet Networks (NGI)","start":{"date-parts":[[2011,6,27]]},"location":"Kaiserslautern, Germany","end":{"date-parts":[[2011,6,29]]}},"container-title":["2011 7th EURO-NGI Conference on Next Generation Internet Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5977166\/5985861\/05985863.pdf?arnumber=5985863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:48:34Z","timestamp":1497919714000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5985863\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ngi.2011.5985863","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}