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 Zhu Xiaorong;Jing Chuanfang;Shi Jindou;Wang Yong;Ho Chifong

作者机构：College of Telecommunications and Information EngineeringNanjing University of Posts and TelecommunicationNanjing 210003China School of Electrical EngineeringNanjing Vocational University of Industry TechnologyNanjing 210003China Ultra Intelligent Technology Company LimitedMacaoChina 

出 版 物：《The Journal of China Universities of Posts and Telecommunications》 (中国邮电高校学报（英文版）)

年 卷 期：2022年第29卷第1期

页      面：81-92页

核心收录：

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 

基　　金：supported by Natural Science Foundation of China (61871237, 92067101) Program to Cultivate Middleaged and Young Science Leaders of Universities of Jiangsu Province and Key R&D Plan of Jiangsu Province (BE2021013-3) the Youth Foundation of Nanjing Institute of Industry Technology (YK18 - 02012) 

主　　题：delay mobile edge computing random routing stochastic network calculus 

摘      要：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).