Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Matchmaking: Distributed Resource Management for High Throughput Computing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Resource discovery in large resource-sharing environments
Resource discovery in large resource-sharing environments
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A lower bound on the number of triangulations of planar point sets
Computational Geometry: Theory and Applications
Distributed Resource Discovery in Large Scale Computing Systems
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
A taxonomy for resource discovery
Personal and Ubiquitous Computing
The Cactus Worm: Experiments with Dynamic Resource Discovery and Allocation in a Grid Environment
International Journal of High Performance Computing Applications
P2P Grid: Service Oriented Framework for Distributed Resource Management
SCC '05 Proceedings of the 2005 IEEE International Conference on Services Computing - Volume 01
Minimum weight triangulation is NP-hard
Proceedings of the twenty-second annual symposium on Computational geometry
Vishwa: A reconfigurable P2P middleware for Grid Computations
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
NodeWiz: peer-to-peer resource discovery for grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
Towards a platform for wide-area overlay network deployment and management
Computer Networks: The International Journal of Computer and Telecommunications Networking
SCAN: a small-world structured p2p overlay for multi-dimensional queries
Proceedings of the 16th international conference on World Wide Web
Peer-to-Peer resource discovery in Grids: Models and systems
Future Generation Computer Systems
Fixing the embarrassing slowness of OpenDHT on PlanetLab
WORLDS'05 Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2
Peer-to-Peer Discovery of Computational Resources for Grid Applications
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
A topology-aware hierarchical structured overlay network based on locality sensitive hashing scheme
Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks
RCT: A distributed tree for supporting efficient range and multi-attribute queries in grid computing
Future Generation Computer Systems
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
On triangulations of a set of points in the plane
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Reorganization and discovery of grid information with epidemic tuning
Future Generation Computer Systems
A new mechanism for resource monitoring in Grid computing
Future Generation Computer Systems
Grid resource discovery based on semantically linked virtual organizations
Future Generation Computer Systems
Application-layer multicasting with Delaunay triangulation overlays
IEEE Journal on Selected Areas in Communications
Federated management of the Future Internet: status and challenges
International Journal of Network Management
| Hi-index | 0.00 |
This paper presents a fully decentralised, efficient and highly scalable resource-discovery approach that is applicable to large heterogeneous and highly dynamic distributed systems. The approach is based on a hybrid overlay network, named TRIPOD, which enables an efficient search for resources in the aforementioned highly distributed, dynamic and largely heterogeneous systems. The key advantages of our solution are its efficient proximity searching, an ability to search over highly dynamic resource properties, the in-built fault tolerance and robustness and, finally, its very low and manageable network overhead.