Skip to main content
SpringerLink
Log in

Optimizing Inter-server Communications by Exploiting Overlapping Communities in Online Social Networks

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10048))

Abstract

As the rapid growth of online social networks (OSNs), inter-server communications are becoming an obstacle to scaling the storage systems of OSNs. To address the problem, network partitioning and data replication are two commonly used approaches. In this paper, we exploit the combination of both approaches simultaneously and propose a data placement scheme based on overlapping communities detection. The principle behind the proposed scheme is to co-locate frequently interactive users together as long as it brings positive traffic reduction and satisfies load constraint. We conduct trace-driven experiments and the results show that our scheme significantly reduces the inter-server communications as well as preserving good load balancing.

J. Zhou—This work is supported by National Natural Science Foundation of China (No. 61502328, No. 61572337), Natural Science Foundation of the Higher Education Institutions of Jiangsu Province (No. 15KJB520032, No. 14KJB520034), Joint Innovation Funding of Jiangsu Province (No. BY2014059-02).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: MSST, pp. 1–10 (2010)

    Google Scholar 

  2. Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. Oper. Syst. Rev. 44(2), 35–40 (2010)

    Article  Google Scholar 

  3. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359–392 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, H., Jin, H., Jin, N., Gu, T.: Minimizing inter-server communications by exploiting self-similarity in online social networks. In: ICNP, pp. 1–10 (2012)

    Google Scholar 

  5. Pujol, J.M., Erramilli, V., Siganos, G., Yang, X., Laoutaris, N., Chhabra, P., Rodriguez, P.: The little engine(s) that could: scaling online social networks. IEEE/ACM Trans. Netw. 20(4), 1162–1175 (2012)

    Article  Google Scholar 

  6. Liu, G., Shen, H., Chandler, H.: Selective data replication for online social networks with distributed datacenters. In: ICNP, pp. 1–10 (2013)

    Google Scholar 

  7. Zhou, J., Fan, J., Wang, J., Cheng, B., Jia, J.: Towards traffic minimization for data placement in online social networks. Concurrency and Computation: Practice and Experience, May 2016

    Google Scholar 

  8. Wilson, C., Sala, A., Puttaswamy, K.P.N., Zhao, B.Y.: Beyond social graphs: user interactions in online social networks and their implications. ACM Trans. Web 6, 17:1–17:31 (2012)

    Article  Google Scholar 

  9. Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in facebook: a case study of unbiased sampling of OSNs. In: INFOCOM, pp. 2498–2506 (2010)

    Google Scholar 

  10. Jiang, J., Wilson, C., Wang, X., Sha, W., Huang, P., Dai, Y., Zhao, B.Y.: Understanding latent interactions in online social networks. ACM Trans. Web 7, 18 (2013)

    Article  Google Scholar 

  11. Benevenuto, F., Rodrigues, T., Cha, M., Almeida, V.A.F.: Characterizing user behavior in online social networks. In: IMC, pp. 49–62 (2009)

    Google Scholar 

  12. Tran, D.A., Nguyen, K., Pham, C.: S-clone: socially-aware data replication for social networks. Comput. Netw. 56, 2001–2013 (2012)

    Article  Google Scholar 

  13. Yu, B., Pan, J.: Location-aware associated data placement for geo-distributed data-intensive applications. In: INFOCOM, pp. 603–611 (2015)

    Google Scholar 

  14. Tran, D.A., Zhang, T.: S-PUT: an EA-based framework for socially aware data partitioning. Comput. Netw. 75, 504–518 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Soochow University, Suzhou, 215006, China

    Jingya Zhou, Jianxi Fan, Baolei Cheng & Juncheng Jia

  2. Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing, 210046, China

    Jingya Zhou, Jianxi Fan, Baolei Cheng & Juncheng Jia

Authors
  1. Jingya Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianxi Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Baolei Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Juncheng Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jingya Zhou .

Editor information

Editors and Affiliations

  1. University Carlos III of Madrid, Leganes, Spain

    Jesus Carretero

  2. Carlos III University of Madrid, Leganes, Madrid, Spain

    Javier Garcia-Blas

  3. The University of Waikato, Hamilton, New Zealand

    Ryan K.L. Ko

  4. IBM Zurich Research Laboratory, Rüschlikon, Switzerland

    Peter Mueller

  5. Hiroshima University, Higashi-Hiroshima, Japan

    Koji Nakano

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Zhou, J., Fan, J., Cheng, B., Jia, J. (2016). Optimizing Inter-server Communications by Exploiting Overlapping Communities in Online Social Networks. In: Carretero, J., Garcia-Blas, J., Ko, R., Mueller, P., Nakano, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2016. Lecture Notes in Computer Science(), vol 10048. Springer, Cham. https://doi.org/10.1007/978-3-319-49583-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49583-5_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49582-8

  • Online ISBN: 978-3-319-49583-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation