{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:56:18Z","timestamp":1729673778677,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1109\/iscc.2009.5202386","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:08:22Z","timestamp":1251112102000},"page":"110-115","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting routing unfairness in DHT overlays"],"prefix":"10.1109","author":[{"given":"Salma","family":"Ktari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Hecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Houda","family":"Labiod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/11547686_25","article-title":"bichord: an improved approach for lookup routing in chord","volume":"numb 3631","author":"jiang","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30208-7_70"},{"article-title":"understanding chord performance and topologyaware overlay construction for chord","year":"2003","author":"li","key":"11"},{"key":"12","article-title":"s-chord: using symmetry to improve lookup efficiency in chord","author":"mesaros","year":"2003","journal-title":"Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0503-60"},{"key":"2","article-title":"a policy for electing super nodes in unstructured p2p networks","author":"georgios","year":"0","journal-title":"AP2PC 2004 2005"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"10","article-title":"s-chord: hybrid topology makes chord efficient","author":"liu","year":"2005","journal-title":"Proceedings of International Conference on Networking"},{"article-title":"scale-free and stable structures incomplex ad hoc networks","year":"0","author":"sarshar","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.026114"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.5468"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.026118"},{"key":"9","article-title":"chord: a scalable peer-to-peer lookup service for internet applications","author":"stoica","year":"2001","journal-title":"Proc ACM SIGCOMM 2001 Technical Conf"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863998"}],"event":{"name":"2009 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2009,7,5]]},"location":"Sousse, Tunisia","end":{"date-parts":[[2009,7,8]]}},"container-title":["2009 IEEE Symposium on Computers and Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179146\/5202209\/05202386.pdf?arnumber=5202386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T19:05:23Z","timestamp":1497812723000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5202386\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/iscc.2009.5202386","relation":{},"subject":[],"published":{"date-parts":[[2009,7]]}}}