{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:31Z","timestamp":1725487111788},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729853"},{"type":"electronic","value":"9783540729860"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72986-0_2","type":"book-chapter","created":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T04:54:10Z","timestamp":1183697650000},"page":"13-24","source":"Crossref","is-referenced-by-count":1,"title":["RAQNet: A Topology-Aware Overlay Network"],"prefix":"10.1007","author":[{"given":"Seyed Iman","family":"Mirrezaei","sequence":"first","affiliation":[]},{"given":"Javad","family":"Shahparian","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","first-page":"264","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"H. Nazerzadeh","year":"2005","unstructured":"Nazerzadeh, H., Ghodsi, M.: RAQ: A range queriable distributed data structure (extended version). In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 264\u2013272. Springer, Heidelberg (2005)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11602613_31","volume-title":"Algorithms and Computation","author":"S. Alaei","year":"2005","unstructured":"Alaei, S., Toossi, M., Ghodsi, M.: SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 298\u2013307. Springer, Heidelberg (2005)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1007\/11590354_109","volume-title":"Grid and Cooperative Computing - GCC 2005","author":"H. Rostami","year":"2005","unstructured":"Rostami, H., Habibi, J.: A Mathematical Foundation for Topology Awareness of P2P Overlay Networks. In: Zhuge, H., Fox, G.C. (eds.) GCC 2005. LNCS, vol.\u00a03795, pp. 906\u2013918. Springer, Heidelberg (2005)"},{"key":"2_CR4","unstructured":"Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-resilient wide-area location and routing, Tech. Rep. UCB\/\/CSD-01-1141, U.C. Berkeley (April 2001)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, June 1997, Newport, Rhode Island, USA, pp. 311\u2013320 (1997)","DOI":"10.1145\/258492.258523"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable,distributed object location and routing for large-scale peer-to-peer systems. In: Proc. IFIP\/ACM Middleware 2001, Heidelberg, Germany (November 2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Costa, M., Castro, M., Rowstron, A., Key, P.: PIC: Practical Internet Coordinates for Distance Estimation. In: 24th IEEE International Conference on Distributed Computing Systems (ICDCS\u2019 04), Tokyo, Japan (March 2004)","DOI":"10.1109\/ICDCS.2004.1281582"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: STOC\u201902 (July 2002)","DOI":"10.1145\/509907.510013"},{"key":"2_CR9","unstructured":"Zegura, E., Calvert, K., Bhattacharjee, S.: How to model an internetwork. In: INFOCOM96 (1996)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proc. of ACM SIGCOMM (August 2001)","DOI":"10.1145\/383059.383072"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM \u201901 Conference, San Diego, California (August 2001)","DOI":"10.1145\/383059.383071"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Freedman, M., Mazieres, D.: Sloppy hashing and self-organizing clusters. In: Proc. 2nd International Workshop on Peer-to-Peer Systems (IPTPS03) (2003)","DOI":"10.1007\/978-3-540-45172-3_4"}],"container-title":["Lecture Notes in Computer Science","Inter-Domain Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72986-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:01:17Z","timestamp":1558483277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72986-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729853","9783540729860"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72986-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}