Ok, I see the "you happen to choose the 'right' node" idea, but it sounds like you want to solve "C* problems" in the client, and they already wrote that complicated code to make clients simple. You're talking about reimplementing key<->node mappings, network topology (with failures), etc... Plus, if they change something about replication and you get too tricky, your code breaks. Or, if they optimize something, you might not benefit.
I'm saying I will make my clients forward the C* requests to the first replica instead of forwarding to a random node.
Sent from my Android phone with K-9 Mail. Please excuse my brevity.
Will Oberman <email@example.com
Sent from my iPhone
On Jul 1, 2011, at 9:53 PM, AJ <firstname.lastname@example.org> wrote:
> Is this possible?
> All reads and writes for a given key will always go to the same node
> from a client.
I don't think that's true. Given a key K, the client will write to N
nodes (N=replication factor). And at consistency level ONE the client
will return after 1 "ack" (from the N writes).