Towards robust and scalable peer-to-peer social networks.
EUROSYS(2012)
摘要
ABSTRACTPeer-to-peer Online Social Networks (OSNs) promise to combine the functionalities of centralized OSNs with the good properties of peer-to-peer systems. However, in time, the number of connections between users of OSNs grows super-linearly in the number of users: the average node degree increases with the overall system size. In large-scale settings, mapping each friendship relation into an overlay link will thus overwhelm popular nodes. We propose simple techniques to build and maintain the peer-to-peer OSN overlay while significantly shifting node degrees towards lower ranges. We evaluate our algorithms using real large-scale datasets, and show that they can disseminate information efficiently while controlling node degrees, even in the presence of high churn.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络