Skip to main content
SpringerLink
Log in

Forming High-Availability Cloud Mechanism for Secure Peer-Servicing Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Currently, websites provide web services to people for expressing their feelings and promoting their relationship with friends. The web service allows people to reveal their current status, view other users’ statuses, and send instant messages online. The number of users’ current statuses and message data will increase over time, and the number of user accounts will increase. Information technology has ushered a new era with the development of the big data technology. In big data, there may be thousands of users who will generate millions of records and create petabytes or exabytes of information by replicating the records in the big data era. This study proposes a system that uses the Rivest–Shamir–Adleman algorithm to encrypt users’ current status or messages and send them to specific people. This system enhances users’ privacy and security. We developed this system on a peer-to-peer network to improve system availability and prevent system crash caused by single user offline. Subsequently, we used the gambler’s ruin method to calculate the number of replicas of each record to achieve data availability which is set by users.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29

Similar content being viewed by others

References

  1. Bhagwan, R., Tati, K., Cheng, Y., Savage, S., Voelker, G. (2004). Total recall: System support for automated availability management. In NSDI’04 proceedings of the 1st conference on symposium on networked systems design and implementation (Vol. 1, pp. 25–25).

  2. Blake, C., Rodrigues R. (2003). High availability, scalable storage, dynamic peer networks: Pick two. In HOTOS’03 proceedings of the 9th conference on hot topics in operating systems (Vol. 9, pp. 1).

  3. Rodrigues, R., Liskov, B. (2005). High availability in DHTs: Erasure coding vs. replication. In International workshop on peer-to-peer systems: Peer-to-peer systems IV (pp. 226–239).

  4. Weatherspoon, H., Kubiatowicz, J. (2002). Erasure coding vs. replication: A quantitative comparison. In International workshop on peer-to-peer systems, IPTPS 2002: Peer-to-peer systems (pp. 328–337).

  5. Wang, G., Tang, J. (2012). The NoSQL principles and basic application of cassandra model. In International conference on computer science and service system, (pp. 1332–1335).

  6. Ramabhadran, S., Pasquale, J. (2006). Analysis of long-running replicated systems. In Proceedings IEEE INFOCOM. 25th IEEE international conference on computer communications (pp. 1–9).

  7. Hongxing, L., Chen, G. (2007). Data persistence in structured P2P networks with redundancy schemes. In Sixth international conference on grid and cooperative computing, (pp. 542–549).

  8. Bitmessage Wiki, https://bitmessage.org/wiki/Main_Page.

  9. Dr Clifford Cocks CB. University of Bristol. Retrieved 14 August 2011.

  10. Rivest R. L., Shamir A., Adleman, L. M. (1983). The original RSA patent as filed with the U.S. patent office. Patent 4,405,829. 14th, 1977.

  11. Reed, I. S., & Solomon, G. (1960). Polynomial codes over certain finite field. Journal of the Society for Industrial and Applied Mathematics, 8(2), 300–304.

    Article  MathSciNet  Google Scholar 

  12. Naicken, S., Basu, A., Livingston, B. (2013). A survey of peer-to-peer network simulators. ACM Computing Surveys (CSUR) Surveys Homepage Archive, 45(4).

  13. OMNeT++ official website, http://www.omnetpp.org/.

  14. INET official website, http://inet.omnetpp.org/.

  15. OverSim official website, http://www.oversim.org/.

  16. Baumgart, I., Heep, B., Krause, S. (2007). OverSim: A flexible overlay network simulation framework. In IEEE global internet symposium (pp. 79–84).

  17. Merzbacher, M., Patterson, D. (2002). Measuring end-user availability on the web: Practical experience. In Proceedings international conference on dependable systems and networks (pp. 473–477).

  18. Wu, F., Qiu, T., Chen, Y., Chen, G. (2005). Redundancy schemes for high availability in DHTs. In Parallel and distributed processing and applications. ISPA 2005. Lecture notes in computer science (Vol 3758). Springer, Berlin.

  19. Hsu, C.-H., Chang, C.-L. (2007) Design of Reed–Solomon decoder and implement on FPGA. National Yunlin University of Science and Technology.

  20. Simo, S. (2009). Simulating a mobile peer-to-peer network. Espoo: Networking Laboratory, Department of Communications and Networking, Helsinki University of Technology.

    Google Scholar 

  21. Bellini, P., Nesi, P., & Pazzaglia, F. (2014). Exploiting P2P scalability for grant authorization in digital rights management solutions. Floernce: Distributed Systems and Internet Technology Lab, Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze.

    Book  Google Scholar 

  22. Gilmore, J. S. (2013). A state management and persistency architecture for peer-to-peer massively multi-user virtual environments. Stellenbosch: Faculty of Engineering, Stellenbosch University.

    Book  Google Scholar 

  23. Mutombo, D. M. (2013). A performance evaluation of peer-to-peer storage systems. Johannesburg: School of Computer Science, the Faculty of Science, University of the Witwatersrand.

    Google Scholar 

  24. Muñoz-Gea, J. P., Malgosa-Sanahuja, J., Manzanares-Lopez, P., Sanchez-Aarnoutse, J. C., Martinez-Rojo, A. M. (2009) Simulation of a P2P application using overSim. In First international conference on advances in future internet.

  25. Baumgart, I., Heep, B., Krause, S. (2007). OverSim: A flexible overlay network simulation framework. In IEEE global internet symposium, pp. 79–84

  26. Shankar, V., Graduate Student, Indiana University Bloomington, Cassandra DHT-based storage system. Indiana University, Indianapolis, Indiana.

Download references

Acknowledgements

This work was supported by the “Allied Advanced Intelligent Biomedical Research Center, STUST” under Higher Education Sprout Project, Ministry of Education, Taiwan.

Author information

Authors and Affiliations

  1. Department of Engineering Science, National Cheng Kung University, Tainan, Taiwan

    Tung-Ying Lee

  2. Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan

    Yin-Jun Chen

  3. Department of Computer Science and Information Engineering, Southern Taiwan University of Science and Technology, Tainan, Taiwan

    Gwo-Jiun Horng

Authors
  1. Tung-Ying Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yin-Jun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gwo-Jiun Horng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gwo-Jiun Horng.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lee, TY., Chen, YJ. & Horng, GJ. Forming High-Availability Cloud Mechanism for Secure Peer-Servicing Networks. Wireless Pers Commun 109, 361–391 (2019). https://doi.org/10.1007/s11277-019-06569-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-019-06569-7

Keywords

Search

Navigation