Mostrar el registro sencillo del ítem
dc.contributor.author | Krynicki, Kamil Krzysztof | es_ES |
dc.contributor.author | Jaén Martínez, Francisco Javier | es_ES |
dc.contributor.author | Catalá Bolós, Alejandro | es_ES |
dc.date.accessioned | 2016-07-07T13:24:01Z | |
dc.date.available | 2016-07-07T13:24:01Z | |
dc.date.issued | 2013-06-20 | |
dc.identifier.isbn | 978-1-4799-0452-5 | |
dc.identifier.issn | 1089-778X | |
dc.identifier.uri | http://hdl.handle.net/10251/67330 | |
dc.description | © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works | es_ES |
dc.description.abstract | The Ant Colony Optimization (ACO) has been a very resourceful metaheuristic over the past decade and it has been successfully used to approximately solve many static NP-Hard problems. There is a limit, however, of its applicability in the field of p2p networks; derived from the fact that such networks have the potential to evolve constantly and at a high pace, rendering the already-established results useless. In this paper we approach the problem by proposing a generic knowledge diffusion mechanism that extends the classical ACO paradigm to better deal with the p2p's dynamic nature. Focusing initially on the appearance of new resources in the network we have shown that it is possible to increase the efficiency of ant routing by a significant margin. | es_ES |
dc.description.sponsorship | Kamil Krynicki is supported by a FPI fellowship from the Universitat Politècnica de València with reference number 3117. This work received financial support from the Spanish Ministry of Education under the National Strategic Program of Research and Project TSI2010-20488. | es_ES |
dc.format.extent | 8 | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | IEEE | es_ES |
dc.relation.ispartof | 2013 IEEE Congress on Evolutionary Computation | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | ACO | es_ES |
dc.subject | Ant Colony Optimization | es_ES |
dc.subject | Overlay networks | es_ES |
dc.subject | Semantic search | es_ES |
dc.subject | Semantic networks | es_ES |
dc.subject | P2P | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.title | A diffusion-based ACO resource discovery framework for dynamic p2p networks | es_ES |
dc.type | Capítulo de libro | es_ES |
dc.type | Comunicación en congreso | es_ES |
dc.identifier.doi | 10.1109/CEC.2013.6557658 | |
dc.relation.projectID | info:eu-repo/grantAgreement/UPV//FPI%2F3117/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/ME//TSI2010-20488/ | 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.; Catalá Bolós, A. (2013). A diffusion-based ACO resource discovery framework for dynamic p2p networks. En 2013 IEEE Congress on Evolutionary Computation. IEEE. 860-867. https://doi.org/10.1109/CEC.2013.6557658 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.conferencename | IEEE Congress on Evolutionary Computation (CEC 2013) | es_ES |
dc.relation.conferencedate | June, 20-23, 2013 | es_ES |
dc.relation.conferenceplace | Cancún, México | es_ES |
dc.relation.publisherversion | http://dx.doi.org/10.1109/CEC.2013.6557658 | es_ES |
dc.description.upvformatpinicio | 860 | es_ES |
dc.description.upvformatpfin | 867 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.relation.senia | 256007 | es_ES |
dc.contributor.funder | Universitat Politècnica de València | es_ES |
dc.contributor.funder | Ministerio de Educación | es_ES |