{"title":"存储代码允许部分协作修复","authors":"Shiqiu Liu, F. Oggier","doi":"10.1109/ISIT.2014.6875272","DOIUrl":null,"url":null,"abstract":"We consider the design of codes for distributed storage systems that are amenable to repair. We introduce the notion of partial collaboration to capture the property that nodes participating in a repair process may collaborate to different extents, bringing more nuances to the known cases: no collaboration or full collaboration during repair. We compute for this scenario the storage (per node) when the repair bandwidth (per node) is minimal, and conversely the repair bandwidth when the storage is minimal. We provide a generic code construction that enables repair of several failures through partial collaboration.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"On storage codes allowing partially collaborative repairs\",\"authors\":\"Shiqiu Liu, F. Oggier\",\"doi\":\"10.1109/ISIT.2014.6875272\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the design of codes for distributed storage systems that are amenable to repair. We introduce the notion of partial collaboration to capture the property that nodes participating in a repair process may collaborate to different extents, bringing more nuances to the known cases: no collaboration or full collaboration during repair. We compute for this scenario the storage (per node) when the repair bandwidth (per node) is minimal, and conversely the repair bandwidth when the storage is minimal. We provide a generic code construction that enables repair of several failures through partial collaboration.\",\"PeriodicalId\":127191,\"journal\":{\"name\":\"2014 IEEE International Symposium on Information Theory\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2014.6875272\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2014.6875272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On storage codes allowing partially collaborative repairs
We consider the design of codes for distributed storage systems that are amenable to repair. We introduce the notion of partial collaboration to capture the property that nodes participating in a repair process may collaborate to different extents, bringing more nuances to the known cases: no collaboration or full collaboration during repair. We compute for this scenario the storage (per node) when the repair bandwidth (per node) is minimal, and conversely the repair bandwidth when the storage is minimal. We provide a generic code construction that enables repair of several failures through partial collaboration.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
