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
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Grapes: Topology-Based Hierarchical Virtual Network for Peer-to-Peer Lookup Services
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
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
ParCop: A Decentralized Peer-to-Peer Computing System
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
P2PDisCo - Java Distributed Computing for Workstations Using Chedar Peer-to-Peer Middleware
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06
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
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
RNet: A Hierarchical P2P Overlay Network for Improving Locality in a Mobile Environment
NCM '08 Proceedings of the 2008 Fourth International Conference on Networked Computing and Advanced Information Management - Volume 01
HilbertChord: a P2P framework for service resources management
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Towards a Peer-to-Peer Framework for Parallel and Distributed Computing
SBAC-PAD '10 Proceedings of the 2010 22nd International Symposium on Computer Architecture and High Performance Computing
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
Distributed k-core decomposition
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Efficient routing and broadcasting algorithms in de bruijn networks
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Fault free shortest path routing on the de bruijn networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
On the optimality of clustering properties of space filling curves
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Editorial: Collaboration computing technologies and applications
Journal of Network and Computer Applications
| Hi-index | 0.00 |
A characteristic of Peer-to-Peer (P2P) computing networks is their huge number of different computational resources scattered across the Internet. Gathering peers into markets according to their multi-attribute computational resources makes it easier to manage these environments. This solution is known as market overlay. In this context, the closeness of the markets with similar resources, known as locality, is a key feature for ensuring good P2P resource management. Thus, the locality feature over a market overlay allows a lack of resources in a given market to be compensated quickly by any other market with similar resources, whenever these are close to each other. Consequently, locality becomes an essential challenge. This paper addresses the analysis of the locality of P2P market over-lays. According to this, a new procedure for measuring locality is applied together with an extensive analysis of some well-known structured P2P overlays. Based on this analysis, a new P2P computing architecture, named DisCoP, oriented towards optimizing locality is proposed. Our proposal gathers the peers into markets according to their computational resources. A Hilbert function is used to arrange multi-attribute markets in an ordered and mono-dimensional space and the markets are linked by means of a Bruijn graph. In order to maintain the DisCoP locality whenever the overlay is not completed, a solution based on the virtualization of markets is also proposed. Finally, the DisCoP locality is tested together with the proposed virtualization method for approximate searches over uncompleted overlays. The simulation results show that approximate searches exploit the DisCoP locality efficiently.