A survey on trade-off between storage and repair traffic in distributed storage systems

  • Authors

    • D Sowmia
    • B Muruganantham
    2018-03-19
    https://doi.org/10.14419/ijet.v7i2.8.10466
  • Distributed Storage Systems, Encryption, Data Center, Wireless Networks

  • Distributed storage systems give dependable access to information through excess spread over independently unreliable hubs. Application scenarios incorporate server farms, distributed capacity frameworks, and capacity in remote systems. This paper gives a study on the cloud storage model of networked online storage where data is stored in virtualized pools of storage which are generally hosted by third parties. Hosting companies operate large data centersand people who require their data to be encouraged buy or lease accumulating limit from them. The server cultivate overseers, outside of anyone's ability to see, virtualize the advantages according to the necessities of the customer and reveal them as limit pools, which the customers would themselves have the capacity to use to store records or data objects. . The data is stored across various locations, when the user wants to retrieve them, it could be done by any of the encryption methods. At last, in view of existing procedures, promising future research bearings are recommended.

  • References

    1. [1] H. Zhang, H. Li, B. Zhu, and J. Chen, “Fast repair for single failure in erasure coding-baseddistributed storage systems,†in Reliable Distributed Systems (SRDS), 2014 IEEE 33rd InternationalSymposium on, Oct 2014, pp. 146–151.

      [2] K. Shvachko, H. Kuang, S. Radia, and R. Chansler, “The hadoop distributed filesystem,†in Mass Storage Systems and Technologies (MSST), 2010 IEEE 26th Symposium on. IEEE,2010, pp. 1–10.

      [3] A.G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, “Network codingfor distributed storage systems,†Information Theory, IEEE Transactions on, vol. 56, no. 9, pp. 4539–4551, 2010.

      [4] Y. Hu, C.-M. Yu, Y. K. Li, P. P. Lee, and J. C. Lui, “Ncfs: On the practicality and extensibility ofa network-coding-based distributed file system,†in Network Coding (NetCod), 2011 InternationalSymposium on. IEEE, 2011, pp. 1–6.

      [5] K. V. Rashmi, N. B. Shah, and P. V. Kumar, “Optimal exact-regenerating codes for distributedstorage at the msr and mbr points via a product-matrix construction,†Information Theory, IEEE Transactions on, vol. 57, no. 8, pp. 5227–5239,2011.

      [6] N. B. Shah, K. V. Rashmi, P. Vijay Kumar, and K. Ramchandran, “Distributed storage codeswith repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff,†Information Theory, IEEE Transactions on, vol. 58, no. 3, pp. 1837–1852, 2012.

      [7] C. Suh and K. Ramchandran, “Exact-repair mds code construction using interference alignment,â€Information Theory, IEEE Transactions on, vol. 57, no. 3, pp. 1425–1442, 2011.

      [8] S.-Y. Li, R. W. Yeung, and N. Cai, “Linear network coding,†Information Theory, IEEE Transactionson, vol. 49, no. 2, pp. 371–381, 2003.

      [9] Xiaowen Chu; Chengjian Liu; Kai Ouyang; Ling Sing Yung; Hai Liu; Yiu-Wing Leung “PErasure: a Parallel Cauchy Reed-Solomon Coding Library for GPUsâ€, IEEE International Conference on Communications (ICC), 2015, pp. 436 – 441.

      [10] J. S. Plank and L. Xu, “Optimizing cauchyreedsolomon codes for fault-tolerant network storageapplications,†in Network Computing and Applications, 2006. NCA 2006. Fifth IEEE InternationalSymposium on. IEEE, 2006, pp. 173–180.

      [11] Y. Wu, “A construction of systematic mds codes with minimum repair bandwidth,†InformationTheory, IEEE Transactions on, vol. 57, no. 6, pp. 3738–3741, 2011.

      [12] A.S. Rawat and S. Vishwanath, “On locality in distributed storage systems,†in InformationTheory Workshop (ITW), 2012 IEEE. IEEE, 2012, pp. 497–501.

      [13] J. Li, S. Yang, X. Wang, X. Xue, and B. Li, “Treestructured data regeneration with network codingin distributed storage systems,†in Quality of Service, 2009. IWQoS. 17th International Workshopon, July 2009, pp. 1–9.

      [14] Y. Wang, D. Wei, X. Yin, and X. Wang, “Heterogeneity-aware data regeneration in distributedstorage systems,†in INFOCOM, 2014 Proceedings IEEE, April 2014, pp. 1878–1886.

      [15] J. Li, S. Yang, X.Wang, and B. Li, “Tree-structured data regeneration in distributed storage systems with regenerating codes,†in INFOCOM, 2010 Proceedings IEEE, March 2010, pp. 1–9.

  • Downloads

  • How to Cite

    Sowmia, D., & Muruganantham, B. (2018). A survey on trade-off between storage and repair traffic in distributed storage systems. International Journal of Engineering & Technology, 7(2.8), 379-381. https://doi.org/10.14419/ijet.v7i2.8.10466