Dynamic task offloading and scheduling for low-latency IoT services in multi-access edge computing

LAUR Repository

Show simple item record

dc.contributor.author Alameddine, Hyame Assem
dc.contributor.author Sharafeddine, Sanaa
dc.contributor.author Sebbah, Samir
dc.contributor.author Ayoubi, Sara
dc.contributor.author Assi, Chadi
dc.date.accessioned 2019-05-07T08:47:09Z
dc.date.available 2019-05-07T08:47:09Z
dc.date.copyright 2019 en_US
dc.date.issued 2019-05-07
dc.identifier.issn 0733-8716 en_US
dc.identifier.uri http://hdl.handle.net/10725/10568
dc.description.abstract Multi-access edge computing (MEC) has recently emerged as a novel paradigm to facilitate access to advanced computing capabilities at the edge of the network, in close proximity to end devices, thereby enabling a rich variety of latency sensitive services demanded by various emerging industry verticals. Internet-of-Things (IoT) devices, being highly ubiquitous and connected, can offload their computational tasks to be processed by applications hosted on the MEC servers due to their limited battery, computing, and storage capacities. Such IoT applications providing services to offloaded tasks of IoT devices are hosted on edge servers with limited computing capabilities. Given the heterogeneity in the requirements of the offloaded tasks (different computing requirements, latency, and so on) and limited MEC capabilities, we jointly decide on the task offloading (tasks to application assignment) and scheduling (order of executing them), which yields a challenging problem of combinatorial nature. Furthermore, we jointly decide on the computing resource allocation for the hosted applications, and we refer this problem as the Dynamic Task Offloading and Scheduling problem, encompassing the three subproblems mentioned earlier. We mathematically formulate this problem, and owing to its complexity, we design a novel thoughtful decomposition based on the technique of the Logic-Based Benders Decomposition. This technique solves a relaxed master, with fewer constraints, and a subproblem, whose resolution allows the generation of cuts which will, iteratively, guide the master to tighten its search space. Ultimately, both the master and the sub-problem will converge to yield the optimal solution. We show that this technique offers several order of magnitude (more than 140 times) improvements in the run time for the studied instances. One other advantage of this method is its capability of providing solutions with performance guarantees. Finally, we use this method to highlight the insightful performance trends for different vertical industries as a function of multiple system parameters with a focus on the delay-sensitive use cases. en_US
dc.language.iso en en_US
dc.title Dynamic task offloading and scheduling for low-latency IoT services in multi-access edge computing en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SAS en_US
dc.author.idnumber 200502746 en_US
dc.author.department Computer Science And Mathematics en_US
dc.description.embargo N/A en_US
dc.relation.journal IEEE Journal on Selected Areas in Communications en_US
dc.journal.volume 37 en_US
dc.journal.issue 3 en_US
dc.article.pages 668-682 en_US
dc.identifier.doi https://doi.org/10.1109/JSAC.2019.2894306 en_US
dc.identifier.ctation Alameddine, H. A., Sharafeddine, S., Sebbah, S., Ayoubi, S., & Assi, C. (2019). Dynamic Task Offloading and Scheduling for Low-Latency IoT Services in Multi-Access Edge Computing. IEEE Journal on Selected Areas in Communications, 37(3), 668-682. en_US
dc.author.email sanaa.sharafeddine@lau.edu.lb en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url https://ieeexplore.ieee.org/abstract/document/8630994 en_US
dc.orcid.id https://orcid.org/0000-0001-6548-1624 en_US
dc.author.affiliation Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account