guodong Wei

Mr. guodong Wei


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
2 February 2024 in Electronics
Verified
Journal Article
Open access
PDF file
LZLing Zheng
Ling Zheng
GWguodong Wei
guodong Wei
KZKeyao Zhang
Keyao Zhang
HCHongyun Chu
Hongyun Chu
Deterministic transmission technology is a core key technology that supports deterministic real-time transmission requirements for industrial control in Time-Sensitive Networking (TSN). It requires each network node to have a deterministic forwarding delay to ensure the real-time end-to-end transmission of critical traffic streams. Therefore, when forwarding data frames, the switch nodes must consider the time-limited requirements of the traffic. In the input-queued switch system, an algorithm for clock-synchronized deterministic network traffic classification scheduling (CSDN-TCS) is proposed to address the issue of whether a higher-quality-of-service (QoS) performance can be provided under packet deadline constraints. First, the scheduling problem of the switch is transformed into a decomposition problem of the traffic matrix. Secondly, the maximum weight-matching algorithm in graph theory is used to solve the matching results slot by slot. By fully utilizing the slot resources, as many packets as possible can be scheduled to be completed before the deadline arrives. For two types of packet scheduling problems, this paper uses the maximum flow algorithm with upper- and lower-bound constraints to move packets from a larger deadline set to idle slots in a smaller deadline set, enabling early transmission, reducing the average packet delay, and increasing system throughput. When there are three or more types of deadlines in the scheduling set, this scheduling problem is an NP-hard problem. We solve this problem by polling the two types of scheduling algorithms. In this paper, simulation experiments based on the switching size and line load are designed, and the Earliest Deadline First (EDF) algorithm and the Flow-Based Iterative Packet Scheduling (FIPS) algorithm are compared with the CSDN-TCS algorithm. The simulation results show that under the same conditions, the CSDN-TCS algorithm proposed in this paper outperforms the other two algorithms in terms of success rate, packet loss rate, average delay and throughput rate. Compared with the FIPS algorithm, the CSDN-TCS algorithm has lower time complexity under the same QoS performance.

5 July 2024 in Electronics
Verified
Journal Article
Open access
PDF file
LZLing Zheng
Ling Zheng
KZKeyao Zhang
Keyao Zhang
GWguodong Wei
guodong Wei
HCHongyun Chu
Hongyun Chu
Time-sensitive networking (TSN) is considered an ideal solution to meet the transmission needs of existing industrial production methods. The traffic scheduling problem of TSN is an NP-hard problem. The traditional traffic scheduling algorithms can lead to issues such as significant computational time consumption and traffic congestion, which are not conducive to the rapid and high-quality deployment of TSN. To simplify the complexity of TSN schedule table generation, the paper studies the scheduling problem of mixed critical traffic in TSN. Using a combinatorial packing traffic scheduling algorithm based on unoccupied space (CPTSA-US), a scheduling table for TSN traffic transmission is generated, proving the feasibility of transforming the TSN traffic scheduling problem into a packing problem. In addition, the initial packing algorithm and traditional traffic scheduling algorithm can cause traffic accumulation, seriously affecting network performance. This paper proposes a mixed-critical traffic scheduling algorithm based on free time domain (MCTSA-FTD), which further partitions the packing space transformed by the time domain. And performs multiple packing of traffic based on the partitioned packing space and generates the TSN schedule table according to the reverse transformation of the packing results. The simulation results show that compared to the CPTSA-US and the traditional traffic scheduling solution algorithm SMT (Satisfiability Modulo Theory), the schedule table generated by the MCTSA-FTD significantly improves the delay, jitter, and packet loss of BE flows in the network while ensuring the transmission requirements of TT flows. This can effectively enhance the transmission performance of the network.