Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dynamic Multi-time Scale User Admission and Resource Allocation for Semantic Extraction in MEC Systems (2307.02748v1)

Published 6 Jul 2023 in cs.NI and eess.SP

Abstract: This paper investigates the semantic extraction task-oriented dynamic multi-time scale user admission and resourceallocation in mobile edge computing (MEC) systems. Amid prevalence artifi cial intelligence applications in various industries,the offloading of semantic extraction tasks which are mainlycomposed of convolutional neural networks of computer vision isa great challenge for communication bandwidth and computing capacity allocation in MEC systems. Considering the stochasticnature of the semantic extraction tasks, we formulate a stochastic optimization problem by modeling it as the dynamic arrival of tasks in the temporal domain. We jointly optimize the system revenue and cost which are represented as user admission in the long term and resource allocation in the short term respectively. To handle the proposed stochastic optimization problem, we decompose it into short-time-scale subproblems and a long-time-scale subproblem by using the Lyapunov optimization technique. After that, the short-time-scale optimization variables of resource allocation, including user association, bandwidth allocation, and computing capacity allocation are obtained in closed form. The user admission optimization on long-time scales is solved by a heuristic iteration method. Then, the multi-time scale user admission and resource allocation algorithm is proposed for dynamic semantic extraction task computing in MEC systems. Simulation results demonstrate that, compared with the benchmarks, the proposed algorithm improves the performance of user admission and resource allocation efficiently and achieves a flexible trade-off between system revenue and cost at multi-time scales and considering semantic extraction tasks.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. Y. Guo, F. R. Yu, J. An, K. Yang, C. Yu and V. C. M. Leung, “Adaptive bitrate streaming in wireless networks with transcoding at network edge using deep reinforcement learning,” IEEE Trans. Veh. Technol., vol. 69, no. 4, pp. 3879-3892, Apr. 2020.
  2. S. Jošilo and G. Dán, “Computation Offloading scheduling for periodic tasks in mobile edge computing,” IEEE Trans. Netw., vol. 28, no. 2, pp. 667-680, Apr. 2020.
  3. L. Lei, C. Chen, Q. Pei, S. Maharjan and Y. Zhang, “Vehicular edge computing and networking: A survey.” Mobile Netw. Appl., vol.26, no. 3, pp. 1145-1168, Jun. 2021.
  4. J. Du, L. Zhao, J. Feng, and X. Chu, “Computation offloading and resource allocation in mixed fog/cloud computing systems with min-max fairness guarantee,” IEEE Trans. Commun., vol. 66, no. 4, pp. 1594-1608, Apr. 2018.
  5. J. Feng, Q. Pei, F. R. Yu, X. Chu, J. Du, and L. Zhu, “Dynamic network slicing and resource allocation in mobile edge computing systems,” IEEE Trans. Veh. Technol., vol. 69, no. 7, pp. 7863-7878, Jul. 2020.
  6. S. Zarandi and H. Tabassum, “Delay minimization in sliced multi-cell mobile edge computing (MEC) systems,” IEEE Commun. Lett., vol. 25, no. 6, pp. 1964-1968, Jun. 2021.
  7. G. Faraci, C. Grasso, and G. Schembra, “Design of a 5G network slice extension with MEC UAVs managed with reinforcement learning,” IEEE J. Sel. Areas Commun., vol. 16, no. 7, pp. 2356-2371, Oct. 2020.
  8. J. Y. Hwang, L. Nkenyereye and N. M. Sung, “IoT service slicing and task offloading for edge computing,” IEEE Internet Things J., vol. 44, no. 4, pp. 1-14, Apr. 2020.
  9. X. Cao, J. Xu and R. Zhang, “Mobile edge computing for cellular-connected UAV: Computation offloading and trajectory optimization,” IEEE 19th International Workshop Signal Process. Adv. Wireless Commun. (SPAWC), pp. 1-5, 2018.
  10. M. A. Hossain, and N. Ansari, “Energy aware latency minimization for network slicing enabled edge computing,” IEEE Trans. Green Commun. Netw., pp. 1-10, May. 2021.
  11. H. Xie, Z. Qin, G. Y. Li, and B. H. Juang. “Deep learning enabled semantic communication systems,” IEEE Trans. Signal Process., vol. 69, pp. 2663-2675, Apr. 2021.
  12. H. Xie and Z. Qin, “A lite distributed semantic communication system for internet of things,” IEEE J. Sel. Areas Commun., vol. 39, no. 1, pp. 142-153, Nov. 2020.
  13. H. Qi, E. R. Sparks and A. Talwalkar, “PALEO: A performance model for deep neural networks,” International Conf. Learn. Representations (ICLR), 2016.
  14. D. Justus, J. Brennan, S. Bonner and A. S. McGough, “Predicting the computational cost of deep learning models,” IEEE International Conf. Big Data, pp. 3873-3882, Dec. 2018.
  15. D. Bienstock, G. Muñoz and S. Pokutta, “Principled deep neural network training through linear programming,” arXiv preprint arXiv:1810.03218, Oct. 2020.
  16. M. Bianchini and F. Scarselli, “On the complexity of neural network classifiers: A comparison between shallow and deep architectures,” IEEE Tran. Neural Netw. Learn. Syst., vol. 25, no. 8, pp. 1553-1565, Jan. 2014.
  17. F. Guo, F. R. Yu, H. Zhang, H. Ji, M. Liu, and V. C. M. Leung, “Adaptive resource allocation in future wireless networks with blockchain and mobile edge computing,” IEEE Trans. Wireless Commun., vol. 19, no. 3, pp. 1689-1703, Mar. 2020.
  18. Y. Xiao and M. Krunz, “Dynamic network slicing for scalable fog computing systems with energy harvesting,” IEEE J. Sel. Areas Commun., vol. 36, no. 12, pp. 2640-2654, Dec. 2018.
  19. N. Van Huynh, D. Thai Hoang, D. N. Nguyen, and E. Dutkiewicz, “Optimal and fast real-time resource slicing with deep dueling neural networks,” IEEE J. Sel. Areas Commun., vol. 37, no. 6, pp. 1455-1470, Jun. 2019.
  20. G. Sun, H. Al-Ward, G. O. Boateng and G. Liu, “Autonomous cache resource slicing and content placement at virtualized mobile edge network,” IEEE Access, vol. 7, pp. 84727-84743, Jun. 2019.
  21. M. J. Neely, “Stochastic network optimization with application to communication and queueing systems,” Synth. Lect. Commun.. San Rafael, CA, USA: Morgan & Claypool Publishers, 2010.
  22. S. Boyd, “Convex optimization problems,” Lecture slides and notes. 2008. [Online]. Available: http://web.stanford.edu/class/ee364a/lectures. html.
  23. M. Grant, S. Boyd, and Y. Ye, “CVX: MATLAB software for disciplined convex programming,” 2014. [Online]. Available: http://cvxr.com/cvx/.
  24. S. Boyd, “Interior-point methods,” Lecture slides and notes. 2008. [Online]. Available: http://web.stanford.edu/class/ee364a/lectures.html.
  25. 3GPP, “Technical specification group radio access network; Small cell enhancements for E-UTRA and E-UTRAN Physical layer aspects,” TR 36.872, Release 15, pp. 9, 76-77, Dec. 2013.
  26. 3GPP, “Technical specification group radio access network; Evolved universal terrestrial radio access (E-UTRA); Further advancements for E-UTRA physical layer aspects,” TR 36.814, Release 9, pp. 94-96, Mar. 2017.
  27. J. Li, Q. L. Dong and M. Liao, “Study on the scenarios and future development of URLLC,” Mob. Commun., vol. 44, no. 2, pp. 20-24, Dec. 2020.
  28. S. Zarandi and H. Tabassum, “Delay minimization in sliced multi-cell mobile edge computing (MEC) systems,” IEEE Commun. Lett., vol. 25, no. 6, pp. 1964-1968, Jan. 2021.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Yuanpeng Zheng (4 papers)
  2. Tiankui Zhang (14 papers)
  3. Jonathan Loo (6 papers)
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now