English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In recent network architectures, multi-MEC cooperative caching has beenintroduced to reduce the transmission latency of VR videos, in which MECservers' computing and caching capability are utilized to optimize thetransmission process. However, many solutions that use the computing capabilityof MEC servers ignore the additional arithmetic power consumed by the codecprocess, thus making them infeasible. Besides, the minimum cache unit isusually the entire VR video, which makes caching inefficient.  To address these challenges, we split VR videos into tile files for cachingbased on the current popular network architecture and provide a reliabletransmission mechanism and an effective caching strategy. Since the number ofdifferent tile files N is too large, the current cooperative caching algorithmsdo not cope with such large-scale input data. We further analyze the problemand propose an optimized k-shortest paths (OKSP) algorithm with an upper boundtime complexity of O((K * M + N) * M * logN)), and suitable for shortest pathswith restricted number of edges, where K is the total number of tiles that allM MEC servers can cache in the collaboration domain. And we prove the OKSPalgorithm can compute the caching scheme with the lowest average latency in anycase, which means the solution given is the exact solution. The simulationresults show that the OKSP algorithm has excellent speed for solvinglarge-scale data and consistently outperforms other caching algorithms in theexperiments.

Multi-MEC Cooperation Based VR Video Transmission and Cache using K-Shortest Paths Optimization