{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:29:18Z","timestamp":1737437358521,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540747833"},{"type":"electronic","value":"9783540747840"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-74784-0_12","type":"book-chapter","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T02:29:19Z","timestamp":1190082559000},"page":"114-123","source":"Crossref","is-referenced-by-count":0,"title":["SW-Uinta: A Small-World P2P Overlay Network"],"prefix":"10.1007","author":[{"given":"Jie","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Gnutella: http:\/\/www.gnutellaforums.com\/"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Leibowitz, N., Ripeanu, M., Wierzbicki, A.: Deconstructing the Kazaa Network. In: Proc. of 3rd IEEE Workshop on Internet Applications, Santa Clara, CA, pp. 112\u2013120 (2003)","DOI":"10.1109\/WIAPP.2003.1210295"},{"key":"12_CR3","unstructured":"Clarke, I., Sandberg, O., Wiley, B., et al.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Proc. of Workshop on Design Issues in Anonymity and Unobservability. ICSI, pp. 311\u2013320 (2000)"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/383059.383071","volume-title":"Proc. of the ACM SIGCOMM","author":"I. Stoica","year":"2001","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. of the ACM SIGCOMM, pp. 149\u2013160. ACM Press, New York (2001)"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/383059.383072","volume-title":"Proc. of ACM SIGCOMM","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proc. of ACM SIGCOMM, pp. 161\u2013172. ACM Press, New York (2001)"},{"key":"12_CR6","first-page":"329","volume-title":"Proc. of the 18th IFIP\/ACM International Conference on Distributed Systems Platforms","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: Proc. of the 18th IFIP\/ACM International Conference on Distributed Systems Platforms, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"12_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, J., Joseph, S.C., Kubiatowicz, A.D.: 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":"12_CR8","unstructured":"Sarshar, N., Roychowdhury, V.P.: A Random Structure for Optimum Cache Size Distributed Hash Table (DHT) Peer-to-Peer Design (2002), http:\/\/www.ee.ucla.edu\/~nima\/Publications\/opt_cache.pdf"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/11603771_27","volume-title":"Distributed Computing","author":"H. Jin","year":"2005","unstructured":"Jin, H., Xu, J., Zou, B., Zhang, H.: Uinta: A P2P Routing Algorithm Based on the User\u2019s Interest and the Network Topology. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 238\u2013249. Springer, Heidelberg (2005)"},{"key":"12_CR10","first-page":"60","volume":"2","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The Small World Problem. Psychology Today\u00a02, 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective Dynamics of Small-World Networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"12_CR12","first-page":"14","volume-title":"Proceedings of Advances in Neural Information Processing Systems","author":"J. Kleinberg","year":"2002","unstructured":"Kleinberg, J.: Small-World Phenomena and the Dynamics of Information. In: Proceedings of Advances in Neural Information Processing Systems, pp. 14\u201325. MIT Press, Cambridge (2002)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. Cornell Computer Science Technical Report 99-1776 (2000)","DOI":"10.1145\/335305.335325"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Iamnitchi, A., Ripeanu, M., Foster, I.: Small-World File-Sharing Communities. In: Proceedings of IEEE INFOCOM, pp. 175\u2013186 (2004)","DOI":"10.1109\/INFCOM.2004.1356982"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, H., Goel, A., Govindan, R.: Using the Small-World Model to Improve Freenet Performance. In: Proceedings of IEEE INFOCOM 2002, pp. 1228\u20131237 (2002)","DOI":"10.1145\/510726.510753"},{"key":"12_CR16","unstructured":"Mahanti, A.: Web Proxy Workload Characterization and Modeling. Master Thesis. Department of Computer Science, University of Saskatchewan (1999)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Zegura, E.W., Calvert, K., Bhattacharjee, S.: How to Model an Internet Work. In: Proceedings of INFOCOM 1996, pp. 594\u2013602 (1996)","DOI":"10.1109\/INFCOM.1996.493353"}],"container-title":["Lecture Notes in Computer Science","Network and Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74784-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T01:18:38Z","timestamp":1737422318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74784-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540747833","9783540747840"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74784-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}