A distributed system consists of, possibly heterogeneous, computing nodes connected by communication network that do not share memory or clock. One of the main benefits of distributed systems is resource sharing which speeds up computation, enhances data availability and reliability. However resources must be discovered and allocated before they can be shared. Virtual caching is a new caching scheme which allows a host node to grant authority of caching pages in some fraction of its own cache to nearby nodes. However the virtual caching protocol doesn't mentions how a client node obtains virtual cache from remote host. To address this problem we formulate a resource discovery and allocation problem. We are focusing our attention on how to locate resources-surplus donor nodes and to determine how much of the request for resources of deficient nodes will be satisfied, efficiently in a connected network especially within a finite hop of the resource deficient node. We intend to minimize the amount of unfulfilled request of deficient nodes. Virtual cache allocation can be changed any time depending upon the require¬ment. Hence the proposed heuristics are efficient both in terms of time and amount of communication performed.

donor deficient token caching