Exploiting locality of interest in online social networks

Online Social Networks (OSN) are fun, popular, and socially significant. An integral part of their success is the immense size of their global user base. To provide a consistent service to all users, Facebook, the world’s largest OSN, is heavily dependent on centralized U.S. data centers, which renders service outside of the U.S. sluggish and wasteful of Internet bandwidth. In this paper, we investigate the detailed causes of these two problems and identify mitigation opportunities. Because details of Facebook’s service remain proprietary, we treat the OSN as a black box and reverse engineer its op-eration from publicly available traces. We find that contrary to current wisdom, OSN state is amenable to partitioning and that its fine grained distribution and processing can signifi-cantly improve performance without loss in service consis-tency. Through simulations of reconstructed Facebook traf-fic over measured Internet paths, we show that user requests can be processed 79 % faster and use 91 % less bandwidth. We conclude that the partitioning of OSN state is an attrac-tive scaling strategy for Facebook and other OSN services. 1