-
Notifications
You must be signed in to change notification settings - Fork 19
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Consistent-hash based broadcaster #26
Draft
manuelbernhardt
wants to merge
10
commits into
lalithsuresh:master
Choose a base branch
from
manuelbernhardt:ch-broadcaster
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Draft
Changes from all commits
Commits
Show all changes
10 commits
Select commit
Hold shift + click to select a range
52a3b36
Fixing compilation error
manuelbernhardt 820d7be
Anti-entropy mechanism
manuelbernhardt e92b180
Simplifying join protocol
manuelbernhardt 2c5ec4d
Improving comment
manuelbernhardt fe57237
Fixing bug & adding safeguard to client
manuelbernhardt 1c05756
Guard against nodes attempting to join during a view change
manuelbernhardt 23461a3
Allows a node to catch up if it misses a consensus round
manuelbernhardt 5819b8c
Merge
manuelbernhardt b045c96
New broadcasting strategy based on a Consistent Hash ring
manuelbernhardt b1fee8c
Refactoring alert batcher
manuelbernhardt File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,64 @@ | ||
package com.vrg.rapid; | ||
|
||
import com.vrg.rapid.pb.Endpoint; | ||
import net.openhft.hashing.LongHashFunction; | ||
|
||
import javax.annotation.Nullable; | ||
import java.util.Collection; | ||
import java.util.SortedMap; | ||
import java.util.TreeMap; | ||
|
||
/** | ||
* Simple consistent Hash implementation, adapted for Endpoints | ||
* | ||
* https://tom-e-white.com/2007/11/consistent-hashing.html | ||
*/ | ||
public class ConsistentHash<T> { | ||
|
||
private final LongHashFunction hashFunction = LongHashFunction.xx(); | ||
private final int numberOfReplicas; | ||
private final SortedMap<Long, Endpoint> circle = new TreeMap<>(); | ||
|
||
public ConsistentHash(final int numberOfReplicas, final Collection<Endpoint> nodes) { | ||
this.numberOfReplicas = numberOfReplicas; | ||
|
||
for (final Endpoint node : nodes) { | ||
add(node); | ||
} | ||
} | ||
|
||
public void add(final Endpoint node) { | ||
for (int i = 0; i < numberOfReplicas; i++) { | ||
circle.put(hash(node, i), node); | ||
} | ||
} | ||
|
||
public void remove(final Endpoint node) { | ||
for (int i = 0; i < numberOfReplicas; i++) { | ||
circle.remove(hash(node, i)); | ||
} | ||
} | ||
|
||
public boolean isEmpty() { | ||
return circle.isEmpty(); | ||
} | ||
|
||
@Nullable | ||
public Endpoint get(final Endpoint key) { | ||
if (circle.isEmpty()) { | ||
return null; | ||
} | ||
long hash = hash(key, 0); | ||
if (!circle.containsKey(hash)) { | ||
final SortedMap<Long, Endpoint> tailMap = circle.tailMap(hash); | ||
hash = tailMap.isEmpty() ? circle.firstKey() : tailMap.firstKey(); | ||
} | ||
return circle.get(hash); | ||
} | ||
|
||
private long hash(final Endpoint node, final int index) { | ||
return hashFunction.hashBytes(node.getHostname().asReadOnlyByteBuffer()) * 31 | ||
+ hashFunction.hashInt(node.getPort()) + hashFunction.hashInt(index); | ||
} | ||
|
||
} |
364 changes: 364 additions & 0 deletions
364
rapid/src/main/java/com/vrg/rapid/ConsistentHashBroadcaster.java
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What is the rationale for adding another consistent hash based ring implementation? Wouldn't any of the K rings in the MembershipView data structure suffice?