Abstract

Virtual Reality (VR) is becoming an important use case for 5G wireless networks, and Mobile Edge Computing (MEC) servers are being explored as a way to reduce VR video latency. To address the limited cache space of a single MEC server, this paper proposes dividing geographically close MEC servers into collaborative domains. A new VR video transmission architecture is designed after analyzing video compression mechanisms.The proposed architecture splits the VR video into equal-sized tile files to simplify the cache problem and improve caching efficiency. However, the large number of different tile files presents a challenge. To address this, the paper proposes an optimized k-shortest paths (OKSP) algorithm with a time complexity of O((K⋅M+N)⋅M⋅logN), where K is the number of tiles that all M MEC servers can cache in the collaboration domain and N is the number of tile files. For extremely large-scale data cases, a greedy-based approximation algorithm is also proposed. The numerical results demonstrate the OKSP algorithm’s excellent performance in solving large-scale data, outperforming other caching algorithms in experiments.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call