I have a distributed system in mind (multiple nodes in one data center) that I want to have the following properties:
- nodes can enter and leave the system at any time.
- There is no data replication between nodes.
- Which node the client uses before the client (i.e. it can be a sequential hash, it could be something else)
- no master (i.e. no central point of failure)
- each node can receive a piece of information that should be redirected to other nodes.
What algorithms (paper links are better) are suitable for this?
(I assume that some of the answers will include P2P algorithms, but most of them that I came across in the past looked more like distributed hash tables where nodes enter and capture some part of the key space, etc. I also find out that multicasting with simple UDP messages may be appropriate here, but what existing work will help make message exchange reliable?)
source
share