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

Improved Degree Search Algorithms in Unstructured P2P Networks

Guole Liu,1,2,3 Haipeng Peng,1,2,3 Lixiang Li,1,2,3 Yixian Yang,1,2,3 and Qun Luo1,2,3

1Information Security Center, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876, China
2Research Center on Fictitious Economy and Data Science, Chinese Academy of Sciences, Beijing 100190, China
3National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received 1 November 2011; Revised 21 February 2012; Accepted 14 April 2012

Academic Editor: Yi-Chung Hu

Copyright © 2012 Guole Liu 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. E. Meshkova, J. Riihijarvi, M. Petrova, and P. Mahonen, “A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks,” Computer Networks, vol. 52, no. 11, pp. 2097–2128, 2008. View at Publisher · View at Google Scholar
  2. A. Iamnitchi, M. Ripeanu, I. Foster et al., “Small-world file-sharing communities,” in Proceedings of the IEEE INFOCOM, vol. 2, pp. 952–963, 2004.
  3. 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, 2002. View at Publisher · View at Google Scholar
  4. B. F. Cooper and H. Garcia-Molina, “Ad Hoc, self-supervising peer-to-peer search networks,” ACM Transactions on Information Systems, vol. 23, no. 2, pp. 169–200, 2005. View at Publisher · View at Google Scholar
  5. J. Risson and T. Moors, “Survey of research towards robust peer-to-peer networks: search methods,” Computer Networks, vol. 50, no. 17, pp. 3485–3521, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. J. Jeong and P. Berman, “Low-cost search in scale-free networks,” Physical Review E, vol. 75, no. 3, Article ID 036104, 4 pages, 2007. View at Google Scholar
  7. V. Isham, J. Kaczmarska, and M. Nekovee, “Spread of information and infection on finite random networks,” Physical Review E, vol. 83, no. 4, Article ID 046128, 12 pages, 2011. View at Google Scholar
  8. D. Trpevski, W. K. S. Tang, and L. Kocarev, “Model for rumor spreading over networks,” Physical Review E, vol. 81, no. 5, Article ID 056102, 11 pages, 2010. View at Google Scholar
  9. D. Shah and T. Zaman, “Rumors in a network: who's the culprit?” Institute of Electrical and Electronics Engineers. Transactions on Information Theory, vol. 57, no. 8, pp. 5163–5181, 2011. View at Publisher · View at Google Scholar
  10. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Randomized gossip algorithms,” Institute of Electrical and Electronics Engineers. Transactions on Information Theory, vol. 52, no. 6, pp. 2508–2530, 2006. View at Publisher · View at Google Scholar
  11. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, “Search in powerlaw networks,” Physical Review E, vol. 64, no. 4, Article ID 046135, 8 pages, 2001. View at Google Scholar
  12. A. Tizghadam and A. Leon-Garcia, “On traffic-aware betweenness and network criticality,” in Proceedings of the INFOCOM IEEE Conference on Computer Communications Workshops, pp. 1–6, 2010.
  13. S. Misra and B. J. Oommen, “An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks,” IEEE Transactions on Computers, vol. 55, no. 6, pp. 686–702, 2006. View at Publisher · View at Google Scholar
  14. A. Reinefeld and T. Marsland, “Enhanced iterative-deepening search,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 7, pp. 701–710, 1994. View at Publisher · View at Google Scholar
  15. Y. Yao and J.-C. Yao, “On modified iterative method for nonexpansive mappings and monotone mappings,” Applied Mathematics and Computation, vol. 186, no. 2, pp. 1551–1558, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. Z. Wang, S. K. Das, M. Kumar, and H. Shen, “An efficient update propagation algorithm for P2P systems,” Computer Communications, vol. 30, no. 5, pp. 1106–1115, 2007. View at Publisher · View at Google Scholar
  17. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and replication in unstructured peer-to-peer networks,” in Proceedings of the 16th international conference on Supercomputing (ICS '02), pp. 84–95, 2002. View at Publisher · View at Google Scholar
  18. C. Gkantsidis, M. Mihail, and A. Saberi, “Random walks in peer-to-peer networks,” in Proceedings of the IEEE INFOCOM, vol. 1, pp. 1–12, 2004.
  19. A. Kumar, J. Xu, and E. W. Zegura, “Effcient and scalable query routing for unstructured peer-to-peer networks,” in Proceedings of the IEEE INFOCOM, vol. 2, pp. 1162–1173, 2005.
  20. C. Gkantsidis, M. Mihail, A. Saberi et al., “Random walks in peer-to-peer networks: algorithms and evaluation,” Performance Evaluation, vol. 63, no. 3, pp. 241–263, 2006. View at Publisher · View at Google Scholar
  21. M. Zhong, K. Shen, and J. Seiferas, “The convergence-guaranteed random walk and its applications in peer-to-peer networks,” Institute of Electrical and Electronics Engineers. Transactions on Computers, vol. 57, no. 5, pp. 619–633, 2008. View at Publisher · View at Google Scholar
  22. T. Lin, P. Lin, H. Wang, and C. Chen, “Dynamic search algorithm in unstructured peer-to-peer networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 5, pp. 654–666, 2009. View at Publisher · View at Google Scholar
  23. X. Ming, Z. Shuigeng, G. Jihong, and H. Xiaohua, “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
  24. K. Oikonomou, D. Kogias, I. Stavrakakis et al., “Probabilistic flooding for efficient information dissemination in random graph topologies,” Computer Networks, vol. 54, no. 10, pp. 1615–1629, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  25. R. Beraldi, L. Querzoni, and R. Baldoni, “Low hitting time random walks in wireless networks,” Wireless Communications and Mobile Computing, vol. 9, no. 5, pp. 719–732, 2009. View at Publisher · View at Google Scholar
  26. F. Guofu, Z. Jincheng, L. Sanglu, C. Guihai, and C. Daoxu, “RER: a replica efficiency based replication strategy,” Chinese Journal of Electronics, vol. 17, no. 4, pp. 589–594, 2008. View at Google Scholar
  27. G. Huiwei and I. H. S. Horace, “A study of parallel data mining in a peer-to-peer network,” Concurrent Engineering-Research and Applications, vol. 15, no. 3, pp. 281–289, 2007. View at Publisher · View at Google Scholar
  28. N. Bisnik and A. A. Alhussein, “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
  29. Y. Liu, J. Han, J. Wang et al., “Rumor riding: anonymizing unstructured peer-to-peer systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 3, pp. 464–475, 2011. View at Publisher · View at Google Scholar
  30. C.-K. Chau and P. Basu, “Analysis of latency of stateless opportunistic forwarding in intermittently connected networks,” IEEE/ACM Transactions on Networking, vol. 19, no. 4, pp. 1111–1124, 2011. View at Publisher · View at Google Scholar
  31. M. E. J. Newman, “Scientific collaboration networks. I. Network construction and fundamental results,” Physical Review E, vol. 64, no. 1, Article ID 016131, 8 pages, 2001. View at Google Scholar
  32. A. Fronczak, P. Fronczak, and J. A. Holyst, “Average path length in random networks,” Physical Review E, vol. 70, no. 5, Article ID 056110, 7 pages, 2004. View at Google Scholar
  33. L. A. Adamic and B. A. Huberman, “Growth dynamics of the world wide web,” Nature, vol. 401, p. 131, 1999. View at Google Scholar
  34. M. Ostilli, A. L. Ferreira, and J. F. F. Mendes, “Critical behavior and correlations on scale-free small-world networks: application to network design,” Physical Review E, vol. 83, no. 6, Article ID 061149, 21 pages, 2011. View at Google Scholar