Malugo: A peer-to-peer storage system

Chan, Yu‐Wei; Ho, Tsung-Hsuan; Shih, Po-Chi; Chung, Yeh‐Ching

doi:10.1504/ijahuc.2010.032995

“…(However, despite a large churn rate, these studies also show that the total number of peers in the network is relatively stable.) P2P algorithms have been proposed for a wide variety of tasks such as data storage and retrieval [45,19,18,14,26], collaborative filtering [11], spam detection [15], data mining [17], worm detection and suppression [38,59], privacy protection of archived data [23], and recently, for cloud computing services as well [57,8]. However, all algorithms proposed for these problems have no theoretical guarantees of being able to work in a dynamically changing network with a very high churn rate, which can be as much as linear (in the network size) per round.…”

Section: Introductionmentioning

confidence: 99%

Storage and search in dynamic peer-to-peer networks

Augustine

¹

,

Molla

²

,

Morsy

³

et al. 2013

Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

We study robust and efficient distributed algorithms for searching, storing, and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave the network continuously over time). Our goal is to guarantee, despite high node churn rate, that a large number of nodes in the network can store, retrieve, and maintain a large number of data items. Our main contributions are fast randomized distributed algorithms that guarantee the above with high probability even under high adversarial churn. In particular, we present the following main results:1. A randomized distributed search algorithm that with high probability guarantees that searches from as many as n − o(n) nodes (n is the stable network size) succeed in O(log n)-rounds despite O(n/ log 1+δ n) churn, for any small constant δ > 0, per round. We assume that the churn is controlled by an oblivious adversary (that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm).2. A storage and maintenance algorithm that guarantees, with high probability, data items can be efficiently stored (with only Θ(log n) copies of each data item) and maintained in a dynamic P2P network with churn rate up to O(n/ log 1+δ n) per round. Our search algorithm together with our storage and maintenance algorithm guarantees that as many as n − o(n) nodes can efficiently store, maintain, and search even under O(n/ log 1+δ n) churn per round. Our algorithms require only polylogarithmic in n bits to be processed and sent (per round) by each node.To the best of our knowledge, our algorithms are the first-known, fully-distributed storage and search algorithms that provably work under highly dynamic settings (i.e., high churn rates per step). Furthermore, they are localized (i.e., do not require any global topological knowledge) and scalable. A technical contribution of this paper, which may be of independent interest, is

show abstract

“…(However, despite a large churn rate, these studies also show that the total number of peers in the network is relatively stable.) P2P algorithms have been proposed for a wide variety of tasks such as data storage and retrieval [3], [8], [9], [10], [11], collaborative filtering [12], spam detection [13], data mining [14], worm detection and suppression [15], [16], privacy protection of archived data [17], and recently, for cloud computing services as well [2], [18]. However, all algorithms proposed for these problems have no theoretical guarantees of being able to work in a dynamically changing network with a very high churn rate.…”

Section: Introductionmentioning

confidence: 99%

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

Augustine

¹

,

Pandurangan

²

,

Robinson

³

et al. 2015

2015 IEEE 56th Annual Symposium on Foundations of Computer Science

View full text Add to dashboard Cite

“…(However, despite a large churn rate, these studies also show that the total number of peers in the network is relatively stable.) P2P algorithms have been proposed for a wide variety of tasks such as data storage and retrieval [45,19,18,14,26], collaborative filtering [11], spam detection [15], data mining [17], worm detection and suppression [38,59], privacy protection of archived data [23], and recently, for cloud computing services as well [57,8]. However, all algorithms proposed for these problems have no theoretical guarantees of being able to work in a dynamically changing network with a very high churn rate, which can be as much as linear (in the network size) per round.…”

Section: Introductionmentioning

confidence: 99%

Storage and Search in Dynamic Peer-to-Peer Networks

Augustine¹,

Molla²,

Morsy³

et al. 2013

Preprint

0

View full text Add to dashboard Cite

We study robust and efficient distributed algorithms for searching, storing, and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave the network continuously over time). Our goal is to guarantee, despite high node churn rate, that a large number of nodes in the network can store, retrieve, and maintain a large number of data items. Our main contributions are fast randomized distributed algorithms that guarantee the above with high probability even under high adversarial churn. In particular, we present the following main results:

show abstract

Malugo: A peer-to-peer storage system

Cited by 8 publications

References 16 publications

Storage and search in dynamic peer-to-peer networks

Storage and search in dynamic peer-to-peer networks

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

Storage and Search in Dynamic Peer-to-Peer Networks

Contact Info

Product

Resources

About