A Hybrid Reputation Model through Federation of Peers Having Analogous Function

Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 166)


The widespread usage of peer to peer (P2P) system is visible in all major application areas like, file sharing , high performance computing, P2P TV, P2P IP TV etc. Conversely, the foremost confront in the growth of P2P system is the dearth of an efficient scheme to handle malicious and mysterious nodes. The QoS factor of the system will be deeply reduced by freeriders. To facilitate the augmentation, the system should be able to trim down the influence of malicious nodes with a feasible, proficient and scalable reputation model. Trust value computation among peers outline the basis of reputation model. This paper recommends a hybrid reputation model through federation of peers having analogous function. The grouping of peers having analogous function is introduced to reduce the unnecessary searching. The competence of the model can be augmented by the application of following methods. Application of election algorithm with suggested modification is a solution to central point failure. The ring structure formation of peers having analogues function reduces the search time through the network. In addition to that the behavior prediction of peers is made more accurate using the Markov chain.


Reputation Election algorithm Markov Chain 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wattenhofer, R.: Attacks on Peer-to-Peer Networks. Dept. of Computer Science, Swiss Federal Institute of Technology (ETH) Zurich (Autumn 2005)Google Scholar
  2. 2.
    Tatsuaki, H., Masahiro, F., Yu, W.: ITU-T Recommendations on Peer-to-Peer (P2P) Network Security Google Scholar
  3. 3.
    Ruohomaa, S., Kutvonen, L., Koutrouli, E.: Reputation Management Survey. In: Second International Conference on Availability, Reliability and Security, ARES 2007 (2007) 0-7695-2775-2/07Google Scholar
  4. 4.
    Damiani, E., Vimercati, S., Paraboschi, S., Samarati, P., Violante, F.: A Reputation-based Approach for Choosing Reliable Resources in Peer-to-Peer Networks. In: ACM Symposium on Computer Communication Security, pp. 207–216 (2002)Google Scholar
  5. 5.
    Singh, A., Liu, L.: Trust Me: Anonymous Management of Trust Relationships in Decentralized P2P Systems. In: IEEE IntI. Conf. on Peer-to-Peer Computing, pp. 142–149 (2003)Google Scholar
  6. 6.
    Kamvar, S., Schlosser, M., Garcia-Molina, H.: The Eigen- Trust algorithm for reputation management in P2P networks. In: Proceedings of the Twelwth International World-Wide Web Conference (WWW 2003), pp. 446–458 (2003)Google Scholar
  7. 7.
    Fan, X., Li, M., Ren, Y., Ma, J.: Dual-EigenRep: A Reputationbased Trust Model for P2P File-Sharing Networks. In: Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, uic-atc, pp. 358–363 (2010)Google Scholar
  8. 8.
    Cai, L., Rojas-Cessa, R.: Three-Dimensional Based Trust Management Scheme for Virus Control in P2P Networks. In: Proc. IEEE ICC 2010, CapeTown, South Africa, May 23-27, p. 5 (2010)Google Scholar
  9. 9.
    Zhou, R., Hwang, K.: Gossip-based reputation aggregation for unstructured peer-to-peer networks. In: Proceedings of IEEE International Conference Parallel and Distributed Processing Symposium, pp. 1–10, V3–V23 (2007)Google Scholar
  10. 10.
    Tanenbaum, A.S.: Distributed Operating Systems Google Scholar
  11. 11.
    Norris, J.R.: Markov Chains. Cambridge Series in Statistical and Probabilistic MathematicsGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of Computer ScienceRajagiri School of Engineering & TechnologyCochinIndia

Personalised recommendations