A novel dynamic resilient scheme adapting for distributed environments

For the past few years, the immerse popularity of Grid resource sharing services has produced a significant stimulus to content-delivery overlay network. In existing system, DHT is the data structure used for that mapping key to the nodes of a network based on a consistent hashing function. Most of the DHT overlays require O (n) hops per lookup request with O (n) neighbors per node, where n is the network size. A computing resource is constantly portrayed by a resource type such as CPU and memory, and resource attributes representing the quantity and specialty. Grid resource management scheme that is data locality-preserving is proposed. Dynamism-resilient resource management algorithm, cluster-token forwarding algorithm, and deadline-driven resource management algorithms are proposed. On adopting these algorithms consumes less overhead, speedy and dynamism-resilient multi resource discovery. Experimental results shows well-organized resource clustering, reduces communications cost, and enhances resource discovery success rate flexibly surviving in large scale applications.