{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T16:48:22Z","timestamp":1675097302022},"reference-count":35,"publisher":"Elsevier BV","issue":"18","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1016\/j.comnet.2008.07.014","type":"journal-article","created":{"date-parts":[[2008,8,23]],"date-time":"2008-08-23T13:18:35Z","timestamp":1219497515000},"page":"3307-3317","source":"Crossref","is-referenced-by-count":1,"title":["Shortest-path routing in randomized DHT-based Peer-to-Peer systems"],"prefix":"10.1016","volume":"52","author":[{"given":"Chih-Chiang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Harfoush","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.comnet.2008.07.014_bib1","article-title":"On the impossibility of directed Moore graphs","volume":"B29","author":"Bridges","year":"1980","journal-title":"Journal of Combinatorial Theory"},{"key":"10.1016\/j.comnet.2008.07.014_bib2","doi-asserted-by":"crossref","unstructured":"M. Castro, P. Druschel, Y.C. Hu, A.I.T. Rowstron, Topology-aware routing in structured peer-to-peer overlay networks, in: Proceedings of the International Workshop on Future Directions in Distribution, Computing, 2003.","DOI":"10.1007\/3-540-37795-6_19"},{"key":"10.1016\/j.comnet.2008.07.014_bib3","article-title":"Diameters of communication networks","author":"Chung","year":"1984","journal-title":"Mathematics of Information Processing"},{"key":"10.1016\/j.comnet.2008.07.014_bib4","doi-asserted-by":"crossref","unstructured":"M. Costa, M. Castro, A. Rowstron, P. Key, Pic: practical internet coordinates for distance estimation, in: Proceedings of the International Conference on Distributed Systems, 2004.","DOI":"10.1109\/ICDCS.2004.1281582"},{"key":"10.1016\/j.comnet.2008.07.014_bib5","doi-asserted-by":"crossref","unstructured":"F. Dabek, R. Cox, F. Kaashoek, R. Morris, Vivaldi: a decentralized network coordinate system, in: Proceedings of the ACM SIGCOMM\u201904 Conference, 2004.","DOI":"10.1145\/1015467.1015471"},{"key":"10.1016\/j.comnet.2008.07.014_bib6","unstructured":"A. Das, I. Gupta, A. Motivala, SWIM: scalable weakly-consistent infection-style process group membership, in: Proceedings of the International Conference on Dependable Systems and Networks, Washington, DC, 2002."},{"key":"10.1016\/j.comnet.2008.07.014_bib7","doi-asserted-by":"crossref","unstructured":"P. Druschel, A. Rowstron, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, in: Proceedings of the 18th IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware 2001), November 2001.","DOI":"10.1007\/3-540-45518-3_18"},{"issue":"4","key":"10.1016\/j.comnet.2008.07.014_bib8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/945506.945507","article-title":"Lightweight probabilistic broadcast","volume":"21","author":"Eugster","year":"2003","journal-title":"ACM Transactions on Computer System"},{"key":"10.1016\/j.comnet.2008.07.014_bib9","doi-asserted-by":"crossref","unstructured":"A.J. Ganesh, A.-M. Kerrmarrec, L. Massoulie, SCAMP: peer-to-peer lightweight membership service for large-scale group communication, in: Proceedings of the third International Workshop on Networked Group Communication, London, UK, 2001.","DOI":"10.1007\/3-540-45546-9_4"},{"key":"10.1016\/j.comnet.2008.07.014_bib10","doi-asserted-by":"crossref","unstructured":"K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, I. Stoica, The impact of DHT routing geometry on resilience and proximity, in: Proceedings of ACM SIGCOMM \u201903, August 2003.","DOI":"10.1145\/863997.863998"},{"key":"10.1016\/j.comnet.2008.07.014_bib11","unstructured":"A. Gupta, B. Liskov, R. Rodrigues, Efficient routing for peer-to-peer overlays. San Francisco, CA, USA, 2004 (NSDI)."},{"key":"10.1016\/j.comnet.2008.07.014_bib12","doi-asserted-by":"crossref","unstructured":"I. Gupta, K. Birman, P. Linga, A. Demers, R.V. Renesse, Kelips: building an efficient and stable P2P DHT through increased memory and background overhead, Berkeley, CA, USA, 2003 (IPTPS).","DOI":"10.1007\/978-3-540-45172-3_15"},{"key":"10.1016\/j.comnet.2008.07.014_bib13","doi-asserted-by":"crossref","unstructured":"Z.J. Haas, M.R. Pearlman, The performance of query control schemes for the zone routing protocol, in: Proceedings of the ACM SIGCOMM, Vancouver, Canada, 1998.","DOI":"10.1145\/285237.285279"},{"key":"10.1016\/j.comnet.2008.07.014_bib14","unstructured":"N.J.A. Harvey, M. Jones, S. Saroiu, M. Theimer, A. Wolman, Skipnet: a scalable overlay network with practical locality properties, in: Proceedings of 4th USENIX Symposium on Internet Technologies and Systems, 2003."},{"key":"10.1016\/j.comnet.2008.07.014_bib15","doi-asserted-by":"crossref","unstructured":"J. Kleinberg, The small-world phenomenon: an algorithmic perspective, in: ACM Symposium on Theory of Computing, May 2000.","DOI":"10.1145\/335305.335325"},{"key":"10.1016\/j.comnet.2008.07.014_bib16","unstructured":"J. Li, J. Stribling, R. Morris, M.F. Kaashoek, Bandwidth-efficient management of DHT routing tables, in: Proceedings of the USENIX NSDI, Anaheim, CA, 2005."},{"key":"10.1016\/j.comnet.2008.07.014_bib17","unstructured":"Q. Lian, W. Chen, Z. Zhang, S. Wu, B.Y. Zhao, Z-ring: fast prefix routing via a low maintenance membership protocol, Boston, Massachusetts, USA, 2005 (IEEE ICNP)."},{"key":"10.1016\/j.comnet.2008.07.014_bib18","doi-asserted-by":"crossref","unstructured":"D. Loguinov, A. Kumar, V. Rai, S. Ganesh, Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience, in: Proceedings of ACM SIGCOMM \u201903, August 2003.","DOI":"10.1145\/863955.863999"},{"key":"10.1016\/j.comnet.2008.07.014_bib19","doi-asserted-by":"crossref","unstructured":"D. Malkhi, , M. Naor, D. Ratajczak, Viceroy: a scalable dynamic emulation of the butterfly, in: ACM Symposium on Principles of Distributed Computing PODC \u201902, July 2002.","DOI":"10.1145\/571855.571857"},{"key":"10.1016\/j.comnet.2008.07.014_bib20","unstructured":"G.S. Manku, M. Bawa, P. Raghavan, Symphony: distributed hashing in a small world, in: Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003."},{"key":"10.1016\/j.comnet.2008.07.014_bib21","doi-asserted-by":"crossref","unstructured":"G.S. Manku, M. Naor, U. Wieder, Know thy neighbor\u2019s neighbor: the power of lookahead in randomized P2P networks, in: Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003.","DOI":"10.1145\/1007352.1007368"},{"key":"10.1016\/j.comnet.2008.07.014_bib22","unstructured":"E. Ng, H. Zhang, Predicting internet network distance with coordinates-based approaches, in: INFOCOM \u201902, New York, NY, June 2002."},{"key":"10.1016\/j.comnet.2008.07.014_bib23","doi-asserted-by":"crossref","unstructured":"M. Pias, J. Crowcroft, S. Wilbur, T. Harris, S. Bhatti, Lighthouses for scalable distributed location, in: Proceedings of the Second International Conference on Peer-to-Peer Systems IPTPS \u201903, Berkeley, CA, February 2003.","DOI":"10.1007\/978-3-540-45172-3_26"},{"key":"10.1016\/j.comnet.2008.07.014_bib24","doi-asserted-by":"crossref","unstructured":"S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content-addressable network, in: SIGCOMM \u201901, San Diego, CA, August 2001.","DOI":"10.1145\/383059.383072"},{"key":"10.1016\/j.comnet.2008.07.014_bib25","unstructured":"S. Ratnasamy, M. Handley, R. Karp, S. Shenker, Topologically-aware overlay construction and server selection, in: Proceedings of the IEEE INFOCOM\u201902, vol. 6, 2002."},{"key":"10.1016\/j.comnet.2008.07.014_bib26","unstructured":"S. Rhea, D. Geels, T. Roscoe, J. Kubiatowicz, Handling churn in a DHT, in: ATEC \u201904: Proceedings of the Annual Conference on USENIX Annual Technical Conference,Berkeley, CA, USA, 2004 (USENIX Association)."},{"key":"10.1016\/j.comnet.2008.07.014_bib27","doi-asserted-by":"crossref","unstructured":"I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. balarkrishnan, Chord: a peer-to-peer lookup service for internet applications, in: SIGCOMM \u201901, San Diego, CA, August 2001.","DOI":"10.1145\/383059.383071"},{"key":"10.1016\/j.comnet.2008.07.014_bib28","doi-asserted-by":"crossref","DOI":"10.1109\/TNET.2002.808407","article-title":"Chord: a scalable peer-to-peer lookup service for internet applications","volume":"11","author":"Stoica","year":"2003","journal-title":"IEEE Transactions on Networking"},{"key":"10.1016\/j.comnet.2008.07.014_bib29","doi-asserted-by":"crossref","unstructured":"C. Tang, M.J. Buco, R.N. Chang, S. Dwarkadas, Low traffic overlay networks with large routing tables, Banff, Alberta, Canada, 2005 (ACM SIGMETRICS).","DOI":"10.1145\/1064212.1064216"},{"issue":"2","key":"10.1016\/j.comnet.2008.07.014_bib30","doi-asserted-by":"crossref","DOI":"10.1007\/s10922-005-4441-x","article-title":"CYCLON: inexpensive membership management for unstructured P2P overlays","volume":"13","author":"Voulgaris","year":"2005","journal-title":"Journal of Network and Systems Management"},{"key":"10.1016\/j.comnet.2008.07.014_bib31","unstructured":"C.-C. Wang, V. Gupta, K. Harfoush, Shortest path routing in DHT-based P2P systems with irregular topologies, in: Proceedings of the 2005 International Conference on Telecommunication Systems, 2005."},{"key":"10.1016\/j.comnet.2008.07.014_bib32","unstructured":"C.-C. Wang, K. Harfoush, Raster: a light-weight routing protocol to discover shortest overlay routes in randomized DHT systems, in: Proceedings of the 12th International Conference on Parallel and Distributed Systems, 2006."},{"key":"10.1016\/j.comnet.2008.07.014_bib33","doi-asserted-by":"crossref","unstructured":"H. Zhang, A. Goel, R. Govindan, Incrementally improving lookup latency in distributed hash table systems, in: ACM SIGMETRICS 2003, 2003.","DOI":"10.1145\/781040.781042"},{"key":"10.1016\/j.comnet.2008.07.014_bib34","unstructured":"B. Zhao, J. Kubiatowicz, A. Joseph, Tapestry: an infrastructure for fault-tolerant wide-area location and routing, Technical Report UCB\/CSD-01-1141, University of California at Berkeley, 2001."},{"key":"10.1016\/j.comnet.2008.07.014_bib35","unstructured":"S.Q. Zhuang, D. Geels, I. Stoica, R.H. Katz, On failure detection algorithms in overlay networks, in: Proceedings of IEEE INFOCOM, Miami, FL, USA, 2005."}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1389128608002272?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1389128608002272?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T15:13:27Z","timestamp":1557760407000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128608002272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":35,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["S1389128608002272"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.comnet.2008.07.014","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}