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
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of Multi-Dimensional Space-Filling Curves
Geoinformatica
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Squid: Enabling search in DHT-based systems
Journal of Parallel and Distributed Computing
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design and implementation trade-offs for wide-area resource discovery
ACM Transactions on Internet Technology (TOIT)
Studying Viable Free Markets in Peer-to-Peer File Exchange Applications without Altruistic Agents
Agents and Peer-to-Peer Computing
Autonomous Resource Selection for Decentralized Utility Computing
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
A computing resource discovery mechanism over a P2P tree topology
VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
Cooperative scheduling mechanism for large-scale peer-to-peer computing systems
Journal of Network and Computer Applications
| Hi-index | 0.00 |
This paper proposes an efficient and scalable computational resource discovery overlay orientated towards P2P computing. Our proposal gathers the peers into markets according to their computational resources. Each market is arranged in an N-tree and the trees are linked by a Bruijn graph. The tree topology allows efficient searching of available resources in a specific market, while Bruijn provides good scalability because search complexity does not depend on the number of markets. A Hilbert function is used to arrange markets in one ordered and monodimensional space. This way, the proposed architecture exploits the Bruijn and N-tree topologies together with the Hilbert function. A look-up query mechanism for simple and multiple queries with a low algorithmic cost is also introduced over this architecture. The performance of our proposal was analysed by means of simulation in relation to the widely used Chord overlay with the case of simple queries, and the Baton algorithm with the case of range queries. Furthermore, a large number of experiments demonstrate the proper behaviour of the system. The results obtained reveal the competitiveness of our proposals.