{"title":"机架感知存储模型的MSR代码的显式构造","authors":"Zitan Chen, A. Barg","doi":"10.1109/ISIT.2019.8849278","DOIUrl":null,"url":null,"abstract":"We consider erasure coding for a model of storage that assumes that nodes are organized into equally sized groups, called racks, such that repairing failed nodes is limited only by inter-rack communication, while transmission of data within a rack does not contribute to the repair bandwidth. We present explicit families of MDS array codes that support recovery of a single failed node from any number of helper racks using the minimum possible amount of inter-rack communication. One of our constructions also has the additional property of low access.Finally, we present a construction of scalar Reed-Solomon codes that support optimal repair for the rack-oriented storage model.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"218 1","pages":"226-230"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Explicit constructions of MSR codes for the rack-aware storage model\",\"authors\":\"Zitan Chen, A. Barg\",\"doi\":\"10.1109/ISIT.2019.8849278\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider erasure coding for a model of storage that assumes that nodes are organized into equally sized groups, called racks, such that repairing failed nodes is limited only by inter-rack communication, while transmission of data within a rack does not contribute to the repair bandwidth. We present explicit families of MDS array codes that support recovery of a single failed node from any number of helper racks using the minimum possible amount of inter-rack communication. One of our constructions also has the additional property of low access.Finally, we present a construction of scalar Reed-Solomon codes that support optimal repair for the rack-oriented storage model.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"218 1\",\"pages\":\"226-230\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2019.8849278\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2019.8849278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Explicit constructions of MSR codes for the rack-aware storage model
We consider erasure coding for a model of storage that assumes that nodes are organized into equally sized groups, called racks, such that repairing failed nodes is limited only by inter-rack communication, while transmission of data within a rack does not contribute to the repair bandwidth. We present explicit families of MDS array codes that support recovery of a single failed node from any number of helper racks using the minimum possible amount of inter-rack communication. One of our constructions also has the additional property of low access.Finally, we present a construction of scalar Reed-Solomon codes that support optimal repair for the rack-oriented storage model.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
