Decentralized intelligent routing algorithm in distributed database cluster

Cluster technology that enables a group of computers working closely to form a single computer, has been a booming research field in computer engineering and network. State of the art cluster applications, such as large scale database processing, require thousands of computers to work together. However, current solutions for cluster database applications require some kinds of centralized control, such as center indexing or localization mapping. When the team sizes of those clusters scale up, centralized control will inevitably bring on the bottle-neck in network and processor traffic. In this paper, we put forward a decentralized algorithm for data processing in database cluster. The key is an intelligent routing algorithm to route data to the exact server without knowing any global knowledge about the cluster. It is able to efficiently route requests through the cluster via the use of local decision theoretic models. Moreover, each processing request is used to improve the routing of other request leading to a dramatic performance improvement.