2022
DOI: 10.1007/s11276-022-02978-y
|View full text |Cite
|
Sign up to set email alerts
|

Latency-aware service migration with decision theory for Internet of Vehicles in mobile edge computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 46 publications
0
3
0
Order By: Relevance
“…The literature [32] developed an optimal iterative relaxation-and-rounding based solution approach to minimize the migration cost. Considering the high mobility of vehicles, Considering the high mobility of vehicles, The authors transform the service migration problem into an uncertain decision optimization problem and designed a a Latency-aware S ervice M igration method with Decision theory (LSMD) [21]. However, it is difficult to achieve fast convergence of the algorithm due to the traditional heuristic algorithm's high time complexity.…”
Section: Service Migration In Edge Computing (Ec)mentioning
confidence: 99%
See 1 more Smart Citation
“…The literature [32] developed an optimal iterative relaxation-and-rounding based solution approach to minimize the migration cost. Considering the high mobility of vehicles, Considering the high mobility of vehicles, The authors transform the service migration problem into an uncertain decision optimization problem and designed a a Latency-aware S ervice M igration method with Decision theory (LSMD) [21]. However, it is difficult to achieve fast convergence of the algorithm due to the traditional heuristic algorithm's high time complexity.…”
Section: Service Migration In Edge Computing (Ec)mentioning
confidence: 99%
“…An autonomous bandwidth allocation approach is proposed to support the low-latency service migration [20]. The authors used a decision theory based algorithm to find an optimal service migration path [21]. Most of the existing works concentrate on finding an optimal algorithm to lower the delay of task offloading or service migration.…”
Section: Introductionmentioning
confidence: 99%
“…With the construction of a power supply company's power dispatching data network, the main station has been consecutively connected to all county dispatching services, resulting in further convergence and an increase in information flow in the main station, which puts considerable pressure on the dispatching data network and the main station dispatching automation system [19,20]. Due to access to county transfer automation business, the operation analysis report of power dispatch automation shows that many hidden defects are generated in the information flow, which is very difficult to trace and analyze due to the large amount of data and fast disappearance of information flow [21,22].…”
Section: Introductionmentioning
confidence: 99%