{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T15:46:08Z","timestamp":1746805568884,"version":"3.40.5"},"reference-count":43,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T00:00:00Z","timestamp":1611878400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Research and Development Project","award":["2019YFB2102600","61572194","61672233"],"award-info":[{"award-number":["2019YFB2102600","61572194","61672233"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2019YFB2102600","61572194","61672233"],"award-info":[{"award-number":["2019YFB2102600","61572194","61672233"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2021,1,29]]},"abstract":"<jats:p>Edge computing, as an emerging computing paradigm, aims to reduce network bandwidth transmission overhead while storing and processing data on edge nodes. However, the storage strategies required for edge nodes are different from those for existing data centers. Erasure code (EC) strategies have been applied in some decentralized storage systems to ensure the privacy and security of data storage. Product-matrix (PM) regenerating codes (RGCs) as a state-of-the-art EC family are designed to minimize the repair bandwidth overhead or minimize the storage overhead. Nevertheless, the high complexity of the PM framework contains more finite-domain multiplication operations than classical ECs, which heavily consumes computational resources at the edge nodes. In this paper, a theoretical derivation of each step of the PM minimum storage regeneration (PM-MSR) and PM minimum bandwidth regeneration (PM-MBR) codes is performed and the XOR complexity over finite fields is analyzed. On this basis, a new construct called product bitmatrix (PB) is designed to reduce the complexity of XOR operations in the PM framework, and two heuristics are used to further reduce the XOR numbers of the PB-MSR and PB-MBR codes, respectively. The evaluation results show that the PB construction significantly reduces the XOR number compared to the PM-MSR, PM-MBR, Reed\u2013Solomon (RS), and Cauchy RS codes while retaining optimal performance and reliability.<\/jats:p>","DOI":"10.1155\/2021\/6642121","type":"journal-article","created":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T18:35:06Z","timestamp":1612031706000},"page":"1-18","source":"Crossref","is-referenced-by-count":1,"title":["PB: A Product-Bitmatrix Construction to Reduce the Complexity of XOR Operations of PM-MSR and PM-MBR Codes over <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                     <a:mtext>GF<\/a:mtext>\n                     <a:mfenced open=\"(\" close=\")\" separators=\"|\">\n                        <a:mrow>\n                           <a:msup>\n                              <a:mrow>\n                                 <a:mn>2<\/a:mn>\n                              <\/a:mrow>\n                              <a:mrow>\n                                 <a:mi>w<\/a:mi>\n                              <\/a:mrow>\n                           <\/a:msup>\n                        <\/a:mrow>\n                     <\/a:mfenced>\n                  <\/a:math>"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0716-1590","authenticated-orcid":true,"given":"Chuqiao","family":"Xiao","sequence":"first","affiliation":[{"name":"East China Normal University, Software Engineering Institute, Shanghai 200062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7532-7153","authenticated-orcid":true,"given":"Xueqing","family":"Gong","sequence":"additional","affiliation":[{"name":"East China Normal University, Software Engineering Institute, Shanghai 200062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5855-2850","authenticated-orcid":true,"given":"Yefeng","family":"Xia","sequence":"additional","affiliation":[{"name":"East China Normal University, Software Engineering Institute, Shanghai 200062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7919-7162","authenticated-orcid":true,"given":"Qian","family":"Zhang","sequence":"additional","affiliation":[{"name":"East China Normal University, Software Engineering Institute, Shanghai 200062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/mc.2017.9"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2016.2579198"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/tii.2020.2974875"},{"author":"K. Dolui","key":"4","article-title":"Comparison of edge computing implementations: fog computing, cloudlet and mobile edge computing"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/3391198"},{"key":"6","doi-asserted-by":"crossref","first-page":"6900","DOI":"10.1109\/ACCESS.2017.2778504","article-title":"A survey on the edge computing for the internet of things","volume":"6","author":"W. Yu","year":"2017","journal-title":"IEEE Access"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9482-6"},{"volume-title":"Sia: Simple Decentralized Storage","year":"2014","author":"D. Vorick","key":"8"},{"volume-title":"Storj a Peer-To-Peer Cloud Storage Network","year":"2014","author":"S. Wilkinson","key":"9"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1109\/ACCESS.2020.2995973","volume-title":"An Erasure-Coded Storage System for Edge Computing","author":"L. Liang","year":"2020"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/3375554"},{"author":"S. P. James","key":"13","article-title":"Heuristics for optimizing matrix-based erasure codes for fault-tolerant storage systems"},{"first-page":"299","article-title":"Screaming fast galois field arithmetic using intel simd instructions","author":"S. P. James","key":"14"},{"key":"15","article-title":"A survey on regenerating codes","volume":"24","author":"V. A. Vins","year":"2014","journal-title":"International Journal of Scientific and Research Publication"},{"author":"K. V. Rashmi","key":"16","article-title":"A solution to the network challenges of data recovery in erasure-coded distributed storage systems: a study on the facebook warehouse cluster"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2010.2054295"},{"issue":"5","key":"18","doi-asserted-by":"crossref","first-page":"2736","DOI":"10.1109\/TIT.2018.2878223","article-title":"Bandwidth adaptive & error resilient mbr exact repair regenerating codes","volume":"65","author":"K. Mahdaviani","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"19","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.1109\/TIT.2017.2661313","article-title":"Explicit constructions of high-rate mds array codes with optimal repair bandwidth","volume":"63","author":"M. Ye","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"first-page":"139","article-title":"Clay codes: moulding M\u2009DScodes to yield an cMSRode","author":"M. Vajha","key":"20"},{"issue":"8","key":"21","doi-asserted-by":"crossref","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","article-title":"Optimal exact-regenerating codes for distributed storage at the msr and mbr points via a product-matrix construction","volume":"57","author":"K. V. Rashmi","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"first-page":"81","article-title":"Having your cake and eating it too: jointly optimal erasure codes for i\/o, storage, and network-bandwidth","author":"K. V. Rashmi","key":"22"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2018.2796599"},{"article-title":"Product matrix minimum storage regenerating codes with flexible number of helpers","author":"K. Mahdaviani","key":"24","doi-asserted-by":"crossref","DOI":"10.1109\/ITW.2017.8278018"},{"key":"25","doi-asserted-by":"crossref","DOI":"10.1201\/9781420034981","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"H. Cohen","year":"2005"},{"volume-title":"An Xor-based erasure-resilient coding scheme","year":"1995","author":"J. Bloemer","key":"26"},{"first-page":"173","article-title":"Optimizing cauchy reed-solomon codes for fault-tolerant network storage applications","author":"S. P. James","key":"27"},{"key":"28","unstructured":"PlankJ. S.JerasureK.A library in C facilitating erasure coding for storage applications\u2013version 2.02014Knoxville, TN, USAUniversity of TennesseeTechnical Report UT-EECS-14-721"},{"key":"29","article-title":"GF-Complete: A comprehensive open source library for Galois Field arithmetic","volume-title":"Technical report UT-CS-13","author":"J. S. Plank","year":"2013"},{"key":"30","article-title":"Nccloud: applying network coding for the storage repair in a cloud-of-clouds","volume":"21","author":"Y. Hu","year":"2012","journal-title":"FAST"},{"first-page":"81","article-title":"Opening the chrysalis: on the real repair performance of codes","author":"L. Pamies-Juarez","key":"31"},{"first-page":"1","article-title":"Ncfs: on the practicality and extensibility of a network-coding-based distributed file system","author":"Y. Hu","key":"32"},{"first-page":"1243","article-title":"Explicit construction of optimal exact regenerating codes for distributed storage","author":"K. V. Rashmi","key":"33"},{"issue":"3","key":"34","first-page":"1837","article-title":"Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff","volume":"58","author":"B. Nihar","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2013.2297109"},{"first-page":"1621","article-title":"Basic regenerating code: binary addition and shift for exact repair","author":"H. Hou","key":"36"},{"first-page":"33","article-title":"Construction of exact-basic codes for distributed storage systems at the msr point","author":"H. Hou","key":"37"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2016.2553670"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.2983835"},{"first-page":"1233","article-title":"Mining consuming behaviors with temporal evolution for personalized recommendation in mobile marketing apps","author":"H. Gao","key":"40"},{"key":"41","first-page":"1","article-title":"An approach to alleviate the sparsity problem of hybrid collaborative filtering based recommendations: the product-attribute perspective from user reviews","volume":"2","author":"X. Yang","year":"2019","journal-title":"Mobile Networks and Applications"},{"key":"42","doi-asserted-by":"crossref","DOI":"10.1109\/TCCN.2020.3027681","article-title":"Qos prediction for service recommendation with features learning in mobile edge computing environment","author":"Y. Yin","year":"2020","journal-title":"IEEE Transactions on Cognitive Communications and Networking"},{"article-title":"Learning a code: machine learning for approximate non-linear coded computation","year":"2018","author":"K. Jack","key":"43"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6642121.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6642121.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6642121.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T18:35:20Z","timestamp":1612031720000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2021\/6642121\/"}},"subtitle":[],"editor":[{"given":"Honghao","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1,29]]},"references-count":43,"alternative-id":["6642121","6642121"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6642121","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2021,1,29]]}}}