An Inter-peer Trustworthiness Based on Access Control in Peer-to-Peer Overlay Networks

We discuss a fully distributed peer-to-peer (P2P) overlay network where each peer is autonomous and accesses to objects distributed in peers by taking advantage of acquaintances. An acquaintance peer of a peer p is a peer about whose service the peer p knows and with which the peer p can directly communicate. The satisfiability is defined to how satisfiable a requesting peer is for each access request by newly taking into account the authorization. The trustworthiness of each acquaintance is calculated by aggregating the satisfiability obtained through each interaction with the acquaintance. If acquaintance information is changed, the change is propagated to peers through acquaintances. Due to the limited size of memory, the peer throws away information of less trustworthy acquaintances to make space to store new acquaintance information. The trustworthiness of acquaintance of each peer is propagated in a peer-by-peer way while some acquaintance information is recorded in a peer. We discuss how to calculate the trustworthiness, satisfiability, and exchange the acquaintance information then with acquaintances. We evaluate how the trustworthiness of acquaintance is changing through interactions among peers and the hit ratio can be improved for a detection request