Optimal search performance in unstructured peer-to-peer networks with clustered demands

IEEE Journal on Selected Areas in Communications

Volumn 25, Issue 1, 2007, Pages 84-95

  Tewari, Saurabh ^a,b   Kleinrock, Leonard ^a,b  

^a IEEE   (United States)

^b Engineering IV   (United States)

Author keywords

Clustered demands; Flooding; Optimal search cost; Optimal search time; Peer to peer networks; Random walk

Indexed keywords

CLUSTERED DEMANDS; FLOODING; OPTIMAL SEARCH COST; OPTIMAL SEARCH TIME; PEER-TO-PEER NETWORKS; RANDOM WALK;

DISTRIBUTED DATABASE SYSTEMS; OPTIMAL SYSTEMS; RANDOM PROCESSES; SEARCH ENGINES;

TELECOMMUNICATION NETWORKS;

EID: 33846579186     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2007.070109     Document Type: Article

References (32)

1. B. Bollobas, Random Graphs. London: Academic Press, 1985.
2. M. Bawa, G. S. Manku, and P. Raghavan, "SETS: Search enhanced by topic segmentation," in Proc. ACM SIGIR, July 2003.
3. Y. Chawathe, S. Ratnasamy, L. Breslau, L. Lanham, and S. Shenker, "Making gnutella-like P2P systems scalable," in Proc. ACM SIGCOMM, Aug. 2003.
4. V. Cholvi, P. A. Felber, and E. W. Biersack, "Efficient search in unstructured peer-to-peer networks," European Trans. Telecommun., vol. 15, no. 6, Nov.-Dec. 2004.
5. E. Cohen, and S. Shenker, "Replication strategies in unstructured peer-to-peer networks," in Proc. ACM SIGCOMM, Aug. 2002.
6. E. Cohen, A. Fiat, and H. Kaplan, "Associative search in peer to peer networks: Harnessing latent semantics," in Proc. IEEE INFOCOM, Mar. 2003, vol. 2, pp. 1261-1271.
7. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 1. New York: John Wiley & Sons, Inc., 1950.
8. C. Gkantsidis, M. Mihail, and A. Saberi, "Hybrid search schemes for unstructured peer-to-peer networks," in Proc. IEEE INFOCOM, Mar. 2005, vol. 3, pp. 1526-1537.
9. Gnutella protocol specification. [Online.] Available: http://www.the-gdf.org/
10. A. Iamnitchi, M. Ripeanu, and I. Foster, "Small-world file-sharing communities," in Proc. IEEE INFOCOM, Mar. 2004, vol. 2, pp. 952-963.
11. M. Khambatti, K. Ryu, and P. Dasgupta, "Structuring peer-to-peer networks using interest-based communities," in Proc. International Workshop Databases, Inform. Syst. Peer-to-Peer Computing (P2PDBIS), Sep. 2003.
12. J. Kleinberg, "The small-world phenomenon: An algorithmic perspective," in Proc. 32nd ACM Symposium Theory of Computing, 2000.
13. A. Klemm, C. Lindemann, M. K. Vernon, and O. P. Waldhorst, "Characterizing the query behavior in peer-to-peer file sharing systems," in Proc. ACM Internet Measurement Conf. (IMC), 2004.
14. F. Le Fessant, S. Handurukande, A. M. Kermarrec, and L. Massouli, "Clustering in peer-to-peer file sharing workloads," in Proc. IPTPS, Feb. 2004.
15. J. Li, J. Stribling, R. Morris, and M. F. Kaashoek, "Bandwidth efficient management of DHT routing tables," in Proc. 2nd Symposium Networked Syst. Design and Implementation (NSDI), May 2005.
16. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the evolution of peer-to-peer systems," in Proc. 22nd ACM Symposium Principles Distr. Computing (PODC), July 2002.
17. A. Loser, et. al., "Searching dynamic communities with personal indexes," in Proc. International Semantic Web Conf., 2005.
18. B. T. Loo, J. M. Hellerstein, R. Huebsch, S. Shenker, and I. Stoica, "Enhancing P2P file-sharing with an internet-scale query processor," in Proc. VLDB, 2004.
19. G. S. Manku, "Routing networks for distributed hash tables," in Proc. 22nd ACM Symposium Principles Distr. Computing (PODC), June 2003, pp. 133-142.
20. W. Nejdl, "Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks," in Proc. International World Wide Web Conf. (WWW), May 2003.
21. C. H. Ng, K. C. Sia, and C. H. Chang, "Peer clustering and firework query model," in Proc. International World Wide Web Conf. (WWW), May 2002.
22. D. A. Pierre, Optimization Theory with Applications. Dover, 1986.
23. V. Ramasubramanian and E. G. Sirer, "Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays," in Proc. Networked System Design Implementation (NSDI), Mar. 2004.
24. O. Sandberg, "Searching in a Small World." University of Gothenburg and Chalmers Technical University, 2005. [Online.] Available: http://www.math.chalmers.se/~ossa/lic.pdf
25. S. Singh, et al., "The case for service provider deployment of super-peers in peer-to-peer networks," in Proc. International Workshop Economics Peer-To-Peer Systems, 2003.
26. K. Sripanidkulchai, K. Maggs, and H. Zhang, "Efficient content location using interest-based locality in peer-to-peer systems," in IEEE INFOCOM, Mar. 2003, vol. 3, pp. 2166-2176.
27. I. Stoica, R. Morris, D. Karger, F. M. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-To-peer lookup service for internet applications," in Proc. ACM SIGCOMM, Aug. 2001.
28. C. Tang, Z. Xu, and S. Dwarkadas, "Peer-to-peer information retrieval using self-organizing semantic overlay networks," in Proc. ACM SIGCOMM, Aug. 2003, pp. 175-186.
29. S. Tewari and L. Kleinrock, "Analysis of search and replication in unstructured peer-to-peer networks," UCLA Computer Science Dept Technical Report UCLA-CSD-TR050006, Mar. 2005.
30. S. Tewari and L. Kleinrock, "On fairness, optimal download performance and proportional replication in peer-to-peer networks," in Proc. IFIP Networking, May 2005.
31. S. Tewari and L. Kleinrock, "Entropy and search distance in peer-to-peer networks," UCLA Computer Science Dept Technical Report UCLA-CSD-TR050049, Nov. 2005.
32. D. Tsoumakos and N. Roussopoulos, "Adaptive probabilistic search for peer-to-peer networks," in Proc. International Conf, Peer-to-Peer Computing (P2P), 2003.