{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T17:08:47Z","timestamp":1742404127398,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1109\/ipdps.2006.1639278","type":"proceedings-article","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T15:59:56Z","timestamp":1152547196000},"page":"10 pp.","source":"Crossref","is-referenced-by-count":49,"title":["D1HT: a distributed one hop hash table"],"prefix":"10.1109","author":[{"given":"L.R.","family":"Monnerat","sequence":"first","affiliation":[]},{"given":"C.L.","family":"Amorim","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"When multi-hop peer-to-peer routing matters","author":"rodrigues","year":"2004","journal-title":"P roc of IPTPS"},{"key":"17","article-title":"Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays","author":"ramasubramanian","year":"2004","journal-title":"Proc of NSDI"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383072"},{"key":"15","article-title":"Structured Superpeers: Leveraging heterogeneity to provide constant-time lookup","author":"mizrak","year":"2003","journal-title":"Proc IEEE Workshop on Internet Applications"},{"key":"16","article-title":"Secure Hash Standard (SHS)","volume":"180 1","year":"1995","journal-title":"FIPS Publications"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/236711.236713"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571857"},{"key":"11","article-title":"Bandwidth-efficient management of DHT routing tables","author":"li","year":"2005","journal-title":"Proc of NSDI"},{"key":"12","article-title":"Analysis of the evolution of peer-to-peer systems","author":"liben-nowell","year":"2002","journal-title":"Proc of 19th PODC"},{"key":"21","article-title":"Pastry: Scalable, decentraized object location and routing for large-scale peer-to-peer systems","author":"rowstron","year":"2001","journal-title":"Proc of Middleware"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/1133373.1133396"},{"key":"22","article-title":"A measurement study of peer-to-peer file sharing systems","author":"saroiu","year":"2002","journal-title":"Proc SPIE MMCN"},{"key":"23","article-title":"A framework for self-optimizing Grids using P2P components","author":"schintke","year":"2003","journal-title":"Proc of the 14th IEEE DEXA"},{"key":"24","doi-asserted-by":"crossref","DOI":"10.1109\/TNET.2002.808407","article-title":"Chord: A scalable peer-to-peer lookup protocol for Internet applications","author":"stoica","year":"2003","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"25","doi-asserted-by":"crossref","DOI":"10.1109\/JSAC.2003.818784","article-title":"Tapestry: A global-scale overlay for rapid service deployment","author":"zhao","year":"2004","journal-title":"Journal on Selected Areas in Communications"},{"key":"3","article-title":"Availability and locality measurements of peer-to-peer file systems","author":"chu","year":"2002","journal-title":"Proc of SPIE"},{"article-title":"Exploring the use of BitTorrent as the basis for a large trace repository","year":"0","author":"bellissimo","key":"2"},{"key":"10","article-title":"A performance vs. cost framework for evaluating DHT design tradeoffs","author":"li","year":"2005","journal-title":"Proc of INFOCOM"},{"year":"2005","author":"oct","key":"1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50036-7"},{"year":"0","key":"6"},{"key":"5","article-title":"Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead","author":"gupta","year":"2003","journal-title":"Proc of IPTPS"},{"key":"4","article-title":"Efficient routing for peer-to-peer overlays","author":"gupta","year":"2004","journal-title":"Proc of NSDI"},{"key":"9","article-title":"Comparing the performance of distributed hash tables under churn","author":"li","year":"2004","journal-title":"Proc of IPTPS"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"}],"event":{"name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","start":{"date-parts":[[2006,4,25]]},"location":"Rhodes Island, Greece","end":{"date-parts":[[2006,4,29]]}},"container-title":["Proceedings 20th IEEE International Parallel & Distributed Processing Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10917\/34366\/01639278.pdf?arnumber=1639278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T03:22:56Z","timestamp":1497669776000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1639278\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2006.1639278","relation":{},"subject":[],"published":{"date-parts":[[2006]]}}}