Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On Fully Decentralized Resource Discovery in Grid Environments
GRID '01 Proceedings of the Second International Workshop on Grid Computing
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
ACM Transactions on Computer Systems (TOCS)
Matchmaking: Distributed Resource Management for High Throughput Computing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable distributed information management system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
A proactive tree recovery mechanism for resilient overlay multicast
IEEE/ACM Transactions on Networking (TON)
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Using content-addressable networks for load balancing in desktop grids
Proceedings of the 16th international symposium on High performance distributed computing
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Scalable blind search and broadcasting over Distributed Hash Tables
Computer Communications
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
Squid: Enabling search in DHT-based systems
Journal of Parallel and Distributed Computing
Design and implementation trade-offs for wide-area resource discovery
ACM Transactions on Internet Technology (TOIT)
Efficient Range Query Processing in Peer-to-Peer Systems
IEEE Transactions on Knowledge and Data Engineering
BonjourGrid: Orchestration of multi-instances of grid middlewares on institutional Desktop Grids
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
On correlated availability in Internet-distributed systems
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
A super-peer model for resource discovery services in large-scale Grids
Future Generation Computer Systems
A decentralized and fault-tolerant Desktop Grid system for distributed applications
Concurrency and Computation: Practice & Experience - Advanced Scheduling Strategies and Grid Programming Environments
A middleware for job distribution in peer-to-peer networks
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Resource Discovery and Scheduling in Unstructured Peer-to-Peer Desktop Grids
ICPPW '10 Proceedings of the 2010 39th International Conference on Parallel Processing Workshops
IEEE Transactions on Parallel and Distributed Systems
DRing: A Layered Scheme for Range Queries over DHTs
CIT '11 Proceedings of the 2011 IEEE 11th International Conference on Computer and Information Technology
Parallel Processing Framework on a P2P System Using Map and Reduce Primitives
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Network-aware summarisation for resource discovery in P2P-content networks
Future Generation Computer Systems
A DHT-based semantic overlay network for service discovery
Future Generation Computer Systems
A grid information service based on peer-to-peer
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Realistic underlays for overlay simulation
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
PonD: dynamic creation of HTC pool on demand using a decentralized resource discovery system
Proceedings of the 21st international symposium on High-Performance Parallel and Distributed Computing
Hi-index | 0.00 |
This paper proposes a novel wide-area resource discovery method, MatchTree, that is built upon a Peer-to-Peer (P2P) framework to deliver scalable and fault-tolerant resource discovery supporting distributed query processing and aggregation of results. MatchTree leverages a self-organizing tree for query distribution and result aggregation with the asymptotic latency increase pattern of O(logN), where N is the number of queried nodes. MatchTree distinguishes itself from related resource discovery systems based on structured P2P overlays by supporting complex queries (such as regular expressions in matchmaking), and from related unstructured P2P discovery systems by guaranteeing query completeness. This paper presents the overall architecture of MatchTree, proposes heuristics to improve fault-tolerance and reduce query response times through redundant query topologies, dynamic timeout policies, and sub-region queries. The paper evaluates the system quantitatively through large scale simulations, as well as through experiments with a prototype implementation deployed on a wide-area infrastructure (PlanetLab). The experiment results with proposed heuristics show that the maximum query latency of MatchTree decreases from 154 to 12 s, and the maximum query missing region decreases from 13.4% to 2.3% in the wide-area real world testbed.