Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Networks and Communications
Volume 2016, Article ID 5191405, 15 pages
http://dx.doi.org/10.1155/2016/5191405
Research Article

A Persistent Structured Hierarchical Overlay Network to Counter Intentional Churn Attack

1Department of Computer Science and Engineering, National Institute of Technology, Jalandhar, Punjab, India
2Department of Information Technology, Jaypee University of Information Technology, Solan, Himachal Pradesh, India
3Department of Computer Science and Engineering, Shaheed Bhagat Singh State Technical Campus, Ferozepur, Punjab, India

Received 23 February 2016; Revised 12 August 2016; Accepted 5 September 2016

Academic Editor: Rui Zhang

Copyright © 2016 Ramanpreet Kaur 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. J. Buford, H. Yu, and E. K. Lua, P2P Networking and Applications, USA Morgan Kuafmann, 2009.
  2. M. Srivatsa and L. Liu, “Vulnerabilities and security threats in structured overlay networks: a quantitative analysis,” in Proceedings of the 20th Annual Computer Security Applications Conference (ACSAC '04), pp. 252–261, December 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. L. Ganesh and B. Y. Zhao, “Identity theft protection in structured overlays,” in Proceedings of the 1st International Conference on Secure Network Protocols (NPSEC '05), pp. 49–54, IEEE, Washington, DC, USA, 2005.
  4. R. Kaur, A. L. Sangal, and K. Kumar, “Secure Overlay Services (SOS): a critical analysis,” in Proceedings of the 2nd IEEE International Conference on Parallel, Distributed and Grid Computing (PDGC '12), pp. 457–462, December 2012. View at Publisher · View at Google Scholar · View at Scopus
  5. E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, “A survey and comparison of peer-to-peer overlay network schemes,” IEEE Communications Surveys and Tutorials, vol. 7, no. 2, pp. 72–93, 2005. View at Publisher · View at Google Scholar · View at Scopus
  6. E. Sit and R. Morris, “Security considerations for peer-to-peer distributed hash tables,” in Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '01), pp. 261–226, London, UK, 2002.
  7. D. S. Wallach, “A survey of peer-to-peer security issues,” in Proceedings of the International Conference on Software Security: Theories and Systems, pp. 42–57, Berlin, Germany, 2002.
  8. B. Pretre, Attacks on peer-to-peer networks [Ph.D. thesis], Department of Computer Science Swiss Federal Institute of Technology (ETH), Zürich, Switzerland, 2005.
  9. A. Singh, T.-W. Johnny Ngan, P. Druschel, and D. S. Wallach, “Eclipse attacks on overlay networks: threats and defenses,” in Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM '06), Barcelona, Spain, April 2006. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Singh, M. Castro, P. Druschel, and A. Rowstron, “Defending against eclipse attacks on overlay networks,” in Proceedings of the 11th Workshop on ACM SIGOPS European Workshop (EW '11), Leuven, Belgium, September 2004. View at Publisher · View at Google Scholar · View at Scopus
  11. D. Germanus, S. Roos, T. Strufe, and N. Suri, “Mitigating eclipse attacks in peer-to-peer networks,” in Proceedings of the IEEE Conference on Communications and Network Security (CNS '14), pp. 400–408, San Francisco, Calif, USA, October 2014. View at Publisher · View at Google Scholar · View at Scopus
  12. F. D. López-Fuentes, I. Eugui-De-Alba, and O. M. Ortíz-Ruiz, “Evaluating P2P networks against eclipse attacks,” in Proceedings of the Iberoamerican Conference on Electronics Engineering and Computer Science, vol. 3, pp. 61–68, Guadalajara, Mexico, May 2012.
  13. Z. Trifa and M. Khemakhem, “Mitigation of sybil attacks in structured P2P overlay networks,” in Proceedings of the 8th International Conference on Semantics, Knowledge and Grids (SKG '12), pp. 245–248, Beijing, China, 2012.
  14. K. Aberer, A. Datta, and M. Hauswirth, “Efficient, self-contained handling of identity in peer-to-peer systems,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 7, pp. 858–869, 2004. View at Publisher · View at Google Scholar · View at Scopus
  15. H. Rowaihy, W. Enck, P. McDaniel, and T. La Porta, “Limiting sybil attacks in structured P2P networks,” in Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM '07), pp. 2596–2600, May 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. R. Kaur, A. L. Sangal, and K. Kumar, “Analysis of different churn models in chord based overlay networks,” in Proceedings of the Recent Advances in Engineering and Computational Sciences (RAECS '14), pp. 1–6, March 2014. View at Publisher · View at Google Scholar
  17. Y.-K. Kwok, “Autonomic peer-to-peer systems: incentive and security issues,” in Autonomic Computing and Networking, pp. 205–236, Springer, New York, NY, USA, 2009. View at Google Scholar
  18. B. Awerbuch and C. Scheideler, “Towards a scalable and robust DHT,” Theory of Computing Systems, vol. 45, no. 2, pp. 244–260, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. H. V. Jagadish, B. C. Ooi, and Q. H. Vu, “BATON: a balanced tree structure for peer-to-peer networks,” in Proceedings of the 31st International Conference on Very Large Data Bases (VLDB '05), pp. 661–672, September 2005. View at Scopus
  20. A. Rowstron and P. Druschel, “Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems,” in Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware '01), Heidelberg, Germany, 2001.
  21. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao, “Distributed object location in a dynamic network,” in Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 41–52, Winnipeg, Canada, August 2002. View at Scopus
  22. C. Rhea, Open DHT: a public DHT service [Ph.D. thesis], University of California, Berkeley, Calif, USA, 2005.
  23. M. Castro, M. Costa, and A. Rowstron, “Performance and dependability of structured peer-to-peer overlays,” in Proceedings of the International Conference on Dependable Systems and Networks, pp. 9–18, July 2004. View at Scopus
  24. I. Stoica, R. Morris, D. Liben-Nowell et al., “Chord: a scalable peer-to-peer lookup protocol for Internet applications,” IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 17–32, 2003. View at Publisher · View at Google Scholar · View at Scopus
  25. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, “Handling churn in a DHT,” in Proceedings of the USENIX Annual Technical Conference, Boston, Mass, USA, June 2004.
  26. D. Stutzbach and R. Rejaie, “Understanding churn in peer-to-peer networks,” in Proceedings of the 6th ACM SIGCOMM on Internet Measurement Conference (IMC '06), pp. 189–202, October 2006. View at Publisher · View at Google Scholar · View at Scopus
  27. F. Kuhn, S. Schmid, and R. Wattenhofer, “Towards worst-case churn resistant peer-to-peer systems,” Distributed Computing, vol. 22, no. 4, pp. 249–267, 2010. View at Publisher · View at Google Scholar · View at Scopus
  28. Z. Liu, R. Yuan, Z. Li, H. Li, and G. Chen, “Survive under high churn in structured P2P systems: evaluation and strategy,” in Proceedings of the 6th International Conference on Computational Science, pp. 404–411, Reading, UK, May 2006.
  29. F. Kuhn, S. Schmid, and R. Wattenhofe, “A self-repairing peer-to-peer system resilient to dynamic adversarial churn,” in Proceedings of the 4th International Conference on Peer-to-Peer Systems, pp. 13–23, Berlin, Germany, 2005.
  30. J. Liang, R. Kumar, and K. W. Ross, “The kazaa overlay: a measurement study,” Computer Networks Journal, Elsevier, vol. 49, no. 6, 2005. View at Google Scholar
  31. B. Yang and H. Garcia-Molina, “Designing a super-peer network,” Tech. Rep., Stanford University, Stanford, Calif, USA, 2002, http://infolab.stanford.edu/~byang/pubs/superpeer.pdf. View at Google Scholar
  32. S.-J. Zhou, Study on the distributed routing algorithm and its security for Peer-to-Peer computing [Ph.D. thesis], University of Electronic Science and Technology of China, Chengdu, China, 2004.
  33. L. Garces-Erice, E. Biersack, P. Felber, K. Ross, and G. Urvoy Keller, “Hierarchical peer-to-peer systems,” in Euro-Par 2003 Parallel Processing: 9th International Euro-Par Conference Klagenfurt, Austria, August 26–29, 2003 Proceedings, vol. 2790 of Lecture Notes in Computer Science, pp. 1230–1239, Springer, Berlin, Germany, 2003. View at Publisher · View at Google Scholar
  34. W. Nejdl, M. Wolpers, W. Siberski et al., “Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks,” in Proceedings of the 12th International Conference on World Wide Web (WWW '03), pp. 536–543, Budapest, Hungary, May 2003. View at Publisher · View at Google Scholar · View at Scopus
  35. J. Sacha, J. Dowling, R. Cunningham, and R. Meier, “Discovery of stable peers in a self organizing peer-to-peer gradient topology,” in Proceedings of the 6th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems (DAIS '06), pp. 70–83, Athens, Greece, June 2006.
  36. F. Buccafurri and G. Lax, “TLS: a tree-based DHT lookup service for highly dynamic networks,” in Proceedings of the OTM Confederated International Conferences, CoopIS, DOA, and ODBASE, Agia Napa, Cyprus, October 2004.
  37. S. Zöls, Q. Hofstätter, Z. Despotovic, and W. Kellerer, “Achieving and maintaining cost-optimal operation of a hierarchical DHT system,” in Proceedings of the IEEE International Conference on Communications (ICC '09), pp. 1–6, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  38. R. Kaur, A. L. Sangal, and K. Kumar, “Modelling and simulation of adaptive neuro-fuzzy based intelligent system for predictive stabilization in structured overlay networks,” Engineering Science and Technology, an International Journal, 2016. View at Publisher · View at Google Scholar
  39. P. Linga, I. Gupta, and K. Birman, “A churn-resistant peer-to-peer web caching system,” in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '04), February 2004.
  40. M. Castro, M. Costa, and A. Rowstron, “Performance and dependability of structured peer to-peer overlays,” Tech. Rep., Microsoft Research, 2003. View at Google Scholar
  41. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao, “Distributed object location in a dynamic network,” in Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '02), pp. 41–52, August 2002. View at Scopus
  42. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, “Handling churn in a dht,” Tech. Rep. ucb/csd-3-1299, UC Berkeley, Computer Science Division, Berkeley, Calif, USA, 2003. View at Google Scholar
  43. J. Saia, A. Fiat, S. Gribble, A. R. Karlin, and S. Saroiu, “Dynamically fault-tolerant content addressable networks,” in Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, Mass, USA, March 2002.
  44. P. Brighten Godfrey, S. Shenker, and I. Stoica, “Minimizing churn in distributed systems,” in Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 147–158, 2006.
  45. F. E. Bustamante and Y. Qiao, “Designing less-structured P2P systems for the expected high churn,” IEEE/ACM Transactions on Networking, vol. 16, no. 3, pp. 617–627, 2008. View at Publisher · View at Google Scholar · View at Scopus
  46. X. Meng, X. Chen, and Y. Ding, “Using the complementary nature of node joining and leaving to handle churn problem in P2P networks,” Computers and Electrical Engineering, vol. 39, no. 2, pp. 326–337, 2013. View at Publisher · View at Google Scholar · View at Scopus
  47. B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph, “Tapestry: an infrastructure for Fault-tolerant wide-area location and routing,” Tech. Rep. UCB/CSD-01-1141, Computer Science Division, UC Berkeley, Berkeley, Calif, USA, 2001. View at Google Scholar
  48. X. Li, J. Misra, and C. G. Plaxton, “Active and concurrent topology maintenance,” in Proceedings of the 18th International Conference on Distributed Computing (DISC '04), pp. 320–334, Amsterdam, Netherlands, 2004.
  49. M. El Dick, E. Pacitti, R. Akbarinia, and B. Kemme, “Building a peer-to-peer content distribution network with high performance, scalability and robustness,” Information Systems, vol. 36, no. 2, pp. 222–247, 2011. View at Publisher · View at Google Scholar · View at Scopus
  50. Z. Trifa and M. Khemakhem, “A novel replication technique to attenuate churn effects,” Peer-to-Peer Networking and Applications, vol. 9, no. 2, pp. 344–355, 2016. View at Publisher · View at Google Scholar · View at Scopus
  51. D. Korzun and A. Gurtov, “Hierarchical architectures in structured peer-to-peer overlay networks,” Peer-to-Peer Networking and Applications, vol. 7, no. 4, pp. 359–395, 2014. View at Publisher · View at Google Scholar · View at Scopus
  52. T. Koskela, E. Harjula, O. Kassinen, and M. Ylianttila, “Robustness of a P2P community management system based on two-level hierarchical DHT overlays,” in Proceedings of the 16th IEEE Symposium on Computers and Communications (ISCC '11), pp. 881–886, July 2011. View at Publisher · View at Google Scholar · View at Scopus
  53. J. M. B. Rocamora and J. R. I. Pedrasa, “Evaluation of hierarchical DHTs to mitigate churn effects in mobile networks,” Computer Communications, vol. 85, pp. 41–57, 2016. View at Publisher · View at Google Scholar
  54. P. Ganesan, K. Gummadi, and H. Garcia-Molina, “Canon in G major: designing DHTs with hierarchical structure,” in Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS ’04), pp. 263–272, March 2004. View at Scopus
  55. FIPS 180-1, Secure Hash Standard, US Department of Commerce/National Technical Information Service (NIST), Springfield, Va, USA, 1995.
  56. B. Yang and H. Garcia-Molina, “Designing a super-peer network,” Tech. Rep., Designing a Super-Peer Network, 2002, http://wwwdb.stanford.edu/~byang/pubs/superpeer.pdf. View at Google Scholar
  57. I. Baumgart, B. Heep, and S. Krause, “OverSim: a flexible overlay network simulation framework,” in Proceedings of the IEEE Global Internet Symposium (GI '07), pp. 79–84, Anchorage, Alaska, USA, May 2007. View at Publisher · View at Google Scholar · View at Scopus
  58. B. Mitra, F. Peruani, S. Ghose, and N. Ganguly, “Brief announcement: measuring robustness of superpeer topologies,” in Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC '07), pp. 372–373, ACM, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  59. H. V. Jagadish, B. C. Ooi, K.-L. Tan, Q. H. Vu, and R. Zhang, “Speeding up search in peer-to-peer networks with a multi-way tree structure,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1–12, ACM, June 2006. View at Publisher · View at Google Scholar · View at Scopus