Reliability, timeliness and load reduction at the edge for cloud gaming

被引:1
作者
Franco, Antonio [1 ]
Fitzgerald, Emma [1 ,2 ]
Landfeld, Bjorn [1 ]
Korner, Ulf [1 ]
机构
[1] Warsaw Univ Technol, Inst Telecommun, Nowowiejska 15-19, PL-00665 Warsaw, Poland
[2] Lund Univ, Dept Elect & Informat Technol, Lund, Sweden
来源
2019 IEEE 38TH INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE (IPCCC) | 2019年
关键词
Age of information; Queuing theory; Cloud gaming; Edge computing;
D O I
10.1109/ipccc47392.2019.8958728
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we study reliability, timeliness and load reduction in an hybrid Mobile Edge Computing (MEC)/Cloud game streaming infrastructure. In our scenario, a user plays a game streamed by the producer to their handheld device or User Equipment (UE). The UE communicates user actions to the edge/cloud via the mobile communication infrastructure; the object is to retrieve the latest game status, of which the most important information is the rendered frame. Particularly, we study reliability through replication in a number of MEC-servers, timeliness through Age of Information (AoI) and load reduction by leveraging the X2 interface at the edge, in order to abort useless frame rendering computations. We translate it as a scenario where a sink - representing the UE - is interested in the freshest possible update from distributed nodes. Each node sends updates following a Last Come First Served (LCFS) policy with preemption. We consider two scenarios; the first is n parallel LCFS systems sending updates, and the second adds a feedback loop aimed at decreasing the number of jobs sent per second by the nodes, thus decreasing the load per node. We analyze the number of jobs sent per second and average peak Age of Information at the sink, showing that the second scheme achieves a significantly lower rate of jobs compared with the first, while maintaining constant AoI, thus reducing the load at the edge. We also find that using the feedback loop, we achieve the maximum saving in transmitted jobs per second when the average arrival rate per system is equal to the inverse of the average busy time in every node.
引用
收藏
页数:8
相关论文
共 21 条
  • [1] Abramowitz M., 1988, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, DOI DOI 10.1119/1.15378
  • [2] [Anonymous], 2015 IEEE INT C COMM
  • [3] Brewer C.A., 2013, ColorBrewer
  • [4] A Survey on Cloud Gaming: Future of Computer Games
    Cai, Wei
    Shea, Ryan
    Huan, Chun-Ying
    Chen, Kuan-Ta
    Liu, Jiangchuan
    Leung, Victor C. M.
    Hsu, Cheng-Hsin
    [J]. IEEE ACCESS, 2016, 4 : 7605 - 7620
  • [5] He Q., 2016, 2016 14 INT S MODELI, P1
  • [6] Hsu YP, 2017, IEEE INT SYMP INFO, P561, DOI 10.1109/ISIT.2017.8006590
  • [7] Jeffrey A., 2007, Table of Integrals, Series, and Products, V7th, P247
  • [8] Kadota I, 2016, ANN ALLERTON CONF, P844, DOI 10.1109/ALLERTON.2016.7852321
  • [9] Effect of Message Transmission Path Diversity on Status Age
    Kam, Clement
    Kompella, Sastry
    Nguyen, Gam D.
    Ephremides, Anthony
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (03) : 1360 - 1374
  • [10] Kam C, 2013, IEEE INT SYMP INFO, P66, DOI 10.1109/ISIT.2013.6620189