[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content

Advertisement

Springer Nature Link
Log in

Decentralized Data Storages: Technologies of Construction

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

A comparative overview of decentralized data storages of different types is presented. It is shown that, although they have some common properties typical of all peer-to-peer (P2P) networks, the tasks they solve and, hence, the technologies used to construct storage facilities of different types are significantly different.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

REFERENCES

  1. Handbook of Peer-to-Peer Networking, Shen, X.S., Yu, H., Buford, J., and Akon, M., Eds., vol. 34, Berlin: Springer, 2010.

    MATH  Google Scholar 

  2. Daswani, N., Garcia-Molina, H., and Yang, B., Open problems in data-sharing peer-to-peer systems, Proc. 9th Int. Conf. Database Theory (ICDT), 2003, pp. 1–15.

  3. Napster. http://www.napster.com. Accessed February 15, 2018.

  4. The annotated Gnutella protocol specification. http:// rfc-gnutella.sourceforge.net/developer/stable. Accessed February 15, 2018.

  5. Good, N.S. and Krekelberg, A., Usability and privacy: A study of Kazaa P2P file-sharing, Proc. SIGCHI Conf. Human Factors in Computing Systems, 2003, pp. 137–144.

  6. Cohen, B., Incentives build robustness in BitTorrent, Proc. Workshop Economics of Peer-to-Peer systems, 2003, vol. 6, pp. 68–72.

  7. Rizzo, F., Spoto, G.L., Brizzi, P., Bonino, D., Di Bella, G., and Castrogiovanni, P., Beekup: A distributed and safe P2P storage framework for IoE applications, Proc. 20th Conf. Innovations in Clouds, Internet, and Networks (ICIN), 2017, pp. 44–51.

  8. Meng, X., A churn-aware durable data storage scheme in hybrid P2P networks, J. Supercomput., 2018, vol. 74, no. 1, pp. 183–204.

    Article  Google Scholar 

  9. Osorio, M. and Buil-Aranda, C., Storage balancing in P2P based distributed RDF data stores, 2017. https:// openreview.net/pdf?id=rJn8cDtIb.

  10. Theyyampattil, M.R. and James, M., A survey on reputation systems and social network based peer-to-peer file sharing systems, Int. J. Comput., Inf., Syst. Sci., Eng., 2017, vol. 5, no. 3, pp. 1619–1626.

    Google Scholar 

  11. Ravichandran, C.G. and Xavier, J.L., A survey of data sharing and security issues in P2P networks, Adv. Nat. Appl. Sci., 2017, vol. 11, no. 7, pp. 329–335.

    Google Scholar 

  12. Gurkin, Yu.N. and Semenov, Yu.A., File-sharing P2P networks: Basic principles, protocols, and security. http://www.ccc.ru/magazine/depot/06_11/read.html ?0302.htm. Accessed February 15, 2018.

  13. Malatras, A., State-of-the-art survey on P2P overlay networks in pervasive computing environments, J. Network Comput. Appl., 2015, vol. 55, pp. 1–23.

    Article  Google Scholar 

  14. Meshkova, E., Riihijarvi, J., Petrova, M., and Mahonen, P., A survey on resource discovery mechanisms, peer-to-peer, and service discovery frameworks, Comput. Networks, 2008, vol. 52, no. 11, pp. 2097–2128.

    Article  Google Scholar 

  15. Tsoumakos, D. and Roussopoulos, N., Adaptive probabilistic search in peer-to-peer networks, Proc. 2nd Int. Workshop Peer-to-Peer Systems (IPTPS), 2003, pp. 102–109.

  16. Yang, C. and Wu, J., A dominating-set-based routing in peer-to-peer networks, Proc. 2nd Int. Workshop Grid and Cooperative Computing (GCC), 2003. pp. 332–339.

  17. Mizrak, A.T., Cheng, Y., Kumar, V., and Savage, S., Structured superpeers: Leveraging heterogeneity to provide constant-time lookup, Proc. IEEE Workshop Internet Applications (WIAPP), 2003, pp. 104–111.

  18. Li, J-S. and Chao, C-H., An efficient superpeer overlay construction and broadcasting scheme based on perfect difference graph, IEEE Trans. Parallel Distrib. Syst., 2010, vol. 21, no. 5, pp. 594–606.

    Article  Google Scholar 

  19. Lv, Q., Cao, P., Cohen, E., Li, K., and Shenker, S., Search and replication in unstructured peer-to-peer networks, Proc. 16th ACM Int. Conf. Supercomputing (ACM ICS), 2002, pp. 84–95.

  20. Barjini, H., Othman, M., Ibrahim, H., and Udzir, N., Shortcoming, problems, and analytical comparison for flooding-based search techniques in unstructured P2P networks, Peer-to-Peer Network Appl., 2012, vol. 5, pp. 1–13.

    Article  Google Scholar 

  21. Brocco, A., Malatras, A., and Hirsbrunner, B., Enabling efficient information discovery in a self-structured grid, Future Gener. Comput. Syst., 2010, vol. 26, no. 6, pp. 838–846.

    Article  Google Scholar 

  22. Ciancaglini, V., Liquori, L., and Hoang, G., Towards a common architecture to interconnect heterogeneous overlay networks, Proc. 17th Int. Conf. Parallel and Distributed Systems, 2011, pp. 817–822.

  23. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., and Balakrishnan, H., Chord: A scalable peer-to-peer lookup service for internet applications, IEEE/ACM Trans. Networking, 2003, vol. 11, no. 1, pp. 17–32.

    Article  Google Scholar 

  24. Varlamov, M.I. and Turdakov, D.Yu., A survey of methods for the extraction of information from Web resources, Program. Comput. Software, 2016, vol. 42, no. 5, pp. 279–291.

    Article  Google Scholar 

  25. Clarke, I., Sandberg, O., Wiley, B., and Hong, T.W., Freenet: A distributed anonymous information storage and retrieval system, in Designing Privacy Enhancing Technologies, 2001, pp. 46–66.

  26. Manku, G.S., Bawa, M., and Raghavan, P., Symphony: Distributed hashing in a small world, Proc. 4th USENIX Symp. Internet Technology and Systems (USITS), 2003, p. 10–25.

  27. Gupta, I., Birman, K., Linga, P., Demers, A., and Renesse, R.V., Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead, Proc. 2nd Int. Workshop Peer-to-Peer Systems (IPTPS), 2003, pp. 160–169.

  28. Demirci, M. and Ammar, M., Fair allocation of substrate resources among multiple overlay networks, Proc. IEEE Int. Symp. Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), 2010, pp. 121–30.

  29. Hsu, C-J., Chung, W-C., Lai, K-C., Li, K-C., and Chung, Y-C., A novel approach for cooperative overlay-maintenance in multi-overlay environments, Proc. IEEE 2nd Int. Conf. Cloud Computing Technology and Science (CloudCom), 2010, pp. 81–88.

  30. Peng, F., Malatras, A., Hirsbrunner, B., and Courant, M., Antom: Constructing multi-layer overlays for pervasive environments, Proc. 8th Int. Workshop Mobile P2P Computing (MP2P), 2012, pp. 1–6.

  31. Buford, J., Yu, H., and Lua, E.K., P2P Networking and Applications, San Francisco: Morgan Kaufmann, 2008.

    Google Scholar 

  32. Serbu, S., Felber, P., and Kropf, P., Hypeer: Structured overlay with flexible-choice routing, Comput. Networks, 2011, vol. 55, no. 1, pp. 300–313.

    Article  Google Scholar 

  33. Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., and Stoica, I., Looking up data in P2P systems, Commun. ACM, 2003, vol. 46, no. 2, pp. 43–48.

    Article  Google Scholar 

  34. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S., A scalable content-addressable network, ACM SIGCOMM Comput. Commun. Rev., 2001, vol. 31, pp. 161–172.

    Article  MATH  Google Scholar 

  35. Rowstron, A. and Druschel, P., Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, Proc. IFIP/ACM Int. Conf. Distributed Systems Platforms, 2001, pp. 329–350.

  36. Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., and Kubiatowicz, J.D., Tapestry: A resilient global-scale overlay for service deployment, IEEE J. Sel. Areas Commun., 2004, vol. 22, no. 1, pp. 41–53.

    Article  Google Scholar 

  37. Maymounkov, P. and Mazieres, D., Kademlia: A peer-to-peer information system based on the XOR metric, Proc. 1st Int. Workshop Peer-to-Peer Systems (IPTPS), 2002, pp. 53–65.

  38. Malkhi, D., Naor, M., and Ratajczak, D., Viceroy: A scalable and dynamic emulation of the butterfly, Proc. 21st Symp. Principles of Distributed Computing (PODC), 2002, pp. 183–192.

  39. Aberer, K., Cudre-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., and Punceva, M., P-grid: A self-organizing structured P2P system, SIGMOD Record, 2003, vol. 32, no. 3, pp. 29–33.

    Article  Google Scholar 

  40. Harvey, N., Jones, M., Saroiu, S., Theimer, M., and Wolman, A., Skipnet: A scalable overlay network with practical locality properties, Proc. 4th USENIX Symp. Internet Technologies and Systems (USITS), 2003, pp. 1–38.

  41. Albert, R. and Barabasi, A.-L., Statistical mechanics of complex networks, Rev. Mod. Phys., 2002, vol. 74, pp. 47–98.

    Article  MathSciNet  MATH  Google Scholar 

  42. Estrada, E., The Structure of Complex Networks: Theory and Applications, Oxford University Press, 2011.

    Book  Google Scholar 

  43. Cohen, R. and Havlin, S., Complex Networks: Structure, Robustness, and Function, Cambridge University Press, 2010.

    Book  MATH  Google Scholar 

  44. Ciancaglini, V., Gaeta, R., Loti, R., and Liquori, L., Interconnection of large scale unstructured P2P networks: Modeling and analysis, Lect. Notes Comput. Sci., 2013, vol. 7984, pp. 183–197.

    Article  Google Scholar 

  45. Leitao, J., Marques, J.P., Pereira, J., and Rodrigues, L., X-bot: A protocol for resilient optimization of unstructured overlay networks, IEEE Trans. Parallel Distrib. Syst., 2012, vol. 23, no. 11, pp. 2175–2188.

    Article  Google Scholar 

  46. Matos, R., Marques, C., and Sargento, S., Distributed approach to control and manage context-based multi-virtual networks, Mobile Networks Appl., 2012, vol. 17, no. 4, pp. 447–462.

    Article  Google Scholar 

  47. Liang, J., Kumar, R., and Ross, K.W., The fasttrack overlay: A measurement study, Comput. Networks, 2006, vol. 50, no. 6, pp. 842–858.

    Article  Google Scholar 

  48. Cohen, B., Incentives build robustness in BitTorrent, Proc. Workshop Economics of Peer-to-Peer systems, 2003, vol. 6, pp. 68–72.

  49. Ripeanu, M., Iamnitchi, A., Foster, I., and Rogers, A., In search of simplicity: A self-organizing group communication overlay, Concurrency Comput. Pract. Exper., 2010, vol. 22, pp. 788–815.

    Google Scholar 

  50. Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., and Shenker, S., Making Gnutella-like P2P systems scalable, Proc. Conf. Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2003. pp. 407–418.

  51. Wouhaybi, R.H. and Campbell, A.T., Phenix: Supporting resilient low-diameter peer-to-peer topologies, Proc. 23rd Joint Conf. IEEE Computer and Communications Societies (INFOCOM), 2004, pp. 1–12.

  52. Carchiolo, V., Malgeri, M., Mangioni, G., and Nicosia, V., An adaptive overlay network inspired by social behaviour, J. Parallel Distrib. Comput., 2010, vol. 70, no. 3, pp. 282–295.

    Article  MATH  Google Scholar 

  53. Babaoglu, O., Canright, G., Deutsch, A., di Caro, G.A., Ducatelle, F., and Gambardella, L.M., Design patterns from biology for distributed computing, ACM Trans. Auton. Adapt. Syst., 2006, vol. 1, no. 1, pp. 26–66.

    Article  Google Scholar 

  54. Balasubramaniam, S., Leibnitz, K., Lio, P., Botvich, D., and Murata, M., Biological principles for future Internet architecture design, IEEE Commun. Mag., 2011, vol. 49, no. 7, pp. 44–52.

    Article  Google Scholar 

  55. Brocco, A. and Baumgart, I., A framework for a comprehensive evaluation of ant-inspired peer-to-peer protocols, Proc. 20th Euromicro Int. Conf. Parallel, Distributed, and Network-Based Processing (PDP), 2012, pp. 303–310.

  56. Dressler, F. and Akan, O.B., Bio-inspired networking: From theory to practice, IEEE Commun. Mag., 2010, vol. 48, no. 11, pp. 176–83.

    Article  MATH  Google Scholar 

  57. Brocco, A., Malatras, A., and Hirsbrunner, B., Enabling efficient information discovery in a self-structured grid, Future Gener. Comput. Syst., 2010, vol. 26, no. 6, pp. 838–846.

    Article  Google Scholar 

  58. Peng, F., Malatras, A., Hirsbrunner, B., and Courant, M., Antom: Constructing multi-layer overlays for pervasive environments, Proc. 8th Int. Workshop Mobile P2P Computing (MP2P), 2012, pp. 1–6.

  59. Forestiero, A., Leonardi, E., Mastroianni, C., and Meo, M., Self-chord: A bio-inspired P2P framework for self-organizing distributed systems, IEEE/ACM Trans. Networking, 2010, vol. 18, no. 5, pp. 1651–1664.

    Article  Google Scholar 

  60. Barthelemy, M., Spatial networks, Phys. Rep., 2011, vol. 499, pp. 1–101.

    Article  MathSciNet  Google Scholar 

  61. Wallach, D., A survey of peer-to-peer security issues, Proc. Int. Symp. Software Security, Theories, and Systems, 2002, pp. 42–57.

  62. Marmol, F.G. and Perez, G.M., State of the art in trust and reputation models in P2P networks, Handbook of Peer-to-Peer Networking, 2010, pp. 761–784.

  63. Urdaneta, G., Pierre, G., and van Steen, M., A survey of DHT security techniques, ACM Comput. Surv., 2011, vol. 43, no. 2, pp. 1–49.

    Article  MATH  Google Scholar 

  64. Tormasov, A., Lysov, A., and Mazur, E., Distributed storage systems: Analysis, classification, and choice, Tr. Inst. Sistemnogo Program. Ross. Akad. Nauk, 2015, vol. 27, no. 6, pp. 225–252.

    Google Scholar 

  65. Kuznetsov, S.D. and Poskonin, A.V., NoSQL data management systems, Program. Comput. Software, 2014, vol. 40, no. 6, pp. 323–332.

    Article  Google Scholar 

  66. Rabin, M.O., Efficient dispersal of information for security, load balancing, and fault tolerance, J. ACM, 1989, vol. 36, no. 2, pp. 335–348.

    Article  MathSciNet  MATH  Google Scholar 

  67. Dimakis, A.G., Ramchandran, K., Wu, Y., and Suh, C., A survey on network codes for distributed storage, Proc. IEEE, 2011, vol. 99, no. 3, pp. 476–489.

    Article  Google Scholar 

  68. Weatherspoon, H. and Kubiatowicz, J.D., Erasure coding vs. replication: A quantitative comparison, Proc. Int. Workshop Peer-to-Peer Systems (IPTPS), 2002, pp. 328–337.

  69. Peterson, W.W. and Wesley, W., Error-Correcting Codes, MIT Press, 1972.

    MATH  Google Scholar 

  70. Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., and Song, D., Provable data possession at untrusted stores, Proc. 14th ACM Conf. Computer and Communications Security, 2007, pp. 598–609.

  71. Ateniese, G., Pietro, R.D., Mancini, L.V., and Tsudik, G., Scalable and efficient provable data possession, Proc. 4th Int. Conf. Security and Privacy in Communication Networks, 2008, p. 9.

  72. Wang, C., Ren, K., and Wang, J., Secure and practical outsourcing of linear programming in cloud computing, Proc. IEEE INFOCOM, 2011, pp. 820–828.

  73. Juels, A. and Kaliski, B.S., PORs: Proofs of retrievability for large files, Proc. 14th ACM Conf. Computer and Communications Security, 2007, pp. 584–597.

  74. Dodis, Y., Vadhan, S., and Wichs, D., Proofs of retrievability via hardness implication, Proc. 6th Conf. Theory of Cryptography, 2009, pp. 109–127.

  75. Sookhak, M., Talebian, H., Ahmed, E., Gani, A., and Khan, M.K., A review on remote data auditing in single cloud server: Taxonomy and open issues, J. Network Comput. Appl., 2014, vol. 43, pp. 121–141.

    Article  Google Scholar 

  76. Mao, W., Modern Cryptography: Theory and Practice, Prentice Hall, 2005.

    MATH  Google Scholar 

  77. Szabo, N., The idea of smart contracts. http://www. fon.hum.uva.nl/rob/Courses/InformationInSpeech/ CDROM/Literature/LOTwinterschool2006/szabo. best.vwh.net/smart_contracts_idea.html. Accessed February 15, 2018.

  78. BitFury Group, Public versus private blockchains. http: //bitfury.com/content/5-white-papers-research/public-vs-private-pt1-1.pdf. Accessed February 15, 2018.

  79. Buterin, V., Ethereum white paper. https://github. com/ethereum/wiki/wiki/White-Paper. Accessed February 15, 2018.

  80. Wood, G., Ethereum: A secure decentralized generalised transaction ledger. http://gavwood.com/paper. pdf. Accessed February 15, 2018.

  81. Franco, P., Understanding Bitcoin, Cryptography, Engineering, and Economics, West Sussex: Wiley, 2015.

    Google Scholar 

  82. Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M., and Morris, R., Designing a DHT for low latency and high throughput, Proc. 1st Symp. Networked Systems Design and Implementation (NSDI), 2004, vol. 4, pp. 85–98.

  83. Flocchini, P., Nayak, A., and Xie, M., Enhancing peer-to-peer systems through redundancy, IEEE J. Sel. Areas Commun., 2007, vol. 25, no. 1, pp. 15–24.

    Article  Google Scholar 

  84. Giordanelli, R., Mastroianni, C., and Meo, M., Bio-inspired P2P systems: The case of multidimensional overlay, ACM Trans. Auton. Adapt. Syst., 2012, vol. 7, no. 4, pp. 35:1–28.

  85. Clarke, I., Sandberg, O., Wiley, B., and Hong, T.W., Freenet: A distributed anonymous information storage and retrieval system, Proc. Int. Workshop Designing Privacy Enhancing Technologies: Design Issues in Anonymity and Unobservability, 2001, pp. 46–66.

  86. Wilkinson, S., Boshevski, T., Brandoff, J., and Buterin, V., Storj: A peer-to-peer cloud storage network. https:// storj.io/storj.pdf. Accessed February 15, 2018.

  87. Vorick, D. and Champine, L., Sia: Simple decentralized storage. https://sia.tech/sia.pdf. Accessed February 15, 2018.

Download references

ACKNOWLEDGMENTS

This work was supported by the Russian Science Foundation, project nos. 18-41-06003 (Sections 2 and 4.1) and 18-11-00075 (Sections 3 and 4.2).

Author information

Authors and Affiliations

  1. Moscow State University, Skobeltsyn Institute of Nuclear Physics, 119991, Moscow, Russia

    A. P. Kryukov & A. P. Demichev

Authors
  1. A. P. Kryukov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. P. Demichev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to A. P. Kryukov or A. P. Demichev.

Additional information

Translated by Yu. Kornienko

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kryukov, A.P., Demichev, A.P. Decentralized Data Storages: Technologies of Construction. Program Comput Soft 44, 303–315 (2018). https://doi.org/10.1134/S0361768818050067

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768818050067

Keywords

Search

Navigation