{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:08:20Z","timestamp":1743127700011,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540303237"},{"type":"electronic","value":"9783540322696"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11587552_5","type":"book-chapter","created":{"date-parts":[[2005,11,18]],"date-time":"2005-11-18T08:52:59Z","timestamp":1132303979000},"page":"82-101","source":"Crossref","is-referenced-by-count":19,"title":["An Optimal Overlay Topology for Routing Peer-to-Peer Searches"],"prefix":"10.1007","author":[{"given":"Brian F.","family":"Cooper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","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 (2001)","DOI":"10.1145\/383059.383071"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. SIGCOMM (2001)","DOI":"10.1145\/383059.383072"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proc. IFIP\/ACM International Conference on Distributed Systems Platforms (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"5_CR4","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":"5_CR5","doi-asserted-by":"crossref","unstructured":"Loo, B., Hellerstein, J., Huebsch, R., Shenker, S., Stoica, I.: Enhancing P2P file-sharing with an Internet-scale query processor. In: Proc. Conference on Very Large Data Bases (2004)","DOI":"10.1016\/B978-012088469-8.50040-1"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Loo, B., Huebsch, R., Stoica, I., Hellerstein, J.: Enhancing P2P file-sharing with an Internet-scale query processor. In: Proc. International Workshop on Peer-to-Peer Systems (2004)","DOI":"10.1016\/B978-012088469-8.50040-1"},{"key":"5_CR7","unstructured":"Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proc. ICDE (2003)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Kalnis, P., Ng, W., Ooi, B., Papadias, D., Tan, K.: An adaptive peer-to-peer network for distributed caching of OLAP results. In: Proc. SIGMOD (2002)","DOI":"10.1145\/564691.564695"},{"key":"5_CR9","unstructured":"Agarwal, D., Berket, K.: Supporting dynamic ad hoc collaboration capabilities. In: Proceedings of the 2003 Conference for Computing in High-Energy and Nuclear Physics, CHEP 2003 (2003)"},{"key":"5_CR10","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":"5_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. of ACM Int\u2019l Conf. on Supercomputing, ICS 2002 (2002)","DOI":"10.1145\/511334.511369"},{"key":"5_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":"5_CR13","doi-asserted-by":"crossref","unstructured":"Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: Proc. ICDCS (2002)","DOI":"10.1109\/ICDCS.2002.1022237"},{"key":"5_CR14","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":"5_CR15","doi-asserted-by":"publisher","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":"5_CR16","doi-asserted-by":"crossref","unstructured":"Cooper, B.F.: A content model for evaluating peer-to-peer searching techniques. In: Proc. ACM\/IFIP\/USENIX Middleware Conference (2004)","DOI":"10.1007\/978-3-540-30229-2_2"},{"key":"5_CR17","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":"5_CR18","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":"5_CR19","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. ACM Press, New York (1999)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/333135.333136","volume":"18","author":"B. Cahoon","year":"2000","unstructured":"Cahoon, B., McKinley, K.S., Lu, Z.: Evaluating the performance of distributed architectures for information retrieval using a variety of workloads. ACM Transactions on Information Systems\u00a018, 1\u201343 (2000)","journal-title":"ACM Transactions on Information Systems"},{"key":"5_CR21","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":"5_CR22","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":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_21","volume-title":"Peer-to-Peer Systems II","author":"B. Bhattacharjee","year":"2003","unstructured":"Bhattacharjee, B.: Efficient peer-to-peer searches using result-caching. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Hybrid search schemes for unstructured peer-to-peer networks. In: Proc. INFOCOM (2005)","DOI":"10.1109\/INFCOM.2005.1498436"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter P2P networks. In: Proc. IEEE Symp. on Foundations of Computer Science (2001)","DOI":"10.1109\/SFCS.2001.959925"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Ge, Z., Figueiredo, D., Jaiswal, S., Kurose, J., Towsley, D.: Modeling peer-peer file sharing systems. In: Proc. INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1209239"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Gummadi, K., Dunn, R., Saroiu, S., Gribble, S., Levy, H., Zahorjan, J.: Measurement, modeling and analysis of a peer-to-peer file-sharing workload. In: Proc. SOSP (2003)","DOI":"10.1145\/945445.945475"},{"key":"5_CR28","unstructured":"Bernstein, P., et al.: Data management for peer-to-peer computing: A vision. In: Proc. WebDB (2002)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proc. INFOCOM (2004)","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. In: Proc. ACM\/IFIP\/USENIX International Middleware Conference (2003)","DOI":"10.1007\/3-540-44892-6_2"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11558989_15","volume-title":"Peer-to-Peer Systems IV","author":"B.F. Cooper","year":"2005","unstructured":"Cooper, B.F.: Quickly routing searches without having to move content. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol.\u00a03640, pp. 163\u2013172. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Middleware 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11587552_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:06:16Z","timestamp":1586567176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11587552_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540303237","9783540322696"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11587552_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}