|
Notas:
|
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.
This work was partially supported by the Spanish Ministry of Science and Innovation under contract TIN2011-28689-C02-02. The authors are members of the research groups 2009-SGR145 and 2014-SGR163, funded by the Generalitat de Catalunya. |
