2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops 2008
DOI: 10.1109/sasow.2008.50
|View full text |Cite
|
Sign up to set email alerts
|

Using Global Information for Load Balancing in DHTs

Abstract: Distributed Hash Tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only improve the load imbalance, we argue that due to the cost of moving items, the competing goal of minimizing the used network traffic must be addressed as well.We aim to improve on existing algorithms by augmenting them with approximations of global knowledge, which can be distributed in a DHT with low cost using gossip mechanisms. In… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…In more detail, the stronger physical server will split into more virtual nodes. However, some systems (e.g., Apache Cassandra) put a limit on the number of virtual nodes as they have several side-eects [63] such as increased agitation due to the failure of a physical node and increasing state maintenance. Some NoSQL stores, such as Apache Cassandra, Amazon Dynamo [58], Riak KV 15 and Microsoft Trinity [64], use this strategy.…”
Section: Key-oriented Static Partitioningmentioning
confidence: 99%
“…In more detail, the stronger physical server will split into more virtual nodes. However, some systems (e.g., Apache Cassandra) put a limit on the number of virtual nodes as they have several side-eects [63] such as increased agitation due to the failure of a physical node and increasing state maintenance. Some NoSQL stores, such as Apache Cassandra, Amazon Dynamo [58], Riak KV 15 and Microsoft Trinity [64], use this strategy.…”
Section: Key-oriented Static Partitioningmentioning
confidence: 99%