Locating nearby copies of replicated Internet servers
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Multidimensional access methods
ACM Computing Surveys (CSUR)
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
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
An architecture for secure wide-area service discovery
Wireless Networks - Selected Papers from Mobicom'99
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
ACM Transactions on Computer Systems (TOCS)
Mariposa: a wide-area distributed database system
The VLDB Journal — The International Journal on Very Large Data Bases
Policy Driven Heterogeneous Resource Co-Allocation with Gangmatching
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
XenoSearch: Distributed Resource Discovery in the XenoServer Open Platform
HPDC '03 Proceedings of the 12th 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
Cache-and-query for wide area sensor databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Designing an efficient distributed digital library database for image data
Designing an efficient distributed digital library database for image data
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
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Willow: DHT, aggregation, and publish/subscribe in one protocol
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Decentralised diffusion-based quota management
Proceedings of the 4th international workshop on Middleware for grid computing
A P2P strategy for QoS discovery and SLA negotiation in Grid environment
Future Generation Computer Systems
Adaptive expression based routing protocol for P2P systems
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Peer-to-peer service provisioning in cloud computing environments
The Journal of Supercomputing
| Hi-index | 0.00 |
The high bandwidth and low latency of the modern internet has made possible the deployment of distributed computing platforms. The XenoServe platform provides a distributed computing platform open to all and presents three major new challenges for resource discovery: Firstly, network location is key for effectively provisioning services, to mitigate against high-latency, high-load or component failure. Secondly, many services require a presence on several servers, with inter-related requirements. Finally, as the platform is open with respect to users and servers, large numbers of queries and updates are expected.To address these requirements we introduce and evaluate XenoSearch, a new distributed service for selecting the machines to host components of multi-node distributed systems and which is uniquely able to express and efficiently answer complex queries with inter-related location constraints. We demonstrate that XenoSearch represents a trade-off between accuracy and query time which avoids exhaustive search and supports multiple resources. In addition the performance of the algorithm and the quality of its server selections is investigated and the performance of the distributed service shown to be invariant as the number of nodes or items indexed increases.