Availability in Global Peer-To-Peer Storage Systems
Thomas Schwarz, Qin Xin, Ethan L. Miller · 2004
Peer-to-peer file sharing applications have become increasingly popular. Measurements of P2P systems indicate large heterogeneity in the availability of individual nodes. Many have cyclic behavior, whereas others are always available. This paper proposes a cooperative storage technique which employs erasure coding schemes on a collection of data objects and provides various levels of data redundancy. Based on this technique, we study a historybased hill climbing scheme that takes advantage of varied time zones in a global p2p system. Our simulation results show the improved data availability by this scheme. We also investigate several climbing strategies including choice of coding schemes and laziness of data movement. 1.