Xiaoye Lu

Xiaoye Lu

Auto-generated profile, based on publicly available information

Xiaoye Lu

School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 January 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
JCJunyan Chen
Junyan Chen
Yong WangYong Wang
Yong Wang
JOJiangtao Ou
Jiangtao Ou
CFChengyuan Fan
Chengyuan Fan
XLXiaoye Lu
Xiaoye Lu
HZHongmei Zhang
Hongmei Zhang
Due to the rapid development of network communication technology and the significant increase in network terminal equipment, the application of new network architecture software‐defined networking (SDN) combined with reinforcement learning in network traffic scheduling has become an important focus of research. Because of network traffic transmission variability and complexity, the traditional reinforcement‐learning algorithms in SDN face problems such as slow convergence rates and unbalanced loads. The problems seriously affect network performance, resulting in network link congestion and the low efficiency of inter‐stream bandwidth allocation. This paper proposes an automatic load‐balancing architecture based on reinforcement learning (ALBRL) in SDN. In this architecture, we design a load‐balancing optimization model in high‐load traffic scenarios and adapt the improved Deep Deterministic Policy Gradient (DDPG) algorithm to find a near‐optimal path between network hosts. The proposed ALBRL uses the sampling method of updating the experience pool with the SumTree structure to improve the random extraction strategy of the empirical‐playback mechanism in DDPG. It extracts a more meaningful experience for network updating with greater probability, which can effectively improve the convergence rate. The experiment results show that the proposed ALBRL has a faster training speed than existing reinforcement‐learning algorithms and significantly improves network throughput.

12 February 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
JCJunyan Chen
Junyan Chen
Yong WangYong Wang
Yong Wang
XHXuefeng Huang
Xuefeng Huang
XXXiaolan Xie
Xiaolan Xie
HZHongmei Zhang
Hongmei Zhang
XLXiaoye Lu
Xiaoye Lu
Load-balancing optimization in software-defined networking (SDN) has been researched for a long time. Researchers have proposed many solutions to the load-balancing problem but have rarely considered the impact of transmission delay between controllers and switches under high-load network conditions. In this paper, we propose an adaptive load-balancing architecture based on link-state prediction (ALBLP) in SDN that can solve the influence of transmission delay between controllers and switches on network load balancing. ALBLP constructs the prediction model of the network link status, adopts the long-term and short-term memory neural network (LSTM) algorithm to predict the network link-state value, and then uses the predicted value as the Dijkstra weight to calculate the optimal path between network hosts. The proposed architecture can adaptively optimize network load balancing and avoid the empty window period, in which the switch flow table does not exist by actively issuing the flow table. Under the network architecture, we collect the data set of the network link-state by simulating the GÉANT network, and we verify the effectiveness of the proposed algorithm. The experiment results show that the ALBLP proposed in this paper can optimize load balancing in SDN and solve the problem of transmission delay between controllers and switches. It has a maximum load-balancing improvement of 23.7% and 11.7% in comparison with the traditional Open Shortest Path First (OSPF) algorithm and the reinforcement learning method based on Q-Learning.

7 July 2026 in Blockchain: Research and Applications
Verified
Journal Article
Open access
HLHai Liang
Hai Liang
XLXiaoye Lu
Xiaoye Lu
CYChangsong Yang
Changsong Yang
YWYujue Wang
Yujue Wang
YDYong Ding
Yong Ding
TWTian Wang
Tian Wang

26 February 2021
Verified
Book Chapter
Closed access
PDF file
YYY.C. Yue
Y.C. Yue
KJKebin Jia
Kebin Jia
ZWZ.Y. Wang
Z.Y. Wang
GPG.H. Peng
G.H. Peng
DXD.Y. Xiong
D.Y. Xiong
XLX. Lu
X. Lu
<!----> <!----> In evaluating the overall performance of the bridge network, each bridge in the network system plays a different role in different network states. Some bridges will be the key bridge to ensure the smooth connection of any two points in the network. Based on the core principle of web search engine, PageRank algorithm is introduced into the bridge importance ranking calculation of bridge network system, which gives each bridge initial connection value in the system, and uses this algorithm to carry on the finite iteration computation until the connection value of each bridge converges to a certain value output in accordance with the final output of the connection value of all the bridges in the network based on their degree of importance for the initial order. The results of the ranking help people allocate limited resources to the maintenance and repair of key bridges at the top of the ranking, and in the wake of natural disasters, such as earthquakes, provide theoretical basis and support for disaster relief decisions <!----> <!---->