Towards efficient replication of documents in chord: Case (r,s) erasure codes

Abstract

In this article we investigate the replication mechanism, called Global Policy with (r,s) erasure codes for Chord peer-to-peer system. Each document is divided into s fragments and then is encoded into s + r fragments that can tolerate r failures. The independent hash functions: H 1,..., H r+s are used for placing fragments of documents into the Chord. In our paper we show analytical formulas describing basic probabilistic properties of the proposed scheme. © 2012 Springer-Verlag.