Show simple item record

dc.contributor.authorRejiba, Zeineb
dc.contributor.authorMasip Bruin, Xavier
dc.contributor.authorMarín Tordera, Eva
dc.contributor.otherUniversitat Politècnica de Catalunya. Doctorat en Arquitectura de Computadors
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.identifier.citationRejiba, Z.; Masip, X.; Marin, E. Computation task assignment in vehicular fog computing: a learning approach via neighbor advice. A: IEEE International Symposium on Network Computing and Applications. "2019 IEEE 18th International Symposium on Network Computing and Applications (NCA): September 26-28, 2019". Institute of Electrical and Electronics Engineers (IEEE), 2019, p. 1-5.
dc.description.abstractIn the recent years, fog computing has been proposed as a promising paradigm to enhance the performance of latency-critical applications by hosting them within idle computation nodes (Fog Nodes, FNs) at the edge of the network. Such a paradigm has been further extended to the vehicular fog computing (VFC) scenario by leveraging available computing resources offered by modern vehicles, thus allowing them to process different types of computation tasks on behalf of onboard users or nearby vehicles. Within this context, the proper assignment of computation tasks to Vehicular FNs is an important issue that is currently under active research. To address this issue, online learning approaches, where the performances of the Vehicular FNs in terms of task execution delay are learnt via trial and error, are starting to gain in popularity. This is mainly motivated by the inherent uncertainty caused by mobility and fluctuating resource availabilities in VFC environments. However, since the process of learning from scratch in such a dynamic vehicular environment may lead to a degradation in the learning performance, this paper proposes the use of an advising mechanism, where a roadside unit (RSU) who has already learnt the performances of the vehicles within its range, uses its acquired knowledge to provide advice to a neighbor RSU who does not have enough experience allowing it to make efficient assignment decisions on its own. To evaluate this approach, we used realistic vehicular mobility traces to simulate the VFC scenario. The obtained results show that our proposed approach improves the learning performance compared to the case where no advice is leveraged.
dc.format.extent5 p.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Programació
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors::Internet
dc.subject.lcshCloud computing
dc.subject.otherFog computing
dc.subject.otherVehicular fog computing
dc.subject.otherTask assignment
dc.subject.otherMulti-armed bandits
dc.subject.otherAdvice-based learning
dc.titleComputation task assignment in vehicular fog computing: a learning approach via neighbor advice
dc.typeConference report
dc.subject.lemacInternet (Computer network)
dc.subject.lemacComputació en núvol
dc.contributor.groupUniversitat Politècnica de Catalunya. CRAAX - Centre de Recerca d'Arquitectures Avançades de Xarxes
dc.description.peerreviewedPeer Reviewed
dc.rights.accessRestricted access - publisher's policy
dc.description.versionPostprint (published version)
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/H2020/730929/EU/Towards an Open, Secure, Decentralized and Coordinated Fog-to-Cloud Management Ecosystem/mF2C
local.citation.authorRejiba, Z.; Masip, X.; Marin, E.
local.citation.contributorIEEE International Symposium on Network Computing and Applications
local.citation.publicationName2019 IEEE 18th International Symposium on Network Computing and Applications (NCA): September 26-28, 2019

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder