IJRIT International Journal of Research in Information Technology, Volume 2, Issue 8, August 2014, Pg. 43-47

International Journal of Research in Information Technology (IJRIT)

www.ijrit.com

ISSN 2001-5569

A Survey on Shrinking Of Destructive Actions in Peer To Peer Systems A.Rupa1, D.Jamuna2 1

2

M.Tech Student, Dept of CSE, CMR Institute of Technology, Kandlakoya Medchal, Hyderabad, India

Associate Professor, Dept of CSE, CMR Institute of Technology, Kandlakoya Medchal, Hyderabad, India

ABSTRACT The speedy expansion of Internet and accompanying networking technologies have made it promising in support of any computer in the region of globe to take part in a collaborative situation. Peer to peer networks is used as a means of transport to blowout malware that offers some significant benefits above worms that spread by scanning for susceptible hosts which is mainly due to the procedure engaged by the peers to examine for content. Self organizing system, enables peers to set up stronger confidence relationships and peers transmit queries of reputation only to peers interacted in the earlier period, which reduces network traffic when compared to the approaches of flooding-based. Intergroup behaviour is a tricky and intricate subject. Groups have been found to perform in destructive manner in the direction of members of previous groups with which they are in opposition. Recent work has recommended that phenomenon is persistent in networks happening in nature as well as technology, and a basic component in the structural progression of World Wide Web.

Keywords:

Malware,

Intergroup

behaviour,

Self

organizing

system,

World

Wide

Web.

I. INTRODUCTION In a P2P communication, conventional difference among clients and back-end servers is merely disappearing. A peer turns out to be an associate of another peer subsequent to providing a service. If a peer has no association, it decides to trust strangers [4]. An acquaintance is always chosen over a stranger if they are evenly dependable. In various times, information concerning the interactions of past and recommendations are accumulated to weigh up capability and reliability of acquaintances [7]. By means of information of trust does not explain all safety problems in the systems of peer to peer however can augment safety and efficiency of systems. Self organizing system was proposed that intends to decrease malicious action in a peer to peer system by means of setting up relations of trust between peers in their propinquity [10]. Peer to peer networks is used as a means of transport to blowout malware that offers some significant benefits above worms that spread by scanning for susceptible hosts which is mainly due to the procedure engaged by the peers to examine for content. When self organizing A.Rupa, IJRIT

43

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 8, August 2014, Pg. 43-47

system is used, peers structure their individual trust network with time and do not appeal recommendations from unreliable peers [8]. A tool of peer to peer file sharing simulation was implemented and conducted research to appreciate impact of self organizing system in the attacks of mitigating [5]. If interactions are modelled accurately, then self organizing system can be modified to a variety of peer to peer applications and hence considers services of providing and giving suggestions as different responsibilities and describes two contexts of trust such as contexts of service and recommendation [1] [3]. Peers are supposed to be strangers to each other at the beginning in the model of self organizing system and by means of a service of a peer is an interface, which is evaluated on the basis of weight and recentness of the communication, and approval of the requester [11]. Recommender’s responsibility and assurance concerning recommendation are measured when assessing recommendations in addition; service and recommendation contexts are separated and enabled us to determine constancy in an extensive selection of attack situations [6] [15]. The central server firmly accumulates trust information and describes the metrics of trust. Each peer build up its individual local view of trust concerning the peers interacted in the earlier period [9].

Fig1: An overview of peer to peer network

II. LITERATURE SURVEY 1. Ahmet Burak Can, and Bharat Bhargava [2] suggests that in self organizing system to appraise connections and recommendations improved, significance and parameters of peer satisfaction are measured. When self organizing system is used, peers structure their individual trust network with time and do not appeal recommendations from unreliable peers as a result, can efficiently alleviate attacks of recommendation support with time. Peers do not attempt to gather trust information from all peers. Self organizing system defines three metrics of trust, a peer interrelates less with new arrivals as its set of connections grows and as a result rate of attacks of service-based reduces with time. Metric of reputation is considered which is based on recommendations. In view of the fact that self organizing system assembles recommendations only from acquaintances, the queries of reputation return additional reliable information. When calculating the metric of A.Rupa, IJRIT

44

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 8, August 2014, Pg. 43-47

reputation, recommendations are calculated on the basis of trust metric of recommendation. In addition, every peer expands its trust system with time in addition can get hold of additional convincing recommendations from acquaintances. Self organizing system, enables peers to set up stronger confidence relationships and peers transmit queries of reputation only to peers interacted in the earlier period, which reduces network traffic when compared to the approaches of flooding-based shown on fig1. It is significant while deciding concerning strangers and novel connections and losses of reputation its significance as understanding with an acquaintance augments.

2. K. Aberer and Z. Despotovic [16] recommends that in a P2P communication, conventional difference among clients and back-end servers is merely disappearing. Peer to peer networks is used as a means of transport to blowout malware that offers some significant benefits above worms that spread by scanning for susceptible hosts which is mainly due to the procedure engaged by the peers to examine for content. Each node of system plays the responsibility of client as well as server. Gnutella is a superior example of a P2P achievement narrative which is moderately straightforward software enables Internet users to generously replace files. The basic difficulty associated towards reputation-based trust management in P2P system is that information concerning transactions carried out among peers is disseminated through-out network with the intention that each peer can merely construct an approximation of comprehensive situation within network. A structural design was put up in support of trust management which relies on the entire system layers, specifically network, storage as well as trust management, on peer-to-peer method.

3. J. Kleinberg [13] suggest that a social complex demonstrate small-world incident if, approximately speaking, any two persons within the network are probable to be associated all the way through a short sequence of intermediary connections. This has long been the focus of anecdotal inspection and folklore; regularly we congregate a stranger and find out that we have an acquaintance in general. Recent work has recommended that phenomenon is persistent in networks happening in nature as well as technology, and a basic component in the structural progression of World Wide Web. In recent times, a model was put forward in support of small-world phenomenon based on a category of random networks that interpolates among two extremes. Such a representation captures critical parameters of social networks such as there is an undemanding fundamental structure that describes the occurrence of the majority edges, but a only some edges are formed by a unsystematic process that does not esteem this structure.

4. S. Marsh [12] proposed that intergroup behaviour is a tricky and intricate subject. Groups have been found to perform in destructive manner in the direction of members of previous groups with which they are in opposition. Trust is undeniably a significant characteristic of everyday lives. Devoid of a background of conviction, it has been recommended, we would experience from a loss of effectiveness as well as dynamism. There are numerous views of conviction and there are more than a little reason for this. Two of these reasons are prominent to be presented particularly, since they handle on most important problems that rise in way of formalising the notion. We are all experts on conviction, not less than our own trademark of it, and there is difficulty, because, as there

A.Rupa, IJRIT

45

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 8, August 2014, Pg. 43-47

are so various different experts, each of which might identify trust in a different way, there are as a lot of contradictory definitions, and consequently views, of trust.

5. Z. Despotovic and K. Aberer [14] suggests that abundant works on reputation as well as trust management in online communities have come out in recent times. The speedy expansion of Internet and accompanying networking technologies have made it promising in support of any computer in the region of globe to take part in a collaborative situation. The reputation management component is accountable in support of collecting information concerning past behaviour of members of neighbourhood under deliberation plus making this information accessible for others to utilize. After data concerning past interactions of possible partners has been gathered, the trust management component comes into play by means of calculating prediction of their upcoming performance. The decision making component, analyse performance of those predictions in communication that is about to occur and having threat averseness connected inputs from user, make assessment whether to interrelate or not. The consequence of interactions is subsequently fed back into reputation management component in support of future use.

III. CONCLUSION A tool of peer to peer file sharing simulation was implemented and conducted research to appreciate impact of self organizing system in the attacks of mitigating. Self organizing system was proposed that intends to decrease malicious action in a peer to peer system by means of setting up relations of trust between peers in their propinquity. When self organizing system is used, peers structure their individual trust network with time and do not appeal recommendations from unreliable peers as a result, can efficiently alleviate attacks of recommendation support with time. The basic difficulty associated towards reputation-based trust management in P2P system is that information concerning transactions carried out among peers is disseminated through-out network with the intention that each peer can merely construct an approximation of comprehensive situation within network. In recent times, a model was put forward in support of small-world phenomenon based on a category of random networks that interpolates among two extremes. The reputation management component is accountable in support of collecting information concerning past behaviour of members of neighbourhood under deliberation plus making this information accessible for others to utilize.

VI. REFERENCES [1] S. Staab, B. Bhargava, L. Lilien, A. Rosenthal, M. Winslett, M. Sloman, T. Dillon, E. Chang, F.K. Hussain, W. Nejdl, D. Olmedilla, and V. Kashyap, “The Pudding of Trust,” IEEE Intelligent Systems, vol. 19, no. 5, pp. 74-88, 2004. [2] SORT: A Self-ORganizing Trust Model for Peer-to-Peer Systems Ahmet Burak Can, and Bharat Bhargava, 2013 [3] S. Saroiu, K. Gummadi, R. Dunn, S.D. Gribble, and H.M. Levy, “An Analysis of Internet Content Delivery Systems,” Proc. Fifth USENIX Symp. Operating Systems Design and Implementation (OSDI), 2002. A.Rupa, IJRIT

46

IJRIT International Journal of Research in Information Technology, Volume 2, Issue 8, August 2014, Pg. 43-47

[4] G. Swamynathan, B.Y. Zhao, and K.C. Almeroth, “Decoupling Service and Feedback Trust in a Peer-toPeer Reputation System,” Proc. Int’l Conf. Parallel and Distributed Processing and Applications (ISPA), 2005. [5] F. Cornelli, E. Damiani, S.D.C. di Vimercati, S. Paraboschi, and P. Samarati, “Implementing a ReputationAware Gnutella Servent,” Proc. Networking 2002 Workshops Web Eng. and Peer-to-Peer Computing, 2002. [6] H. Yu, M. Kaminsky, P.B. Gibbons, and A. Flaxman, “Sybilguard: Defending against Sybil Attacks via Social Networks,” ACM SIGCOMM Computer Comm. Rev., vol. 36, no. 4, pp. 267-278, 2006. [7] M. Ripeanu, I. Foster, and A. Iamnitchi, “Mapping the Gnutella Network: Properties of Large-Scale Peer-toPeer Systems and Implications for System Design,” IEEE Internet Computing, vol. 6, no. 1, pp. 50-57, Jan. 2002. [8] M. Virendra, M. Jadliwala, M. Chandrasekaran, and S. Upadhyaya, “Quantifying Trust in Mobile Ad-Hoc Networks,” Proc. IEEE Int’l Conf. Integration of Knowledge Intensive Multi-Agent Systems (KIMAS), 2005. [9] Y. Wang and J. Vassileva, “Bayesian Network Trust Model in Peer-to-Peer Networks,” Proc. Second Workshop Agents and Peer-to-Peer Computing at the Autonomous Agents and Multi Agent Systems Conf. (AAMAS), 2003. [10] A. Habib, D. Xu, M. Atallah, B. Bhargava, and J. Chuang, “A Tree- Based Forward Digest Protocol to Verify Data Integrity in Distributed Media Streaming,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 7, pp. 1010-1014, July 2005. [11] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” ACM SIGCOMM Computer Comm. Rev., vol. 31, no. 4, pp. 149160, 2001. [12] S. Marsh, “Formalising Trust as a Computational Concept,” PhDthesis, Dept. of Math. and Computer Science, Univ. of Stirling,1994 [13] J. Kleinberg, “The Small-World Phenomenon: An AlgorithmicPerspective,” Proc. 32nd ACM Symp. Theory of Computing, 2000. [14] Z. Despotovic and K. Aberer, “Trust-Aware Delivery of CompositeGoods,” Proc. First Int’l Conf. Agents and Peer-to-Peer Computing,2002 [15] E. Terzi, Y. Zhong, B. Bhargava, Pankaj, and S. Madria, “An Algorithm for Building User-Role Profiles in a Trust Environment,” Proc. Fourth Int’l Conf. Data Warehousing and Knowledge Discovery (DaWaK), vol. 2454, 2002. [16] K. Aberer and Z. Despotovic, “Managing Trust in a Peer-2-PeerInformation System,” Proc. 10th Int’l Conf. Information and KnowledgeManagement (CIKM), 2001

A.Rupa, IJRIT

47