Searching techniques in peer-to-peer networks

Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks

Volumn , Issue , 2005, Pages 617-642

  Li, Xiuqi ^a   Wu, Jie ^a  

^a Florida Atlantic Univ   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85054208517     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9780203323687     Document Type: Chapter

References (53)

1. H. Balakrishnan, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica, Looking up data in P2P systems, Commun. ACM, Vol. 46, No. 2, 2003.
2. C. Yang and J. Wu, A dominating-set-based routing in peer-to-peer networks, Proc. 2nd Int. Workshop on Grid and Cooperative Computing Workshop (GCC’03), 2003.
3. N. Daswani, H. Garcia-Molina, and B. Yang, Open problems in data-sharing peer-to-peer systems, Proc. 9th Int. Conf. on Database Theory (ICDT’03), 2003.
4. D.S. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B. Richard, S. Rolins, and Z. Xu, Peer-to-Peer Computing, HP Lab technical report, HPL-2002-57, 2002.
5. D. Barkai, Technologies for sharing and collaborating on the net, Proc. of the 1st Int. Workshop on Peer-to-Peer Systems (IPTPS’02), 2002.
6. B. Yang and H. Garcia-Molina, Improving search in peer-to-peer networks, Proc. 22nd IEEE Int. Conf. on Distributed Computing (IEEE ICDCS’02), 2002.
7. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and replication in unstructured peer-to-peer networks, Proc. 16th ACM Int. Conf. on Supercomputing (ACM ICS’02), 2002.
8. A. Crespo and H. Garcia-Molina, Routing indices for peer-to-peer systems, Proc. 22nd Int. Conf. on Distributed Computing (IEEE ICDCS’02), 2002.
9. S.C. Rhea and J. Kubiatowicz, Probabilistic location and routing, Proc. 21st Annu. Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM’02), 2002.
10. V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-yazti, A local search mechanism for peer-to-peer networks, Proc. 11th ACM Conf. on Information and Knowledge Management (ACM CIKM’02), 2002.
11. D. Tsoumakos and N. Roussopoulos, Adaptive probabilistic search in peer-to-peer networks, Proc. 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
12. D. and N. Roussopoulos, Adaptive Probabilistic Searchin Peer-to-Peer Networks, Technical Report, CS-TR-4451, 2003.
13. D. Tsoumakos and N. Roussopoulos, A comparison of peer-to-peer search methods, Proc. 2003 Int. Workshop on the Web and Databases, 2003.
14. L.A. Adamic, R.M. Lukose, A.R. Puniyani, and B.A. Huberman, Search in power-law networks, Physical Review, Vol. 64, 2001.
15. The gnutella protocol specifications VO.4.CLip2 distributed search solutions, http://www.CLip2.com.
16. I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, Chord: a scalable peer-to-peer lookup service for Internet applications, Proc. 2001 ACM Annu. Conf. of the Special Interest Group on Data Communication (ACM SIGCOMM’01), 2001.
17. A. Rowstron and P. Druschel, Pastry: scalable, distributed object location and routing for largescale peer-to-peer systems, Proc. 18th IFIP/ACM Int. Conf. of Distributed Systems Platforms, 2001. www.cs.rice.edu/CS/systems?Pastry.
18. K. Hildrum, J. Kubiatowicz, S. Rao, and B.Y. Zhao, Distributed object location in a dynamic network, Proc. 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), 2002.
19. P. Maymounkov and D. Mazieres, Kademlia: a peer-to-peer information system based on the XOR metric, Proc. 1st Int. Workshop on Peer-to-Peer Systems (IPTPS’02), Springer-Verlag version, 2002.
20. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content-addressable network, Proc. 2001 ACM Annu. Conf. of the Special Interest Group on Data Communication (ACM SIGCOMM’ 01), 2001
21. M.F. Kaashoek, and D.R. Karger, Koorde: a simple degree-optimal distributed hash table, Proc. 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
22. D. Xuan, S. Chellappan, and M. Krishnamoorthy, R Chord: an enhanced chord system resilient to routing attacks, Proc. 2003 Int. Conf. in Computer Networks and Mobile Computing, 2003.
23. I. Gupta, K. Birman, P. Linga, A. Demers, and R.V. Renesse, Kelips: building an efficient and stable P2P DHT through increased memory and background overhead, Proc. 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
24. M.J. Freedman and D. Mazieres, Sloppy hashing and self-organized clusters, Proc. 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
25. A.T. Mizrak, Y. Cheng, V. Kumar, and S. Savage, Structured superpeers: leveraging heterogeneity to provide constant-time lookup, Proc. IEEE Workshop on Internet Applications (WIAPP’03), 2003.
26. L. Garces-Erice, E.W. Biersack, P.A. Felber, K.W. Ross, and G. Urvoy-Keller, Hierarchical peer-to-peer systems, Parallel Processing Letters, Vol. 13, 2003.
27. KaZaA, http://www.kazaa.com.
28. B.Y. Zhao, Y. Duan, L. Huang, A.D. Joseph, and J.D. Kubiatowicz, Brocade: landmark routing on overlay networks, Proc. 1st Int. Workshop on Peer-to-Peer Systems (IPTPS’02), 2002.
29. N.J.A. Harvey, M.B. Jones, S. Saroiu, M. Theimer, and A. Wolman, SkipNet: a scalable overlay network with practical locality properties, Proc. 4th USENIX Symp. on Internet Technologies and Systems (USITS’03), 2003.
30. J. Aspnes and G. Shah, Skip Graphs, technical report, Yale University, 2003.
31. G.S. Manku, M. Bawa, and P. Raghavan, Symphony: distributed hashing in a small world, Proc. 4th USENIX Symp. on Internet Technology and Systems (USITS’03), 2003.
32. B. Silaghi, B. Bhattacharjee, and P. Keleher, Query routing in the TerraDir Distributed Directory, Proc. SPIE ITCom’02, 2002.
33. B. Bhattacharjee, P. Keleher, and B. Silaghi, The design of Terra Dir, technical report, CS-TR-4299, University of Maryland, College Park, 2001.
34. I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong, Freenet: a distributed anonymous information storage and retrieval system, Proc. ICSI Workshop on Design Issues in Anonymity and Unobservability, 2000.
35. H. Zhang, A. Goel, and R. Govindan, Using the small-world model to improve Freenet performance, Proc. 22nd Annu. Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM’03), 2003.
36. S. Rhea, T. Roscoe, and J. Kubiatowicz, Structured peer-to-peer overlays need application-driven benchmarks, Proc. 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
37. T. Lin and H. Wang, Search performance analysis in peer-to-peer networks, Proc. 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
38. Z. Xu, R. Min, and Y. Hu, HIERAS: a DHT based hierarchical P2P routing algorithm, Proc. 32nd Int. Conf. on Parallel Processing (ICPP’03), 2003.
39. B. Yang, P. Vinograd, and H. Garcia-Molina, Evaluating GUESS and non-forwarding peer-to-peer search, Proc. 24th IEEE Int. Conf. on Distributed Computing Systems (IEEE ICDCS’04), 2004.
40. R.H. Wouhaybi and A.T. Campbell, Phenix: supporting resilient low-diameter peer-to-peer topologies, Proc. 23rdAnnu. JointConf. of the IEEE Computer and Communications Societies (INFOCOM’04), 2004.
41. E. Cohen and S. Shenker, Replication strategies in unstructured peer-to-peer networks, Proc. ACM Annu. Conf. of the Special Interest Group on Data Communication (ACM SIGCOMM’02), 2002.
42. Y. Liu, X. Liu, and L. Xiao, Location-aware topology matching in P2P systems, Proc. 23rd Annu. Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM’04), 2004.
43. S. Ren, L. Guo, S. Jiang, and X. Zhang, SAT-Match: a self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks, Proc. 18th IEEE Int. Parallel & Distributed Processing Symp. (IPDPS’04), 2004.
44. Y. Liu, L. Xiao, and L.M. Ni, Building a scalable bipartite P2P overlay network, Proc. 18th IEEE Int. Parallel & Distributed Processing Symp. (IPDPS’04), 2004.
45. S. Marti, P. Ganesan, and H. Garcia-Molina, DHT routing using social links, Proc. 3rd Int. Workshop on Peer-to-Peer Systems (IPTPS’04), 2004.
46. D. Malkhi, M. Naor, and D. Ratajczak, Viceroy: a scalable and dynamic emulation of the butterfly, Proc. of Principles of Distributed Computing (PODC) 2002, 2002.
47. H. Shen, C.-Z. Xu, and G. Chen, Cycloid: a constant-degree and lookup-efficient P2P overlay network, Proc. 18th IEEE Int. Parallel & Distributed Processing Symp. (IPDPS’04), 2004.
48. P. Ganesan, K., and H. Garcia-Molina, Canon in G major: designing DHTs with hierarchical structure, Proc. 24th IEEE Int. Conf. on Distributed Computing Systems (IEEE ICDCS’04), 2004.
49. J. Kleinberg, The small-world phenomenon: an algorithmic perspective, Proc. 32nd ACM Symp. on Theory of Computing, 2000.
50. B. Bloom, Space/time trade-offs in hash coding with allowable errors, Commun. ACM, Vol. 13(7), 1970.
51. F.M. Cuenca-Acuna, C. Peery, R.P. Martin, and T.D. Nguyen, Planet P: using gossiping to build content addressable peer-to-peer information sharing communities, Proc. 12th IEEE Int. l Symp. on High Performance Distributed Computing (HPDC’03), 2003.
52. I. Jawhar and J. Wu, A two-level random walk search protocol for peer-to-peer networks, Proc. 8th World Multi-Conf. on Systemics, Cybernetics and Informatics, 2004.
53. http://www.napster.com.