{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T05:19:51Z","timestamp":1736227191623,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309598"},{"type":"electronic","value":"9783540324287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11603771_27","type":"book-chapter","created":{"date-parts":[[2005,12,12]],"date-time":"2005-12-12T17:11:50Z","timestamp":1134407510000},"page":"238-249","source":"Crossref","is-referenced-by-count":2,"title":["Uinta: A P2P Routing Algorithm Based on the User\u2019s Interest and the Network Topology"],"prefix":"10.1007","author":[{"given":"Hai","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Gnutella, http:\/\/www.gnutellaforums.com\/"},{"key":"27_CR2","unstructured":"KazaA, http:\/\/www.kazaa.com"},{"key":"27_CR3","unstructured":"Freenet, http:\/\/freenet.sourceforge.net\/"},{"key":"27_CR4","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 Special Interest Group on Data Communication (SIGCOMM) (August 2001)","DOI":"10.1145\/383059.383071"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proceedings of the 2003 ACM Special Interest Group on Data Communication (SIGCOMM) (August 2001)","DOI":"10.1145\/964723.383072"},{"key":"27_CR6","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, 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":"27_CR7","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.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications\u00a022, 41\u201353 (2004)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"27_CR8","unstructured":"Shin, K., Lee, S., Lim, G., Yoon, H., Ma, J.S.: Grapes: Topology-based Hierarchical Virtual Network for Peer-to-peer Lookup Services. In: Proceedings of the International Conference on Parallel Processing Workshops, ICPPW 2002 (2002)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Xu, Z., Min, R., Hu, Y.: HIERAS:A DHT-Based Hierarchical Peer-to-Peer Routing Algorithm. In: Proceedings of the 2003 International Conference on Parallel Processing (ICPP 2003), October 2003, pp. 187\u2013194 (2003)","DOI":"10.1109\/ICPP.2003.1240580"},{"key":"27_CR10","unstructured":"Mahanti, A.: Web proxy workload characterisation and modelling. Master\u2019s Thesis, Department of Computer Science, University of Saskatchewan (September 1999)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of ACM SIGCOMM (2003)","DOI":"10.1145\/863955.863998"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: Proceedings of IEEE INFOCOM 2002, New York (June 2002)","DOI":"10.1109\/INFCOM.2002.1019369"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Lehman, E., Leighton, F., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: Proc. 29th Annu. ACM Symp. Theory of Computing, El Paso, TX, May 1997, pp. 654\u2013663 (1997)","DOI":"10.1145\/258533.258660"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Kubiatowicz, J., Bindel, D., Eaton, P., Chen, Y., Geels, D., Gummadi, R., Rhea, S., Weimer, W., Wells, C., Weatherspoon, H., Zhao, B.: OceanStore: An architecture for global-scale persistent storage. In: Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), Cambridge, MA, November 2000, pp. 190\u2013201 (2000)","DOI":"10.1145\/378993.379239"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-Area Cooperative Storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001), Banff, Alberta, Canada, October 2001, pp. 202\u2013215 (2001)","DOI":"10.1145\/502034.502054"},{"key":"27_CR16","unstructured":"Zegura, E.W., Calvert, K., Bhattacharjee, S.: How to model an internet work. In: Proceedings of IEEE INFOCOM (1996)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing \u2013 IWDC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11603771_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T12:48:36Z","timestamp":1736167716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11603771_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309598","9783540324287"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11603771_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}