A Survey of Resource Discovery Approaches in Distributed Computing Environment
---
paper_title: Resource and Service Discovery in Wireless AD-HOC Networks with Agile Computing

paper_content:

Resource and service discovery in tactical networking environments is a challenging problem. The ad-hoc and peer-to-peer nature of the network invalidates many traditional approaches to resource and service discovery that rely on registries. The agile computing middleware supports opportunistic service and resource discovery and tasking in tactical environments. The group manager component of the middleware supports bandwidth-efficient discovery of neighboring nodes, their resources (including CPU, memory, storage, and connectivity), and their services. Nodes may join one or more groups that allow resources and services to be categorized into related sets. Applications using the group manager are notified about the appearance and disappearance of peers as well as changes in memberships of groups. The group manager is efficient in finding neighboring services and is designed to improve the probability of finding resource-rich nodes. Cross-layer integration between the group manager and the MANET layer reduces the network overhead and improves performance.
---
paper_title: Distributed Indexing for Resource Discovery in P2P Networks

paper_content:

P2P networks facilitate people belonging to a community to share resources of interest. However, discovering resources in a large scale P2P network poses a number of challenges. Although Distributed Hash Table (DHT) structured P2P networks have shown enhanced scalability in routing messages, they only support key based exact matches. This paper presents DIndex, a distributed indexing component that can be used in P2P networks in support of range queries. DIndex introduces the concept of search dimensions for partitioning a search space, and it organizes peer nodes in a three-layered structure. Experimental results show that, for aP2P network with N number of peers, the average number of hops per message is less than log(N).
---
paper_title: Efficient Resource Discovery in Mobile Ad Hoc Networks

paper_content:

The highly dynamic nature of infrastructureless adhoc networks poses new challenges during resource discovery. In this paper, we propose a novel algorithm for resource discovery in mobile ad hoc networks called Efficient Resource-Discovery (ERD). When proposing this novel algorithm, our primary goal is to spread the most relevant resources and queries to the nodes in the network. The proposed algorithm ERD is very efficient in dynamically ranking resources and queries based on their priority, selecting the transmission time, and determining how many resources and queries are to be transmitted. ERD utilizes the network bandwidth in an optimal manner avoiding the spread of redundant data in the network, which otherwise can significantly overload the network with duplicate copies. We compare ERD with periodic flooding and rank based broadcast (RBB) algorithms for mobile ad hoc networks. Results show that ERD outperforms both these algorithms significantly.
---
paper_title: A Resource Discovery Algorithm Based on Mobile Ad hoc Network and Its Implementation

paper_content:

This paper proposes the mobile resource discovery algorithm called MRDA, which focus on the communication of Mobile Ad-hoc Network (MANET) nodes in a peer-to-peer manner. It utilizes distributed hash tables (DHTs) to efficiently cache the resource information. Meanwhile, we design the simple datagram structure and use dynamic transmission interval of advertising datagram, which can effectively reduce the mobile phone's memory occupancy and decrease the network transmission cost. Finally, we design and implement prototype program of communication between the mobile terminal nodes in MANET environment, which can illustrate the efficiency of MRDA.
---
paper_title: A Knowledge-Driven Architecture for Efficient Resource Discovery in P2P Networks

paper_content:

As shared electronic data increases, it has become more difficult to manage it successfully and the demand for scalable and efficient mechanisms for managing and retrieving data effectively becomes essential. In this paper amore effective P2P architecture is presented, aiming to improve existing resource discovery processes. The proposed architecture is organised as a hierarchical super-peer structure, where super-peers of the network representnetwork’s knowledge that is formalised dynamically using its peers’ resources. The main focus of this paper is the creation of an adaptive hierarchical concept-based P2Ptopology using collective intelligence methods. In that process, unmanageable data is transformed into a structured knowledge based repository of semantic resources. Therefore, the network takes the form of an ontology of conceptually related entities of resource information, as provided by the peers. This knowledge driven approach has benefits over traditional load driven architectures, as the user query context is usually the main driver for managing the performance of the network, and in a way the network can be characterised as proactive rather than reactive. A number of experiments have been undertaken and results demonstrate the advantages of the proposed concept-based architecture over other popular architectures.
---
paper_title: A Broker-Based Approach to Resource Discovery and Selection in Grid Environments

paper_content:

The grid provides mechanisms to share dynamic, heterogeneous, distributed resources spanned across multiple administrative domains. The dynamic nature of resources on computational grids raises the question of an efficient scheduling process, which mainly consists of resource discovery and resource selection. So, appropriate resource discovery and selection mechanism is an important aspect of grid computing. In this paper a novel approach for resource discovery and resource selection is proposed. The approach is based on client agents which act on behalf of grid users and search for resources in a network of resource brokers that are registries for various grid resources. After suitable resources are discovered, client agents determines the willing resources and uses the current load information and memory availability of the resources to determine the optimum set of resources for the tasks in hand. The effectiveness of our algorithm is evaluated through simulation results, which mainly reduces the response time of the tasks.
---
paper_title: A heuristic algorithm for agent-based grid resource discovery

paper_content:

This paper introduces an agent-based resource management model, agent structure and its function. On the basis of local resources adopting the strategy "first come first served" to the task, we put forward a resource management heuristic algorithm using a technique of resource advertisement and discovery. Agents are organized into a graph and the heuristic algorithm is based on multi-agent cooperation, to ensure this methodology achieves the goal of task scheduling.
---

Title: A Survey of Resource Discovery Approaches in Distributed Computing Environment

Section 1: INTRODUCTION
Description 1: This section introduces the topic of resource management in distributed computing environments, highlighting the importance of resource discovery and outlining the scope and purpose of the survey.

Section 2: SEVERAL APPROACHES
Description 2: This section provides an overview of various resource discovery approaches in distributed computing environments.

Section 3: Group Manager Approach
Description 3: This section describes the Group Manager component, including its functionality, mechanisms of group formation, and the peer-to-peer search algorithm.

Section 4: Distributed Indexing
Description 4: This section discusses the distributed index component, explaining the partitioning and indexing techniques used for resource discovery in peer-to-peer networks.

Section 5: An Efficient Resource Discovery Algorithm
Description 5: This section introduces a hybrid algorithm combining push and pull approaches, detailing the phases of neighbor detection, query and resource ranking, and dissemination.

Section 6: Mobile Resource Discovery Algorithm
Description 6: This section outlines a resource discovery algorithm designed for mobile ad-hoc networks, describing roles of nodes and stages of discovery and maintenance.

Section 7: Knowledge Driven Approach
Description 7: This section explains a knowledge-driven model for resource discovery using network ontology and a two-layered architecture consisting of peers and super-peers.

Section 8: Web Services based Grid
Description 8: This section covers resource discovery in web-services grid using UDDI and SOAP for accessing and querying grid resources.

Section 9: Broker based approach
Description 9: This section discusses the use of brokers for resource discovery, detailing the process of resource registration, request handling, and performance measurement.

Section 10: Gnutella Protocol
Description 10: This section describes the Gnutella protocol for decentralized resource discovery, focusing on query handling, file searching, and the associated challenges.

Section 11: Agent based Discovery
Description 11: This section explores the use of mobile agents for resource discovery, addressing scalability, service models, and dynamic performance updates.

Section 12: CONCLUSION
Description 12: This section summarizes the key points of the survey, emphasizing the goals and challenges of resource discovery in distributed computing environments.