Journal article · 2026 · Open access
Reinforcement Learning-Based Resource Allocation and Request Routing Optimization Algorithm for Edge AIGC Services
Symmetry, 18(10), 1690 · Published 12 October 2026 · DOI 10.3390/sym18101690
In brief
“Reinforcement Learning-Based Resource Allocation and Request Routing Optimization Algorithm for Edge AIGC Services” is a 2026 journal article by Qianyu Cao and 4 co-authors, published in Symmetry. OpenAlex counts 0 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at Symmetry.
- Citations
- 0
- References
- 22
- Authors
- 5
Abstract
With the explosive growth of artificial intelligence generated content (AIGC) applications, deploying lightweight tiny neural networks (TNNs) at the edge to mitigate the high latency and cost of large cloud models has become an important trend in mobile computing. However, resource heterogeneity in edge environments, the spatiotemporal randomness of user requests, and the complex association problem arising from overlapping base-station coverage challenge traditional static resource allocation methods in meeting multi-dimensional quality of service (QoS) requirements. Existing research often lacks a unified trade-off among model accuracy, service cost, and response latency. To address these challenges, this paper formulates a joint model deployment and request routing multi-objective optimization problem. To handle the high-dimensional, mixed decision space, a dual-timescale decoupled optimization strategy is designed: on the macro timescale, a greedy algorithm based on request statistics periodically performs model deployment to adapt to the long-term traffic distribution and maximize local cache utilization; on the micro timescale, an improved deep deterministic policy gradient (DDPG) algorithm performs real-time dynamic request routing, achieving a multi-dimensional performance trade-off through online environment learning. Simulation experiments based on the real-world EUA trace and calibrated synthetic workloads show that the proposed scheme improves the comprehensive objective and reduces the service cost compared with traditional heuristics and state-of-the-art deep reinforcement learning baselines (TD3 and SAC), while significantly reducing the response latency. Ablation, robustness, and sensitivity studies further confirm the contribution of each component and the stability of the method. The algorithm demonstrates robustness and scalability under high concurrency, indicating its potential for future large-scale edge AIGC services.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Cao, Q., Xu, C., Zhang, L., Tang, B., & He, W. (2026). Reinforcement Learning-Based Resource Allocation and Request Routing Optimization Algorithm for Edge AIGC Services. Symmetry, 18(10), 1690. https://doi.org/10.3390/sym18101690
MLA 9
Cao, Qianyu, et al. “Reinforcement Learning-Based Resource Allocation and Request Routing Optimization Algorithm for Edge AIGC Services.” Symmetry, vol. 18, no. 10, 2026, p. 1690. https://doi.org/10.3390/sym18101690.
Chicago
Cao, Qianyu, Chan Xu, Li Zhang, Bing Tang, and Wenhui He. 2026. “Reinforcement Learning-Based Resource Allocation and Request Routing Optimization Algorithm for Edge AIGC Services.” Symmetry 18 (10): 1690. https://doi.org/10.3390/sym18101690.
Harvard
Cao, Q. et al. (2026) ‘Reinforcement Learning-Based Resource Allocation and Request Routing Optimization Algorithm for Edge AIGC Services’, Symmetry, 18(10), p. 1690. doi:10.3390/sym18101690.
IEEE
Q. Cao, C. Xu, L. Zhang, B. Tang, and W. He, “Reinforcement Learning-Based Resource Allocation and Request Routing Optimization Algorithm for Edge AIGC Services,” Symmetry, vol. 18, no. 10, p. 1690, 2026, doi: 10.3390/sym18101690.
BibTeX
@article{cao2026reinforcement,
title = {{Reinforcement Learning-Based Resource Allocation and Request Routing Optimization Algorithm for Edge AIGC Services}},
author = {Cao, Qianyu and Xu, Chan and Zhang, Li and Tang, Bing and He, Wenhui},
journal = {Symmetry},
year = {2026},
volume = {18},
number = {10},
pages = {1690},
doi = {10.3390/sym18101690},
url = {https://doi.org/10.3390/sym18101690}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- AI-generated content
- edge computing
- resource allocation
- request routing
- model deployment
- deep deterministic policy gradient
- multi-objective optimization
- quality of service
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Cao, Q., Xu, C., Zhang, L., Tang, B., & He, W. (2026). Reinforcement Learning-Based Resource Allocation and Request Routing Optimization Algorithm for Edge AIGC Services. Symmetry, 18(10), 1690. https://doi.org/10.3390/sym18101690
How many times has this paper been cited?
0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Symmetry: sign in and open the full text from this page.
Who wrote this paper?
Qianyu Cao, Chan Xu, Li Zhang, Bing Tang, Wenhui He.
What is the DOI of this paper?
10.3390/sym18101690, permanently at https://doi.org/10.3390/sym18101690. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.