Fault-tolerant multi-server video-on-demand service

Friedman, Roy; Baram, Liran; Abarbanel, S.

doi:10.1109/ipdps.2003.1213168

Cited by 6 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, added redundancy can get restricted to significant parts of data, whereby less significant parts may be lost in case of faults. Examples were given with MPEG-aware encoding [3] or a faulttolerant multi-server VOD architecture [4]. Roughly, one may classify common redundancy schemes in:…”

Section: Introductionmentioning

confidence: 99%

Construction of efficient OR-based deletion - tolerant coding schemes

Sobe¹,

Peter²

2006

Proceedings 20th IEEE International Parallel &Amp; Distributed Processing Symposium

View full text Add to dashboard Cite

Fault-tolerant data layouts for storage systems are based on the principle to add redundancy to groups of data blocks and store them in different fault regions. Commonly, XOR-based codes are used with an optimal redundancy overhead but with the disadvantage of relatively high calculation costs. We present a scheme that encodes input data in a highly redundant code and exploits that redundancy for a fault tolerance scheme. It allows to recalculate missed bits in fewer steps than needed for XOR-based schemes. This simple and efficient en-and decoding requires an appropriate hardware architecture or a highly parallel microprocessor architecture. Particularly, disjunctions over many input bits must be calculated, e.g. by wide OR-gates or busses that are driven by multiple logic input lines. The high redundant encoding is combined with data compression for separated data streams, each stream dedicated to a storage device. The compression not only eliminates the introduced redundancy of the used code, it also eliminates redundancy in the input data.

show abstract

Section: Introductionmentioning

confidence: 99%