{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:10:58Z","timestamp":1729631458626,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1109\/ngi.2009.5175761","type":"proceedings-article","created":{"date-parts":[[2009,8,5]],"date-time":"2009-08-05T17:55:24Z","timestamp":1249494924000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Exploiting Power-Law Node Degree Distribution in Chord 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":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30208-7_70"},{"journal-title":"Understanding Chord Performance and Topologyaware Overlay Construction for Chord","year":"2003","author":"li","key":"17"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0503-60"},{"key":"18","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":"23","first-page":"32","article-title":"scale-free overlay topologies with hard cutoffs for unstructured peer-to-peer networks","author":"yuksel","year":"2007","journal-title":"27th International Conference on Distributed Computing Systems (ICDCS '07)"},{"key":"15","article-title":"debunking some myths about structured and unstructured overlays","author":"castro","year":"0","journal-title":"Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation"},{"journal-title":"OverSim","year":"0","key":"16"},{"key":"13","first-page":"2","article-title":"scalable percolation search in power law networks","author":"sarshar","year":"2004","journal-title":"Fourth International Conference on Peer-to-Peer Computing pp"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.026114"},{"key":"12","doi-asserted-by":"crossref","first-page":"26101","DOI":"10.1103\/PhysRevE.69.026101","article-title":"scale-free and stable structures in complex ad hoc networks","volume":"69","author":"sarshar","year":"2004","journal-title":"Phys Rev E"},{"journal-title":"Graph Theory","year":"2005","author":"reinhard","key":"21"},{"key":"3","article-title":"tapestry: an infrastructure for fault-tolerant wide-area location and routing","author":"zhao","year":"2001","journal-title":"Technical Report CSD-01-1141"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/514191.514206"},{"key":"2","article-title":"s-chord: hybrid topology makes chord efficient","author":"liu","year":"2005","journal-title":"Proceedings of International Conference on Networking"},{"key":"10","doi-asserted-by":"crossref","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","article-title":"network robustness and fragility: percolation on random graphs","volume":"85","author":"strogatz","year":"0","journal-title":"Phys Rev Lett"},{"journal-title":"RFC-Gnutella","year":"0","author":"klingberg","key":"1"},{"key":"7","article-title":"a policy for electing super nodes in unstructured p2p networks","author":"georgios","year":"2005","journal-title":"AP2PC 2004"},{"key":"6","article-title":"a super-peer based lookup in structured peer-to-peer systems","author":"zhu","year":"2003","journal-title":"Proceedings of the 16th International Conference on Parallel and Distributed Computing Systems (PDCS)"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.026118"},{"key":"4","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":"9","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":"8","article-title":"jun li, scalable supernode selection in peer-to-peer overlay networks","author":"liu","year":"0","journal-title":"Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems"}],"event":{"name":"2009 Next Generation Internet Networks (NGI)","start":{"date-parts":[[2009,7,1]]},"location":"Aviero, Portugal","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 Next Generation Internet Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5175743\/5175744\/05175761.pdf?arnumber=5175761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T22:34:24Z","timestamp":1497825264000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5175761\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/ngi.2009.5175761","relation":{},"subject":[],"published":{"date-parts":[[2009,7]]}}}