{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:29:42Z","timestamp":1742383782416},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290681"},{"type":"electronic","value":"9783540319061"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558989_15","type":"book-chapter","created":{"date-parts":[[2005,11,2]],"date-time":"2005-11-02T03:51:51Z","timestamp":1130903511000},"page":"163-172","source":"Crossref","is-referenced-by-count":19,"title":["Quickly Routing Searches Without Having to Move Content"],"prefix":"10.1007","author":[{"given":"Brian F.","family":"Cooper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"46135","DOI":"10.1103\/PhysRevE.64.046135","volume":"64","author":"L. Adamic","year":"2001","unstructured":"Adamic, L., Lukose, R., Puniyani, A., Huberman, B.: Search in power-law networks. Phys. Rev. E\u00a064, 46135\u201346143 (2001)","journal-title":"Phys. Rev. E"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bawa, M., Bayardo Jr., R.J., Rajagopalan, S., Shekita, E.: Make it fresh, make it quick \u2014 searching a network of personal webservers. In: Proc. WWW (2003)","DOI":"10.1145\/775152.775234"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making Gnutella-like P2P systems scalable. In: Proc. SIGCOMM (2003)","DOI":"10.1145\/863955.864000"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, E., Shenker, S.: Replication strategies in unstructured peer-to-peer networks. In: Proc. SIGCOMM (2002)","DOI":"10.1145\/633025.633043"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-30229-2_2","volume-title":"Middleware 2004","author":"B.F. Cooper","year":"2004","unstructured":"Cooper, B.F.: A content model for evaluating peer-to-peer searching techniques. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol.\u00a03231, pp. 18\u201337. Springer, Heidelberg (2004)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Cooper, B.F.: An optimal overlay topology for routing peer-to-peer searches. Technical report (April 2005), available at http:\/\/www.cc.gatech.edu\/~cooperb\/pubs\/squareroot.pdf","DOI":"10.1007\/11587552_5"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_20","volume-title":"Peer-to-Peer Systems II","author":"B.F. Cooper","year":"2003","unstructured":"Cooper, B.F., Garcia-Molina, H.: Studying search networks with SIL. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc. ICDCS (2002)","DOI":"10.1109\/ICDCS.2002.1022239"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Ge, Z., Figueiredo, D.R., Jaiswal, S., Kurose, J., Towsley, D.: Modeling peer-peer file sharing systems. In: Proc. INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1209239"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, modeling and analysis of a peer-to-peer file-sharing workload. In: Proc. SOSP (2003)","DOI":"10.1145\/945445.945475"},{"key":"15_CR11","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. Int\u2019l Conf. on Supercomputing (ICS) (2002)","DOI":"10.1145\/514191.514206"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-45748-8_9","volume-title":"Peer-to-Peer Systems","author":"Q. Lv","year":"2002","unstructured":"Lv, Q., Ratnasamy, S., Shenker, S.: Can heterogeneity make Gnutella scalable. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 94. Springer, Heidelberg (2002)"},{"key":"15_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Nejdl, W., Wolpers, M., Siberski, W., Schmitz, C., Schlosser, M., Brunkhorst, I., Loser, A.: Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks. In: Proc. WWW (2003)","DOI":"10.1145\/775152.775229"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Palmer, C., Steffan, J.: Generating network topologies that obey power laws. In: Proc. GLOBECOM (2000)","DOI":"10.1109\/GLOCOM.2000.892042"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter P2P networks. In: Proc. IEEE FOCS (2001)","DOI":"10.1109\/SFCS.2001.959925"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. SIGCOMM (August 2001)","DOI":"10.1145\/383059.383072"},{"key":"15_CR18","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. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized 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":"15_CR19","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: Proc. SIGCOMM (August 2001)","DOI":"10.1145\/383059.383071"},{"key":"15_CR20","unstructured":"Yang, B., Garcia-Molina, H.: Efficient search in peer-to-peer networks. In: Proc. ICDCS (2002)"},{"key":"15_CR21","unstructured":"Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proc. ICDE (2003)"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558989_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T12:09:21Z","timestamp":1586520561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558989_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290681","9783540319061"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11558989_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}