Haiying Shen

Haiying Shen

Auto-generated profile, based on publicly available information

Haiying Shen

Department of Computer Science, University of Virginia, Charlottesville, VA, USA

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
11 May 2020 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
JGJiechao Gao
Jiechao Gao
HWHaoyu Wang
Haoyu Wang
HSHaiying Shen
Haiying Shen
A large-scale cloud data center needs to provide high service reliability and availability with low failure occurrence probability. However, current large-scale cloud data centers still face high failure rates due to many reasons such as hardware and software failures, which often result in task and job failures. Such failures can severely reduce the reliability of cloud services and also occupy huge amount of resources to recover the service from failures. Therefore, it is important to predict task or job failures before occurrence with high accuracy to avoid unexpected wastage. Many machine learning and deep learning based methods have been proposed for the task or job failure prediction by analyzing past system message logs and identifying the relationship between the data and the failures. In order to further improve the failure prediction accuracy of the previous machine learning and deep learning based methods, in this paper, we propose a failure prediction algorithm based on multi-layer Bidirectional Long Short Term Memory (Bi-LSTM) to identify task and job failures in the cloud. The trace-driven experiments show that our algorithm outperforms other state-of-art prediction methods with 93% accuracy and 87% for task failure and job failures respectively.

15 March 2019 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
ASAnkur Sarker
Ankur Sarker
HSHaiying Shen
Haiying Shen
MRMizanur Rahman
Mizanur Rahman
MCMashrur Chowdhury
Mashrur Chowdhury
KDKakan Dey
Kakan Dey
HNHusnu Saner Narman
Husnu Saner Narman
Information-aware connected and automated vehicles (CAVs) have drawn great attention in recent years due to their potentially significant positive impacts on roadway safety and operational efficiency. In this paper, we conduct an in-depth review of three basic and key interrelated aspects of a CAV: sensing and communication technologies; human factors; and information-aware controller design. First, the different vehicular sensing and communication technologies and their protocol stacks, to provide reliable information to the information-aware CAV controller, are thoroughly discussed. Diverse human factors, such as user comfort, preferences, and reliability, to design the CAV systems for mass adaptation are also discussed. Then, the different layers of a CAV controller (route planning, driving mode execution, and driving model selection) considering human factors and information through connectivity are reviewed. In addition, the critical challenges for the sensing and communication technologies, human factors, and information-aware controller are identified to support the design of a safe and efficient CAV system while considering user acceptance and comfort. Finally, the promising future research directions of these three aspects are discussed to overcome existing challenges to realize a safe and operationally efficient CAV.

3 February 2016 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
LYLei Yu
Lei Yu
LCLiuhua Chen
Liuhua Chen
ZCZhipeng Cai
Zhipeng Cai
HSHaiying Shen
Haiying Shen
YLYi Liang
Yi Liang
YPYi Pan
Yi Pan
Cloud computing offers a cost-effective and elastic computing paradigm that facilitates large scale data storage and analytics. By deploying virtualization technologies in the datacenter, cloud enables efficient resource management and isolation for various big data applications. Since the hotspots (i.e., overloaded machines) can degrade the performance of these applications, virtual machine migration has been utilized to perform load balancing in the datacenters to eliminate hotspots and guarantee Service Level Agreements (SLAs). However, the previous load balancing schemes make migration decisions based on deterministic resource demand estimation and workload characterization, without considering their stochastic properties. By studying real world traces, we show that the resource demand and workload of virtual machines are highly dynamic and bursty, which can cause these schemes to make inefficient migrations for load balancing. To address this problem, in this paper we propose a stochastic load balancing scheme which aims to provide probabilistic guarantee against the resource overloading with virtual machine migration, while minimizing the total migration overhead. Our scheme effectively addresses the prediction of the distribution of resource demand and the multidimensional resource requirements with stochastic characterization. Moreover, as opposed to the previous works that measure the migration cost without considering the network topology, our scheme explicitly takes into account the distance between the source physical machine and the destination physical machine for a virtual machine migration. The trace-driven experiments show that our scheme outperforms the previous schemes in terms of SLA violation and the migration cost.

5 May 2016 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
YLYuhua Lin
Yuhua Lin
HSHaiying Shen
Haiying Shen
With the increasing popularity of Massively Multiplayer Online Game (MMOG) and fast growth of mobile gaming, cloud gaming exhibits great promises over the conventional MMOG gaming model as it frees players from the requirement of hardware and game installation on their local computers. However, as the graphics rendering is offloaded to the cloud, the data transmission between the end-users and the cloud significantly increases the response latency and limits the user coverage, thus preventing cloud gaming to achieve high user Quality of Service (QoS). To solve this problem, previous research suggested deploying more datacenters, but it comes at a prohibitive cost. We propose a lightweight system called CloudFog, which incorporates “fog” consisting of supernodes that are responsible for rendering game videos and streaming them to their nearby players. Fog enables the cloud to be only responsible for the intensive game state computation and sending update information to supernodes, which significantly reduce the traffic hence the latency and bandwidth consumption. To further enhance QoS, we propose the reputation based supernode selection strategy to assign each player with a suitable supernode that can provide satisfactory game video streaming service, the receiver-driven encoding rate adaptation strategy to increase the playback continuity, the social network based server assignment strategy to avoid the communication interaction between servers in a datacenter to reduce latency, and the dynamic supernode provisioning strategy to deal with user churns. Experimental results from PeerSim and PlanetLab show the effectiveness and efficiency of CloudFog and our individual strategies in increasing user coverage, reducing response latency and bandwidth consumption.

18 July 2019 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
TZTao Zhang
Tao Zhang
HLHongyan Li
Hongyan Li
SZShun Zhang
Shun Zhang
JLJiandong LI
Jiandong LI
HSHaiying Shen
Haiying Shen
As the typical delay tolerant networks, the satellite networks possess the intermittent connections, the large-scale time delays and the time-varying topologies. Obviously, such features seriously affect the delivery of mission data with certain requirements on the traffic or latency. To decrease the delivery time, existing relay-based contact graph routing (CGR) method selects the earliest reachable path to forward mission data. However, this method can not guarantee the transmission of a large amount data and wastes the rare contact opportunities. Therefore, in this paper, we focus on the transmission QoS problem of multiple missions over the satellite networks, and design a QoS support routing strategy to achieve multiple flow-maximizing paths with acceptable delivery delays. Specially, with the storage time aggregated graph (STAG), we construct an on-demand mission model to depict both the network dynamic characteristics and the different mission requirements, and then reduce the QoS support problem as a graph-based maximum flow problem. To solve this problem, one STAG-based multiple flow-maximizing routing scheme is proposed to ensure the mission QoS and match the rare network resources, which has low computation complexity. Finally, compared with CGR, simulation results demonstrate the proposed scheme can achieve a higher mission completion rate and resource utilization rate.

9 August 2017 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
HSHaiying Shen
Haiying Shen
LCLiuhua Chen
Liuhua Chen
To provide robust infrastructure as a service (IaaS), clouds currently perform load balancing by migrating virtual machines (VMs) from heavily loaded physical machines (PMs) to lightly loaded PMs. The unique features of clouds pose formidable challenges to achieving effective and efficient load balancing. First, VMs in clouds use different resources (e.g., CPU, bandwidth, memory) to serve a variety of services (e.g., high performance computing, web services, file services), resulting in different over utilized resources in different PMs. Also, the over utilized resources in a PM may vary over time due to the time-varying heterogeneous service requests. Second, there is intensive network communication between VMs. However, previous load balancing methods statically assign equal or predefined weights to different resources, which lead to degraded performance in terms of speed and cost to achieve load balance. Also, they do not strive to minimize the VM communications between PMs. We propose a Resource Intensity Aware Load balancing method (RIAL). For each PM, RIAL dynamically assigns different weights to different resources according to their usage intensity in the PM, which significantly reduces the time and cost to achieve load balance and avoids future load imbalance. It also tries to keep frequently communicating VMs in the same PM to reduce bandwidth cost, and migrates VMs to PMs with minimum VM performance degradation. We also propose an extended version of RIAL with three additional algorithms. First, it optimally determines the weights for considering communication cost and performance degradation due to VM migrations. Second, it has a more strict migration triggering algorithm to avoid unnecessary migrations while still satisfying Service Level Objects (SLOs). Third, it conducts destination PM selection in a decentralized manner to improve scalability. Our extensive trace-driven simulation results and real-world experimental results show the superior performance of RIAL compared to other load balancing methods.