TY - JOUR
T1 - Two-Timescale Optimization for E2E Network Slicing-Aided Cloud-Edge Collaborative Networks
AU - Wang, Yunfeng
AU - Zhao, Liqiang
AU - Chu, Xiaoli
AU - Song, Shenghui
AU - Deng, Yansha
AU - Nallanathan, Arumugam
AU - Zhou, Guorong
N1 - Publisher Copyright:
© 1967-2012 IEEE.
PY - 2025
Y1 - 2025
N2 - To leverage the synergy between cloud computing (CC) and edge computing (EC) to support various services while reducing the CC/EC switching overhead, the two-timescale utility maximization problem for an end-to-end network slicing-aided cloud-edge collaborative network (E2E-CECN) is formulated covering both the high throughput and low delay service requirements. To solve the utility maximization problem while dynamically adjusting the weights of the E2E-CECN utility to accommodate the variation of users' service requests, we proposed a reward comparison double deep Q network algorithm to optimize the large timescale joint virtual basestation activation and CC-EC scheduling, and a reward comparison deep deterministic policy gradient algorithm to optimize the small timescale allocation of backhaul link capacity (BLC), CC/EC capability and transmission power. Numerical results show that both the high-throughput and low-delay service requirements can be satisfied simultaneously under the reasonable BLC usage and power consumption.
AB - To leverage the synergy between cloud computing (CC) and edge computing (EC) to support various services while reducing the CC/EC switching overhead, the two-timescale utility maximization problem for an end-to-end network slicing-aided cloud-edge collaborative network (E2E-CECN) is formulated covering both the high throughput and low delay service requirements. To solve the utility maximization problem while dynamically adjusting the weights of the E2E-CECN utility to accommodate the variation of users' service requests, we proposed a reward comparison double deep Q network algorithm to optimize the large timescale joint virtual basestation activation and CC-EC scheduling, and a reward comparison deep deterministic policy gradient algorithm to optimize the small timescale allocation of backhaul link capacity (BLC), CC/EC capability and transmission power. Numerical results show that both the high-throughput and low-delay service requirements can be satisfied simultaneously under the reasonable BLC usage and power consumption.
KW - Cloud-edge collaborative network
KW - cloud computing
KW - edge computing
KW - end-to-end network slicing
KW - two-timescale
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:001513230700009
UR - https://openalex.org/W4407639003
UR - https://www.scopus.com/pages/publications/85218718546
U2 - 10.1109/TVT.2025.3542407
DO - 10.1109/TVT.2025.3542407
M3 - Journal Article
SN - 0018-9545
VL - 74
SP - 9777
EP - 9789
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 6
ER -