{"title":"RS(10,4) Reed-Solomon码的低带宽修复","authors":"I. Duursma, Hoang Dau","doi":"10.1109/ITA.2017.8023449","DOIUrl":null,"url":null,"abstract":"As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon codes. The use of Reed-Solomon codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Low bandwidth repair of the RS(10,4) Reed-Solomon code\",\"authors\":\"I. Duursma, Hoang Dau\",\"doi\":\"10.1109/ITA.2017.8023449\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon codes. The use of Reed-Solomon codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.\",\"PeriodicalId\":305510,\"journal\":{\"name\":\"2017 Information Theory and Applications Workshop (ITA)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Information Theory and Applications Workshop (ITA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA.2017.8023449\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Information Theory and Applications Workshop (ITA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2017.8023449","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low bandwidth repair of the RS(10,4) Reed-Solomon code
As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon codes. The use of Reed-Solomon codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
