A New Heuristic Computation Offloading Method Based on Cache-Assisted Model

Algorithm 2

OPP Algorithm.

Input: Request server ; cost function , ; actual cost from starting point to candidate point , ; estimated cost from candidate point to target point , ; search step

Output: Optimal path set

1:  ;

2:  Obtain through Algorithm 1, , ;

3:  If set is empty then

4:    Return false.

5:  Else

6:    While is searched forward and backward and marked as and is smallest do

7:    If is null then

8:      Search for node ;

9:    Else

10:      Calculate the cost of successor node , ;

11:      Select minimum , , , , ;

12:    If is null then

13:      Search for the node ;

14:    Else

15:      Calculate the cost of successor node , ;

16:      Select minimum , , , , ;

17:    If is null then

18:     Search for the node ;

19:    Else

20:     Calculate the cost of successor node , ;

21:     Select minimum , , , , ;

22:     Search backward from node , search step is ;

23:     Return 7;

24: Return ;