DisCoP: a P2P framework for managing and searching computing markets
MetadataShow full item record
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 orientated towards P2P computing, called DisCoP. Our proposal gathers the peers
into markets according to their computational resources. Each market is arranged in an N-ari Tree and these trees are linked by a Bruijn graph. The tree topology allows efficient searching of available resources in a specific market, while the Bruijn provides good scalability. A Hilbert function is used to arrange markets in one ordered and mono-dimensional space. This way, the proposed architecture exploits the Bruijn and the N-ari tree topologies together with the Hilbert function to classify the computing markets. Searching efficiently for computational resources in P2P systems is a challenge and in turn, an essential requirement for the platform to provide. This article also proposes different search algorithms, each adapted to the DisCoP overlay and optimized to locate computing resources in different ways: exact, range, multi-attribute and approximate searches. A large number of experiments demonstrate the correct behavior of our proposals. The comparison of the obtained results obtained compared to other approaches in the literature reveals their competitiveness in terms of efficiency, latency and hit rates.
Is part ofJournal of Grid Computing, 2015, vol. 13, p. 115-137
Showing items related by title, author, creator and subject.
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 ...
Castellà, Damià; Giné, Francesc; Solsona Tehàs, Francesc; Lérida Monsó, Josep Lluís (Elsevier, 2013)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 ...