Huaiying Sun

Huaiying Sun


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
19 July 2019 in Peer-to-Peer Networking and Applications
Verified
Journal Article
Closed access
PDF file
HSHuaiying Sun
Huaiying Sun
HYHuiqun Yu
Huiqun Yu
GFGuisheng Fan
Guisheng Fan
LCliqiong chen
liqiong chen

3 March 2020 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
HSHuaiying Sun
Huaiying Sun
HYHuiqun Yu
Huiqun Yu
GFGuisheng Fan
Guisheng Fan
Fog computing as an extension of the cloud based infrastructure, provides a better computing platform than cloud computing for mobile computing, Internet of Things, etc. One of the problems is how to make full use of the resources of the fog so that more requests of applications can be executed on the edge, reducing the pressure on the network and ensuring the time requirement of tasks. The high mobility of fog nodes also has a great impact on the task completion time and user satisfaction. Thus, a general IoT-Fog-Cloud computing architecture with a contract-based resource sharing mechanism is proposed in this paper. The contract establishment problem of resource sharing mechanism among fog clusters is modeled as a sealed-bid bilateral auction in order to take full advantage of the fog resources and ensure that more tasks could be executed on the fog. Then, we propose a scheduling method based on functional domain construction to mitigate the influence of mobility of fog nodes. It includes the selection of critical fog nodes and the construction of fog function domains based on spectral clustering. The selection of critical fog nodes is used to find the best fog nodes in each fog cluster with respect to the betweenness centrality, computing performance and communication delay to the IoT nodes. The critical nodes are responsible for building the functional domains of the remaining fog nodes in each fog cluster. Functional domain construction is used to determine the set of fog nodes contained in the corresponding functional domain. Finally, through extensive simulation experiments, the performance difference between the proposed method and the other four methods in terms of average service time, average utilization of fog nodes, success rate of tasks, average WLAN delay and the average cost of successful tasks are evaluated. Results show that our method generally outperforms the other four methods in these metrics.

28 February 2020 in IEEE Access
Verified
Journal Article
Open access
HSHuaiying Sun
Huaiying Sun
HYHuiqun Yu
Huiqun Yu
GFGuisheng Fan
Guisheng Fan
LCLiqiong Chen
Liqiong Chen
The geographically dispersed resources and ever-changing context incur unique heterogeneity, potential fragility, and vulnerability of an edge-cloud system. Thus, the reliability guarantee of services in the edge-cloud is critical. This paper firstly proposes a QoS-aware scheduling model with fault-tolerance in the edge-cloud, which extends the traditional primary-backup (PB) fault-tolerant model to improve the service reliability in the edge-cloud with the time constraints of tasks being satisfied. Then, a QoS-aware fault-tolerant scheduling algorithm including primary copy placement, backup copy placement and an adjustment mechanism is proposed to improve the QoS levels of tasks in the edge-cloud. The primary copy placement is to guarantee the earlier execution of the primary copy of a task to better satisfy the time requirements of tasks. The backup copy placement is to ensure the later execution of the backup copy of a task, reducing the overlapping of the two copies of a task, realizing the improvement of the resource utilization in the edge-cloud under the condition of redundancy and deadline requirements of tasks. The adjustment mechanism is triggered to rearrange the task copies of a computing node of the edge-cloud after the deallocation of a backup copy on the node, to better assist the goal-achievement of the primary and backup copy scheduling. Finally, through extensive simulation experiments with the real world taxi traces, the performance difference between the proposed method and the other four methods are evaluated. Results show that the proposed method generally outperforms the other methods in terms of guarantee ratio, average QoS level, and reliability cost.

1 September 2019 in International Journal of Software Engineering and Knowledge Engineering
Verified
Journal Article
Closed access
PDF file
KSKai Shi
Kai Shi
HYHuiqun Yu
Huiqun Yu
GFGuisheng Fan
Guisheng Fan
JGJianmei Guo
Jianmei Guo
LCliqiong chen
liqiong chen
HSHuaiying Sun
Huaiying Sun

19 February 2023
Verified
Book Chapter
Closed access
PDF file
BNBehkish Nassirzadeh
Behkish Nassirzadeh
HSHuaiying Sun
Huaiying Sun
SBSebastian Banescu
Sebastian Banescu
VGVijay Ganesh
Vijay Ganesh

11 October 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
HSHuaiying Sun
Huaiying Sun
HYHuiqun Yu
Huiqun Yu
GFGuisheng Fan
Guisheng Fan
LCliqiong chen
liqiong chen
ZLZheng Liu
Zheng Liu
Most of the emerging applications such as the Deep Neural Networks (DNN) based smart Internet of Things (IoT) systems need intensive and high-performance computing, which is contradictory to the limited resources of IoT/terminal devices. It is a big challenge to offload all tasks to the cloud due to the bandwidth limitation, processing overhead, and transmission costs. Edge computing as an extension of cloud computing that can provide abundant computing resources near the edge of the network and thereby can potentially improve the QoS of applications. However, offloading tasks to the edge servers is liable to external security threats. How to balance the response time and the security of application services is a big challenge for realizing good application service placement. This paper proposes a time and security efficient task scheduling framework in the edge-cloud environment. The corresponding computing models are established, such as the security-related model, time model, and the risk probability model. Then, a time-guaranteed and security-aware task scheduling algorithm is proposed including the domain construction, the security-aware task ranking, and the task dispatching. Extensive simulation experiments have been conducted. Results show that the proposed method has better performance than the other four compared methods in general.