{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:17:09Z","timestamp":1725556629333},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131356"},{"type":"electronic","value":"9783642131363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13136-3_24","type":"book-chapter","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T18:20:16Z","timestamp":1274811616000},"page":"235-243","source":"Crossref","is-referenced-by-count":1,"title":["Quick Forwarding of Queries to Relevant Peers in a Hierarchical P2P File Search System"],"prefix":"10.1007","author":[{"given":"Tingting","family":"Qin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiying","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Fujita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Adar, E., Huberman, B.A.: Free Riding on Gnutella. First Monday\u00a05(10) (2000)","DOI":"10.5210\/fm.v5i10.792"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/606272.606299","volume":"46","author":"H. Balakrishnan","year":"2003","unstructured":"Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R.: Looking Up Data in P2P Systems. Communications of the ACM\u00a046(2), 43\u201348 (2003)","journal-title":"Communications of the ACM"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Qin, T.T., Cao, Q., Wei, Q.Y., Fujita, S.: A Hierarchical Architecture for Real-Time File Search in Peer-to-Peer Networks. In:Proc. PDAA, in conjunction with PDCAT09 (December 2009)","DOI":"10.1109\/PDCAT.2009.44"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45748-8_23","volume-title":"Peer-to-Peer Systems","author":"M. Harren","year":"2002","unstructured":"Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex Queries in DHT-based Peer-to-Peer Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 242. Springer, Heidelberg (2002)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Kalogeraki, V., Gunopulos, D., Zeinalipour-Yazti, D.: A Local Search Mechanism for Peer-to-Peer Networks. In: Proc. CIKM (2002)","DOI":"10.1145\/584792.584842"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proc. ACM SIGMETRICS (2002)","DOI":"10.1145\/511365.511369"},{"key":"24_CR7","unstructured":"Napster Homepage, http:\/\/www.napster.com\/"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/00107510500052444","volume":"46","author":"M. Newman","year":"2005","unstructured":"Newman, M.: Power laws, Pareto distributions and Zipf\u2019s law. Contemporary Physics\u00a046, 323\u2013351 (2005)","journal-title":"Contemporary Physics"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A.I.T. Rowstron","year":"2001","unstructured":"Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, p. 329. Springer, Heidelberg (2001)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Sotica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proc. ACM SIGCOMM (August 2001)","DOI":"10.1145\/383059.383071"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B.Y. Zhao","year":"2004","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications\u00a022(1), 41\u201353 (2004)","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13136-3_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:00Z","timestamp":1606168920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13136-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131356","9783642131363"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13136-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}