Abstract
This paper aims to propose a single failure recovery for a distributed social network. Single node and multi-node recovery are both non-trivial tasks. We have considered that a user is treated as a single independent server with its own independent storage and is focused only on single-user failure. Here, failure refers to the failure of the server as a whole. With these fundamental assumptions, a new fast recovery strategy for the single failed user is proposed. In this method, partial replication of node data is used for recovery of the node to reduce the storage issue.
This research is supported by Visvesvaraya Project funded by Digital India Corporation, established by Ministry of Electronics & Information Technology, Government of India.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chen, R., Shi, J., Chen, Y., Zang, B., Guan, H., Chen, H.: PowerLyra: differentiated graph computation and partitioning on skewed graphs. ACM Trans. Parallel Comput. (TOPC) 5(3), 1–39 (2019)
M Collective: Dark crystal. Accessed 30 July 2020
Datta, A., Buchegger, S., Vu, L.H., Strufe, T., Rzadca, K.: Decentralized online social networks. In: Furht, B. (ed.) Handbook of Social Network Technologies and Applications, pp. 349–378. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-7142-5_17
Défago, X., Schiper, A., Urbán, P.: Total order broadcast and multicast algorithms: taxonomy and survey. ACM Comput. Surv. (CSUR) 36(4), 372–421 (2004)
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem ACM transactions on programming languages and systems, vol. 4, no. 3, pp. 382–401 (1982)
Lu, W., Shen, Y., Wang, T., Zhang, M., Jagadish, H.V., Du, X.: Fast failure recovery in vertex-centric distributed graph processing systems. IEEE Trans. Knowl. Data Eng. 31(4), 733–746 (2018)
Noor, A.S.M., Deris, M.M.: Failure recovery mechanism in neighbor replica distribution architecture. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds.) ICICA 2010. LNCS, vol. 6377, pp. 41–48. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16167-4_6
Noor, A.S.M., Deris, M.M.: Fail-stop failure recovery in neighbor replica environment. Procedia Comput. Sci. 19, 1040–1045 (2013)
Onizuka, M., Fujimori, T., Shiokawa, H.: Graph partitioning for distributed graph processing. Data Sci. Eng. 2(1), 94–105 (2017)
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
Shen, Y., Chen, G., Jagadish, H., Lu, W., Ooi, B.C., Tudor, B.M.: Fast failure recovery in distributed graph processing systems. Proc. VLDB Endow. 8(4), 437–448 (2014)
Tarr, D.: Secure Scuttlebutt. Accessed 29 July 2020
Tarr, D., Lavoie, E., Meyer, A., Tschudin, C.: Secure scuttlebutt: an identity-centric protocol for subjective and decentralized applications. In: Proceedings of the 6th ACM Conference on Information-Centric Networking, pp. 1–11 (2019)
Yan, D., Cheng, J., Yang, F.: Lightweight fault tolerance in large-scale distributed graph processing. arXiv preprint arXiv:1601.06496 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Roy, C., Chakraborty, D., Debnath, S., Mukherjee, A., Chaki, N. (2021). Single Failure Recovery in Distributed Social Network. In: Hong, TP., Wojtkiewicz, K., Chawuthai, R., Sitek, P. (eds) Recent Challenges in Intelligent Information and Database Systems. ACIIDS 2021. Communications in Computer and Information Science, vol 1371. Springer, Singapore. https://doi.org/10.1007/978-981-16-1685-3_17
Download citation
DOI: https://doi.org/10.1007/978-981-16-1685-3_17
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-1684-6
Online ISBN: 978-981-16-1685-3
eBook Packages: Computer ScienceComputer Science (R0)