Jiangyuan Yao

Dr. Jiangyuan Yao

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
1 October 2014
Verified
Conference Paper
Closed access
JYJiangyuan Yao
Jiangyuan Yao
ZWZhiliang Wang
Zhiliang Wang
XYXia Yin
Xia Yin
XSXingang Shiyz
Xingang Shiyz
JWJianping Wu
Jianping Wu
Existing tools for Software-Defined Networking (SDN) data plane testing can be classified into two classes: white box and black-box. For the former, all or part of source codes should be accessed. But for testers outside the manufacturers, the accessing of source code is impossible or very difficult in most cases, especially for hardware devices. For the latter, test cases are manually developed, which cannot ensure the coverage. In this paper, we present a model based black-box systematic testing method for SDN data plane. We propose a new model, Pipelined Extended Finite State Machine (Pi-EFSM), to specify the multiple-level pipeline of SDN data plane. For the Pi-EFSM model, we present a 3-phase systematic test generation approach. By using a hierarchical test generation strategy, the proposed test generation method can alleviate state space explosion to some extent. Our test generation method can achieve the systematic coverage towards the elements of the model. We apply our method in the testing of Open Flow switches (specification version 1.3.0). We build a Pi-EFSM model for Open Flow switches and derive the executable test sequences. Some implementation faults and specification confusions are exposed when we test two switches, Open switch 2.1.0 and CPqD Open Flow 1.3 Software Switch.

1 January 2020 in Computers, Materials & Continua
Verified
Journal Article
Closed access
CZChuqing Zhang
Chuqing Zhang
JYJiangyuan Yao
Jiangyuan Yao
GHGuangwu Hu
Guangwu Hu
TSThomas Sch鴗t
Thomas Sch鴗t
Due to its outstanding ability in processing large quantity and high-dimensional data, machine learning models have been used in many cases, such as pattern recognition, classification, spam filtering, data mining and forecasting. As an outstanding machine learning algorithm, K-Nearest Neighbor (KNN) has been widely used in different situations, yet in selecting qualified applicants for winning a funding is almost new. The major problem lies in how to accurately determine the importance of attributes. In this paper, we propose a Feature-weighted Gradient Decent K-Nearest Neighbor (FGDKNN) method to classify funding applicants in to two types: approved ones or not approved ones. The FGDKNN is based on a gradient decent learning algorithm to update weight. It updatesthe weight of labels by minimizing error ratio iteratively, so that the importance of attributes can be described better. We investigate the performance of FGDKNN with Beijing Innofund. The results show that FGDKNN performs about 23%, 20%, 18%, 15% better than KNN, SVM, DT and ANN, respectively. Moreover, the FGDKNN has fast convergence time under different training scales, and has good performance under different settings.

4 July 2022
Verified
Book Chapter
Closed access
PDF file
JYJiangyuan Yao
Jiangyuan Yao
CXChunxiang Xu
Chunxiang Xu
ALand Deshun Li
and Deshun Li
SLShengjun Lin
Shengjun Lin
XCXingcan Cao
Xingcan Cao

1 January 2020 in Computers, Materials & Continua
Verified
Journal Article
Closed access
HGHaijun Geng
Haijun Geng
JYJiangyuan Yao
Jiangyuan Yao
YZYangyang Zhang
Yangyang Zhang
Loop free alternate (LFA) is a routing protection scheme that is currently deployed in commercial routers. However, LFA cannot handle all single network component failure scenarios in traditional networks. As Internet service providers have begun to deploy software defined network (SDN) technology, the Internet will be in a hybrid SDN network where traditional and SDN devices coexist for a long time. Therefore, this study aims to deploy the LFA scheme in hybrid SDN network architecture to handle all possible single network component failure scenarios. First, the deployment of LFA scheme in a hybrid SDN network is described as a 0-1 integer linear programming (ILP) problem. Then, two greedy algorithms, namely, greedy algorithm for LFA based on hybrid SDN (GALFAHSDN) and improved greedy algorithm for LFA based on hybrid SDN (IGALFAHSDN), are proposed to solve the proposed problem. Finally, both algorithms are tested in the simulation environment and the real platform. Experiment results show that GALFAHSDN and IGALFAHSDN can cope with all single network component failure scenarios when only a small number of nodes are upgraded to SDN nodes. The path stretch of the two algorithms is less than 1.36.

1 September 2017
Verified
Conference Paper
Closed access
JYJiangyuan Yao
Jiangyuan Yao
ZWZhiliang Wang
Zhiliang Wang
XYXia Yin
Xia Yin
XSXingang Shi
Xingang Shi
YLYahui Li
Yahui Li
CLChongrong Li
Chongrong Li
The programmability of Software-Defined Networking (SDN) challenges the correctness and reliability of networks. There may be design flaws as well as implementation bugs in SDN applications. White-box testing methods with formal models rely on source codes, which limits the applicability of these methods. Black-box methods without behavior models cannot systematically cover an application's functions. Most previous work has mainly focused on design flaws and has ignored implementation bugs. In this paper, we propose a new black-box test framework to detect both design flaws and implementation bugs. Following this test framework, we propose a new model, Information Table Extended State Machine (IT-EFSM), combining a group of parallel state machines and an abstract topology to specify the SDN applications. We employ a model checking tool to generate tests against design flaws and propose a test generation based on partial composition, symmetry simplification on the topology and topology simulated execution to expose implementation bugs. The experimental results of the testing process demonstrate the effectiveness and applicability of our method.

1 January 2022 in Computers, Materials & Continua
Verified
Journal Article
Open access
PDF file
MWMing Wan
Ming Wan
QLQuanliang Li
Quanliang Li
JYJiangyuan Yao
Jiangyuan Yao
YSYan Song
Yan Song
YLYang Liu
Yang Liu
YWYuxin Wan
Yuxin Wan
Anomaly detection is becoming increasingly significant in industrial cyber security, and different machine-learning algorithms have been generally acknowledged as various effective intrusion detection engines to successfully identify cyber attacks. However, different machine-learning algorithms may exhibit their own detection effects even if they analyze the same feature samples. As a sequence, after developing one feature generation approach, the most effective and applicable detection engines should be desperately selected by comparing distinct properties of each machine-learning algorithm. Based on process control features generated by directed function transition diagrams, this paper introduces five different machine-learning algorithms as alternative detection engines to discuss their matching abilities. Furthermore, this paper not only describes some qualitative properties to compare their advantages and disadvantages, but also gives an in-depth and meticulous research on their detection accuracies and consuming time. In the verified experiments, two attack models and four different attack intensities are defined to facilitate all quantitative comparisons, and the impacts of detection accuracy caused by the feature parameter are also comparatively analyzed. All experimental results can clearly explain that SVM (Support Vector Machine) and WNN (Wavelet Neural Network) are suggested as two applicable detection engines under differing cases.