Research Article
Dynamic Rendering-Aware VR Service Module Placement Strategy in MEC Networks
Algorithm 1
Auxiliary graph construction and solving algorithm.
Input: The network delay between BS and BS ; The | switching cost of group at time ; The migration | delay of group at time ; | Output: The value of binary variables and ; The auxiliary | graph ; the variables and | 1: Initialization; ; | 2: fordo | 3: fordo | 4: do | 5: ; | 6: ; | 7: end for | 8: for Algorithm 1 do | 9: ; | 10: | ; | 11: | 12: end for | 13: end for | 14: end for | 15: Solve the k-size s-t min cut [43] of ; |
|