No abstract

LH* RSP2P is a Scalable Distributed Data Structure (SDDS) designed for P2P applications. It stores and processes data on SDDS peer nodes. Each node is both an SDDS client and, actually or potentially, an SDDS server with application or parity data. The scheme builds on LH* RS scheme principles. The basic difference is that LH* RS P2P key based queries require at most one forwarding message, instead of two for LH* RS . This makes LH* RS P2P the fastest P2P and SDDS addressing scheme currently known. In addition, the LH* RS P2P scan has the upper limit of two rounds. LH* RS P2P parity management reuses the LH* RS Reed Salomon erasure correction scheme to deal efficiently with churn. The file supports unavailability or withdrawal of up to any k ≥ 1 peers, where k is a parameter that can scale dynamically. We discuss the LH* RS P2P design, implementation issues and variants, as well as the related work.