• DocumentCode
    2179629
  • Title

    Trustworthiness of Peers Based on Access Control in Peer-to-Peer Overlay Networks

  • Author

    Watanabe, Kenichi ; Nakajima, Yoshio ; Hayashibara, Naohiro ; Enokido, Tomoya ; Takizawa, Makoto ; Deen, S. Misbah

  • Author_Institution
    Tokyo Denki University, Japan
  • fYear
    2006
  • fDate
    04-07 July 2006
  • Firstpage
    74
  • Lastpage
    74
  • Abstract
    Service supported by an object in a peer-to-peer (P2P) overlay network is modeled to be a set of methods and quality of service (QoS). In addition to discovering a peer holding a target object, it is critical to discuss what peer is allowed to manipulate the target object in what method. In this paper, we take an acquaintance approach to finding and manipulating objects in P2P overlay networks. An acquaintance peer of a peer is a peer whose service the peer knows and with which the peer can directly communicate In this paper, we discuss ways to obtain results satisfying an access request by the cooperation of acquaintances. Acquaintance peers of a peer p may hold different information on target peers since it takes time to propagate change information of the target peers, and peers may be faulty. Here, it is critical to discuss how much a peer can trust each acquaintance. First, we define how much a requesting peer is satisfied for each access request issued to an acquaintance. Then, we define the trustworthiness of an acquaintance based on the satisfiability.
  • Keywords
    Access control; Computer networks; Databases; Encapsulation; Intelligent networks; Object detection; Peer to peer computing; Permission; Quality of service; Scalability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing Systems Workshops, 2006. ICDCS Workshops 2006. 26th IEEE International Conference on
  • ISSN
    1545-0678
  • Print_ISBN
    0-7695-2541-5
  • Type

    conf

  • DOI
    10.1109/ICDCSW.2006.112
  • Filename
    1648963