Gossip and Storage

Yann Busnel, Ali Ghodsi, Seif Haridi, Konrad Iwanicki, Hugo Miranda,

and Hakim Weatherspoon

Motivation-position I

• Gossiping for Partition tolerance in Storage Systems

• Motivation– Internet-based storage systems suffer from failures such

as node and network failures and partitions– Applications desire consistency in presence of partitions

• From eventual to one-copy serializable

– Need to keep membership info up to date in presence of partitions

Position I• Gossip-based communication is a uniform

mechanism that can be used for achieving a range of consistency from eventual to one-copy serializability in presence of node and network failures.

– By replacing communication medium with gossip-based mechanism the system can detect, recover, and heal from partitions.

• E.g. replace leader-based two-phase commit protocols with gossip.

– Advantages: mechanism is uniform whether partitions exist at the moment or not.

Motivation - position II

• Achieving distributed Storage in Wireless Networks via Gossip

• Motivation– Need to maintain data within network for long periods– However, constrained resources

• battery, computational and memory

– Gossip provides constant/predictable resource utilization

Position II

• Gossip is adequate for resource constrained distributed storage system in wireless networks.

– biasing gossip for the particularities of the media: • e.g. selecting the nodes that gossip

– Use gossip as a dissemination and information retrieval mechanism

– Use gossip to maintain the reliability of stored data