Adaptive peer-to-peer load balancing in distributed environments

As we have multiple servers that serves clients on a request-response basis, we need a robust load-balancing. And since the load can't be predicted, we need the load-balancing to be adaptive. And since robustness is an issue in a clustering system, we need not have single point of failures. So instead of a central load-balancing server, we need it must like peer-to-peer.
So we introduced our novel load-balancing algorithm that satisfies this properties. It's complexity is O(log2 N) instead of O(N). Each node is only aware of 3 other nodes, not the whole cluster. In case of failure of a node, or in case of isolation of 2 subset of nodes, each subset will be load-balanced as a single unit, which means the algorithm is also graceful degradable.
We have written a paper about the algorithm and isA it will be published soon.