Change search
ReferencesLink to record
Permanent link

Direct link
Repair for distributed storage systems with packet erasure channels and dedicated nodes for repair
KTH, School of Electrical Engineering (EES), Communication Theory.
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-5407-0835
KTH, School of Electrical Engineering (EES).
KTH, School of Electrical Engineering (EES), Automatic Control.ORCID iD: 0000-0001-9810-3478
Show others and affiliations
2016 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 64, no 4, 1367-1383 p., 7422022Article in journal (Refereed) PublishedText
Abstract [en]

We study the repair problem in distributed storage systems where storage nodes are connected through packet erasure channels and some nodes are dedicated to repair [termed as dedicated-for-repair (DR) storage nodes]. We first investigate the minimum required repair-bandwidth in an asymptotic setup, in which the stored file is assumed to have an infinite size. The result shows that the asymptotic repair-bandwidth over packet erasure channels with a fixed erasure probability has a closed-form relation to the repair-bandwidth in lossless networks. Next, we show the benefits of DR storage nodes in reducing the repair bandwidth, and then we derive the necessary minimal storage space of DR storage nodes. Finally, we study the repair in a nonasymptotic setup, where the stored file size is finite. We study the minimum practical-repair-bandwidth, i.e., the repair-bandwidth for achieving a given probability of successful repair. A combinatorial optimization problem is formulated to provide the optimal practical-repair-bandwidth for a given packet erasure probability. We show the gain of our proposed approaches in reducing the repair-bandwidth.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2016. Vol. 64, no 4, 1367-1383 p., 7422022
Keyword [en]
Bandwidth, Codes (symbols), Combinatorial optimization, Multiprocessing systems, Optimization, Probability, Closed-form relations, Combinatorial optimization problems, Distributed storage system, Lossless networks, Non-asymptotic, Packet erasure channels, Storage nodes, Storage spaces
National Category
URN: urn:nbn:se:kth:diva-187195DOI: 10.1109/TCOMM.2016.2532879ISI: 000375032400002ScopusID: 2-s2.0-84964334268OAI: diva2:932377

QC 20160601

Available from: 2016-06-01 Created: 2016-05-18 Last updated: 2016-06-01Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Gerami, MajidXiao, MingFischione, Carlo
By organisation
Communication TheorySchool of Electrical Engineering (EES)Automatic Control
In the same journal
IEEE Transactions on Communications

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 6 hits
ReferencesLink to record
Permanent link

Direct link