Capacity of dynamical storage systems

Ohad Elishco; Alexander Barg

doi:10.1109/ISIT.2019.8849745

Capacity of dynamical storage systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 n₁ have links with bandwidth greater than the remaining n - n₁ nodes by γ symbols, then the average capacity increases by Ω(γ(k - n₁)²) symbols compared to the static model.

Original language	American English
Title of host publication	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Pages	1562-1566
Number of pages	5
ISBN (Electronic)	9781538692912
DOIs	https://doi.org/10.1109/ISIT.2019.8849745
State	Published - 1 Jul 2019
Externally published	Yes
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2019-July

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	7/07/19 → 12/07/19

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2019.8849745

Cite this

@inproceedings{6177156a73d746d997eb247fdacfd0d9,

title = "Capacity of dynamical storage systems",

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.",

author = "Ohad Elishco and Alexander Barg",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

year = "2019",

month = jul,

day = "1",

doi = "10.1109/ISIT.2019.8849745",

language = "American English",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1562--1566",

booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

}

Elishco, O & Barg, A 2019, Capacity of dynamical storage systems. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849745, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, pp. 1562-1566, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/07/19. https://doi.org/10.1109/ISIT.2019.8849745

Capacity of dynamical storage systems. / Elishco, Ohad; Barg, Alexander.
2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. 2019. p. 1562-1566 8849745 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Capacity of dynamical storage systems

AU - Elishco, Ohad

AU - Barg, Alexander

PY - 2019/7/1

Y1 - 2019/7/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85073150064&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849745

DO - 10.1109/ISIT.2019.8849745

M3 - Conference contribution

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1562

EP - 1566

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

Capacity of dynamical storage systems

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this