Mostrar el registro sencillo del ítem
dc.contributor.author | Radenkovic, Milena![]() |
es_ES |
dc.contributor.author | Huynh, Vu San Ha![]() |
es_ES |
dc.contributor.author | Manzoni, Pietro![]() |
es_ES |
dc.date.accessioned | 2019-04-27T20:38:41Z | |
dc.date.available | 2019-04-27T20:38:41Z | |
dc.date.issued | 2018 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/119617 | |
dc.description | (c) 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, 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 components of this work in other works | |
dc.description.abstract | [EN] Emerging mobile environments motivate the need for the development of new distributed technologies which are able to support dynamic peer to peer content sharing, decrease high operating costs, and handle intermittent disconnections. In this paper, we investigate complex challenges related to the mobile disconnection tolerant discovery of content that may be stored in mobile devices and its delivery to the requesting nodes in mobile resource-constrained heterogeneous environments. We propose a new adaptive real-time predictive multi-layer caching and forwarding approach, CafRepCache, which is collaborative, resource, latency, and content aware. CafRepCache comprises multiple multi-layer complementary real-time distributed predictive heuristics which allow it to respond and adapt to time-varying network topology, dynamically changing resources, and workloads while managing complex dynamic tradeoffs between them in real time. We extensively evaluate our work against three competitive protocols across a range of metrics over three heterogeneous real-world mobility traces in the face of vastly different workloads and content popularity patterns. We show that CafRepCache consistently maintains higher cache availability, efficiency and success ratios while keeping lower delays, packet loss rates, and caching footprint compared to the three competing protocols across three traces when dynamically varying content popularity and dynamic mobility of content publishers and subscribers. We also show that the computational cost and network overheads of CafRepCache are only marginally increased compared with the other competing protocols. | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Institute of Electrical and Electronics Engineers | es_ES |
dc.relation.ispartof | IEEE Access | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Mobile disconnection tolerant networks | es_ES |
dc.subject | Content discovery and retrieval | es_ES |
dc.subject | Content caching | es_ES |
dc.subject | Latency awareness, Congestion awareness | es_ES |
dc.subject.classification | ARQUITECTURA Y TECNOLOGIA DE COMPUTADORES | es_ES |
dc.title | Adaptive Real-Time Predictive Collaborative Content Discovery and Retrieval in Mobile Disconnection Prone Networks | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1109/ACCESS.2018.2840040 | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Informática de Sistemas y Computadores - Departament d'Informàtica de Sistemes i Computadors | es_ES |
dc.description.bibliographicCitation | Radenkovic, M.; Huynh, VSH.; Manzoni, P. (2018). Adaptive Real-Time Predictive Collaborative Content Discovery and Retrieval in Mobile Disconnection Prone Networks. IEEE Access. 6:32188-32206. https://doi.org/10.1109/ACCESS.2018.2840040 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | http://doi.org/10.1109/ACCESS.2018.2840040 | es_ES |
dc.description.upvformatpinicio | 32188 | es_ES |
dc.description.upvformatpfin | 32206 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 6 | es_ES |
dc.identifier.eissn | 2169-3536 | es_ES |
dc.relation.pasarela | S\383180 | es_ES |