Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Jxta in a Nutshell
SETI@home: an experiment in public-resource computing
Communications of the ACM
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Magi: An Architecture for Mobile and Disconnected Workflow
IEEE Internet Computing
IEEE Internet Computing
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Entropia: architecture and performance of an enterprise desktop grid system
Journal of Parallel and Distributed Computing - Special issue on computational grids
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
A peer-to-peer approach to resource location in Grid environments
Grid resource management
Information Retrieval Techniques for Peer-to-Peer Networks
Computing in Science and Engineering
DCFS: distributed cooperative fault-tolerance storage mechanism
ACM SIGOPS Operating Systems Review
F2CS: FSSP to CATH and SCOP prediction server
Bioinformatics
A simple analytical framework to analyze search strategies in large-scale peer-to-peer networks
Performance Evaluation - Performance 2005
Novel approaches to efficient flooding search in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Peer-to-Peer resource discovery in Grids: Models and systems
Future Generation Computer Systems
Random graphs as models of hierarchical peer-to-peer networks
Performance Evaluation
Enhanced DHT-based P2P Architecture for Effective Resource Discovery and Management
Journal of Network and Systems Management
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
Ant colony optimization inspired resource discovery in P2P Grid systems
The Journal of Supercomputing
A dynamic framework for integrated management of all types of resources in P2P systems
The Journal of Supercomputing
State-Based Search Strategy in Unstructured P2P
ISORC '10 Proceedings of the 2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing
Resource Bundles: Using Aggregation for Statistical Large-Scale Resource Discovery and Management
IEEE Transactions on Parallel and Distributed Systems
Improving learning-based request forwarding in resource discovery through load-awareness
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
Generalized Probabilistic Flooding in Unstructured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Assisted Peer-to-Peer Search with Partial Indexing
IEEE Transactions on Parallel and Distributed Systems
Dynamic Multilevel Feedback-Based Searching Strategy in Unstructured Peer-to-Peer Systems
GREENCOM '12 Proceedings of the 2012 IEEE International Conference on Green Computing and Communications
| Hi-index | 0.00 |
In this paper, we propose an efficient resource discovery framework allowing pure unstructured peer-to-peer systems to respond to requests at run time with a high success rate while preserving the local autonomy of member machines. There are five units in the proposed framework that respectively gather information about the status of resources, make decisions, detect the states of member machines, discover resources to respond to requests in normal and dynamic conditions, and balance the load of local machines. Efficient resource discovery is achieved by the deployment of a newly introduced mechanism that is placed on every machine allowing it to figure out its states before and after accepting other machines' requests for its resources using a state model and deciding whether to accept or reject those requests. This state model accurately estimates the machine's state based on the resources and processes of the machine before and after accepting the request. We have experimentally compared the proposed mechanism with random, learning-based, and state-based search mechanisms with regard to the number of missed requests, network bandwidth due to transferred messages, number of associated machines in a discovery operation, time required to process information in discovery operation, processing time in machines, and the number of faults per request. The results show significant improvement of some of these parameters, specially network bandwidth and the number of missed requests in a dynamic condition, under our framework.