research-article

Exploiting locality of interest in online social networks

Authors:

Mike P. Wittie,

Veljko Pejovic,

Kevin C. Almeroth,

Ben Y. ZhaoAuthors Info & Claims

Co-NEXT '10: Proceedings of the 6th International COnference

Article No.: 25, Pages 1 - 12

https://doi.org/10.1145/1921168.1921201

Published: 30 November 2010 Publication History

Abstract

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 operation 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 significantly improve performance without loss in service consistency. Through simulations of reconstructed Facebook traffic 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 attractive scaling strategy for Facebook and other OSN services.

References

[1]

S. Agarwal et al. Volley: Automated data placement for geo-distributed cloud services. In Usenix NSDI, April 2010.

Digital Library

[2]

Y.-Y. Ahn et al. Analysis of topological characteristics of huge online social networking services. In World Wide Web Conference (WWW), May 2007.

Digital Library

[3]

L. Backstrom et al. Group formation in large social networks: membership, growth, and evolution. In ACM KDD, August 2006.

Digital Library

[4]

A. Bakre and B. R. Badrinath. I-TCP: Indirect TCP for mobile hosts. In International Conference on Distributed Computing Systems (ICDCS), May 1995.

Digital Library

[5]

F. Benevenuto et al. Characterizing user behavior in online social networks. In ACM IMC, November 2009.

Digital Library

[6]

J. Carrasco et al. Agency in social activity interactions: The role of social networks in time and space. Journal of Economic and Social Geography, 99(5):562--583, December 2008.

[7]

M. Cha et al. Characterizing social cascades in Flickr. In Sigcomm Workshop on Online Social Networks (WOSN), August 2008.

Digital Library

[8]

G. Chen et al. Energy-aware server provisioning and load dispatching for connection-intensive internet services. In Usenix NSDI, April 2008.

Digital Library

[9]

H. Chun et al. Comparison of online social relations in volume vs interaction: a case study of CyWorld. In ACM IMC, October 2008.

Digital Library

[10]

Facebook. Statistics. http://www.facebook.com/press/info.php?statistics, 2010.

[11]

T. Isdal et al. Leveraging BitTorrent for end host measurements. In Passive and Active Network Measurement (PAM), April 2007.

Digital Library

[12]

N. Kennedy. Facebook's growing infrastructure spending. http://www.niallkennedy.com/blog/2009/03/facebook-infrastructure-financing.html, March 2009.

[13]

R. Kumar et al. Structure and evolution of online social networks. In ACM KDD, August 2006.

Digital Library

[14]

D. Liben-Nowell et al. Geographic routing in social networks. Proceedings of the National Academy of Sciences, 102(33):11623--11628, August 2005.

[15]

A. Mislove et al. Measurement and analysis of online social networks. In ACM IMC, October 2007.

Digital Library

[16]

A. Nazir et al. Network level footprints of Facebook applications. In ACM IMC, November 2009.

Digital Library

[17]

R. Prasad et al. Bandwidth estimation: metrics, measurement techniques, and tools. IEEE Network, 17(6):27--35, November 2003.

Digital Library

[18]

J. M. Pujol et al. The little engine(s) that could: scaling online social networks. In Sigcomm, August 2010.

Digital Library

[19]

A. Qureshi et al. Cutting the electric bill for internet-scale systems. In Sigcomm, August 2009.

Digital Library

[20]

D. Schafer. Reducing markup size. http://www.facebook.com/note.php?note_id=125015758919, September 2009.

[21]

F. Schneider et al. Understanding online social network usage from a network perspective. In ACM IMC, November 2009.

Digital Library

[22]

J. Sobel. Scaling out. http://www.facebook.com/note.php?note_id=23844338919, August 2008.

[23]

A. Su et al. Drafting behind Akamai (travelocity-based detouring). Sigcomm Computer Communications Review, 36(4):435--446, October 2006.

Digital Library

[24]

D. M. Swany and R. Wolski. Data logistics in network computing: The logistical session layer. In IEEE Network Computing and Applications, October 2001.

Digital Library

[25]

J. Tang et al. Temporal distance metrics for social network analysis. In Sigcomm Workshop on Online Social Networks (WOSN), August 2009.

Digital Library

[26]

P. Vajgel. Needle in a haystack: efficient storage of billions of photos. http://www.facebook.com/note. php?note_id=76191543919, April 2009.

[27]

M. Valafar et al. Beyond friendship graphs: a study of user interactions in Flickr. In Sigcomm Workshop on Social Networks (WOSN), August 2009.

Digital Library

[28]

V. Valancius et al. Greening the internet with nano data centers. In ACM CoNEXT, December 2009.

Digital Library

[29]

B. Viswanath et al. On the evolution of user interaction in Facebook. In Sigcomm Workshop on Online Social Networks (WOSN), August 2009.

Digital Library

[30]

C. Wilson et al. User interactions in social networks and their implications. In European Conference on Computer Systems (EuroSys), April 2009.

Digital Library

[31]

Z. Yang. Every millisecond counts. http://www.facebook.com/note.php?note_id=122869103919, August 2009.

[32]

Z. Zhang et al. Optimizing cost and performance in online service provider networks. In Usenix NSDI, April 2010.

Digital Library

Cited By

Liu JShen HChi HNarman HYang YCheng LChung W(2021)A Low-Cost Multi-Failure Resilient Replication Scheme for High-Data Availability in Cloud StorageIEEE/ACM Transactions on Networking10.1109/TNET.2020.302781429:4(1436-1451)Online publication date: Aug-2021
https://doi.org/10.1109/TNET.2020.3027814
Lappalainen ARosenberg C(2021)Bridging the digital divide: success depends on content provider and application developer involvement [point of view]Proceedings of the IEEE10.1109/JPROC.2020.3028611109:1(2-10)Online publication date: Jan-2021
https://doi.org/10.1109/JPROC.2020.3028611
Showalter EMoghaddas NVigil-Hayes MZegura EBelding EChandwani RSingh PKumar NVeeraraghavan R(2019)Indigenous internetProceedings of the Tenth International Conference on Information and Communication Technologies and Development10.1145/3287098.3287141(1-4)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3287098.3287141
Show More Cited By

Index Terms

Exploiting locality of interest in online social networks
1. Information systems

Recommendations

Investigating Homophily in Online Social Networks
WI-IAT '10: Proceedings of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01

Similarity breeds connections, the principle of homophily, has been well studied in existing sociology literature. %Several studies have observed this phenomena by conducting surveys on human subjects. These studies have concluded that new ties are ...
Online Bonding and Bridging Social Capital via Social Networking Sites

This research aimed to explore types of online social capital bridging and bonding that the Emiratis perceive in the context of social networking site SNS usage. A snow-ball sample of 230 Emiratis from two Emirates, Abu Dhabi and Dubai was used. The ...
Social exchange in online social networks. The reciprocity phenomenon on Facebook

Our research is focused on reciprocity, which is crucial for social exchanges.The online social network platform of our choice was Facebook, which is one of the most successful online social sites.In our study we found strong empirical evidence that an ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

Co-NEXT '10: Proceedings of the 6th International COnference

November 2010

349 pages

ISBN:9781450304481

DOI:10.1145/1921168

Conference Chairs:
Jaudelice de Oliveira
Drexel University
,
Maximilian Ott
NICTA, Australia
,
Program Chairs:
Tim Griffin
University of Cambridge
,
Muriel Medard
Massachusetts Institute of Technology

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 November 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

Co-NEXT '10

Sponsor:

SIGCOMM

Co-NEXT '10: Conference on emerging Networking EXperiments and Technologies

November 30 - December 3, 2010

Pennsylvania, Philadelphia

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

95
Total Citations
View Citations
731
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)2

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Liu JShen HChi HNarman HYang YCheng LChung W(2021)A Low-Cost Multi-Failure Resilient Replication Scheme for High-Data Availability in Cloud StorageIEEE/ACM Transactions on Networking10.1109/TNET.2020.302781429:4(1436-1451)Online publication date: Aug-2021
https://doi.org/10.1109/TNET.2020.3027814
Lappalainen ARosenberg C(2021)Bridging the digital divide: success depends on content provider and application developer involvement [point of view]Proceedings of the IEEE10.1109/JPROC.2020.3028611109:1(2-10)Online publication date: Jan-2021
https://doi.org/10.1109/JPROC.2020.3028611
Showalter EMoghaddas NVigil-Hayes MZegura EBelding EChandwani RSingh PKumar NVeeraraghavan R(2019)Indigenous internetProceedings of the Tenth International Conference on Information and Communication Technologies and Development10.1145/3287098.3287141(1-4)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3287098.3287141
Intharah TTurmukhambetov DBrostow G(2019)HILCACM Transactions on Interactive Intelligent Systems10.1145/32345089:2-3(1-27)Online publication date: 18-Mar-2019
https://dl.acm.org/doi/10.1145/3234508
Katsuragawa KKamal ALiu QNegulescu MLank E(2019)Bi-Level ThresholdingACM Transactions on Interactive Intelligent Systems10.1145/31816729:2-3(1-30)Online publication date: 2-Apr-2019
https://dl.acm.org/doi/10.1145/3181672
Liu JShen HNarman H(2019)Popularity-Aware Multi-Failure Resilient and Cost-Effective Replication for High Data Durability in Cloud StorageIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.287338430:10(2355-2369)Online publication date: 1-Oct-2019
https://doi.org/10.1109/TPDS.2018.2873384
Hada RJin MXie YLe L(2019)Link Prediction Based Minimum Cost and Balanced Partition of Large Online Social Networks2019 IEEE 18th International Symposium on Network Computing and Applications (NCA)10.1109/NCA.2019.8935044(1-9)Online publication date: Sep-2019
https://doi.org/10.1109/NCA.2019.8935044
Gao LRouskas G(2019)On Congestion Minimization for Service Chain Routing ProblemsICC 2019 - 2019 IEEE International Conference on Communications (ICC)10.1109/ICC.2019.8761660(1-6)Online publication date: May-2019
https://doi.org/10.1109/ICC.2019.8761660
Gao TLi F(2019)Efficient Content Delivery via Interest QueueingICC 2019 - 2019 IEEE International Conference on Communications (ICC)10.1109/ICC.2019.8761339(1-6)Online publication date: May-2019
https://doi.org/10.1109/ICC.2019.8761339
Han ZNiyato DSaad WBaşar T(2019)Game Theory for Next Generation Wireless and Communication Networks10.1017/9781108277402Online publication date: 13-Jun-2019
https://doi.org/10.1017/9781108277402
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten