Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 197878, 20 pages
http://dx.doi.org/10.1155/2014/197878
Research Article

CSA: A Credibility Search Algorithm Based on Different Query in Unstructured Peer-to-Peer Networks

1Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, Beijing 100876, China
2School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received 27 February 2014; Revised 12 June 2014; Accepted 13 June 2014; Published 10 July 2014

Academic Editor: He Huang

Copyright © 2014 Hongyan Mei et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Open Source Community, “Gnutella,” 2001, http://eg.wego.com/.
  2. FastTrack Peer-to-Peer Technology Company, “Fast track,” 2001, http://fasttrack.nu/.
  3. KaZaA lesharing network, “KaZaA,” 2002, http://www.kazaa.com/.
  4. D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger, “Sampling techniques for large, dynamic graphs,” in Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM '06), pp. 1–6, April 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. A. H. Rasti, D. Stutzbach, and R. Rejaie, “On the long-term evolution of the two-tier Gnutella overlay,” in Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM '06), pp. 1–6, April 2006. View at Publisher · View at Google Scholar · View at Scopus
  6. B. Yang and H. Garcia-Molina, “Improving search in peer-to-peer networks,” in Proceedings of the 22nd IEEE International Conference on Distributed Computing (ICDCS ' 02), pp. 5–14, IEEE, July 2002. View at Scopus
  7. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and replication in unstructured peer-to-peer networks,” in Proceedings of the International Conference on Supercomputing, pp. 84–95, June 2002. View at Scopus
  8. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making gnutell-like p2p systems scalable,” in Proceeding of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications ( SIGCOMM '03 ), pp. 407–418, August 2003. View at Scopus
  9. M. Andreolini and R. Lancellotti, “A flexible and robust lookup algorithm for P2P systems,” in Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS '09), pp. 1–8, May 2009. View at Publisher · View at Google Scholar · View at Scopus
  10. R. Gaeta and M. Sereno, “Generalized probabilistic flooding in unstructured peer-to-peer networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 12, pp. 2055–2062, 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. C. Gkantsidis, M. Mihail, and A. Saberi, “Random walks in peer-to-peer networks,” in Proceedings of the 23 rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), vol. 1, pp. 7–11, March 2004.
  12. N. Bisnik and A. A. Abouzeid, “Optimizing random walk search algorithms in P2P networks,” Computer Networks, vol. 51, no. 6, pp. 1499–1514, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. C. Gkantsidis, M. Mihail, and A. Saberi, “Hybrid search schemes for unstructured peer-to-peer networks,” in Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies ( INFOCOM '05 ), vol. 3, pp. 1526–1537, Miami, Fla, USA, March 2005. View at Publisher · View at Google Scholar · View at Scopus
  14. S. Jiang, L. Guo, X. Zhang, and H. Wang, “LightFlood: minimizing redundant messages and maximizing scope of peer-to-peer search,” IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 5, pp. 601–614, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. H. Y. Mei, Y. J. Zhang, X. W. Meng, and W. M. Ma, “Limited search mechanism for unstructured peer-to-peer network,” Journal of Software, vol. 24, no. 9, pp. 2132–2150, 2013. View at Google Scholar
  16. V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti, “A local search mechanism for peer-to-peer networks,” in Proceedings of the 11th International Conference on Information and Knowledge Management (CIKM '02), pp. 300–307, McLean, Va, USA, November 2002. View at Scopus
  17. D. Tsoumakos and N. Roussopoulos, “Adaptive probabilistic search in peer-to-peer networks,” in Proceedings of the 3rd International Conference on Peer-to-Peer Computing (P2P '03), pp. 102–109, September 2003.
  18. M. Xu, S. Zhou, J. Guan, and X. Hu, “A path-traceable query routing mechanism for search in unstructured peer-to-peer networks,” Journal of Network and Computer Applications, vol. 33, no. 2, pp. 115–127, 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. D. M. R. Himali and S. K. Prasad, “SPUN: a P2P probabilistic search algorithm based on successful paths in unstructured networks,” in Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW '11), pp. 1610–1617, May 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. B. Zuo and Q. Gao, “The effects of familiarity and similarity on the interpersonal attraction,” Chinese Journal of Clinical Psychology, vol. 16, no. 6, pp. 634–636, 2008. View at Google Scholar
  21. W. Ma, X. Meng, and Y. Zhang, “Bidirectional random walk search mechanism for unstructured P2P network,” Journal of Software, vol. 23, no. 4, pp. 894–911, 2012. View at Publisher · View at Google Scholar · View at Scopus
  22. G. Chen, C. P. Low, and Z. Yang, “Enhancing search performance in unstructured P2P networks based on users' common interest,” IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 6, pp. 821–836, 2008. View at Publisher · View at Google Scholar · View at Scopus
  23. K. C. Lin, C. Wang, C. Chou, and L. Golubchik, “SocioNet: A social-based multimedia access system for unstructured P2P networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 7, pp. 1027–1041, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. C. G. M. Snoek, M. Worring, J. C. van Gemert, J.-M. Geusebroek, and A. W. M. Smeulders, “The challenge problem for automated detection of 101 semantic concepts in multimedia,” in Proceedings of the 14th Annual ACM International Conference on Multimedia ( MULTIMEDIA '06 ), pp. 421–430, October 2006.
  25. M. S. Lew, N. Sebe, C. Djeraba, and R. Jain, “Content-based multimedia information retrieval: State of the art and challenges,” ACM Transactions on Multimedia Computing, Communications and Applications, vol. 2, no. 1, pp. 1–19, 2006. View at Publisher · View at Google Scholar · View at Scopus
  26. C. J. Lin, S. C. Tsai, Y. T. Chang, and C. F. Chou, “Enabling keyword search and similarity search in small-world-based P2P systems,” in Proceedings of the 16th International Conference on Computer Communications and Networks (ICCCN '07), pp. 115–120, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  27. G. Salton, Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer, Addison-Wesley, 1988.
  28. “The peersim simulator,” 2007, http://peersim.sourceforge.net/.
  29. K. Sripanidkulchai, “The popularity of Gnutella queries and its implications on scalability,” 2001, http://www.cs.cmu.edu/~kunwadee/research/p2p/paper.html.
  30. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web caching and Zipf-like distributions: evidence and implications,” in Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societie (INFOCOM '99), pp. 126–134, March 1999. View at Scopus
  31. P. Backx, “A comparison of peer-to-peer architectures,” in Proceedings of the Eurescom 2002 Powerful Networks for Profitable Services, pp. 1–8, 2002.