{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:13:01Z","timestamp":1725574381564},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540235781"},{"type":"electronic","value":"9783540302070"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30207-0_28","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T20:51:21Z","timestamp":1294433481000},"page":"221-228","source":"Crossref","is-referenced-by-count":7,"title":["Topology and Resource Discovery in Peer-to-Peer Overlay Networks"],"prefix":"10.1007","author":[{"given":"Dongsheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nong","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xicheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Saroiu, S., Krishna Gummadi, P.: Steven D. Gribble: A measurement study of peer-topeer file sharing systems. In: Proc. of MMCN 2002 (2002)","DOI":"10.1117\/12.449977"},{"key":"28_CR2","unstructured":"Jovanovic, M., Annexstein, F.S., Berman, K.A.: Modeling peer-to-peer network topologies through small-World models and power laws. In: TELFOR, Belgrade, Yugoslavia (November 2001)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"46135","DOI":"10.1103\/PhysRevE.64.046135","volume":"64","author":"L.A. Adamic","year":"2001","unstructured":"Adamic, L.A., Humberman, B., Lukose, R., Puniyani, A.: Search in power law networks. Phys. Rev. E\u00a064, 46135\u201346143 (2001)","journal-title":"Phys. Rev. E"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-topeer networks. In: Proc. of ICS 2002, New York, USA (2002)","DOI":"10.1145\/511334.511369"},{"key":"28_CR5","unstructured":"Yang, B., Garcia-Molina, H.: Efficient search in peer-to-peer networks. In: Proc. of ICDCS 2002, Vienna, Austria (2002)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proc. of Infocom 2004 (2004)","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc. of ICDCS 2002, Vienna, Austria (2002)","DOI":"10.1109\/ICDCS.2002.1022239"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, E.: Associative search in peer to peer networks: harnessing latent semantics. In: Proc. of Infocom 2003 (2003)","DOI":"10.1109\/INFCOM.2003.1208962"},{"key":"28_CR9","unstructured":"Sripanidkulchai, K.: The popularity of Gnutella queries and its implications on scalability. White paper, Carnegie Mellon Univ. (2001), available online at http:\/\/www.cs.cmu.edu\/~kunwadee\/research\/p2p\/gnutella.html"},{"key":"28_CR10","unstructured":"Evangelos, P.: Markatos: Tracing a large-scale Peer to Peer System: an hour in the life of Gnutella. In: Proc. of CCGrid 2002(2002)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"cohen, E., shenker, S.: Replication strategies in unstructured peer-to-peer networks. In: Proc. of ACM Sigcomm 2002 (2002)","DOI":"10.1145\/633025.633043"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Pandurangan, G., Raghavan, P., Upfal, E.: Building low diameter peer-to-peer networks. In: Proc. of FOCS 2001 (2001)","DOI":"10.1109\/SFCS.2001.959925"},{"key":"28_CR13","unstructured":"Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interestbased locality in peer-to-peer systems. In: Proc. of Infocom 2003 (2003)"},{"key":"28_CR14","unstructured":"Wouhaybi, R.H., Campbell, A.T.: Phenix: supporting resilient low-diameter peer-topeer topologoies. In: Proc. of Infocom 2004 (2004)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, H., Goel, A., Govindan, R.: Using the small-world model to improve freenet performance. In: Proc. of Infocom 2002 (2002)","DOI":"10.1109\/INFCOM.2002.1019373"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_4","volume-title":"Peer-to-Peer Systems","author":"S. Ratnasamy","year":"2002","unstructured":"Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: some open questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, Springer, Heidelberg (2002)"},{"issue":"2","key":"28_CR17","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., et al.: Looking up data in p2p systems. Communications of the ACM\u00a046(2), 43\u201348 (2003)","journal-title":"Communications of the ACM"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Xu, J., Kumar, A., Yu, X.: On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE JSAC\u00a0(1) (2004)","DOI":"10.1109\/JSAC.2003.818805"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-540-39425-9_49","volume-title":"Advanced Parallel Processing Technologies","author":"D. Li","year":"2003","unstructured":"Li, D., Fang, X., Wang, Y., et al.: A Scalable peer-to-peer network with constant degree. In: Zhou, X., Xu, M., J\u00e4hnichen, S., Cao, J. (eds.) APPT 2003. LNCS, vol.\u00a02834, pp. 414\u2013425. Springer, Heidelberg (2003)"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Li, D., Lu, X., Su, J.: Graph-theoretic analysis of Kautz topology and DHT schemes. In: Proc. of IFIP NPC 2004 (2004)","DOI":"10.1007\/978-3-540-30141-7_45"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_15","volume-title":"Peer-to-Peer Systems II","author":"I. Gupta","year":"2003","unstructured":"Gupta, I., Birman, K., Linga, P., et al.: Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"key":"28_CR22","unstructured":"Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proc. of ICDE 2003 (2003)"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Xu, Z., Mahalingam, M., Karlsson, M.: Turining Heterogeneity into an advantage in overlay routing. In: Proc. of IEEE Infocom 2003 (2003)","DOI":"10.1109\/INFCOM.2003.1208985"}],"container-title":["Lecture Notes in Computer Science","Grid and Cooperative Computing - GCC 2004 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30207-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:48:44Z","timestamp":1605761324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30207-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540235781","9783540302070"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30207-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}