A survey of peer-to-peer storage techniques for distributed file systems

Hasan, Ragib; Anwar, Z.; Yurcik, William; Brumbaugh, Larry; Campbell, Roy H.

doi:10.1109/itcc.2005.42

Cited by 78 publications

(44 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…(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

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

show abstract

“…Issues on designing a P2P storage system include redundancy management, access control, load balancing and fast resource location. Hasan et al [40] give a survey on current P2P storage systems and analyze their advantages and disadvantages.…”

Section: P2p Storagementioning

confidence: 99%

Efficient Algorithms for Multi-Sender Data Transmission in Swarm-Based Peer-to-Peer Streaming Systems

Shen

Hsu²,

Hefeeda

2011

IEEE Trans. Multimedia

View full text Add to dashboard Cite

“…The main architectural elements include the seed, the tracker, and the leech; see [8], [19], [20] for overviews. At the heart of this content distribution scheme are static files called torrents, which provide information about the file to be distributed, such as, its length and name, along with a hashed value (checksum of the file).…”

Section: Object Resolution In Bittorrentmentioning

confidence: 99%

Distributed Information Object Resolution

Pentikousis

2009

2009 Eighth International Conference on Networks

View full text Add to dashboard Cite

The established host-centric networking paradigm is challenged due to handicaps related with disconnected operation, mobility, and broken locator/identifier semantics. This paper soberly examines another topic of great interest: distributed information object resolution. After recapping the notion of an information object, we review object resolution in today's Internet which is based on Uniform Resource Identifiers (URIs). We revisit the implications of DNS involvement in URI resolution and discuss how two different types of content distribution networks work with respect to name resolution. Then we evaluate proposals championing the replacement of DNS with alternatives based on distributed hash tables. We present the pros and cons and highlight the importance of latency in resolution. The paper positions these issues in the context of a Network of Information (NetInf) and concludes with open research topics in the area.

show abstract

A survey of peer-to-peer storage techniques for distributed file systems

Cited by 78 publications

References 24 publications

Storage and search in dynamic peer-to-peer networks

Storage and search in dynamic peer-to-peer networks

Efficient Algorithms for Multi-Sender Data Transmission in Swarm-Based Peer-to-Peer Streaming Systems

Distributed Information Object Resolution

Contact Info

Product

Resources

About