• DocumentCode
    3544984
  • Title

    Performance Improvement of Overlay Networks for P2P Systems Using Trust-Based Mechanisms

  • Author

    Khan, Ayaz Ul Hassan ; Arshad, Shoieb

  • Author_Institution
    Dept. of Inf. & Comput. Sci., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia
  • fYear
    2012
  • fDate
    8-10 Feb. 2012
  • Firstpage
    550
  • Lastpage
    553
  • Abstract
    Emergence of peer-to-peer (P2P) networks has provided a new dimension to overlay networks. People can help each other by sharing the contents of which other people may not have strength to purchase. Besides these generous peers, there are some other peers who always try to harm the network by providing harmful data or just block the activities with invalid responses and dropping lookup queries to fail the searches by the source peers. These problems force the researchers to introduce trust system into the peer-to-peer networks to isolate the malicious nodes from the generous nodes. In this paper, we have evaluated the effects of malicious nodes in the network by running the simulation of GIA (GIAnduia: an unstructured P2P network, creates the overlay network based on nodes capacities) using OverSim and found out that how we can improve the performance of P2P systems by creating the network based on trust -- based topologies.
  • Keywords
    computer network security; peer-to-peer computing; telecommunication network topology; trusted computing; GIAnduia; OverSim; content sharing; overlay network; peer-to-peer network; performance improvement; topology; trust-based mechanism; unstructured P2P network; Bandwidth; Communities; Computational modeling; Network topology; Peer to peer computing; Time measurement; Topology; OverSim; P2P Simulator; P2P systems; overlay networks; trust-based topologies; trust-model;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Systems, Modelling and Simulation (ISMS), 2012 Third International Conference on
  • Conference_Location
    Kota Kinabalu
  • Print_ISBN
    978-1-4673-0886-1
  • Type

    conf

  • DOI
    10.1109/ISMS.2012.135
  • Filename
    6169761