ID-Replication for Structured Peer-to-Peer Systems

Shafaat, Tallat M.; Ahmad, Bilal; Haridi, Seif

doi:10.1007/978-3-642-32820-6_37

Cited by 10 publications

(6 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The drawback of symmetric method is the necessity of manipulating complex structure data each time replicating or searching a resource. This method presents a fixed value of replication factor (number of replicas), unlike ID replication where this factor varies between 2 values: rmin and rmax. The advantage of this latter is the no necessity of manipulating complex structure data, but it generates more messages to stabilize groups and to achieve load balance between them.…”

Section: Discussionmentioning

confidence: 99%

“…The joining/leaving implies the exchange of update messages between r nodes of the same class to maintain the replicas, which is much reduced compared to the approaches of the preceding category. ID‐Replication: The authors use the notion of group to express the notion of node, what means each range of resources is assigned to a corresponding group with specific identifier. As this method is applied on Chord, the group responsible of resource key is the one with ID equals or immediately superior than key, then all the r nodes of this group replicate the resource key.…”

Section: Related Workmentioning

confidence: 99%

“…This means, it is superior than in basic Chord but it is the same in our method as in the other popular replication works like predecessor replication (PredChord), successor‐list replication, and leaf‐set replication because r in all of them is equal to m‐1 ( log 2 ( N ) ‐ 1 ). In other works like, the storage space can be higher or lower as the replication factor increases with the augmentation of resource popularity.…”

Section: The Proposed Approach (Repmchord)mentioning

confidence: 99%

See 2 more Smart Citations

RepMChord: A novel replication approach for mobile Chord with reduced traffic overhead

Cherbal

Boukerram

Boubetra

2017

Int J Communication

View full text Add to dashboard Cite

Structured peer-to-peer systems based on distributed hash table (DHT) have known a great popularity and performance since their appearance. They have experienced multiple improvements to increase the efficiency, like replication mechanism with different used methods and different objectives like increasing data availability or fitting to churn. Besides their benefits, these methods suffer from the excessive generated overhead in maintenance process. On the other side, we have the interest deployment of DHT overlay on mobile ad hoc network, which benefits from the infrastructure-less architecture, but presents some shortcomings because of the limited bandwidth and energy batteries, what require a reduced overhead. Therefore, the aim of this work is to improve the lookup efficiency of DHT-based Chord on mobile ad hoc network underlay. For that, we propose a novel replication mechanism based on data structure to determine the replica nodes, while avoiding the excessive generated overhead in maintenance process to cope with the problem of limited energy batteries. To evaluate the proposed method, we present an extensive simulation study that compares the work to another efficient replication method and to mobile basic Chord. The results show the efficiency of our approach in decreasing the lookup path, the maintenance overhead, and the energy consumption.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: The Proposed Approach (Repmchord)mentioning

confidence: 99%

See 1 more Smart Citation

RepMChord: A novel replication approach for mobile Chord with reduced traffic overhead

Cherbal

Boukerram

Boubetra

2017

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Perhaps the closest approaches to ours are Scatter [24], ID-Replication [25], and Oracle's NoSQL database [17]. All these systems use consistent hashing and self-managing replication groups.…”

Section: Related Workmentioning

confidence: 99%

ACaZoo: A Distributed Key-Value Store Based on Replicated LSM-Trees

Garefalakis

Papadopoulos

Magoutis

2014

2014 IEEE 33rd International Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

In this paper we describe the design and implementation of ACaZoo 1 , a key-value store that combines strong consistency with high performance and high availability. ACaZoo supports the popular column-oriented data model of Apache Cassandra and HBase. It implements strongly-consistent data replication using primary-backup atomic broadcast of a writeahead log, which records data mutations to a Log-structured Merge Tree (LSM-Tree). ACaZoo scales by horizontally partitioning the key space via consistent primary-key hashing on available replica groups (RGs). LSM-Tree compactions can hamper performance, especially when they take place at RG primaries. ACaZoo addresses this problem by changing RG leadership prior to heavy compactions, a method that can improve throughput by up to 40% in write-intensive workloads. We evaluate ACaZoo using the Yahoo Cloud Serving Benchmark (YCSB) and compare it to Oracle's NoSQL Database and to Cassandra providing serial consistency via an extension of the Paxos algorithm.

show abstract

“…Kelips supports e cient lookups, but it does not present any solution for data replication and each node stores a pointer to every object owned by its virtual node, a property that severely limits its scalability. Concurrently to our work [28], [29] proposes an architecture inspired on similar principles; however Rollercain uses di↵erent techniques to perform joins, merges, and to maintain the routing table.…”

Section: Combining Structured and Unstructured Overlaysmentioning

confidence: 99%

Rollerchain: A DHT for Efficient Replication

Paiva

Leitão

Rodrigues

2013

2013 IEEE 12th International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

In this paper we present Rollerchain, a novel Distributed Hash Table that o↵ers e cient data storage through the combination of gossip-based and structured overlay networks. The unstructured component maintains clusters of fully connected nodes, where each cluster acts as a virtual node in the structured component. This architecture simplifies the management of data replication and balances the load among nodes in the system. We have implemented a prototype of Rollerchain that we have used to experimentally validate its performance against other state of the art solutions.. Rollerchain: a DHT for E cient ReplicationJoão Paiva, João Leitão and Luís Rodrigues joao.paiva@ist.utl.pt, jc.leitao@fct.unl.pt, ler@ist.utl.pt INESC-ID, Instituto Superior Técnico, Universidade Técnica de LisboaAbstract. In this paper we present Rollerchain, a novel Distributed Hash Table that o↵ers e cient data storage through the combination of gossip-based and structured overlay networks. The unstructured component maintains clusters of fully connected nodes, where each cluster acts as a virtual node in the structured component. This architecture simplifies the management of data replication and balances the load among nodes in the system. We have implemented a prototype of Rollerchain that we have used to experimentally validate its performance against other state of the art solutions.

show abstract

ID-Replication for Structured Peer-to-Peer Systems

Cited by 10 publications

References 22 publications

RepMChord: A novel replication approach for mobile Chord with reduced traffic overhead

RepMChord: A novel replication approach for mobile Chord with reduced traffic overhead

ACaZoo: A Distributed Key-Value Store Based on Replicated LSM-Trees

Rollerchain: A DHT for Efficient Replication

Contact Info

Product

Resources

About