动态存储系统的容量

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI:10.1109/ISIT.2019.8849745

Ohad Elishco, A. Barg

{"title":"动态存储系统的容量","authors":"Ohad Elishco, A. Barg","doi":"10.1109/ISIT.2019.8849745","DOIUrl":null,"url":null,"abstract":"We define a time-dependent model of erasure coding for distributed storage and estimate the average capacity of the network in the simple case of fixed link bandwidth that takes one of two given values. We show that if k data blocks are encoded into n blocks placed on n nodes of which n1 have links with bandwidth greater than the remaining n − n1 nodes by γ symbols, then the average capacity increases by Ω(γ(k – n1)2) symbols compared to the static model.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"1562-1566"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Capacity of dynamical storage systems\",\"authors\":\"Ohad Elishco, A. Barg\",\"doi\":\"10.1109/ISIT.2019.8849745\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We define a time-dependent model of erasure coding for distributed storage and estimate the average capacity of the network in the simple case of fixed link bandwidth that takes one of two given values. We show that if k data blocks are encoded into n blocks placed on n nodes of which n1 have links with bandwidth greater than the remaining n − n1 nodes by γ symbols, then the average capacity increases by Ω(γ(k – n1)2) symbols compared to the static model.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"1 1\",\"pages\":\"1562-1566\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"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.8849745\",\"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.8849745","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们定义了分布式存储的擦除编码的时间依赖模型，并在固定链路带宽取两个给定值之一的简单情况下估计了网络的平均容量。我们表明，如果k个数据块被编码成n个块，放置在n个节点上，其中n1个节点的链路带宽比剩余的n - n1个节点大γ个符号，那么平均容量比静态模型增加Ω(γ(k - n1)2)个符号。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Capacity of dynamical storage systems

We define a time-dependent model of erasure coding for distributed storage and estimate the average capacity of the network in the simple case of fixed link bandwidth that takes one of two given values. We show that if k data blocks are encoded into n blocks placed on n nodes of which n1 have links with bandwidth greater than the remaining n − n1 nodes by γ symbols, then the average capacity increases by Ω(γ(k – n1)2) symbols compared to the static model.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 IEEE International Symposium on Information Theory (ISIT)

自引率

0.00%

发文量

期刊最新文献

Gambling and Rényi Divergence Irregular Product Coded Computation for High-Dimensional Matrix Multiplication Error Exponents in Distributed Hypothesis Testing of Correlations Pareto Optimal Schemes in Coded Caching Constrained de Bruijn Codes and their Applications