论文出处： http://netdb09.cis.upenn.edu/netdb09papers/netdb09-final3.pdf
The abstract:
Online Social Networks (OSN) face serious scalability challenges due to their rapid growth and popularity. To address this issue we present a novel approach to scale up OSN called One Hop Replication (OHR). Our system combines partitioning and replication in a middleware to transparently scale up a centralized OSN design, and therefore, avoid the OSN application to undergo the costly transition to a fully distributed system to meet its scalability needs.
OHR exploits some of the structural characteristics of Social Networks: 1) most of the information is one-hop away, and 2) the topology of the network of connections among people displays a strong community structure. We evaluate our system and its potential benefits and overheads using data from real OSNs: Twitter and Orkut. We show that OHR has the potential to provide out-of-the-box transparent scalability while maintaining the replication overhead costs in check.
论文中这个图，做的很直观，很清晰的给出了传统的DB和目前流行的分散DB的区别..
The OHR system is composed of two components: the controller and the middleware.
基本上就是这2个东西起了作用，不过什么时候这个controller能够更加人工智能就好了.具体太细节的东西，文章也没说多少。
分析结果就是拿了2个data-sets来分析的，twitter和orkut的数据
……………………
最终实验平台，好像是在Amazon的EC2上进行的，在韩国这边不是太了解这个EC2，感觉应该是在美国非常的流行了。之前有看到EC2针对教育行业有个discount的消息，其实这个实验在EC2上能够顺利的进行的话，也就不用自己再单独购买机器了。这也是cloud computing的优势之一……
^^^^^^^^^^^^^
最后再推荐一个ppt
http://www.cs.cornell.edu/projects/ladis2009/talks/dean-keynote-ladis2009.pdf
Jeff Dean的又一篇ppt长达73页，可以看到google在达拉斯的machine farm均当30个机柜的存储能力
标签：cloud computing, Google, Jeff Dean, Networks, Online, OSN, Paper, Scaling, Social
Post comment