{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:26:36Z","timestamp":1729628796185,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/glocom.2005.1577762","type":"proceedings-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T16:24:16Z","timestamp":1138206256000},"page":"6 pp.","source":"Crossref","is-referenced-by-count":2,"title":["Search time in unstructured peer-to-peer networks with clustered demands"],"prefix":"10.1109","author":[{"given":"S.","family":"Tewari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Kleinrock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","article-title":"Performance Analysis in Unstructured Overlays","volume":"199","author":"zhang","year":"2003","journal-title":"Proc of IEEE"},{"key":"15","article-title":"On Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks","author":"tewari","year":"2005","journal-title":"Proc of IFIP Networking"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064276"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.1145\/964723.383071","article-title":"Chord: A Scalable Peer-To-Peer Lookup Service For Internet Applications","author":"stoica","year":"2001","journal-title":"Proc of ACM SIGCOMM"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064276"},{"journal-title":"Can Unstructured P2P Protocols Survive Flash Crowds","year":"2005","author":"rubenstein","key":"11"},{"key":"12","article-title":"Percolation Search in Power Law Networks: Making Unstructured Peer-To-Peer Networks Scalable","author":"sarshar","year":"2003","journal-title":"Proceedings of Peer-to-Peer Computing"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1017"},{"journal-title":"Random Graphs","year":"1985","author":"bollobas","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.08.007"},{"key":"10","article-title":"Pastry: Scalable, Decentralized Object Location, And Routing For Large-Scale Peer-To-Peer Systems","author":"rowstron","year":"2001","journal-title":"Proc of IFIP\/ACM Middleware"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"6","volume":"1","author":"feller","year":"1950","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633043"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/863955.864000"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/PTP.2002.1046315"},{"key":"8","article-title":"Clustering in Peer-to-Peer File Sharing Workloads","author":"le fessant","year":"2004","journal-title":"Proc of IPTPS"}],"event":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","start":{"date-parts":[[2005,12,2]]},"location":"St. Louis, MO, USA","end":{"date-parts":[[2005,12,2]]}},"container-title":["GLOBECOM '05. IEEE Global Telecommunications Conference, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10511\/33286\/01577762.pdf?arnumber=1577762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T02:45:19Z","timestamp":1497667519000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1577762\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/glocom.2005.1577762","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}