Analyzing locality over a P2P computing architecture
MetadataShow full item record
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.
Is part ofJournal of Network and Computer Applications, 2013, vol. 36, núm. 6, p. 1610-1619
Showing items related by title, author, creator and subject.
Castellà Martínez, Damià; Solsona Tehàs, Francesc; Giné, Francesc (Springer Verlag, 2015)Peer-to-Peer (P2P) computing, the harnessing of idle CPU cycles through the Internet, offers new research challenges in the domain of distributed computing. This paper proposes an efficient, dynamic and scalable overlay ...
Romero-Tris, Cristina; Castellà Martínez, Damià; Viejo Galicia, Alexandre; Castellà Roca, Jordi; Solsona Tehàs, Francesc; Mateo-Sanz, Josep María (Elsevier, 2015)Web Search Engines store and analyze queries made by their users in order to build their profiles and offer them personalized search results (i.e., results are ranked according to each user’s preferences). Even though ...
Sentís, Josep M.; Solsona Tehàs, Francesc; Castellà Martínez, Damià; Rius Torrentó, Josep Maria (Springer Verlag, 2014)CodiP2P and DisCoP are two peer-to-peer (P2P) computing overlays aimed at sharing computing resources (CPU, Memory, etc.) to execute parallel applications. Their component nodes are basically PC’s and a wide range of ...