arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2004.07033cs.SIcs.DC
收藏

P2P-based社交网络中分布式数据管理的缓存结构

Caching Structures for Distributed Data Management in P2P-based Social Networks

Newton Masinde, Moritz Kanzler, Kalman Graffi

摘要:

分布式应用程序需要新的解决方案来解决由于带宽、内存和处理能力等资源稀缺而出现的问题。分布式数据管理就是这些挑战之一。挑战是两个部分的问题,确保内容在访问时是有效的,并在更改时立即更新。当考虑到基于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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑