FroDO: Friendly Routing Over Dunbar-based Overlays

Centralized Online Social Networks (OSNs) have become the main communication channel in both the personal and the business domain. A current trend for developing OSN services is towards the distribution of the social network infrastructure by using P2P architectures as basis for Distributed Online Social Networks (DOSNs). One of the main challenges of DOSNs comes from guaranteeing privacy and protection of private data. To ensure a certain level of trust, we propose a Dunbar-based approach applied to Pastry. Furthermore, we introduce goLLuM, a general solution, which overrides drawbacks of the previous solution and which can be used in structured and unstructured P2P networks. Our protocol enables to route messages via friendly nodes only, even if only few friends per node exist. By using synthetic models and real-data traces for the representation of friendship relationships we compare a baseline with a more refined algorithm and show the effectiveness of the latter