DHT-assisted probabilistic exhaustive search in unstructured P2P networks

IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

Volumn , Issue , 2008, Pages

  Luo, Xucheng ^a   Qin, Zhiguang ^a   Han, Jinsong ^b   Chen, Hanhua ^c  

^a UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS; PROBABILITY; RISK ASSESSMENT;

EXHAUSTIVE SEARCH; REPLICATION STRATEGIES;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 51049085365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2008.4536254     Document Type: Conference Paper

References (27)

1. D. Chamberlin. Xquery: a query language for xml. In Proceedings of ACM SIGMOD 2003, pages 682-682, San Diego, California, USA, 2003. ACM.
2. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making gnutella-like p2p systems scalable. In Proceedings of ACM SIGCOMM 2003, pages 407-418, Karlsruhe, Germany, 2003. ACM.
3. H. Chen, H. Jin, Y. Liu, and L. M. Ni. Difficulty-aware hybrid search in peer-to-peer networks. In Proceedings of the ICPP 2007, page 6, Xi'An, China, 2007. IEEE.
4. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. In Proceedings of ACM SIGCOMM 2002, pages 177-190, Pittsburgh, PA, USA, 2002. ACM.
5. B. F. Cooper. Quickly routing searches without having to move content. In Proceedings of IPTPS 2005, pages 163-172, Ithaca, NY, USA, 2005. Springer.
6. R. A. Ferreira, M. K. Ramanathan, A. Awan, A. Grama, and S. Jagannathan. Search with probabilistic guarantees in unstructured peer-to-peer networks. In Proceedings of P2P 2005, pages 165-172, Konstanz, Germany, 2005. IEEE.
7. C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid search schemes for unstructured peer-to-peer networks. In Proceedings of IEEE INFOCOM 2005, pages 1526-1537, Miami, FL, USA, 2005. IEEE.
8. V. King and J. Saia. Choosing a random peer. In Proceedings of ACM PODC 2004, pages 125-130, St. John's, Newfoundland, Canada, 2004. ACM.
9. J. Kleinberg. The small-world phenomenon: an algorithmic perspective. In Proceedings of ACM STOC 2000, pages 163-170. ACM, 2000.
10. Y. Liu, X. Liu, L. Xiao, L. M. Ni, and X. Zhang. Location-aware topology matching in p2p systems. In Proceedings of IEEE INFOCOM 2004, pages 2220-2230, Hong Kong, 2004. IEEE.
11. Y. Liu, L. Xiao, and L. M. Ni. Building a scalable bipartite p2p overlay network. IEEE Transactions on Parallel and Distributed Systems (TPDS), 18(9):1296-1306, 2007.
12. Y. Liu, Z. Zhuang, L. Xiao, and L. M. Ni. a distributed approach to solving overlay mismatching problem. In Proceedings of IEEE ICDCS 2004, pages 132-139. IEEE, 2004.
13. B. T. Loo, R. Huebsch, I. Stoica, and J. M. Hellerstein. The case for a hybrid p2p search infrastructure. In Proceedings of IPTPS 2004, pages 141-150, La Jolla, CA, USA, 2004. Springer.
14. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In Proceedings of ACM ICS 2002, pages 84-95, New York,USA, 2002. ACM.
15. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: a scalable and dynamic emulation of the butterfly. In Proceedings of ACM PODC 2002, pages 183-192, Monterey, California, USA, 2002. ACM.
16. G. S. Manku. Routing networks for distributed hash tables. In Proceedings of ACM PODC 2003, pages 133-142, Boston, Massachusetts, USA, 2003. ACM.
17. P. Maymounkov and D. Mazieres. Kademlia: a peer-to-peer information system based on the xor metric. In Proceedings of IPTPS 2002, pages 53-65, Cambridge, MA, USA, 2002. Springer.
18. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
19. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. a scalable content-addressable network. In Proceedings of ACM SIGCOMM 2001, pages 161-172, San Francisco, California, USA, 2001. ACM.
20. S. Saroiu, K. Gummadi, and S. Gribble. Measuring and analyzing the characteristics of napster and gnutella hosts. Multimedia Systems Journal, 9(2):170-184, 2003.
21. S. Saroiu, P. K. Gummadi, and S. D. Gribble. a measurement study of peer-to-peer file sharing systems. In Proceedings of MMCN 2002, pages 156-170, San Jose, USA, 2002. SPIE.
22. N. Sarshar, P. O. Boykin, and V. P. Roychowdhury. Percolation search in power law networks: Making unstructured peer-to-peer networks scalable. In Proceedings of IEEE P2P 2004, pages 2-9, Zurich, Switzerland, 2004. IEEE.
23. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM 2001, pages 149-160, San Diego, California, USA, 2001. ACM.
24. W. W. Terpstra, J. Kangasharju, C. Leng, and A. P. Buchmann. Bubblestorm: Resilient, probabilistic, and exhaustive peer-to-peer search. In Proceedings of ACM SIGCOMM 2007, pages 49-60, Kyoto, Japan, 2007. ACM.
25. M. Zaharia and S. Keshav. Gossip-based search selection in hybrid peer-to-peer networks. In Proceedings of IPTPS 2006, Santa Barbara, CA, USA, 2006.
26. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz. Tapestry: a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1):41-53, 2004.
27. M. Zhong and K. Shen. Popularity-biased random walks for peer-to-peer search under the square-root principle. In Proceedings of IPTPS 2006, Santa Barbara, CA, USA, 2006.