English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Regenerating codes (RCs) can significantly reduce the repair-bandwidth ofdistributed storage networks. Initially, the analysis of RCs was based on theassumption that during the repair process, the newcomer does not distinguish(among all surviving nodes) which nodes to access, i.e., the newcomer isoblivious to the set of helpers being used. Such a scheme is termed the blindhelper selection (BHS) scheme. Nonetheless, it is intuitive in practice thatthe newcomer should choose to access only those "good" helpers. In thistwo-part paper, a new characterization of the effect of choosing the helpernodes in terms of the storage-bandwidth tradeoff is given. Specifically, theanswer to the following fundamental question is provided: Under what conditiondoes proactively choosing the helper nodes improve the storage-bandwidthtradeoff?  Through a graph-based analysis, this Part I paper answers this question byproviding a necessary and sufficient condition under which optimally choosinggood helpers strictly improves the storage-bandwidth tradeoff. A low-complexityhelper selection solution, termed the family helper selection (FHS) scheme, isproposed and the corresponding storage/repair-bandwidth curve is characterized.This Part I paper also proves that under some design parameters, the FHS schemeis indeed optimal among all helper selection schemes. In the Part II paper, anexplicit construction of an exact-repair code is proposed that achieves theminimum-bandwidth-regenerating (MBR) point of the FHS scheme. The newexact-repair code can be viewed as a generalization of the existing fractionalrepetition code.

When Can Helper Node Selection Improve Regenerating Codes? Part I: Graph-Based Analysis