On Routing in Distributed Hash Tables

Klemm, Fabius; Girdzijauskas, Šarūnas; Boudec, J.-Y. Le; Aberer, Karl

doi:10.1109/p2p.2007.38

Cited by 16 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Extensive research efforts have been devoted to analyze different aspects of DHT designs, e.g., load balancing [17], the routing cost [18], churn handling [19], and malicious attacks [20]. Load rebalancing has also been studied [21].…”

Section: Related Workmentioning

confidence: 99%

When Load Rebalancing Does Not Work for Distributed Hash Table

Zhu

2020

Preprint

View full text Add to dashboard Cite

Distributed hash table (DHT) is the foundation of many widely used storage systems, for its prominent features of high scalability and load balancing. Recently, DHT-based systems have been deployed for the Internet-of-Things (IoT) application scenarios. Unfortunately, such systems can experience a breakdown in the scale-out and load rebalancing process. This phenomenon contradicts with the common conception of DHT systems, especially about its scalability and load balancing features. In this paper, we investigate the breakdown of DHTbased systems in the scale-out process. We formulate the load rebalancing problem of DHT by considering the impacts of write workloads and data movement. We show that, the average network bandwidth of each node and the intensity of the average write workload are the two key factors that determine the feasibility of DHT load rebalancing. We theoretically prove that load rebalancing is not feasible for a large DHT system under heavy write workloads in a node-by-node scale-out process.

show abstract

Section: Related Workmentioning

confidence: 99%

When Load Rebalancing Does Not Work for Distributed Hash Table

Zhu

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…However, if some areas of the identifier space have more vnodes, these will appear more frequently in Rollerchain's routing tables, whereas in typical DHTs they would have the same probability regardless of the density of those regions. It is important to notice that even though this routing scheme ensures that our system can route messages logarithmically with the number of vnodes, other routing mechanisms, such as those based on Skipnets [32] or the work presented in [33], could also be employed.…”

Section: The Structured Layermentioning

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

“…We do not change the general overlay structure only the hash function is replaced. Thus already known methods for performance optimization [12] and congestion control [13] will apply as well.…”

Section: Quad Treesmentioning

confidence: 99%

Optimally Efficient Multicast in Structured Peer-to-Peer Networks

Bradler

Kangasharju

Mühlhäuser

2009

2009 6th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

Abstract-The Distributed Tree Construction (DTC) algorithm is designed for optimally efficient multicast tree construction over structured peer-to-peer networks. It achieves this by creating a spanning tree over the peers in the multicast group, using only information available locally on each peer. Furthermore, we show that the tree depth has the same upper bound as a regular DHT lookup which in turn guarantees fast and responsive runtime behavior. Our DTC algorithm is DHT-agnostic and works with most existing DHTs. We evaluate the performance of DTC over several DHTs by comparing the performance to existing application-level multicast solutions, we show that DTC sends 30-250% fewer messages than common solutions.

show abstract

On Routing in Distributed Hash Tables

Abstract: There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT).

Cited by 16 publications

References 22 publications

When Load Rebalancing Does Not Work for Distributed Hash Table

When Load Rebalancing Does Not Work for Distributed Hash Table

Rollerchain: A DHT for Efficient Replication

Optimally Efficient Multicast in Structured Peer-to-Peer Networks

Contact Info

Product

Resources

About