Online Caching Algorithm for VR Video Streaming in Mobile Edge Caching System

preprint OA: closed
Full text JSON View at publisher
AI-generated summary by claude@2026-07, 2026-07-16

This paper jointly optimizes prediction, caching, computing, and transmission for VR video streaming in edge systems and proposes a VIE caching algorithm that improves content hit rate and reduces delay, ultimately enhancing user quality of experience.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

AI-generated deep summary by claude@2026-07, 2026-07-16 · read from full text

The paper studies optimization of transmission for VR video streaming in a mobile edge caching end-edge-cloud system by jointly optimizing four stages: prediction, caching, computing, and transmission to maximize user quality of experience. Using an online caching algorithm called VIE designed for unknown future request content, the authors report improved content hit rate and reduced durations for prediction, computing, and transmission, with the VIE caching approach analytically shown to have lower delay than other algorithms. The work additionally evaluates performance by simulating scenarios under arbitrary resource allocation, varying overlap and completion rate, and verifying in a real scenario via comparisons with several other caching algorithms, where simulation results indicate improved QoE. The paper explicitly frames itself as a preprint and does not provide peer-review details within the provided text. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

The transmission optimization of VR video streaming can improve the quality of user experience, which includes content prediction optimization and caching strategy optimization. Existing work either focuses on content prediction or on caching strategy. However, in the end-edge-cloud system, prediction and caching should be considered together. In this paper, we jointly optimize the four stages of prediction, caching, computing and transmission in mobile edge caching system, aimed to maximize the user's quality of experience. In terms of caching strategy, we design a caching algorithm VIE with unknown future request content, which can efficiently improve the content hit rate, as well as the durations for prediction, computing and transmission. The VIE caching algorithm is proved to be ahead of other algorithms in terms of delay. We optimize the four stages under arbitrary resource allocation and simulate the proposed caching algorithm according to the degree of overlap, as well as completion rate. Finally, under the real scenario, the proposed caching algorithm is verified by comparing with several other caching algorithms, simulation results show that the user's QoE is improved under the proposed caching algorithm.
Full text 11,698 characters · extracted from preprint-html · click to expand
Online Caching Algorithm for VR Video Streaming in Mobile Edge Caching System | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Online Caching Algorithm for VR Video Streaming in Mobile Edge Caching System Qiuming Liu, Hao Chen, Zihui Li, Yaxin Bai, Dong Wu, Yang Zhou This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3166387/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 26 Jan, 2024 Read the published version in Mobile Networks and Applications → Version 1 posted You are reading this latest preprint version Abstract The transmission optimization of VR video streaming can improve the quality of user experience, which includes content prediction optimization and caching strategy optimization. Existing work either focuses on content prediction or on caching strategy. However, in the end-edge-cloud system, prediction and caching should be considered together. In this paper, we jointly optimize the four stages of prediction, caching, computing and transmission in mobile edge caching system, aimed to maximize the user's quality of experience. In terms of caching strategy, we design a caching algorithm VIE with unknown future request content, which can efficiently improve the content hit rate, as well as the durations for prediction, computing and transmission. The VIE caching algorithm is proved to be ahead of other algorithms in terms of delay. We optimize the four stages under arbitrary resource allocation and simulate the proposed caching algorithm according to the degree of overlap, as well as completion rate. Finally, under the real scenario, the proposed caching algorithm is verified by comparing with several other caching algorithms, simulation results show that the user's QoE is improved under the proposed caching algorithm. VR video streaming Joint optimization Caching algorithm Quality of experience Edge computing Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 26 Jan, 2024 Read the published version in Mobile Networks and Applications → Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-3166387","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":218319248,"identity":"e59b2d5a-e021-4cb1-acf0-ba63f2c7a696","order_by":0,"name":"Qiuming Liu","email":"","orcid":"","institution":"Jiangxi University of Science and Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Qiuming","middleName":"","lastName":"Liu","suffix":""},{"id":218319249,"identity":"59769e67-7359-42f0-84cf-5ca5ff390ed9","order_by":1,"name":"Hao Chen","email":"","orcid":"","institution":"Jiangxi University of Science and Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Hao","middleName":"","lastName":"Chen","suffix":""},{"id":218319250,"identity":"3527db02-ef96-426f-9fea-23eae62af47c","order_by":2,"name":"Zihui Li","email":"","orcid":"","institution":"Jiangxi University of Science and Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Zihui","middleName":"","lastName":"Li","suffix":""},{"id":218319251,"identity":"1e243bd9-9e40-42b3-9277-3884da2f974a","order_by":3,"name":"Yaxin Bai","email":"","orcid":"","institution":"Jiangxi University of Science and Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Yaxin","middleName":"","lastName":"Bai","suffix":""},{"id":218319252,"identity":"ce2a276e-0b12-43f3-9596-86d6331fd122","order_by":4,"name":"Dong Wu","email":"","orcid":"","institution":"State Grid Jiangxi Electric Power Co","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Dong","middleName":"","lastName":"Wu","suffix":""},{"id":218319253,"identity":"801b3505-4df9-4ba7-9cf7-2572215fcd1f","order_by":5,"name":"Yang Zhou","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAvklEQVRIiWNgGAWjYBACef7m4z8+VEjY8ROtxXDGsQTJGWcskiUbiNZzIMdAmretgnHDAWJ1MDacMTDgYZNgNj6evIHhR8U2wlrYmdsKEiR4JPjMzjwrYOw5c5sYWw5vOGAgIcFsdiPHgJmxjQgtDAcSDBsSDCQYN88gXkuKMVCbBOMGCWK1AAM5jbHhgESyBNAvB4nyCzAqjzH//Vdnx9+evPHBjwpiHIYACQYHSFIP1kKqjlEwCkbBKBghAADEvD4ek6vwGgAAAABJRU5ErkJggg==","orcid":"","institution":"State Grid Jiangxi Electric Power Co","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Yang","middleName":"","lastName":"Zhou","suffix":""}],"badges":[],"createdAt":"2023-07-13 08:46:40","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-3166387/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-3166387/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s11036-024-02291-2","type":"published","date":"2024-01-26T15:17:28+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":50314264,"identity":"c0c121ba-03bc-4857-8580-c84c8ddd9b8a","added_by":"auto","created_at":"2024-01-29 15:29:54","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":695743,"visible":true,"origin":"","legend":"","description":"","filename":"snarticle.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3166387/v1_covered_feca23e0-b5f0-4797-b297-e24b6e5cbd56.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Online Caching Algorithm for VR Video Streaming in Mobile Edge Caching System","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"VR video streaming, Joint optimization, Caching algorithm, Quality of experience, Edge computing","lastPublishedDoi":"10.21203/rs.3.rs-3166387/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3166387/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"The transmission optimization of VR video streaming can improve the quality of user experience, which includes content prediction optimization and caching strategy optimization. Existing work either focuses on content prediction or on caching strategy. However, in the end-edge-cloud system, prediction and caching should be considered together. In this paper, we jointly optimize the four stages of prediction, caching, computing and transmission in mobile edge caching system, aimed to maximize the user's quality of experience. In terms of caching strategy, we design a caching algorithm VIE with unknown future request content, which can efficiently improve the content hit rate, as well as the durations for prediction, computing and transmission. The VIE caching algorithm is proved to be ahead of other algorithms in terms of delay. We optimize the four stages under arbitrary resource allocation and simulate the proposed caching algorithm according to the degree of overlap, as well as completion rate. Finally, under the real scenario, the proposed caching algorithm is verified by comparing with several other caching algorithms, simulation results show that the user's QoE is improved under the proposed caching algorithm.","manuscriptTitle":"Online Caching Algorithm for VR Video Streaming in Mobile Edge Caching System","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2023-07-18 02:05:11","doi":"10.21203/rs.3.rs-3166387/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"454041a8-3054-4901-8361-d160b6d62e4a","owner":[],"postedDate":"July 18th, 2023","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-01-29T15:27:44+00:00","versionOfRecord":{"articleIdentity":"rs-3166387","link":"https://doi.org/10.1007/s11036-024-02291-2","journal":{"identity":"mobile-networks-and-applications","isVorOnly":false,"title":"Mobile Networks and Applications"},"publishedOn":"2024-01-26 15:17:28","publishedOnDateReadable":"January 26th, 2024"},"versionCreatedAt":"2023-07-18 02:05:11","video":"","vorDoi":"10.1007/s11036-024-02291-2","vorDoiUrl":"https://doi.org/10.1007/s11036-024-02291-2","workflowStages":[]},"version":"v1","identity":"rs-3166387","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3166387","identity":"rs-3166387","version":["v1"]},"buildId":"cBFmMYwuxLRRLfASyISRj","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00