Hui-Ching Hsieh

Dr. Hui-Ching Hsieh


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
29 March 2019 in Journal of Grid Computing
Verified
Journal Article
Closed access
PDF file
HHHui-Ching Hsieh
Hui-Ching Hsieh
MCMao-Lun Chiang
Mao-Lun Chiang

8 May 2020 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
Chin-Ling ChenChin-Ling Chen
Chin-Ling Chen
MCMao-Lun Chiang
Mao-Lun Chiang
HHHui-Ching Hsieh
Hui-Ching Hsieh
CLChing-Cheng Liu
Ching-Cheng Liu
YDYong-Yuan Deng
Yong-Yuan Deng

16 August 2018 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MCMao-Lun Chiang
Mao-Lun Chiang
Yung-Fa HuangYung-Fa Huang
Yung-Fa Huang
HHHui-Ching Hsieh
Hui-Ching Hsieh
WTWen-Chung Tsai
Wen-Chung Tsai
Due to the rapid development and popularity of the Internet, cloud computing has become an indispensable application service. However, how to assign various tasks to the appropriate service nodes is an important issue. Based on the reason above, an efficient scheduling algorithm is necessary to enhance the performance of the system. Therefore, a Three-Layer Cloud Dispatching (TLCD) architecture is proposed to enhance the performance of task scheduling. In the first layer, the tasks need to be distinguished into different types by their characters. Subsequently, the Cluster Selection Algorithm is proposed to dispatch the tasks to appropriate service clusters in the second layer. Besides this, a new scheduling algorithm is proposed in the third layer to dispatch the task to a suitable server in a server cluster to enhance the scheduling efficiency. Basically, the best task completion time can be obtained in our TLCD architecture. Furthermore, load balancing and reliability can be achieved under a cloud computing network environment.

19 April 2021 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
HHHui-Ching Hsieh
Hui-Ching Hsieh
MCMao-Lun Chiang
Mao-Lun Chiang
TCTzu-Yang Chang
Tzu-Yang Chang

23 July 2018 in IEEE Access
Verified
Journal Article
Open access
MCMao-Lun Chiang
Mao-Lun Chiang
HHHui-Ching Hsieh
Hui-Ching Hsieh
CWChun-Wei Wang
Chun-Wei Wang
With the rapid development of the Internet technologies, network architectures have been improved continuously. A novel network topology called Software-Defined Network (SDN) has been proposed to enhance the performance of network. Basically, the goals of constructing the SDN network are to achieve faster service deployment, greater flexibility in managing the network and provisioning while reducing operational costs. So far, most researches have been done to ensure the consistency and reliability on control plane of SDN. However, the consistency and reliability on the data plane of SDN has been neglected. Based on the reasons above, the fault tolerance issue needs to be studied to increase the consistency and reliability of the SDN network. One of the most important problems of fault tolerance issue is the Byzantine Agreement (BA) problem. The goal of Byzantine Agreement problem is to make the fault-free processors achieving an agreement to ensure the system working normally even if the faults persist. Unfortunately, the traditional solution is not suitable for the SDN network. Hence, the BA problem should be revised under the SDN network. In this paper, the new kind of failure type called path fault is discussed to adapt to real world. It is because that the routing path between source and destination switch may have faulty influence. Subsequently, a Path-based Agreement Protocol (PAP) is proposed to solve the BA problem to help all the data be transmitted to the destination even when there are some faulty switches exist in the SDN network. Here, the proposed protocol only requires the minimum number of rounds of message exchange and can tolerate the maximum number of faulty paths for ensuring the consistency and reliability of the SDN network.

15 October 2022 in Soft Computing
Verified
Journal Article
Closed access
PDF file
MCMao-Lun Chiang
Mao-Lun Chiang
HHHui-Ching Hsieh
Hui-Ching Hsieh
TCTing-Yi Chang
Ting-Yi Chang
TLTzu-Ling Lin
Tzu-Ling Lin
HCHong-Wei Chen
Hong-Wei Chen