TREE TOPOLOGY-BASED RESOURCE ALLOCATION AND DISCOVERY ALGORITHM FOR ONE HOP

The components of a distributed system include multiple computing nodes which may use different types of hardware and connect to each other through a communication network that operates without shared memory or clock systems. The primary advantage of distributed systems enables organizations to share resources which results in faster computing times together with increased data availability and system reliability. The process of resource sharing requires organizations to first identify their resources and then assign those resources before anyone can access them. Computer systems implement caching to store frequently used data and program segments. The new caching technique called virtual caching enables a host node to delegate its cache authority for specific pages to nearby nodes who can use its partial cache space. The virtual caching protocol specifies neither the client node's process for accessing virtual cache nor its method for retrieving virtual cache from distant servers. The resource discovery and allocation problem needs us to develop a solution for this particular issue. The resource donation process requires us to find donor nodes who have extra resources while we need to assess which resources will be given to deficient nodes at each connected network point. Our goal is to achieve complete fulfillment of requests which deficient nodes make for resources. The importance of virtual caching lies in the fact that it doesn't require physical movements of cache. The requirements of the system determine when virtual cache allocation can be modified. The proposed heuristics provide efficient performance because they require minimal time and perform limited communication operations. We assess distribution quality through a comparison between heuristic distribution results and the distribution outcomes from the ILP problem solution. We present and assess several heuristics which aim to reduce unfulfilled resource requests that arise from resource-deficient nodes during their resource search process which has a maximum distance of two hops. The paper restricts its analysis to single hop operations only. The paper demonstrates through its research that this algorithm reaches optimal solution status based on our established benchmark criteria. The resource distribution for bounded hops restricts its operations to one-hop resource distribution. Every resource-surplus node transfers additional nodes to other nodes while maintaining its own resource balance without reaching resource-deficient status. Load distribution cannot be divided into infinite parts. Our research focuses on measuring the fulfillment level for each resource-deficient node request.