{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T17:36:52Z","timestamp":1725385012402},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5935033","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T10:59:10Z","timestamp":1310036350000},"page":"21-25","source":"Crossref","is-referenced-by-count":1,"title":["Exploiting Tag-based Path Diversity in the DLG-Kautz network"],"prefix":"10.1109","author":[{"given":"Yiming","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/510726.510740"},{"key":"ref11","first-page":"183","article-title":"Improving the reliability of internet paths with one-hop source routing","author":"gummadi","year":"2004","journal-title":"OSDI"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TNET.2005.850224"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/972426.944768"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/774763.774774"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/1015467.1015487"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/972426.944766"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/INFCOM.2001.916780"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/s11432-010-0034-8"},{"key":"ref19","first-page":"329","article-title":"Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems","author":"rowstron","year":"2001","journal-title":"Middleware"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/964723.383072"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/JSAC.2010.100104"},{"key":"ref6","first-page":"98","article-title":"Koorde: A simple degree-optimal distributed hash table","author":"kaashoek","year":"2003","journal-title":"IPTPS"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/ICDCS.2008.35"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TC.1984.1676455"},{"key":"ref7","first-page":"1677","article-title":"Fissione: a scalable constant degree and low congestion dht scheme based on kautz graphs","author":"li","year":"2005","journal-title":"INFOCOM"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/1015467.1015509"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/1159913.1159933"},{"key":"ref9","article-title":"Efficient range query processing over dhts based on the balanced kautz tree","author":"zhang","year":"2010","journal-title":"Concurrency and Computation Practice and Experience"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TDSC.2008.60"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/ICDE.2005.115"},{"key":"ref21","first-page":"127","article-title":"Handling churn in a DHT","author":"rhea","year":"2004","journal-title":"USENIX Annual Technical Conference General Track"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","start":{"date-parts":[[2011,4,10]]},"location":"Shanghai, China","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05935033.pdf?arnumber=5935033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:19:45Z","timestamp":1490066385000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5935033\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5935033","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}