Minimizing Inter-Server Communications by Exploiting Self-Similarity in Online Social Networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 27, Issue 4, 2016, Pages 1116-1130

  Chen, Hanhua ^a   Jin, Hai ^a   Wu, Shaoliang ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

data center; inter server communications; interaction graph; online social networks; Self similarity

Indexed keywords

COMPLEX NETWORKS; DIGITAL STORAGE; DISTRIBUTED COMPUTER SYSTEMS; ONLINE SYSTEMS; WEBSITES;

DATA CENTERS; INTER-SERVER COMMUNICATIONS; INTERACTION GRAPHS; ON-LINE SOCIAL NETWORKS; SELF-SIMILARITIES;

SOCIAL NETWORKING (ONLINE);

EID: 84963541120     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2015.2427155     Document Type: Article

References (47)

1. G. Liang, J. Cao, and W. Zhu, "CircleSense: A pervasive computing system for recognizing social activities," in Proc. IEEE Int. Conf. Pervasive Comput. Commun., 2013, pp. 201-206.
2. K.-L. Liu, W.-J. Li, and M. Guo, "Emoticon smoothed language models for twitter sentiment analysis," in Proc. AAAI, 2012, pp. 1678-1684.
3. S. Wen, W. Zhou, J. Zhang, Y. Xiang, W. Zhou, and W. Jia, "Modeling propagation dynamics of social network worms," IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 8, pp. 1633-1643, Aug. 2013.
4. Z. Zhang, "Community structure detection in social networks based on dictionary learning," Sci. China Inf. Sci., vol. 56, no. 7, pp. 1-12, 2013.
5. (2014) [Online]. Available: http://newsroom.fb.com
6. (2010) [Online]. Available: http://www.datacenterknowledge. com/archives/2010/06/28/facebook-server-count-60000-or-more
7. G. Wang, Q. Liu, F. Li, S. Yang, and J. Wu, "Outsourcing privacypreserving social networks to a cloud," in Proc. INFOCOM, 2013, pp. 2886-2894.
8. N. Bronson, Z. Amsden, G. Cabrera, P. Chakka, P. Dimov, H. Ding, J. Ferris, A. Giardullo, S. Kulkarni, H. Li, M. Marchukov, D. Petrov, L. Puzar, Y. J. Song, and V. Venkataramani, "Tao: Facebook's distributed data store for the social graph," in proc. USENIX Annual Technical Conf., San Jose, CA, USA, 2013, pp. 49-60.
9. A. Lakshman and P. Malik, "Cassandra: A decentralized structured storage system," ACM SIGOPS Operating Syst. Rev., vol. 44, no. 2, pp. 35-40, 2010.
10. D. Karger, E. Lehman, T. Leightom, M. Levine, D. Lewin, and R. Panigrahy, "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web," in Proc. 29th Annu. ACM Symp. Theory Comput., 1998, pp. 654-663.
11. J. Pujol, V. Erramilli, G. Siganos, X. Yang, N. Laoutaris, P. Chhabra, and P. Rodriguez, "The little engine(s) that could: Scaling online social networks," in Proc. ACM SIGCOMM, 2010, pp. 375-386.
12. Q. Duong, S. Goel, J. M. Hofman, and S. Vassilvitskii, "Sharding social networks," in Proc. 6th ACM Int. Conf. Web Search Data Mining, 2013, pp. 223-232.
13. F. Bourse, M. Lelarge, and M. Vojnovic, "Balanced graph edge partition," in Proc. 20th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2014, pp. 1456-1465.
14. C. Wilson, B. Boe, A. Sala, K. Puttaswamy, and B. Zhao, "User interactions in social networks and their implications," in Proc. 4th ACM Eur. Conf. Comput. Syst., 2009, pp. 205-218.
15. M. Buchanan, "A game of chance," Nature, vol. 419, p. 787, 2002.
16. A. C. Champion, Z. Yang, B. Zhang, J. Dai, D. Xuan, and D. Li, "Esmalltalker: A distributed mobile system for social networking in physical proximity," IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 8, pp. 1535-1545, Aug. 2013.
17. J. Fan, J. Chen, Y. Du, W. Gao, J. Wu, and Y. Sun, "Geocommunitybased broadcasting for data dissemination in mobile social networks," IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 4, pp. 734-743, Apr. 2013.
18. X. Zhang, C. Liu, S. Nepal, S. Pandey, and J. Chen, "A privacy leakage upper bound constraint-based approach for cost-effective privacy preserving of intermediate data sets in cloud," IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 6, pp. 1192-1202, Jun. 2013.
19. S. Garriss, M. Kaminsky, M. J. Freedman, B. Karp, D. Mazi'eres, and H. Yu, "Re: Reliable email," in Proc. 3rd Conf. Netw. Syst. Des. Implementation, 2006, p. 22.
20. A. Mislove, K. P. Gummadi, and P. Druschel, "Exploiting social networks for internet search," in Proc. 5th Workshop Hot Topics Netw., 2006, pp. 79-84.
21. B. Viswanath, A. Post, P. K. Gummadi, and A. Mislove, "An analysis of social network-based Sybil defenses," in Proc. ACM SIGCOMM, 2010, pp. 363-374.
22. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and analysis of online social networks," in Proc. IMC, 2007, pp. 29-42.
23. M. U. Ilyas, M. Z. Shafiq, A. X. Liu, and H. Radha, "A distributed and privacy preserving algorithm for identifying information hubs in social networks," in Proc. INFOCOM, 2011, pp. 561-565.
24. V. Gómez, A. Kaltenbrunner, and V. López, "Statistical analysis of the social network and discussion threads in slashdot," in Proc. 17th Int. Conf. World Wide Web, 2008, pp. 645-654.
25. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, "Statistical properties of community structure in large social and information networks," in Proc. 17th Int. Conf. World Wide Web, 2008, pp. 695-704.
26. N. P. Nguyen, T. N. Dinh, S. Tokala, and M. T. Thai, "Overlapping communities in dynamic networks: their detection and mobile applications," in Proc. 17th Annu. Int. Conf. Mobile Comput. Netw., 2011, pp. 85-96.
27. A. Sridharan, Y. Gao, K. Wu, and J. Nastos, "Statistical behavior of embeddedness and communities of overlapping cliques in online social networks," in Proc. INFOCOM, 2011, pp. 546-550.
28. M. Newman, "Fast algorithm for detecting community structure in networks," Phys. Rev. E, vol. 69, p. 066133, 2004.
29. D. Ediger, K. Jiang, E. J. Riedy, and D. A. Bader, "GraphCT: Multithreaded algorithms for massive graph analysis," IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 11, pp. 2220-2229, Nov. 2013.
30. E. J. Riedy, H. Meyerhenke, D. Ediger, and D. A. Bader, "Parallel community detection for massive graphs," in Proc. 9th Int. Conf. Graph Partitioning Graph Clustering, 2012, pp. 286-296.
31. S. Milgram, "The small world problem," Psychol. Today, vol. 2, no. 1, pp. 60-67, 1967.
32. H. Kwak, C. Lee, H. Park, and S. Moon, "What is twitter, a social network or a news media?" in Proc. 19th Int. Conf. World Wide Web, 2010, pp. 591-600.
33. A. Rinaldo, I. Rodriguez-Iturbe, R. Rigon, E. Ijjasz-Vasquez, and R. L. Bras, "Self-organized fractal river networks," Physical Rev. Lett., vol. 70, no. 6, pp. 822-825, 1993.
34. A. N. Strahler, "Hypsometric (area-altitude) analysis of erosional topography," Bull. Geological Soc. Am., vol. 63, pp. 1117-1142, 1952.
35. T. C. Halsey, "The branching structure of diffusion-limited aggregates," Europhys. Lett., vol. 39, no. 1, p. 43, 1997.
36. A. Maritan, A. Rinaldo, R. Rigon, A. Giacometti, and I. Rodriguez-Iturbe, "Scaling laws for river networks," Phys. Rev. E, vol. 53, no. 2, pp. 1510-1515, 1996.
37. A. Rao, K. Lakshminarayanan, S. Surana, R. M. Karp, and I. Stoica, "Load balancing in structured p2p systems," in Proc. 2nd Int. Workshop Peer-to-Peer Syst., 2003, pp. 68-79.
38. M. Jayasinghe, Z. Tari, P. Zeephongsekul, and A. Y. Zomaya, "Adapt-policy: Task assignment in server farms when the service time distribution of tasks is not known a priori," IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 4, pp. 851-861, Apr. 2014.
39. A. Quiroz, H. Kim, M. Parashar, N. Gnanasambandam, and N. Sharma, "Towards autonomic workload provisioning for enterprise grids and clouds," in Proc. 10th IEEE/ACM Int. Conf. Grid Comput., 2009, pp. 50-57.
40. R. Nishtala, H. Fugal, S. Grimm, M. Kwiatkowski, H. Lee, H. C. Li, R. McElroy, M. Paleczny, D. Peek, P. Saab, D. Stafford, T. Tung, and V. Venkataramani, "Scaling Memcache at Facebook," in Proc. 10th USENIX Conf. Netw. Syst. Des. Implementation, 2013, pp. 385-398.
41. M. Alizadeh, A. Greenberg, D. A. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan, "Data center TCP (DCTCP)," in Proc. ACM SIGCOMM, 2010, pp. 63-74.
42. R. Niranjan Mysore, A. Pamboris, N. Farrington, N. Huang, P. Miri, S. Radhakrishnan, V. Subramanya, and A. Vahdat, "PortLand: A scalable fault-tolerant layer 2 data center network fabric," in Proc. ACM SIGCOMM, 2009, pp. 39-50.
43. C.-Y. Hong, M. Caesar, and P. B. Godfrey, "Finishing flows quickly with preemptive scheduling," in Proc. ACM SIGCOMM, 2012, pp. 127-138.
44. D. Zats, T. Das, P. Mohan, D. Borthakur, and R. Katz, "DeTail: Reducing the flow completion time tail in datacenter networks," in ACM SIGCOMM, 2012, pp. 139-150.
45. (2010) [Online]. Available: http://highscalability.com/blog/ 2009/10/13/why-are-facebook-digg-and-twitter-so-hard-to-scale. html
46. Y. Liu, L. Xiao, X. Liu, L. M. Ni, and X. Zhang, "Location awareness in unstructured peer-to-peer systems," IEEE Trans. Parallel Distrib. Syst., vol. 16, no. 2, pp. 163-174, Feb. 2005.
47. M. E. Renda, G. Resta, and P. Santi, "Load balancing hashing in geographic hash tables," IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 8, pp. 1508-1519, Aug. 2012.