Skip to main content

A Socially-Aware, Privacy-Preserving, and Scalable Federated Learning Protocol for Distributed Online Social Networks

  • Conference paper
  • First Online:
Advanced Information Networking and Applications (AINA 2022)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 450))

Abstract

Online Social Networks (OSNs) have been gaining tremendous growth by attracting billions of users from all over the world. Such massive growth leads to scalability and data privacy concerns. Decentralized solutions still are not able to solve privacy and scalability problems efficiently. Hence, recently fully Distributed Online Social Networks (DOSNs) have been proposed. However, despite solving scalability and privacy issues, fully DOSNs impose difficulties in executing data mining and machine learning services which are vital for social networks. In the fully DOSN, each user has only one feature vector and these vectors cannot move to any central storage or other users in a raw form due to privacy issues. In addition, users can directly communicate only with their immediate neighbours/friends in a social network/graph. To cope with these problems, we propose a novel Federated learning algorithm for DOSNs based on the Gossip protocol. We propose a two layer protocol in which the underlying layer is a socially-aware gossip sampling protocol and the upper layer is a push-based merging gossip protocol. The former is responsible for creating a socially-aware random overlay network while the latter, utilizing the sampling protocol, does the training model. We implement our algorithm and through extensive experiments show that the algorithm trains the model up to 88% accuracy compared to the centralized approach.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.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. Debatin, B., et al.: Facebook and online privacy: atitudes, behaviors, and unintended consequences. J. Comput. Mediat. Commun. 15(1), 83–108 (2009)

    Article  Google Scholar 

  2. Koll, D., Li, J., Fu, X.: SOUP: an online social network by the people, for the people. In: Proceedings of the 15th International Middleware Conference (2014)

    Google Scholar 

  3. Nilizadeh, S., et al.: Cachet: a decentralized architecture for privacy preserving social networking with caching. In: Proceedings of the 8th International Conference on Emerging Networking Experiments and Technologies (2012)

    Google Scholar 

  4. Nasir, M.A.U., Girdzijauskas, S., Kourtellis, N.: Socially-aware distributed hash tables for decentralized online social networks. In: 2015 IEEE International Conference on Peer-to-Peer Computing (P2P), pp. 1–10). IEEE, September 2015

    Google Scholar 

  5. Ormándi, R., Hegedűs, I., Jelasity, M.: Gossip learning with linear models on fully distributed data. Concurr. Comput. Pract. Experience 25(4), 556–571 (2013)

    Article  Google Scholar 

  6. Jelasity, M., et al.: Gossip-based peer sampling. ACM Trans. Comput. Syst. (TOCS) 25(3), 8-es (2007)

    Article  Google Scholar 

  7. Khelghatdoust, M., Girdzijauskas, S.: Short: gossip-based sampling in social overlays. In: Noubir, G., Raynal, M. (eds.) NETYS 2014. LNCS, vol. 8593, pp 335–340. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09581-3_26

  8. Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., Van Steen, M.: Gossip-based peer sampling. ACM Trans. Comput. Syst. (TOCS) 25(3), 8-es (2007)

    Article  Google Scholar 

  9. Baagyere, E.Y., Qin, Z., Xiong, H., Zhiguang, Q.: The structural properties of online social networks and their application areas. IAENG Int. J. Comput. Sci. 43(2) (2016)

    Google Scholar 

  10. King, V., Saia, J.: Choosing a random peer. In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 125–130. ACM Press (2004)

    Google Scholar 

  11. Voulgaris, S., Gavidia, D., Van Steen, M.: CYCLON: inexpensive membership management for unstructured P2P overlays. J. Netw. Syst. Manag. 13(2), 197–217 (2005). https://doi.org/10.1007/s10922-005-4441-x

    Article  Google Scholar 

  12. Giaretta, L., Girdzijauskas, Š: Gossip learning: off the beaten path. In: 2019 IEEE International Conference on Big Data (Big Data). IEEE (2019)

    Google Scholar 

  13. McMahan, B., et al.: Communication-efficient learning of deep networks from decentralized data. In: Artificial intelligence and statistics. PMLR (2017)

    Google Scholar 

  14. Kyasanur, P., Choudhury, R.R., Gupta, I.: Smart gossip: an adaptive gossip-based broadcasting service for sensor networks. In: 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems. IEEE (2006)

    Google Scholar 

  15. Montresor, A.: Gossip and epidemic protocols. Wiley Encyclopedia of Electrical and Electronics Engineering, vol. 1 (2017)

    Google Scholar 

  16. Alkathiri, A.A., et al.: Decentralized Word2Vec using gossip learning. In: 23rd Nordic Conference on Computational Linguistics (NoDaLiDa 2021) (2021)

    Google Scholar 

  17. Hegedűs, I., Danner, G., Jelasity, M.: Gossip learning as a decentralized alternative to federated learning. In: Pereira, J., Ricci, L. (eds.). DAIS 2019. LNCS, vol. 11534, pp. 74–90. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-22496-7_5

  18. Montresor, A., Jelasity, M.: PeerSim: a scalable P2P simulator. In: Proceedings of the 9th International Conference on Peer-to-Peer (P2P 2009), pp. 99–100, Seattle, WA, September 2009

    Google Scholar 

  19. Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 1361–1370. ACM (2010)

    Google Scholar 

  20. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Disc. Data (TKDD) 1(1), 2 (2007)

    Article  Google Scholar 

  21. McAuley, J., Leskovec, J.: Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems, vol. 25, pp. 548–556 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mansour Khelghatdoust .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Khelghatdoust, M., Mahdavi, M. (2022). A Socially-Aware, Privacy-Preserving, and Scalable Federated Learning Protocol for Distributed Online Social Networks. In: Barolli, L., Hussain, F., Enokido, T. (eds) Advanced Information Networking and Applications. AINA 2022. Lecture Notes in Networks and Systems, vol 450. Springer, Cham. https://doi.org/10.1007/978-3-030-99587-4_17

Download citation

Publish with us

Policies and ethics