Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Choosing reputable servents in a P2P network
Proceedings of the 11th international conference on World Wide Web
Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
Proceedings of the 13th international conference on World Wide Web
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
DKOMP: a peer-to-peer platform for distributed knowledge management
PAKM'06 Proceedings of the 6th international conference on Practical Aspects of Knowledge Management
| Hi-index | 0.00 |
Searching social networks is determined by two factors: reputation and relevance. Reputation is the memory and summary of behavior from past transactions. Relevance is the probability that useful information can be obtained from a person. Search in social networks is performed by asking persons of high relevance and a good reputation or persons who are supposed to know somebody like that. We describe how these social aspects can be used in peer-to-peer networks in order to increase efficiency and scalability. Based on a social peer-to-peer network a knowledge management application with advantages over centralized approaches can be implemented.