{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:13:08Z","timestamp":1649189588580},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,6,9]],"date-time":"2010-06-09T00:00:00Z","timestamp":1276041600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s11235-010-9326-y","type":"journal-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T19:31:47Z","timestamp":1276025507000},"page":"163-172","source":"Crossref","is-referenced-by-count":2,"title":["Symmetric routing in DHT overlays"],"prefix":"10.1007","volume":"48","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":"297","published-online":{"date-parts":[[2010,6,9]]},"reference":[{"key":"9326_CR1","doi-asserted-by":"crossref","unstructured":"Barabasi, B. (2003). Scale-free networks. Scientific American.","DOI":"10.1038\/scientificamerican0503-60"},{"key":"9326_CR2","doi-asserted-by":"crossref","unstructured":"Baumgart, I., & Mies, S. (2007). S\/kademlia: a practicable approach towards secure key-based routing. In Parallel and distributed systems, international conference (Vol.\u00a02).","DOI":"10.1109\/ICPADS.2007.4447808"},{"issue":"25","key":"9326_CR3","doi-asserted-by":"crossref","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","volume":"85","author":"O. Callaway","year":"2000","unstructured":"Callaway, O., & Newman, O. (2000). Network robustness and fragility: percolation on random graphs. Physical Review Letters, 85(25), 5468\u20135471.","journal-title":"Physical Review Letters"},{"key":"9326_CR4","volume-title":"Graph theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R. (2005). Graph theory (Vol. 173). Heidelberg: Springer."},{"key":"9326_CR5","doi-asserted-by":"crossref","unstructured":"Jiang, J., & Pan, R. (2005). Bichord: an improved approach for lookup routing in chord. In ADBIS (pp.\u00a0338\u2013348).","DOI":"10.1007\/11547686_25"},{"key":"9326_CR6","doi-asserted-by":"crossref","unstructured":"Ktari, S. (2009). A\u00a0construction scheme for scale free dht-based networks. Global telecommunications conference, Globecom.","DOI":"10.1109\/GLOCOM.2009.5426238"},{"key":"9326_CR7","volume-title":"Understanding KaZaA","author":"K. Liang","year":"2008","unstructured":"Liang, K., Kumar, J., & Ross, R. (2008). Understanding KaZaA (Tech. Report). New York: Polytechnic University."},{"key":"9326_CR8","unstructured":"Liu, X. K. (2005). S-chord: hybrid topology makes chord efficient. In Proceedings of international conference on networking."},{"key":"9326_CR9","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/514191.514206","volume-title":"ICS\u201902: proceedings of the 16th international conference on supercomputing","author":"Q. Lv","year":"2002","unstructured":"Lv, Q. (2002). Search and replication in unstructured peer-to-peer networks. In ICS\u201902: proceedings of the 16th international conference on supercomputing (pp. 84\u201395). New York: ACM Press."},{"key":"9326_CR10","unstructured":"Mesaros, V., & Carton, B. (2003). S-chord: using symmetry to improve lookup efficiency in chord. In PDPTA (pp.\u00a01752\u20131760)."},{"key":"9326_CR11","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Frans\u00a0Kaashoek, M., & Balakrishnan, H. (2001). Chord: a scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (pp. 149\u2013160).","DOI":"10.1145\/383059.383071"},{"key":"9326_CR12","first-page":"53","volume-title":"IPTPS \u201901: revised papers from the first international workshop on peer-to-peer systems","author":"P. Maymounkov","year":"2002","unstructured":"Maymounkov, P., & Mazieres, D. (2002). Kademlia: a peer-to-peer information system based on the XOR metric. In IPTPS \u201901: revised papers from the first international workshop on peer-to-peer systems (pp. 53\u201365). London: Springer."},{"key":"9326_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. A. Barabasi","year":"2002","unstructured":"Barabasi, R. A. (2002). Statistical mechanics of complex networks. Reviews of Modern Physics, 74, 47\u201397.","journal-title":"Reviews of Modern Physics"},{"key":"9326_CR14","volume-title":"Lecture notes in computer science","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A. (2001). Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Lecture notes in computer science (Vol.\u00a02218). Berlin: Springer."},{"key":"9326_CR15","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.72.026114","volume":"72","author":"R. Sarshar","year":"2005","unstructured":"Sarshar, R. (2005). Multiple power-law structures in heterogeneous complex networks (Tech. Rep.). Physical Review E, 72, 020101.","journal-title":"Physical Review E"},{"key":"9326_CR16","unstructured":"Wang, H. D. W. Z. D. (2004). Janus: build gnutella-like file sharing system over structured overlay. In GCC (pp.\u00a0511\u2013518)."},{"key":"9326_CR17","unstructured":"Zhao, K. (2001). Tapestry: an infrastructure for fault-tolerant wide-area location and routing (Tech. Rep.). UCB\/CSD-01-1141, UC Berkeley."},{"key":"9326_CR18","unstructured":"Zhou, F. (2005). Understanding chord performance and topology-aware overlay construction for chord. http:\/\/www.cs.berkley.edu\/~zl\/doc\/chord_perf.pdf ."},{"key":"9326_CR19","unstructured":"Zhu, W. (2000). A super-peer based lookup in structured peer-to-peer systems. In 16th international conference on parallel and distributed computing systems (PDCS\u201903)."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-010-9326-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-010-9326-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-010-9326-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:50:09Z","timestamp":1559386209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-010-9326-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,9]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9326"],"URL":"https:\/\/doi.org\/10.1007\/s11235-010-9326-y","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,9]]}}}