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

Locally repairable codes (LRCs) are ingeniously designed distributed storagecodes with a (usually small) fixed set of helper nodes participating in repair.Since most existing LRCs assume exact repair and allow full exchange of thestored data ($\beta=\alpha$) from the helper nodes, they can be viewed as ageneralization of the traditional erasure codes (ECs) with a much desiredfeature of local repairability via predetermined sets of helpers. However, italso means that they lack the features of (i) functional repair, and (ii)partial information-exchange ($\beta<\alpha$) in the original regeneratingcodes (RCs), which could further reduce the repair bandwidth. Motivated by thesignificant bandwidth reduction of RCs over ECs, existing works by Ahmad et aland by Hollmann studied the concept of "locally repairable regenerating codes(LRRCs)" that successfully combine functional repair and partial informationexchange of regenerating codes with the much-desired local repairabilityfeature of LRC. The resulting LRRCs demonstrate significant bandwidthreduction.  One important issue that needs to be addressed by any local repair schemes(including both LRCs and LRRCs) is that sometimes designated helper nodes maybe temporarily unavailable, the result of multiple failures, degraded reads, orother network dynamics. Under the setting of LRRCs with temporary nodeunavailability, this work studies the impact of different helper selectionmethods. It proves that with node unavailability, all existing methods ofhelper selection, including those used in RCs and LRCs, can be insufficient interms of achieving the optimal repair-bandwidth. For some scenarios, it isnecessary to combine LRRCs with a new helper selection method, termed dynamichelper selection, to achieve optimal repair bandwidth. This work also comparesthe performance of different helper selection methods and answers...

Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair