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 impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
A scalable content-addressable network
Identity Crisis: Anonymity vs. Reputation in P2P Systems
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
SPROUT: P2P routing with social networks
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
SLACER: A Self-Organizing Protocol for Coordination in Peer-to-Peer Networks
IEEE Intelligent Systems
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Implementing ReGreT in a Decentralized Multi-agent Environment
MATES '07 Proceedings of the 5th German conference on Multiagent System Technologies
Secure Forwarding in DHTs - Is Redundancy the Key to Robustness?
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Proceedings of the 1st Workshop on Social Network Systems
Friendstore: cooperative online backup using trusted nodes
Proceedings of the 1st Workshop on Social Network Systems
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Reputation management algorithms for DHT-based peer-to-peer environment
Computer Communications
Exploring the Feasibility of Reputation Models for Improving P2P Routing under Churn
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
An intrusion detection system in ad hoc networks: a social network analysis approach
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
A framework for rank computation and aggregation in fuzzy environments
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
A market-based approach to managing the risk of peer-to-peer transactions
Computer Networks: The International Journal of Computer and Telecommunications Networking
Availability for DHT-based overlay networks with unidirectional routing
WISTP'08 Proceedings of the 2nd IFIP WG 11.2 international conference on Information security theory and practices: smart devices, convergence and next generation networks
Pass it on: social networks stymie censors
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Secure routing strategies in DHT-based systems
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
Toward a behavioral approach to privacy for online social networks
SocInfo'10 Proceedings of the Second international conference on Social informatics
Privacy amplification with social networks
Proceedings of the 15th international conference on Security protocols
Efficient cooperative backup with decentralized trust management
ACM Transactions on Storage (TOS)
Beyond Social Graphs: User Interactions in Online Social Networks and their Implications
ACM Transactions on the Web (TWEB)
Sophia: A local trust system to secure key-based routing in non-deterministic DHTs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The equality and anonymity of peer-to-peer networks makes them vulnerable to routing denial of service attacks from misbehaving nodes. In this paper, we investigate how existing social networks can benefit P2P networks by leveraging the inherent trust associated with social links. We present a trust model that lets us compare routing algorithms for P2P networks overlaying social networks. We propose SPROUT, a DHT routing algorithm that significantly increases the probability of successful routing by using social links. Finally, we discuss further optimization and design choices for both the model and the routing algorithm.