{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:01Z","timestamp":1740123841373,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T00:00:00Z","timestamp":1679702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T00:00:00Z","timestamp":1679702400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62171313"],"award-info":[{"award-number":["62171313"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ACHILLES","award":["PID2019- 104207RB-I00"],"award-info":[{"award-number":["PID2019- 104207RB-I00"]}]},{"name":"6\u00a0G-INTEGRATION","award":["TSI-063000-2021-127"],"award-info":[{"award-number":["TSI-063000-2021-127"]}]},{"name":"Go2Edge network","award":["RED2018-102585-T"],"award-info":[{"award-number":["RED2018-102585-T"]}]},{"DOI":"10.13039\/501100003759","name":"Universidad Polit\u00e9cnica de Madrid","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003759","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Big data becomes the key for ubiquitous computing and intelligence, and Distributed Storage Systems (DSS) are widely used in large-scale data centers or in the cloud for efficient data management. However, the data on stored are likely to be unavailable due to hardware failures and cyberattacks, e.g. DDoS. Maximum Distance Separable (MDS) codes are commonly used for the recovery of faulty storage nodes or unavailable data. However, the recovery of data nodes usually involves access to multiple nodes, which introduces significant communication overheads to the DSS. In this paper, a new DSS based on the Redundant Residue Number System (RRNS) is proposed, where efficient recovery is enabled by applying the second version of Chinese Remainder Theorem (CRT-II). The complexity and network traffic of the proposed data protection scheme is analyzed theoretically and compared with that of traditional MDS based DSSs. Experimental results show that the proposed DSS achieves lower encoding complexity, lower recovery complexity and lower network traffic than the MDS based schemes. Although the proposed data protection scheme introduces computation overheads for the case on which there are no failing nodes, its complexity is still lower for scenarios with frequent data updates. In addition, the proposed scheme introduces additional advantages in terms of security and storage flexibility.<\/jats:p>","DOI":"10.1007\/s11276-023-03287-8","type":"journal-article","created":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T18:02:30Z","timestamp":1679767350000},"page":"5601-5612","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing data protection with a distributed storage system based on the redundant residue number system"],"prefix":"10.1007","volume":"30","author":[{"given":"Zhen","family":"Gao","sequence":"first","affiliation":[]},{"given":"Lu","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Reviriego","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,25]]},"reference":[{"issue":"8","key":"3287_CR1","doi-asserted-by":"publisher","first-page":"4481","DOI":"10.1109\/TIT.2016.2524510","volume":"62","author":"AS Rawat","year":"2016","unstructured":"Rawat, A. S., Papailiopoulos, D. S., Dimakis, A. G., & Vishwanath, S. (2016). Locality and availability in distributed storage. IEEE Transactions on Information Theory, 62(8), 4481\u20134493.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3287_CR2","doi-asserted-by":"crossref","unstructured":"Yang, L., & Liu, S. (2015) An energy-saving method for erasure-coded distributed storage system. In: Proceedings of the 4th International Conference on Computer Engineering and Networks, (pp. 271\u2013278) Springer","DOI":"10.1007\/978-3-319-11104-9_32"},{"key":"3287_CR3","doi-asserted-by":"crossref","unstructured":"Shvachko, K., Kuang, H., Radia, S., & Chansler, R. (2010) The hadoop distributed file system. In: 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST), pp. 1\u201310","DOI":"10.1109\/MSST.2010.5496972"},{"issue":"3","key":"3287_CR4","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/JPROC.2010.2096170","volume":"99","author":"AG Dimakis","year":"2011","unstructured":"Dimakis, A. G., Ramchandran, K., Wu, Y., & Suh, C. (2011). A survey on network codes for distributed storage. Proceedings of the IEEE, 99(3), 476\u2013489.","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"3287_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1109\/TPDS.2019.2937492","volume":"31","author":"J Zhou","year":"2019","unstructured":"Zhou, J., Chen, Y., Wang, W., He, S., & Meng, D. (2019). A highly reliable metadata service for large-scale distributed file systems. IEEE Transactions on Parallel and Distributed Systems, 31(2), 374\u2013392.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"10","key":"3287_CR6","doi-asserted-by":"publisher","first-page":"2248","DOI":"10.1109\/TPDS.2020.2987837","volume":"31","author":"L Xu","year":"2020","unstructured":"Xu, L., Lyu, M., Li, Z., Li, Y., & Xu, Y. (2020). Deterministic data distribution for efficient recovery in erasure-coded storage systems. IEEE Transactions on Parallel and Distributed Systems, 31(10), 2248\u20132262.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"3287_CR7","unstructured":"Schroeder, B., & Gibson, G.A.: Disk failures in the real world: What does an mttf of 1,000,000 hours mean to you?(cmu-pdl-06-111) (2006)"},{"key":"3287_CR8","unstructured":"Borthakur, D.: Hdfs and erasure codes (hdfs-raid). http:\/\/hadoopblog.blogspot.com\/2009\/08\/"},{"key":"3287_CR9","first-page":"4","volume":"6","author":"B-G Chun","year":"2006","unstructured":"Chun, B.-G., Dabek, F., Haeberlen, A., Sit, E., Weatherspoon, H., Kaashoek, M. F., Kubiatowicz, J., & Morris, R. T. (2006). Efficient replica maintenance for distributed storage systems. NSDI, 6, 4\u20134.","journal-title":"NSDI"},{"key":"3287_CR10","doi-asserted-by":"crossref","unstructured":"Fan, B., Tantisiriroj, W., Xiao, L., & Gibson, G. (2009) Diskreduce: Raid for data-intensive scalable computing. In: Proceedings of the 4th Annual Workshop on Petascale Data Storage, pp. 6\u201310","DOI":"10.1145\/1713072.1713075"},{"key":"3287_CR11","unstructured":"Acedanski, S., Deb, S., M\u00e9dard, M., & Koetter, R.: How good is random linear coding based distributed networked storage. In: Workshop on network coding, theory and applications, pp. 1\u20136 (2005)"},{"issue":"9","key":"3287_CR12","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis, A. G., Godfrey, P. B., Wu, Y., Wainwright, M. J., & Ramchandran, K. (2010). Network coding for distributed storage systems. IEEE Transactions on Information Theory, 56(9), 4539\u20134551.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"3287_CR13","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"KV Rashmi","year":"2011","unstructured":"Rashmi, K. V., Shah, N. B., & Kumar, P. V. (2011). Optimal exact-regenerating codes for distributed storage at the msr and mbr points via a product-matrix construction. IEEE Transactions on Information Theory, 57(8), 5227\u20135239.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"3287_CR14","first-page":"5802","volume":"63","author":"K Rashmi","year":"2017","unstructured":"Rashmi, K., Shah, N. B., & Ramchandran, K. (2017). A piggybacking design framework for read-and download-efficient distributed storage codes. IEEE Transactions on Information Theory, 63(9), 5802\u20135820.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3287_CR15","doi-asserted-by":"crossref","unstructured":"Rashmi, K.V., Shah, N.B., Gu, D., Kuang, H., Borthakur, D., & Ramchandran, K. (2014) A\u201c hitchhiker\u2019s\u201d guide to fast and efficient data reconstruction in erasure-coded data centers. In: Proceedings of the 2014 ACM conference on SIGCOMM, pp. 331\u2013342","DOI":"10.1145\/2619239.2626325"},{"key":"3287_CR16","doi-asserted-by":"crossref","unstructured":"Mahdaviani, K., Mohajer, S., & Khisti, A. (2017) Product matrix minimum storage regenerating codes with flexible number of helpers. In: 2017 IEEE information theory workshop (ITW), pp. 41\u201345. IEEE","DOI":"10.1109\/ITW.2017.8278018"},{"key":"3287_CR17","doi-asserted-by":"crossref","unstructured":"Wang, C., Zhou, K., & Wei, R. (2018) Qs-code: A quasi-systematic erasure code with partial security for cloud storage. In: International Conference on Cloud Computing and Security, (pp. 206\u2013216). Springer","DOI":"10.1007\/978-3-030-00012-7_19"},{"key":"3287_CR18","doi-asserted-by":"crossref","unstructured":"Ren, Y., Zhou, L., Liu, Y., & Zhang, X. (2018) Preservation mechanism of electronic record based on erasure code and multi copies in cloud storage. In: International Conference on Cloud Computing and Security, (pp. 174\u2013183) Springer","DOI":"10.1007\/978-3-030-00012-7_16"},{"issue":"11","key":"3287_CR19","doi-asserted-by":"publisher","first-page":"9127","DOI":"10.1007\/s13369-019-03983-8","volume":"44","author":"OT Lee","year":"2019","unstructured":"Lee, O. T., Akash, G., Kumar, S., & Chandran, P. (2019). Storage node allocation methods for erasure code-based cloud storage systems. Arabian Journal for Science and Engineering, 44(11), 9127\u20139142.","journal-title":"Arabian Journal for Science and Engineering"},{"key":"3287_CR20","doi-asserted-by":"crossref","unstructured":"Yang, L., & Liu, S. (2015) An energy-saving method for erasure-coded distributed storage system. In: Proceedings of the 4th International Conference on Computer Engineering and Networks, (pp. 271\u2013278). Springer","DOI":"10.1007\/978-3-319-11104-9_32"},{"issue":"9","key":"3287_CR21","doi-asserted-by":"publisher","first-page":"9408","DOI":"10.1109\/TVT.2021.3099303","volume":"70","author":"H Feng","year":"2021","unstructured":"Feng, H., Guo, S., Yang, L., & Yang, Y. (2021). Collaborative data caching and computation offloading for multi-service mobile edge computing. IEEE Transactions on Vehicular Technology, 70(9), 9408\u20139422.","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"9","key":"3287_CR22","doi-asserted-by":"publisher","first-page":"9212","DOI":"10.1109\/TVT.2022.3179363","volume":"71","author":"W Li","year":"2022","unstructured":"Li, W., Li, Q., Chen, L., Wu, F., & Ren, J. (2022). A storage resource collaboration model among edge nodes in edge federation service. IEEE Transactions on Vehicular Technology, 71(9), 9212\u20139224.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"3287_CR23","doi-asserted-by":"crossref","unstructured":"Dussoye, S., Issack, Z., & Chiniah, A. (2019) Erasure code and edge computing for providing an optimal platform for storage of iot data. In: 2019 IEEE Global Conference on Internet of Things (GCIoT), (pp. 1\u20134). IEEE","DOI":"10.1109\/GCIoT47977.2019.9058414"},{"key":"3287_CR24","unstructured":"Yang, J., Sabnis, A., Berger, D.S., Rashmi, K., & Sitaraman, R.K. (2022) $$\\{$$C2DN$$\\}$$: How to harness erasure codes at the edge for efficient content delivery. In: 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22), (pp. 1159\u20131177)"},{"key":"3287_CR25","doi-asserted-by":"crossref","unstructured":"Kontodimas, K., Soumplis, P., Kretsis, A., Kokkinos, P., & Varvarigos, E. (2021) Secure distributed storage on cloud-edge infrastructures. In: 2021 IEEE 10th International Conference on Cloud Networking (CloudNet), (pp. 127\u2013132). IEEE","DOI":"10.1109\/CloudNet53349.2021.9657156"},{"key":"3287_CR26","doi-asserted-by":"crossref","unstructured":"Jonathan, A., Uluyol, M., Chandra, A., & Weissman, J. (2017) Ensuring reliability in geo-distributed edge cloud. In: 2017 Resilience Week (RWS), (pp. 127\u2013132). IEEE","DOI":"10.1109\/RWEEK.2017.8088660"},{"issue":"2","key":"3287_CR27","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1109\/TIT.2005.862100","volume":"52","author":"H Gluesing-Luerssen","year":"2006","unstructured":"Gluesing-Luerssen, H., Rosenthal, J., & Smarandache, R. (2006). Strongly-mds convolutional codes. IEEE Transactions on Information Theory, 52(2), 584\u2013598.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3287_CR28","doi-asserted-by":"crossref","unstructured":"Ohtsuji, H., & Tatebe, O. (2015) Network-based data processing architecture for reliable and high-performance distributed storage system. In: European Conference on Parallel Processing, (pp. 16\u201326). Springer","DOI":"10.1007\/978-3-319-27308-2_2"},{"issue":"10","key":"3287_CR29","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2021.3129973","volume":"33","author":"L Xu","year":"2021","unstructured":"Xu, L., Lyu, M., Li, Q., Xie, L., Li, C., & Xu, Y. (2021). Selectiveec: Towards balanced recovery load on erasure-coded storage systems. IEEE Transactions on Parallel and Distributed Systems, 33(10), 2386\u20132400.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"3287_CR30","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I. S., & Solomon, G. (1960). Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics, 8(2), 300\u2013304.","journal-title":"Journal of the society for industrial and applied mathematics"},{"issue":"8","key":"3287_CR31","doi-asserted-by":"publisher","first-page":"4785","DOI":"10.1109\/TIT.2019.2912165","volume":"65","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as, U., & Kschischang, F. R. (2019). Reliable and secure multishot network coding using linearized reed-solomon codes. IEEE Transactions on Information Theory, 65(8), 4785\u20134803.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"3287_CR32","doi-asserted-by":"publisher","first-page":"1937","DOI":"10.1007\/s10623-022-01049-9","volume":"90","author":"J Sui","year":"2022","unstructured":"Sui, J., Zhu, X., & Shi, X. (2022). Mds and near-mds codes via twisted reed-solomon codes. Designs, Codes and Cryptography, 90(8), 1937\u20131958.","journal-title":"Designs, Codes and Cryptography"},{"issue":"2","key":"3287_CR33","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/263876.263881","volume":"27","author":"L Rizzo","year":"1997","unstructured":"Rizzo, L. (1997). Effective erasure codes for reliable computer communication protocols. ACM SIGCOMM computer communication review, 27(2), 24\u201336.","journal-title":"ACM SIGCOMM computer communication review"},{"key":"3287_CR34","doi-asserted-by":"crossref","unstructured":"Li, J. (2005) The efficient implementation of reed-solomon high rate erasure resilient codes. In: Proceedings.(ICASSP\u201905). IEEE international conference on acoustics, speech, and signal processing. 3: 1097. IEEE","DOI":"10.1109\/ICASSP.2005.1415905"},{"key":"3287_CR35","unstructured":"Omura, J.K., Massey, J.L. (1986) Computational method and apparatus for finite field arithmetic. Google Patents US Patent 4: 587\u2013627"},{"key":"3287_CR36","doi-asserted-by":"crossref","unstructured":"Al-Shaikhi, A.A., & Ilow, J. (2008) Packet loss recovery codes based on vandermonde matrices and shift operators. In: 2008 IEEE International Symposium on Information Theory, (pp. 1058\u20131062). IEEE","DOI":"10.1109\/ISIT.2008.4595149"},{"issue":"9","key":"3287_CR37","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1002\/(SICI)1097-024X(199709)27:9<995::AID-SPE111>3.0.CO;2-6","volume":"27","author":"JS Plank","year":"1997","unstructured":"Plank, J. S. (1997). A tutorial on reed-solomon coding for fault-tolerance in raid-like systems. Software Practice and Experience, 27(9), 995\u20131012.","journal-title":"Software Practice and Experience"},{"key":"3287_CR38","doi-asserted-by":"crossref","unstructured":"Garner, H.L. (1959) The residue number system. In: papers presented at the the March 3-5, 1959, Western joint computer conference, (pp. 146\u2013153)","DOI":"10.1145\/1457838.1457864"},{"key":"3287_CR39","doi-asserted-by":"crossref","unstructured":"Wang, Y. (1998) New chinese remainder theorems. In: Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No. 98CH36284), (vol. 1, pp. 165\u2013171). IEEE","DOI":"10.1109\/ACSSC.1998.750847"},{"issue":"3","key":"3287_CR40","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/T-C.1973.223711","volume":"100","author":"F Barsi","year":"1973","unstructured":"Barsi, F., & Maestrini, P. (1973). Error correcting properties of redundant residue number systems. IEEE Transactions on Computers, 100(3), 307\u2013315.","journal-title":"IEEE Transactions on Computers"},{"key":"3287_CR41","doi-asserted-by":"crossref","unstructured":"Timarchi, S., & Navi, K. (2007) Efficient class of redundant residue number system. In: 2007 IEEE international symposium on intelligent signal processing, (pp. 1\u20136). IEEE","DOI":"10.1109\/WISP.2007.4447506"},{"issue":"1","key":"3287_CR42","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TNET.2018.2881169","volume":"27","author":"G Tang","year":"2018","unstructured":"Tang, G., Wang, H., Wu, K., & Guo, D. (2018). Tapping the knowledge of dynamic traffic demands for optimal cdn design. IEEE\/ACM Transactions on Networking, 27(1), 98\u2013111.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"2","key":"3287_CR43","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/MCOM.2014.6736753","volume":"52","author":"X Wang","year":"2014","unstructured":"Wang, X., Chen, M., Taleb, T., Ksentini, A., & Leung, V. C. (2014). Cache in the air: Exploiting content caching and delivery techniques for 5g systems. IEEE Communications Magazine, 52(2), 131\u2013139.","journal-title":"IEEE Communications Magazine"},{"issue":"5","key":"3287_CR44","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1109\/TDSC.2018.2833110","volume":"17","author":"S Cui","year":"2018","unstructured":"Cui, S., Asghar, M. R., & Russello, G. (2018). Multi-cdn: Towards privacy in content delivery networks. IEEE Transactions on Dependable and Secure Computing, 17(5), 984\u2013999.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"3287_CR45","doi-asserted-by":"publisher","first-page":"3805","DOI":"10.1109\/TMM.2020.3032042","volume":"23","author":"S Nacakli","year":"2020","unstructured":"Nacakli, S., & Tekalp, A. M. (2020). Controlling p2p-cdn live streaming services at sdn-enabled multi-access edge datacenters. IEEE Transactions on Multimedia, 23, 3805\u20133816.","journal-title":"IEEE Transactions on Multimedia"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-023-03287-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11276-023-03287-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-023-03287-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:54:24Z","timestamp":1729126464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11276-023-03287-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,25]]},"references-count":45,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["3287"],"URL":"https:\/\/doi.org\/10.1007\/s11276-023-03287-8","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2023,3,25]]},"assertion":[{"value":"13 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}