Jinyao Yan

Prof. Dr. Jinyao Yan

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 January 2019 in Energies
Verified
Journal Article
Open access
PDF file
Ming YanMing Yan
Ming Yan
Chien Aun ChanChien Aun Chan
Chien Aun Chan
AGAndré Gygax
André Gygax
JYJinyao Yan
Jinyao Yan
LCLeith Campbell
Leith Campbell
CLChristopher Leckie
Christopher Leckie
Reducing the energy consumption of Internet services requires knowledge about the specific traffic and energy consumption characteristics, as well as the associated end-to-end topology and the energy consumption of each network segment. Here, we propose a shift from segment-specific to service-specific end-to-end energy-efficiency modeling to align engineering with activity-based accounting principles. We use the model to assess a range of the most popular instant messaging and video play applications to emerging augmented reality and virtual reality applications. We demonstrate how measurements can be conducted and used in service-specific end-to-end energy consumption assessments. Since the energy consumption is dependent on user behavior, we then conduct a sensitivity analysis on different usage patterns and identify the root causes of service-specific energy consumption. Our main findings show that smartphones are the main energy consumers for web browsing and instant messaging applications, whereas the LTE wireless network is the main consumer for heavy data applications such as video play, video chat and virtual reality applications. By using small cell offloading and mobile edge caching, our results show that the energy consumption of popular and emerging applications could potentially be reduced by over 80%.

5 July 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
YZYuan Zhang
Yuan Zhang
LJLei Jiao
Lei Jiao
JYJinyao Yan
Jinyao Yan
XLXiaojun Lin
Xiaojun Lin
To realize mobile Virtual Reality (VR) group gaming services which are currently hampered by the prohibitive bandwidth and the stringent delay requirements, we investigate the problem of provisioning such services using the emerging Mobile Edge Cloudlet (MEC) networks with a distributed content rendering architecture. The underlying dynamic rendering-module placement problem requires to optimize the service’s operational cost and the users’ end-to-end performance, involving multiple intertwined conflicting system objectives which are discrete, nonconvex, and higher-degree polynomial functions, with coupled decisions and arbitrary user dynamics over time. We solve this online placement problem by leveraging Model Predictive Control (MPC) and overcoming the aforementioned challenges over each prediction window. We explore the connection between the placement problem and the minimal s-t cut problem in graph theory, and solve the former via solving a series of instances of the latter. We formally prove the performance guarantee of our approach. We also conduct extensive trace-driven evaluations and demonstrate the superior practical performance of our MPC-based approach compared to the de facto practices and the state-of-the-art alternatives.

13 March 2023 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
YZYuan Zhang
Yuan Zhang
LPLingjun Pu
Lingjun Pu
TLTao Lin
Tao Lin
JYJinyao Yan
Jinyao Yan
Mobile edge computing is a promising framework for mobile virtual reality (VR) game. Although there are several existing studies on the edge assisted mobile VR game system, they lack the consideration of provisioning services with satisfactory QoE to a large number of users. In this paper, we consider the problem of providing QoE-oriented edge assisted mobile VR game as a service to multiple users, with a comprehensive QoE concern of both visual and delay aspects. Due to the unique features of mobile VR game, the problem is formulated into a Mixed Integer Quadratically Constrained Quadratic Programming (MIQCQP) problem. We show that the problem is NP-hard with object placement decision and rendering level selection decision quadratically coupling together. To solve this problem, we propose the Alternating Directions Method of Multipliers (ADMM) algorithm which can iteratively decouple the quadratic terms and reform the problem into the efficiently solvable MIQCQP-1 (i.e., MIQCQP with one constraint) problem. Trace driven simulation shows that our algorithm fits the edge assisted mobile VR game scenario well with fast computation time (at least 4 orders of magnitude less computation time compared to Gurobi solver) and good performance (at least 18% of user visual QoE improvement compared to other mobile VR scheme).

2 March 2019 in Electronics
Verified
Journal Article
Open access
PDF file
GJGeng junjie
Geng junjie
JYJinyao Yan
Jinyao Yan
YZYuan Zhang
Yuan Zhang
Modern data centers aim to offer very high throughput and ultra-low latency to meet the demands of applications such as online intensive services. Traditional TCP/IP stacks cannot meet these requirements due to their high CPU overhead and high-latency. Remote Direct Memory Access (RDMA) is an approach that can be designed to meet this demand. The mainstream transport protocol of RDMA over Ethernet is RoCE (RDMA over Converged Ethernet), which relies on Priority Flow Control (PFC) within the network to enable a lossless network. However, PFC is a coarse-grained protocol which can lead to problems such as congestion spreading, head-of-the-line blocking. A congestion control protocol that can alleviate these problems of PFC is needed. We propose a protocol, called P4QCN for this purpose. P4QCN is a congestion control scheme for RoCE and it is an improved Quantized Congestion Notification (QCN) design based on P4, which is a flow-level, rate-based congestion control mechanism. P4QCN extends the QCN protocol to make it compatible with IP-routed networks based on a framework of P4 and adopts a two-point algorithm architecture which is more effective than the three-point architecture used in QCN and Data Center QCN(DCQCN). Experiments show that our proposed P4QCN algorithm achieves the expected performance in terms of latency and throughput.

17 February 2020 in IEEE Access
Verified
Journal Article
Open access
QJQingmiao Jiang
Qingmiao Jiang
YZYuan Zhang
Yuan Zhang
JYJinyao Yan
Jinyao Yan
Computation offloading is an efficient approach to reduce the energy consumption of a mobile device (MD). In this paper, we consider the multi-user offloading problem for mobile edge computing (MEC) in a multi-server environment. Its aim is to minimize the total energy consumption of MDs. This problem has been proven to be NP-hard. We formulate the problem as a multidimensional multiple knapsack (MMKP) problem with constraints, and propose a neural network architecture called Multi-Pointer networks (Mptr-Net) to solve the problem. We train Mptr-Net based on the reinforcement learning method, and design an algorithm to search for feasible solutions that meet the constraints. The simulation results show that the probability of a Mptr-Net obtaining an optimal solution can exceed 98%, which is approximately 25% more than that of a baseline heuristic algorithm. Additionally, the time needed to solve the problem by our neural network is stable compared with that of a mathematical programming solver named or-tools.

17 October 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YZYuan Zhang
Yuan Zhang
WZWenlong Zhang
Wenlong Zhang
LPLingjun Pu
Lingjun Pu
TLTao Lin
Tao Lin
JYJinyao Yan
Jinyao Yan
Apart from the promising potential, federated learning (FL) faces challenges, such as high communication costs and client heterogeneity. Although numerous works have been proposed to address these issues, they lack a holistic perspective to balance all requirements. Moreover, these solutions have not fully utilized the underlying computation capability and network resources, resulting in suboptimal tradeoffs between communication efficiency and inference accuracy. To overcome these challenges, we propose FDL: a federated distillation (FD) learning framework that combines FD and FL to fully utilize computation and network resources. We theoretically prove the convergence bound of the proposed FDL framework. Furthermore, to minimize the training time while maintaining inference accuracy, we design HAD: a heterogeneity-aware FL/FD selection algorithm that determines the total communication rounds and selects the set of FL and FD nodes in each communication round. The optimality of HAD is also theoretically proved. The FDL framework and HAD algorithm together minimize the training time while satisfying the inference accuracy in a heterogeneous and dynamic environment. Extensive experiments on various learning algorithms and data sets show that the proposed FDL-HAD solution can obtain the optimal selection decision in overwhelmingly less selection time compared with the Gurobi solver and can reduce the overall training time by at least 44.8% compared with FL solutions with the same inference accuracy.