Volume 2, Issue 1, January 2016, Page: 9-14
Heal Gossip: A Secure Overlay for Unstructured P2P Networks
Anubhava Srivastava, Dept. of Computer Science and Engineering, United College of Engineering and Research, Allahabad, U.P., India
Dharmendra Kumar, Dept. of Computer Science and Engineering, United College of Engineering and Research, Allahabad, U.P., India
Received: Jan. 7, 2016;       Accepted: Jan. 20, 2016;       Published: Jan. 29, 2016
DOI: 10.11648/j.ijdst.20160201.13      View  3265      Downloads  78
Abstract
Gossip-based protocols are an e cient mechanism for man-aging pure unstructured peer-to-peer (P2P) networks. Such protocols are Newscast, Cyclone, Lbpcast, etc. They have overcome from several di culties of such P2P random overlay connection. Such difficulties are randomness, high churn rate, very large unstructured distributed net-work, etc. But the performance of all gossip-based protocols have been completely vanished by presence of few malicious nodes. Since, non-detectable messages and behaviour of attackers are not leave them se-cure. These malicious nodes divide the overlay into several isolated clusters such as in Hub Attack or may be engaged non-malicious nodes in such a way that they are denying actual work such as in Denial of Ser-vice (DoS) Attacks. For securing unstructured P2P networks, there are some existing security protocols such as Secure Peer Sampling (SPSS), TooLate, S-Gossip etc. They are able to identify the malicious nodes and restrict them from gossiping. But restricting some malicious nodes on each node is not sufficient the security purpose of such epidemic over-lays. Especially in completely distributed networks, the malicious nodes may affect other non-malicious nodes although they have been already captured and restricted for gossip on others. In this regards, a new gossip mechanism is proposed, named HealGos-sip. It uses an additional property to inform captured malicious nodes on a node to all its neighbours. This process helps to identify and re-strict malicious nodes faster than other security mechanism. The propose mechanism relief the non-malicious nodes from the group of malicious nodes while performing detecting process. Hence, the propose protocol reduces the communication overhead as well as paralyses almost all malicious nodes within the network. For confusing among malicious and non-malicious nodes while detecting, a new variant of Hub attack is pro-posed and is called Hide and Seek (HnS) attack. It is able to miss-lead existing security protocols regarding the restriction of malicious nodes from gossip.
Keywords
Heal Gossip, Pear to Pear Network, Hide and Seek Attack Model, S-Gossip, Routing
To cite this article
Anubhava Srivastava, Dharmendra Kumar, Heal Gossip: A Secure Overlay for Unstructured P2P Networks, International Journal on Data Science and Technology. Vol. 2, No. 1, 2016, pp. 9-14. doi: 10.11648/j.ijdst.20160201.13
Copyright
Copyright © 2016 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Reference
[1]
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. IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 17-32, (2003).
[2]
A. Rowstron and P. Druschel: Pastry- Scalable, decentralized object location and routing for large-scale peer-to-peer systems. in Proc. of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329-350, (2001).
[3]
S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz: Handling churn in a DHT. in Proc. of the USENIX Annual Technical Conference. Berkeley, CA, USA: USENIX Association, pp. 10-23, (2004).
[4]
A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry: Epidemic algorithms for replicated database mainte-nance. in Proc. of the 6th ACM Symposium on Principles of Distributing Computing (PODC87), pp. 1-12, (1987).
[5]
P. T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massouli: Epidemic infor-mation dissemination in distributed systems. IEEE Computer, vol. 37, no. 5, pp. 60-67, (2004).
[6]
M. Jelasity, A. Montresor, and O. Babaoglu: A modular paradigm for building self-organizing peer- to-peer applications. in Proc. of Engineering Self- Organising Systems. Springer, pp. 265-282, (2004).
[7]
Mark Jelasity, Alberto Montresor, and Ozalp Babaoglu: The bootstrapping service. in Proc. Of the 26th IEEE International Conference Workshops on Distributed Computing Systems (IDCSW06). IEEE Computer Society, pp. 11-16, (2006).
[8]
S. Voulgaris and M. van Steen, Epidemic-style management of semantic overlays for content-based searching. in Proc. of Euro-Par 2005 Parallel Processing, pp. 1143-1152, (2005).
[9]
S. Voulgaris, D. Gavidia, and M. van Steen: Cyclon- Inexpensive membership man-agement for unstructured P2P overlays. Journal of Network and Systems Manage-ment, vol. 13, no. 2, pp. 197-217, (2005).
[10]
Marin Bertier, Francois Bonnet, Anne-Marie Kermarrec, Vincent Leroy, Sathya Peri, Michel Raynal: D2HT- The Best of Both Worlds, Integrating RPS and DHT. European Dependable Computing Conference, pp. 135 (144, (2010).
[11]
G. P. Jesi, A. Montresor and M. van Steen: A Secure Peer Sampling., Elsevier Journal, 54, pp. 2086-2098, (2010).
[12]
G. P. Jesi, D. Hales, and M. van Steen: Identifying Malicious Peers Before its TooLate: A Decentralized Secure Peer Sampling Service. IEEE SASO, Boston, MA(USA), (2007).
[13]
Sumit Kumar Tetarave, SomanathTripathy, SathyaPeri. S-Gossip: Security En-hanced Gossip Protocol for Unstructured P2P Networks, 11th International Con-ference on Distributed Computing and Internet Technology, Springer, Volume 8956, pp 288-298, (2015).
[14]
Anceaume, Emmanuelle and Busnel, Yann and Gambs, Sebastien: Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes. Springer, ISBN: 978-3-642-17652-4, Tozeur, Tunisie, (2010).
[15]
Bortnikov, Edward and Gurevich, Maxim and Keidar, Idit and Kliot, Gabriel and Shraer, Alexander: Brahms: byzantine resilient random membership sampling. Pro-ceedings of the twenty-seventh ACM symposium on Principles of distributed com-puting, Toronto, Canada, (2008).
[16]
A. Montresor and M. Jelasity: PeerSim: A scalable P2P simulator., IEEE Ninth International Conference, pp. 99-100 (2009).
Browse journals by subject