The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Neko: A Single Environment to Simulate and Prototype Distributed Algorithms
ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Role-Based Access Control
[15] Peer-to-Peer Architecture Case Study: Gnutella Network
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
A Distributed Approach to Solving Overlay Mismatching Problem
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
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
An efficient nearest neighbor algorithm for P2P settings
dg.o '05 Proceedings of the 2005 national conference on Digital government research
Trustworthiness in Peer-to-Peer Overlay Networks
SUTC '06 Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06) - Volume 01
A Multi-Source Streaming Model for Mobile Peer-to-Peer (P2P) Overlay Networks
NBiS '08 Proceedings of the 2nd international conference on Network-Based Information Systems
Engineering of Software-Intensive Systems: State of the Art and Research Challenges
Software-Intensive Systems and New Computing Paradigms
Trustworthy acquaintances in Peer-to-Peer (P2P) overlay networks
International Journal of Business Intelligence and Data Mining
Journal of Mobile Multimedia
TMPR-scheme for reliably broadcast messages among peer processes
International Journal of Grid and Utility Computing
P2P data replication and trustworthiness for a JXTA-Overlay P2P system using fuzzy logic
Applied Soft Computing
Hi-index | 0.00 |
A large number of peer processes are distributed in a peer-to-peer (P2P) overlay network. It is difficult, maybe impossible for a peer to perceive the membership and location of every resource object due to the scalability and openness of a P2P network. In this article, we discuss a fully distributed P2P system where there is no centralized controller. Each peer has to obtain service information from its acquaintance peers and also send its service information to the acquaintance peers. 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 in an overlay network. Some acquaintance peer might hold obsolete service information and might be faulty. Each peer has to find a more trustworthy one among acquaintance peers. There are many discussions on how to detect peers that hold a target object. However, a peer cannot manipulate an object without being granted access rights (permissions). In addition to detecting what peers hold a target object, we have to find peers granted access rights to manipulate the target object. The trustworthiness of each acquaintance is defined in terms of the satisfiability and ranking factor in this article. The satisfiability of an acquaintance peer shows how much each peer can trust the acquaintance peer through direct communication to not only detect target objects but also obtain their access rights. On the other hand, the ranking factor of an acquaintance peer indicates how much the acquaintance peer is trusted only by trustworthy acquaintance peers which is different from the traditional reputation concept. We evaluate how the trustworthiness of an acquaintance peer is changed through interactions among peers in a detection algorithm.