Research Article
Multi-MEC Cooperation Based VR Video Transmission and Cache Using K-Shortest Paths Optimization
@INPROCEEDINGS{10.1007/978-3-031-34776-4_18, author={Jingwen Xia and Luyao Chen and Yong Tang and Ting Yang and Wenyong Wang}, title={Multi-MEC Cooperation Based VR Video Transmission and Cache Using K-Shortest Paths Optimization}, proceedings={Mobile and Ubiquitous Systems: Computing, Networking and Services. 19th EAI International Conference, MobiQuitous 2022, Pittsburgh, PA, USA, November 14-17, 2022, Proceedings}, proceedings_a={MOBIQUITOUS}, year={2023}, month={6}, keywords={360 virtual reality video Virtual reality Mobile edge computing K-shortest paths}, doi={10.1007/978-3-031-34776-4_18} }- Jingwen Xia
Luyao Chen
Yong Tang
Ting Yang
Wenyong Wang
Year: 2023
Multi-MEC Cooperation Based VR Video Transmission and Cache Using K-Shortest Paths Optimization
MOBIQUITOUS
Springer
DOI: 10.1007/978-3-031-34776-4_18
Abstract
In recent network architectures, multi-MEC cooperative caching has been introduced to reduce the transmission latency of VR videos, in which MEC servers’ computing and caching capability are utilized to optimize the transmission process. However, many solutions that use the computing capability of MEC servers ignore the additional arithmetic power consumed by the codec process, thus making them infeasible. Besides, the minimum cache unit is usually the entire VR video, which makes caching inefficient.
To address these challenges, we split VR videos into tile files for caching based on the current popular network architecture and provide a reliable transmission mechanism and an effective caching strategy. Since the number of different tile filesNis too large, the current cooperative caching algorithms do not cope with such large-scale input data. We further analyze the problem and propose an optimized k-shortest paths (OKSP) algorithm with an upper bound time complexity of(O((K \cdot M + N) \cdot M \cdot \log N))), and suitable for shortest paths with restricted number of edges, whereKis the total number of tiles that allMMEC servers can cache in the collaboration domain. And we prove the OKSP algorithm can compute the caching scheme with the lowest average latency in any case, which means the solution given is the exact solution. The simulation results show that the OKSP algorithm has excellent speed for solving large-scale data and consistently outperforms other caching algorithms in the experiments.
