In this paper, we study the deadline-aware task data offloading in edge-cloud computing systems. The hard-deadline tasks strictly demand to be processed within their delay deadline, whereas the deadline can be relaxed for the soft-deadline tasks. Generally, edge computing aims to shorten the transmission delay between the remote cloud and the end-user, however, at the cost of limited computing capability. Therefore, it is challenging to decide where to offload the hard- and soft-deadline tasks based on the average delay and the service price set by the edge and cloud servers. Both edge and cloud servers aim to maximize their revenue by selling the computational resources at the optimal price. Interestingly, a Wardrop equilibrium is reached, considering that each task is considered independently to be offloaded to a suitable location. The numerical results demonstrate that the proposed price- and deadline-sensitive task offloading policy reaches the equilibrium and finds the optimal location for processing while maximizing the revenue of both edge and cloud servers.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal Pricing for Offloaded Hard- and Soft-Deadline Tasks in Edge Computing


    Contributors:


    Publication date :

    2022-07-01


    Size :

    1773064 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Mobility and Deadline-Aware Task Scheduling Mechanism for Vehicular Edge Computing

    da Costa, Joahannes B. D. / de Souza, Allan M. / Meneguette, Rodolfo I. et al. | IEEE | 2023

    Free access

    Optimal Offloading of Computing-intensive Tasks for Edge-aided Maritime UAV Systems

    Li, Huanran / Wu, Shaohua / Li, Dongqing et al. | IEEE | 2022



    A Hard Look At Soft Computing

    Noor, A. K. / Jorgensen, C. C. | British Library Online Contents | 1996


    A HARD LOOK AT SOFT COMPUTING

    Noor, Ahmed K. | Online Contents | 1996