Edge Container Caching and Task Offloading Under Coupled Decisions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for task offloading and service caching in edge computing systems suffer from low convergence speed and long training times, particularly in nonlinear 0-1 programming, leading to suboptimal solutions and limitations in practical applications.
Innovation Solution
A joint optimization method is developed for task offloading and container caching in a containerized edge computing system, transforming nonlinear 0-1 programming into linear 1 programming through equivalent transformation, including the steps of establishing a mathematical model, establishing a joint optimization problem, and solving it using a linear integer programming algorithm.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If alternating iterative optimization method is used to solve coupling problem, then task offloading and service caching decisions can be optimized, but convergence speed becomes low
Solution Approach 1:
The patent segments the joint optimization problem into two independent sub-problems: task offloading optimization and container caching optimization. By decomposing the coupled nonlinear 0-1 programming problem, the method can solve each sub-problem separately using efficient algorithms, thereby achieving fast convergence without sacrificing optimization accuracy.
Solution Approach 2:
The patent performs preliminary actions by pre-calculating container caching decisions and image file caching decisions before task offloading optimization. This preliminary optimization of caching strategies reduces the complexity of the subsequent task offloading problem, enabling faster convergence of the overall algorithm.
2Reliability
If block coordinate descent method is used for alternating optimization, then coupling problem can be solved, but global optimum solution cannot be found
Solution Approach 1:
The patent changes the mathematical formulation by transforming the nonlinear 0-1 programming problem into a linear 0-1 programming problem through equivalent transformation. This parameter change enables the use of efficient linear programming algorithms that can find global optimum solutions, overcoming the limitation of block coordinate descent methods.
3Productivity
If deep reinforcement learning method is used, then problem can be solved quickly with trained model, but training time becomes long and practical application is limited
Solution Approach 1:
The patent replaces the data-driven deep reinforcement learning approach with a mathematically rigorous optimization approach using linear 0-1 programming. This substitution eliminates the need for extensive model training while providing guaranteed convergence to optimal solutions, making the method suitable for real-time practical applications.
Data Source
AI summary
The invention introduces a joint optimization technique for task offloading and container caching in containerized edge computing, within the domain of task offloading and container caching. The method involves the steps: constructing a mathematical model based on the containerized edge computing system environment, formulating a joint optimization problem using nonlinear 0-1 programming from the model, and resolving the nonlinear 0-1 programming issue. It establishes a mathematical model for the containerized edge computing system to minimize terminal device task processing time. Additionally, it presents a joint optimization approach for task offloading and container caching. This method transforms the challenging nonlinear 0-1 programming into a solvable linear 0-1 programming problem via an equivalent transformation technique. This addresses the coupling problem between caching and task offloading decisions in edge computing, thereby reducing image file download and container instance startup times in the containerized edge computing system, ultimately shortening terminal device task processing times.