- -

On the performance of ACO-based methods in p2p resource discovery

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

  • Estadisticas de Uso

On the performance of ACO-based methods in p2p resource discovery

Show simple item record

Files in this item

dc.contributor.author Krynicki, Kamil Krzysztof es_ES
dc.contributor.author Jaén Martínez, Francisco Javier es_ES
dc.contributor.author Mocholí Agües, Jose Antonio es_ES
dc.date.accessioned 2014-10-06T10:53:29Z
dc.date.available 2014-10-06T10:53:29Z
dc.date.issued 2013-12
dc.identifier.issn 1568-4946
dc.identifier.uri http://hdl.handle.net/10251/40662
dc.description.abstract Over the recent years peer-to-peer (p2p) systems have become increasingly popular. As of today most ofthe internet IP traffic is already transmitted in this format and still it is said to double in volume till 2014.Most p2p systems, however, are not pure serverless solutions, nor is the searching in those networkshighly efficient, usually achieved by simple flooding. In order to confront with the growing traffic wemust consider more elaborate search mechanisms and far less centralized environments. An effectiveproposal to this problem is to solve it in the domain of ant colony optimization metaheuristics. In thispaper we present an overview of ACO algorithms that offer the best potential in this field, under the strictrequirements and limitations of a pure p2p network. We design several experiments to serve as an evalu-ation platform for the mentioned algorithms to conclude the features of a high quality approach. Finally,we consider two hybrid extensions to the classical algorithms, in order to examine their contribution tothe overall quality robustness.© 2013 Elsevier B.V. All rights reserved. es_ES
dc.description.sponsorship This work was funded by the Spanish Ministry of Education and Science and Innovation under the National Strategic Program of Scientific Research, Development and Technological Innovation (I+D+i) project TIN2010-20488. Kamil Krynicki is supported by a FPI fellowship from Universidad Politecnica de Valencia. en_EN
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof Applied Soft Computing es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Semantic search es_ES
dc.subject Ant colony optimization es_ES
dc.subject Peer-to-peer es_ES
dc.subject.classification LENGUAJES Y SISTEMAS INFORMATICOS es_ES
dc.title On the performance of ACO-based methods in p2p resource discovery es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.asoc.2013.07.022
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//TIN2010-20488/ES/CREATEWORLDS: UNA PLATAFORMA PARA EL APRENDIZAJE CREATIVO SOBRE MESAS INTERACTIVAS/ es_ES
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació es_ES
dc.description.bibliographicCitation Krynicki, KK.; Jaén Martínez, FJ.; Mocholí Agües, JA. (2013). On the performance of ACO-based methods in p2p resource discovery. Applied Soft Computing. 13(12):4813-4831. https://doi.org/10.1016/j.asoc.2013.07.022 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1016/j.asoc.2013.07.022 es_ES
dc.description.upvformatpinicio 4813 es_ES
dc.description.upvformatpfin 4831 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 13 es_ES
dc.description.issue 12 es_ES
dc.relation.senia 256810
dc.contributor.funder Ministerio de Ciencia e Innovación es_ES
dc.contributor.funder Universitat Politècnica de València es_ES


This item appears in the following Collection(s)

Show simple item record