论文标题
基于P2P的社交网络中分布式数据管理的缓存结构
Caching Structures for Distributed Data Management in P2P-based Social Networks
论文作者
论文摘要
分布式应用程序需要新颖的解决方案来解决由于资源（例如带宽，内存和处理能力）缺乏资源而引起的问题。在分布式数据管理中可以看到这些挑战之一。挑战是确保访问时内容有效并在更改时立即更新的两个部分问题。在考虑基于P2P的分布式在线社交网络时，这一点尤其困难，该网络旨在在通常不可靠和不安全的设备上建立可靠，安全的社交网络平台。在本文中，我们提出了三种选择策略，即随机，趋势和社会得分，以实现社会缓存机制。他们考虑社交网络中的社交互动模式。我们在基于DHT的分布式在线社交网络中实施和评估它们，称为Libresocial，并表明社交得分是最佳策略。此外，我们实施了社交缓存解决方案，还表明，与现有的缓存解决方案结合使用时，几乎所有请求都可以通过缓存服务，同时在更新过程中保留数据的一致性。
Distributed applications require novel solutions to tackle problems that arise due to the scarcity of resources such as bandwidth, memory and processing power. One of these challenges is seen in distributed data management. The challenge is the two part problem of ensuring that the content is valid when accessed and updating it immediately when changed. This is especially difficult when considering p2p-based distributed online social networks, which aim to build reliable, secure social networking platforms on top of often unreliable and unsecure devices. In this paper, we propose three selection strategies, random, trend and social score, for a social caching mechanism. They consider the social interaction patterns in the social network. We implement and evaluate them in a DHT-based distributed online social networks called LibreSocial and show that the social score is the best strategy. Further we implement the social caching solution and also show that when used in combination with the existing caching solution almost all requests can be serviced via cache while retaining the consistency of data during updates.
