2017 IEEE International Conference on Communications (ICC) 2017
DOI: 10.1109/icc.2017.7997392
|View full text |Cite
|
Sign up to set email alerts
|

Capacity of clustered distributed storage

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
113
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 23 publications
(114 citation statements)
references
References 11 publications
1
113
0
Order By: Relevance
“…Obviously, the k newcomers {x ti } k i=1 correspond to a repair sequence of k original nodes called selected nodes. As analyzed in [22,24], the min-cut in the HC-DSS model is obtained by cutting {x ti } k i=1 one by one in the topological ordering as…”
Section: Main Definitionsmentioning
confidence: 99%
See 4 more Smart Citations
“…Obviously, the k newcomers {x ti } k i=1 correspond to a repair sequence of k original nodes called selected nodes. As analyzed in [22,24], the min-cut in the HC-DSS model is obtained by cutting {x ti } k i=1 one by one in the topological ordering as…”
Section: Main Definitionsmentioning
confidence: 99%
“…In [17,24], the authors proposed algorithms for the cluster DSS model corresponding to the above two steps under the assumption that the newcomer connects to all the alive nodes, namely, d = n − 1. However, this assumption cannot be used to analyse the cases with multiple node failures, which is also frequent in realistic storage systems [20,32].…”
Section: Heterogeneous Vertical Order Algorithm and Horizontal Selectmentioning
confidence: 99%
See 3 more Smart Citations