Research Article
DIMDP: A Driving Intention-Based MDP Service Migration Model under MEC/MSCN Architecture
Table 1
Explanation for Algorithm 1’s variables and functions.
| Variable/function | Explanation |
| pif | Probability set of forward area migration inclining events | | Service request data size | | Service migration data size | | The data size of frame structure | | The coverage radius of RSU | | Vehicle speed | f | Service request frequency | | The minimal average total cost | S | The optimal migration strategy, a service migration event occurring when | get_Pmatrix (pif, N) | Obtain the state transition probability matrix P according to pif at migration distance N | get_state (, N) | Obtain the row probability vector of states at the migration distance N according to (3) and (-4) | Get_cost (Cset, , N) | Obtain the average total cost according to (18). Cset is |
|
|