Agent-Based Resource Discovery
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
A Peer-to-Peer Approach to Resource Location in Grid Environments
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Peer-to-Peer resource discovery in Grids: Models and systems
Future Generation Computer Systems
A Simple Cache Based Mechanism for Peer to Peer Resource Discovery in Grid Environments
CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Semantic-supported and agent-based decentralized grid resource discovery
Future Generation Computer Systems
Design and implementation trade-offs for wide-area resource discovery
ACM Transactions on Internet Technology (TOIT)
Grid Resource Discovery Strategy Based on Historical Information
GCC '08 Proceedings of the 2008 Seventh International Conference on Grid and Cooperative Computing
Load and Proximity Aware Request-Redirection for Dynamic Load Distribution in Peering CDNs
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Peer-to-peer models for resource discovery in large-scale grids: a scalable architecture
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
A dynamic framework for integrated management of all types of resources in P2P systems
The Journal of Supercomputing
An efficient resource discovery framework for pure unstructured peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Request forwarding is an efficient approach in discovering resources in distributed systems because it achieves one of the main goals of distributed systems namely the scalability goal. Despite achieving reasonable scalability, this approach suffers from long response times to resource requests. Several solutions such as learning-based request forwarding have tried to improve the response time but not quite. This is because target nodes in learning-based request forwarding are selected based on their responses to previous similar requests. This method of selection overloads the nodes and prolongs the response times to resource requests. This paper introduces a new strategy for selection of target nodes to ameliorate this flaw by taking into account the loads on target nodes as well as their abilities in responding to requests based on their previous behaviors. Evaluations show that as the number of requests increases, the proposed strategy reduces the response times to resource requests much more significantly compared with pure learning-based request forwarding strategy.