[15] Peer-to-Peer Architecture Case Study: Gnutella Network
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Charge-Based Flooding Algorithm for Detecting Multimedia Objects in Peer-to-Peer Overlay Networks
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Exploiting the TTL Rule in Unstructured Peer-to-Peer Networks
WETICE '06 Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises
LagOver: Latency Gradated Overlays
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Query-driven indexing for scalable peer-to-peer text retrieval
Proceedings of the 2nd international conference on Scalable information systems
Research on the Backup Mechanism of Oracle Database
ESIAT '09 Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02
Trustworthiness of Acquaintances in Peer-to-Peer(P2P) Overlay Networks
CISIS '10 Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive Systems
Subjective and Objective Types of Trustworthiness in Peer-to-Peer(P2P) Overlay Networks
WAINA '10 Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops
A framework for interest-based community evolution and sharing of latent knowledge
International Journal of Grid and Utility Computing
Hi-index | 0.00 |
In fully distributed P2P overlay networks, each peer has to obtain information on objects distributed through communicating with its acquaintances. An acquaintance might hold obsolete information due to the propagation delay and faults of peers. Hence, a peer has to collect information only from trustworthy acquaintances. The subjective trustworthiness shows how much a peer trusts its acquaintance. The objective trustworthiness indicates how much other peers trust the acquaintance. We discuss three algorithms to calculate the objective trustworthiness. The algorithm OT1 shows a type of flooding algorithm. A peer sends request messages only to the acquaintances to reduce the number of messages in the algorithms OT2 and OT3. Furthermore, the peer ps sends messages to only acquaintances which the peer ps can trust in OT3. Then, the peer ps receives the subjective trustworthiness on the acquaintance from the acquaintance p2. The peer pu obtains the average value of the subjective trustworthiness collected as the objective trustworthiness. We evaluate the three algorithms in terms of how correct objective trustworthiness can be obtained by the algorithms.