- -

Deadline-Aware Fair Scheduling for Offloaded Tasks in Fog Computing With Inter-Fog Dependency

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

Deadline-Aware Fair Scheduling for Offloaded Tasks in Fog Computing With Inter-Fog Dependency

Mostrar el registro sencillo del ítem

Ficheros en el ítem

dc.contributor.author Mukherjee, Mithun es_ES
dc.contributor.author Guo, Mian es_ES
dc.contributor.author Lloret, Jaime es_ES
dc.contributor.author Iqbal, Razi es_ES
dc.contributor.author Zhang, Qi es_ES
dc.date.accessioned 2022-11-07T19:02:01Z
dc.date.available 2022-11-07T19:02:01Z
dc.date.issued 2020-02 es_ES
dc.identifier.issn 1089-7798 es_ES
dc.identifier.uri http://hdl.handle.net/10251/189399
dc.description.abstract [EN] A fundamental problem in fog computing networks is how to schedule the deadline-aware offloaded tasks that directly arrive from the end-users and via other fog nodes. The computational resource allocation becomes more challenging when the tasks demand different delay-deadlines. In this letter, we aim to propose a scheduling strategy to maximize the number of the completed tasks within their respective deadlines while making the network strongly stable. We exploit Lyapunov drift-plus-penalty function on the queue length to schedule the tasks in the queues. Subsequently, the scheduling policy decides the amount of task to be offloaded to the underloaded fog nodes to fully utilize the computational resources offered by all fog nodes in the network. Our simulation results reveal that the proposed strategy outperforms the baseline schemes, especially when those tasks have distinct delay-deadlines. es_ES
dc.description.sponsorship This work was supported in part by the National Natural Science Foundation of China under Grants 61901128 and 61672174. es_ES
dc.language Inglés es_ES
dc.publisher Institute of Electrical and Electronics Engineers es_ES
dc.relation.ispartof IEEE Communications Letters es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Task analysis es_ES
dc.subject Delays es_ES
dc.subject Electronic mail es_ES
dc.subject Queueing analysis es_ES
dc.subject Processor scheduling es_ES
dc.subject Edge computing es_ES
dc.subject Schedules es_ES
dc.subject Fog computing es_ES
dc.subject Computation offloading es_ES
dc.subject Latency sensitive es_ES
dc.subject Fog collaboration es_ES
dc.subject Lyapunov optimization es_ES
dc.subject Resource allocation es_ES
dc.title Deadline-Aware Fair Scheduling for Offloaded Tasks in Fog Computing With Inter-Fog Dependency es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1109/LCOMM.2019.2957741 es_ES
dc.relation.projectID info:eu-repo/grantAgreement/NSFC//61901128/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/NSFC//61672174/ es_ES
dc.rights.accessRights Abierto es_ES
dc.description.bibliographicCitation Mukherjee, M.; Guo, M.; Lloret, J.; Iqbal, R.; Zhang, Q. (2020). Deadline-Aware Fair Scheduling for Offloaded Tasks in Fog Computing With Inter-Fog Dependency. IEEE Communications Letters. 24(2):307-311. https://doi.org/10.1109/LCOMM.2019.2957741 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1109/LCOMM.2019.2957741 es_ES
dc.description.upvformatpinicio 307 es_ES
dc.description.upvformatpfin 311 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 24 es_ES
dc.description.issue 2 es_ES
dc.relation.pasarela S\473136 es_ES
dc.contributor.funder National Natural Science Foundation of China es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem