The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Eight friends are enough: social graph approximation via public listings
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
PeerSoN: P2P social networking: early experiences and insights
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
Semantic social overlay networks
IEEE Journal on Selected Areas in Communications
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper presents our approach to use social network information in P2P networks in order to efficiently retrieve relevant information by exploiting existing trust relations of the social network links. The novelty of our work is to demonstrate that only a subset of the whole social network is adequate to build an efficient and reliable service. We use our P2P network, which is an adaptation of virtual ring routing mechanisms originally proposed for ad-hoc networks, to deploy a directory service facilitating search for friends - a common functionality required in online social networks as well. We expect our mechanism can be used in facilitating the deployment of peer-to-peer online social networks. Small scale experiment results, using both artificial as well as real social network graphs, show that with even only small subset of nodes from the whole social network, the approach achieves a high level of query success.