Cooperative Job Dispatching in Edge Computing Network with Unpredictable Uploading Delay

@article{Lv2020CooperativeJD,
  title={Cooperative Job Dispatching in Edge Computing Network with Unpredictable Uploading Delay},
  author={Bojie Lv and Yuncong Hong and Haisheng Tan and Zhenhua Han and Rui Wang},
  journal={ArXiv},
  year={2020},
  volume={abs/1912.10732}
}
In this paper, the cooperative jobs dispatching problem in an edge computing network with multiple access points (APs) and edge servers is considered. Due to the uncertain traffic in the network between APs and edge servers, the job uploading delay can not be predicted accurately. Specifically, the job arrivals at the APs, the job uploading delay from APs to edge servers and the job computation time at the edge servers are all modeled as random variables. Since each job dispatching decision… 

Figures and Tables from this paper

Online Distributed Job Dispatching with Outdated and Partially-Observable Information
  • Yuncong Hong, B. Lv, F. Lau
  • Computer Science
    2020 16th International Conference on Mobility, Sensing and Networking (MSN)
  • 2020
TLDR
A novel low-complexity solution framework for distributed job dispatch is proposed, based on which the optimization of job dispatching policy can be decoupled via an alternative policy iteration algorithm, so that the distributed policy iteration of each AP can be made according to partial and outdated observation.
Scheduling for Mobile Edge Computing With Random User Arrivals—An Approximate MDP and Reinforcement Learning Approach
TLDR
This work investigates the scheduling design of a mobile edge computing (MEC) system, where active mobile devices with computation tasks randomly appear in a cell, and introduces a baseline scheduling policy, whose value function can be derived analytically with the statistics of random mobile device arrivals.
Joint Optimization of File Placement and Delivery in Cache-Assisted Wireless Networks
TLDR
It is shown that the optimal solution of transmission power and time in one finite file lifetime as a Markov Decision Process (MDP) with a random number of stages can be obtained via a revised Bellman's equation.
Edge‐adaptable serverless acceleration for machine learning Internet of Things applications
TLDR
STOIC (serverless teleoperable hybrid cloud), an IoT application deployment and offloading system that extends the serverless model in three ways, is presented and it is found that STOIC reduces overall execution time and achieves placement accuracy that ranges from 92% to 97%.
Edge-Adaptable Serverless Acceleration for Machine Learning IoT Applications
TLDR
It is found that STOIC can be used for training image processing workloads (for object recognition) – once thought too resourceintensive for edge deployments, and reduces overall execution time and achieves placement accuracy that ranges from 92% to 97%.
Energy-Efficient UAV-Sensor Data Harvesting: Dynamic Adaptive Modulation and Height Control
TLDR
Considering the urban environment during flight, dynamic adaptive modulation and height control for UAV-sensor data harvesting in urban areas is proposed and the advantage of proposed joint design over modulation selection only is illustrated via the computer simulations.

References

SHOWING 1-10 OF 19 REFERENCES
Online job dispatching and scheduling in edge-clouds
TLDR
The first online job dispatching and scheduling algorithm in edge-clouds, called OnDisc, is derived, which is scalable in the speed augmentation model; that is, OnDisc is (1 + ε)-speed O(1/ε)-competitive for any constant ε ∊ (0,1).
Joint Downlink Scheduling for File Placement and Delivery in Cache-Assisted Wireless Networks With Finite File Lifetime
TLDR
It is shown by simulation that the proposed low-complexity reactive multicast policy can significantly reduce the resource consumption at the base station, and the proactive multicasts policy can further improve the performance.
Joint Service Caching and Task Offloading for Mobile Edge Computing in Dense Networks
TLDR
An efficient online algorithm, called OREO, is proposed, which jointly optimizes dynamic service caching and task offloading to address a number of key challenges in MEC systems, including service heterogeneity, unknown system dynamics, spatial demand coupling and decentralized coordination.
Joint Optimization of File Placement and Delivery in Cache-Assisted Wireless Networks
TLDR
It is shown that the optimal solution of transmission power and time in one finite file lifetime as a Markov Decision Process (MDP) with a random number of stages can be obtained via a revised Bellman's equation.
Cellular Offloading via Downlink Cache Placement
In this paper, the downlink file transmission within a finite lifetime is optimized with the assistance of wireless cache nodes. Specifically, the number of requests within the lifetime of one file
Computation Offloading and Resource Allocation in Mixed Fog/Cloud Computing Systems With Min-Max Fairness Guarantee
TLDR
This paper tackles the computation offloading problem in a mixed fog/cloud system by jointly optimizing the offloading decisions and the allocation of computation resource, transmit power, and radio bandwidth while guaranteeing user fairness and maximum tolerable delay.
Delay-Aware Two-Hop Cooperative Relay Communications via Approximate MDP and Stochastic Learning
  • Rui Wang, V. Lau
  • Computer Science
    IEEE Transactions on Information Theory
  • 2013
TLDR
A low-complexity delay-aware cross-layer scheduling algorithm for two-hop relay communication systems that achieves significant gain compared with various baselines such as the conventional CSIT-only control and the throughput optimal control.
Efficient Multi-User Computation Offloading for Mobile-Edge Cloud Computing
TLDR
This paper designs a distributed computation offloading algorithm that can achieve a Nash equilibrium, derive the upper bound of the convergence time, and quantify its efficiency ratio over the centralized optimal solutions in terms of two important performance metrics.
Capacitated cloudlet placements in Wireless Metropolitan Area Networks
TLDR
This paper considers placing multiple cloudlets with different computing capacities at some strategic local locations in a WMAN to reduce the average cloudlet access delay of mobile users at different APs and proposes a fast yet efficient heuristic.
Dynamic Programming and Optimal Control[M], 4th ed, vol
  • Athena Scientific,
  • 2012
...
...