Show simple item record

dc.contributor.authorCastellà, Damià
dc.contributor.authorGiné, Francesc
dc.contributor.authorSolsona Tehàs, Francesc
dc.contributor.authorLérida Monsó, Josep Lluís
dc.date.accessioned2016-05-23T09:18:15Z
dc.date.issued2013
dc.identifier.issn1084-8045
dc.identifier.urihttp://hdl.handle.net/10459.1/57082
dc.description.abstractA 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.ca_ES
dc.description.sponsorshipThis work was supported by the MEyC under contract TIN2011-28689-C02-02.ca_ES
dc.language.isoengca_ES
dc.publisherElsevierca_ES
dc.relationMICINN/PN2008-2011/TIN2011-28689-C02-02ca_ES
dc.relation.isformatofReproducció del document publicat a https://doi.org/10.1016/j.jnca.2012.12.032ca_ES
dc.relation.ispartofJournal of Network and Computer Applications, 2013, vol. 36, núm. 6, p. 1610-1619ca_ES
dc.rights(c) Elsevier, 2013ca_ES
dc.subjectP2P computingca_ES
dc.subjectP2P topologiesca_ES
dc.subjectLocalityca_ES
dc.titleAnalyzing locality over a P2P computing architectureca_ES
dc.typearticleca_ES
dc.identifier.idgrec019260
dc.type.versionpublishedVersionca_ES
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccessca_ES
dc.identifier.doihttps://doi.org/10.1016/j.jnca.2012.12.032
dc.date.embargoEndDate2025-01-01


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record