The Journal of China Universities of Posts and Telecommunications ›› 2022, Vol. 29 ›› Issue (1): 81-92.doi: 10.19682/j.cnki.1005-8885.2022.2009

• Mobile Communications • Previous Articles     Next Articles

Data-flow in mobile edge computing networks: end-to-end performance analysis using stochastic network calculus

Zhu Xiaorong, Jing Chuanfang, Shi Jindou, Wang Yong, Ho Chifong   

  1. 1. College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunication, Nanjing 210003, China 2. School of Electrical Engineering, Nanjing Vocational University of Industry Technology, Nanjing 210023, China 3. RD Director, Ultra Intelligent Technology Company Limited, Macau, China
  • Received:2021-05-31 Revised:2021-09-16 Accepted:2021-12-13 Online:2022-02-26 Published:2022-02-28
  • Contact: Corresponding author: Zhu Xiaorong
  • Supported by:
    This work was supported by Natural Science Foundation of China (61871237, 92067101), Program to Cultivate Middle-aged and Young Science Leaders of Universities of Jiangsu Province and Key R&D Plan of Jiangsu Province (BE2021013-3), and the Youth Foundation of Nanjing Institute of Industry Technology (YK18-02012).

Abstract: Mobile edge computing (MEC) networks can provide a variety of services for different applications. End-to-end performance analysis of these services serves as a benchmark for the efficient planning of network resource allocation and routing strategies. In this paper, a performance analysis framework is proposed for the end-to-end data-flows in MEC networks based on stochastic network calculus (SNC). Due to the random nature of routing in MEC networks, probability parameters are introduced in the proposed analysis model to characterize this randomness into the derived expressions. Taking actual communication scenarios into consideration, the end-to-end performance of three network data-flows is analyzed, namely, voice over Internet protocol (VoIP), video, and file transfer protocol (FTP). These network data-flows adopt the preemptive priority scheduling scheme. Based on the arrival processes of these three data-flows, the effect of interference on their performances and the service capacity of each node in the MEC networks, closed-form expressions are derived for showing the relationship between delay, backlog upper bounds, and violation probability of the data-flows. Analytical and simulation results show that delay and backlog performances of the data-flows are influenced by the number of hops in the network and the random probability parameters of interference-flow (IF).

Key words: delay, mobile edge computing, random routing, stochastic network calculus

CLC Number: