A bus network data transmission control method based on priority scheduling

Abstract

The application provides a bus network data transmission control method based on priority scheduling, and relates to the technical field of network data transmission, and comprises the following steps: dividing a bus network into an edge layer, a core layer and a terminal layer; the terminal layer comprises a plurality of executor nodes; priority classification is performed on terminal data sets in the edge layer; priority rating data transmission time slots are allocated based on a preemptive scheduling algorithm in the core layer; priority data transmission strategies are dynamically adjusted in combination with a dynamic time slot allocation table and a local load state; when a plurality of executor nodes simultaneously initiate transmission requests, a final transmission sequence is output according to the priority data transmission strategy. Through a static rule base and a dynamic correction mechanism, the application accurately identifies key data characteristics, ensures the real-time performance and reliability of high-priority data, and reduces the delay risk of key services. Through a preemptive scheduling algorithm, intelligent allocation of bandwidth resources is realized, real-time service requirements are maximally guaranteed, and the network throughput efficiency is significantly improved.

Description

Technical Field

[0001] The present invention relates to the technical field of network data transmission, and in particular to a bus network data transmission control method based on priority scheduling. Background Art

[0002] In the development of modern computer networks, bus network architectures have played a crucial role as a communication protocol and architecture. Bus networks utilize a shared transmission medium to exchange data between nodes. This architecture, driven by the need for scalability and cost-effectiveness, aims to provide an efficient and simple way to connect multiple devices.

[0003] Bus networks were first introduced in the 1970s and early 1980s and were widely used in local area networks (LANs). During this period, the widespread adoption of personal computers and office automation equipment led to a rapid increase in demand, prompting researchers to explore various data transmission methods to meet the growing demand. The introduction of bus networks provided a centralized solution for communication between multiple devices, making it easier to add devices to the same network. The core concept of bus networks is to allow multiple devices to transmit data simultaneously over a shared transmission medium. This design not only reduces wiring costs but also simplifies the overall network architecture. Furthermore, the flexibility and scalability of bus networks make it easier to add or remove devices from the network, meeting users' diverse needs for network architecture. With the continuous advancement of network technology, bus networks have also evolved to adapt to the needs of emerging technologies and application scenarios. In recent years, with the rise of emerging fields such as the Internet of Things, smart homes, and industrial automation, the application scope of bus networks has continued to expand, demonstrating their unique advantages and adaptability.

[0004] In typical bus network data transmission control methods, because multiple devices share the same transmission medium, data conflicts can occur when multiple devices attempt to send data simultaneously. This situation not only causes data transmission failures but may also require data retransmissions, wasting bandwidth and increasing network latency. As the number of devices in the network increases, bandwidth sharing reduces the available bandwidth per node, thereby lowering the overall data transmission rate. Summary of the Invention

[0005] The present invention provides a bus network data transmission control method based on priority scheduling, which is used to solve the defects in the prior art.

[0006] In one aspect, the present invention provides a bus network data transmission control method based on priority scheduling, comprising:

[0007] The bus network is divided into an edge layer, a core layer, and a terminal layer; the terminal layer includes multiple actuator nodes;

[0008] Prioritize the terminal data set at the edge layer and output priority rating data;

[0009] At the core layer, the transmission time slots of priority-rated data are allocated based on a preemptive scheduling algorithm, and a dynamic time slot allocation table is generated;

[0010] Dynamically adjust the priority data transmission strategy based on the dynamic time slot allocation table and local load status;

[0011] When multiple executor nodes initiate transmission requests at the same time, the final transmission sequence is output according to the priority data transmission strategy.

[0012] According to a bus network data transmission control method based on priority scheduling provided by the present invention, the step of performing priority classification includes:

[0013] Set key data feature information and generate a static priority rule base;

[0014] Perform preliminary priority screening on the terminal data set based on the static priority rule base and output the initial priority data;

[0015] Perform TTL verification and business relevance correction on the initial priority data, and output the stage priority data;

[0016] According to the local load status, the stage priority data is further judged and the final priority data is output.

[0017] According to a bus network data transmission control method based on priority scheduling provided by the present invention, the step of generating a static priority rule base includes:

[0018] Analyze the data characteristics of the terminal data set; set key data characteristic information based on the data characteristics;

[0019] Set priority classification standards based on key data feature information;

[0020] According to the priority classification standards, formulate priority rules, define conditions and expected priority results for each priority rule, and output a preliminary priority rule list;

[0021] Construct a static priority rule base framework based on the preliminary priority rule list;

[0022] Use historical data to verify the priority results in the preliminary priority rule list and output a validity evaluation report;

[0023] According to the effectiveness evaluation report, optimize the priority rules and output the final priority rules;

[0024] The final priority rules are input into the static priority rule base framework to generate a static priority rule base.

[0025] According to a bus network data transmission control method based on priority scheduling provided by the present invention, the step of performing preliminary priority screening on a terminal data set includes:

[0026] Traverse each sub-data in the terminal data set;

[0027] According to the static priority rule base, the priority of each sub-data is calculated and marked, and the initial priority data is output.

[0028] According to a bus network data transmission control method based on priority scheduling provided by the present invention, the step of outputting stage priority data includes:

[0029] Set TTL parameters according to business needs;

[0030] Check the validity of each sub-data in the initial priority data, mark the data that exceeds the TTL parameter, and output the TTL verification result;

[0031] According to the TTL check result, invalid data in the initial priority data is filtered and excluded, and the remaining priority data is output;

[0032] Further analyze the business relevance of the remaining priority data, make corrections according to preset business rules, and output the stage priority data.

[0033] According to a bus network data transmission control method based on priority scheduling provided by the present invention, the steps of allocating transmission time slots for priority-rated data include:

[0034] Predefine fixed time slot pool and flexible time slot pool based on total bus bandwidth;

[0035] Divide the priority rating data into queues and output real-time data queues;

[0036] Combined with the real-time data queue, bandwidth is exclusively allocated. If the amount of data in the real-time data queue exceeds the fixed bandwidth of the fixed time slot pool, the excess is discarded and the fixed time slot plan is output.

[0037] Combined with the elastic time slot pool, the proportion of high-priority data and low-priority data in the real-time data queue is dynamically calculated;

[0038] Allocate bandwidth to high-priority data and low-priority data based on their proportions, and output the flexible time slot bandwidth allocation results;

[0039] Based on the preemptive scheduling algorithm and combined with the flexible time slot bandwidth allocation results, the flexible time slot plan is updated; the current low-priority data transmission is interrupted, the interruption location is recorded, and the recovery information of the interrupted low-priority data is output;

[0040] Perform time slot scheduling based on fixed time slot plans and flexible time slot plans, and output the latest queue status;

[0041] Based on the latest queue status and historical bandwidth usage, the system adjusts the bandwidth allocation ratio between high and low priority levels and outputs the transmission time slot allocation strategy.

[0042] According to a bus network data transmission control method based on priority scheduling provided by the present invention, the step of updating the flexible time slot plan includes:

[0043] Collect the latest high-priority data;

[0044] Determine whether the latest high-priority data needs to preempt the transmission time slot of the current low-priority data; if the transmission time required is greater than the remaining time of the current time slot, the preemption condition is met;

[0045] Interrupt low-priority data transmission and give priority to the latest high-priority data;

[0046] Insert high-priority data into the current time slot and generate a new flexible time slot plan;

[0047] Resume low-priority data transmission in subsequent time slots; if low-priority data is preempted multiple times and times out, it will be downgraded to the lowest priority data.

[0048] According to a bus network data transmission control method based on priority scheduling provided by the present invention, the step of dynamically adjusting the priority data transmission strategy includes:

[0049] Determine whether to activate the degradation strategy based on the load status and output the judgment result; including: temporarily storing non-urgent data in the low-priority queue to the memory buffer; if the memory occupancy rate exceeds the preset occupancy rate, send a flow control instruction to the terminal device;

[0050] Optimize directly related configurable variables based on the judgment results and output tuning parameters;

[0051] Encapsulate tuning parameters into executable transmission instructions to drive edge node behavior and generate priority data transmission strategies.

[0052] According to a bus network data transmission control method based on priority scheduling provided by the present invention, the step of outputting a final transmission sequence includes:

[0053] Generate a priority tag request queue based on key data feature information in the transmission request;

[0054] Based on the local load status, the priority of low-priority requests is dynamically adjusted and the latest priority queue is output;

[0055] According to the latest priority queue, the priority data transmission strategy is switched and the selected arbitration strategy is output;

[0056] Combine the selected arbitration strategy with the latest priority queue, output a preliminary draft of the transmission sequence through dynamic weight allocation and preemption logic execution;

[0057] According to the transmission time slot allocation strategy and the preliminary transmission sequence draft, the start and end times of each time slot are adjusted and the final transmission sequence is output.

[0058] According to a bus network data transmission control method based on priority scheduling provided by the present invention, the steps of driving edge node behavior include:

[0059] Real-time monitoring of network status data through the core layer;

[0060] Perform data analysis on network status data and output abnormal events;

[0061] Combine abnormal events and static priority rule base to generate structured policy documents;

[0062] Push structured policy files to edge nodes through the core layer;

[0063] After receiving the policy, the edge node verifies the integrity and backs up the local original rules, and outputs the stage policy file;

[0064] Update the static priority rule base according to the stage strategy file to generate intermediate state data;

[0065] Optimize the stage policy file based on the intermediate status data; if a backlog is detected in a low-priority queue, dynamically increase its bandwidth quota; if the stage policy file fails to execute, fall back to the default rules and issue an alarm.

[0066] This invention provides a bus network data transmission control method based on priority scheduling. This method, through a layered design consisting of edge, core, and terminal layers, achieves modular division of labor for data processing. The edge layer is responsible for priority classification and policy generation, the core layer focuses on dynamic scheduling and resource allocation, and the terminal layer performs specific operations. This effectively reduces system coupling and facilitates functional expansion and maintenance. A static rule base and dynamic correction mechanisms (such as TTL verification and service relevance analysis) accurately identify key data characteristics and dynamically adjust priorities based on local load conditions, ensuring the real-time and reliability of high-priority data and reducing the risk of delays for critical services. A preemptive scheduling algorithm enables intelligent allocation of bandwidth resources. When high-priority data bursts occur, low-priority transmissions can be interrupted and dynamically resumed, avoiding bandwidth waste while maximizing real-time service needs and significantly improving network throughput efficiency. By monitoring network load in real time, downgrade policies (such as non-urgent data caching and flow control instructions) and flexible bandwidth adjustment mechanisms are triggered to proactively optimize resource allocation before congestion occurs, effectively preventing network paralysis. Dynamic terminal node policy updates and exception fallback functions are also supported, ensuring stable system operation in complex environments. BRIEF DESCRIPTION OF THE DRAWINGS

[0067] In order to more clearly illustrate the technical solutions in the present invention or the prior art, a brief introduction is given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0068] Figure 1 This is a step diagram of a bus network data transmission control method based on priority scheduling provided by an embodiment of the present invention;

[0069] Figure 2 This is a diagram of steps for generating a static priority rule base in an embodiment of the present invention;

[0070] Figure 3 This is a diagram of the steps for allocating transmission time slots for priority rating data in an embodiment of the present invention. DETAILED DESCRIPTION

[0071] To make the objectives, technical solutions, and advantages of the present invention more clear, the technical solutions of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the embodiments described are only some of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention. Example

[0072] The following combination Figure 1-Figure 3 The present invention describes a bus network data transmission control method based on priority scheduling.

[0073] like Figure 1-Figure 3 As shown, an embodiment of the present invention provides a bus network data transmission control method based on priority scheduling, including:

[0074] The bus network is divided into edge, core, and terminal layers. The edge layer deploys intelligent gateway devices, integrating edge computing modules and rule engines to support local data processing and pre-analysis, effectively reducing data processing pressure at the core layer. The terminal layer includes multiple actuator nodes, each equipped with dual-redundant CAN bus interfaces, supporting millisecond-level failover, and integrating hardware-level encryption modules to ensure data security at the physical layer.

[0075] Priority classification is performed on the terminal data set at the edge layer, and priority rating data is output. The steps for priority classification include:

[0076] Set key data feature information and generate a static priority rule base. The steps to generate a static priority rule base include:

[0077] Analyze the data characteristics of the terminal dataset. Principal component analysis is used to extract the three principal components of time sensitivity, security level, and business impact, and construct a three-dimensional feature space model. Key data feature information is defined based on the data characteristics. Time sensitivity indicators include deadline, fluctuation frequency, and historical delay variance. The security level is further subdivided into two dimensions: device authentication strength and data encryption algorithm strength.

[0078] According to the key data feature information, priority classification standards are set. Fuzzy logic reasoning mechanism is used to handle the nonlinear relationship between features, and membership function is established to quantify the weight of each feature.

[0079] Priority rules are developed based on the priority classification criteria. Each rule includes threshold conditions, time constraints, and priority mappings. For example, data with a time sensitivity exceeding 90 decibels and a security level of AES-256 can be marked as urgent. Conditions and expected priority outcomes are defined for each priority rule, and a preliminary list of priority rules is output.

[0080] A static priority rule base framework is constructed based on the preliminary priority rule list. The framework uses a hierarchical index structure to support fast retrieval of rules by business type and device ID.

[0081] Use historical data to validate the priority results in the preliminary priority rule list and output an effectiveness evaluation report. Calculate the classification accuracy using the 10-fold cross-validation method, and use the ROC curve to analyze the rationality of the rule boundary conditions.

[0082] Based on the effectiveness evaluation report, the priority rules were optimized and the final priority rules were output. A reinforcement learning strategy was used to adjust the rule parameters for misjudged samples, ultimately achieving an accuracy rate of over 99.3% for emergency data recognition.

[0083] The final priority rules are input into the static priority rule base framework to generate a static priority rule base.

[0084] According to the static priority rule base, the terminal data set is preliminarily prioritized and the initial priority data is output. The steps for preliminarily prioritizing the terminal data set include:

[0085] Traverse each sub-data in the terminal data set. Use parallel processing technology to improve throughput, with a single node processing capacity of up to 100,000 records per second.

[0086] Based on the static priority rule base, the priority of each sub-data is calculated and marked, and the initial priority data is output. A rule conflict detection mechanism is introduced, and when multiple rules are triggered simultaneously, voting is used to determine the final priority.

[0087] Perform TTL verification and business relevance correction on the initial priority data and output the stage priority data. The steps for outputting the stage priority data include:

[0088] Set TTL parameters based on business needs. Use emergency control commands to set dynamic TTL values, whose attenuation coefficient is positively correlated with the degree of network congestion.

[0089] Check the validity of each sub-data in the initial priority data, use the sliding window protocol to verify the integrity of the data sequence, and start the automatic retransmission mechanism for timed-out data. Mark the data that exceeds the TTL parameter and output the TTL verification result.

[0090] According to the TTL check result, invalid data in the initial priority data is filtered and excluded, an invalid data isolation area is established to prevent the error from spreading, and the remaining priority data is output.

[0091] We further analyze the business relevance of the remaining priority data, construct a data dependency graph, and use the PageRank algorithm to quantify the node influence values ​​and dynamically adjust the priority offset of the associated data. We then make corrections based on pre-set business rules and output the staged priority data. For example, medical device data takes precedence over environmental monitoring data, even if they have the same business impact score.

[0092] Based on the local load status, the stage priority data is further evaluated and the final priority data is output. The local load assessment covers three dimensions: CPU utilization, memory swap space utilization, and queue backlog duration. The dynamic load index is derived through weighted synthesis.

[0093] The core layer allocates transmission time slots for priority-rated data based on a preemptive scheduling algorithm and generates a dynamic time slot allocation table. The steps for allocating transmission time slots for priority-rated data include:

[0094] Fixed time slot pools and flexible time slot pools are predefined based on the total bus bandwidth. The fixed time slot pool uses time division multiplexing technology to ensure basic services, while the flexible time slot pool implements weighted polling scheduling to cope with burst traffic.

[0095] Priority rating data is divided into queues and output as real-time data queues. Queue division thresholds are adaptively adjusted based on historical traffic patterns.

[0096] Combined with real-time data queues, bandwidth is exclusively allocated. If the amount of data in the real-time data queue exceeds the fixed bandwidth of the fixed time slot pool, the excess is discarded. The discard strategy prioritizes the integrity of time-sensitive data and outputs a fixed time slot plan.

[0097] Combined with the elastic time slot pool, the ratio of high-priority data to low-priority data in the real-time data queue is dynamically calculated. This ratio calculation can incorporate an exponential smoothing factor to mitigate the impact of instantaneous traffic fluctuations.

[0098] Bandwidth is allocated to high-priority data and low-priority data based on their proportions. The bandwidth guarantee interval for high-priority data is no less than 45% of the total bandwidth, and the elastic time slot bandwidth allocation result is output.

[0099] Based on the preemptive scheduling algorithm and the results of the flexible time slot bandwidth allocation, the flexible time slot plan is updated. The current low-priority data transmission is interrupted. During the interruption process, the transmission status is recorded accurately down to the packet level, including the number of bytes transmitted and the CRC check bit. The interruption location is recorded, and the recovery information of the interrupted low-priority data is output. The recovery information includes a timestamp, sequence number, and checksum to ensure the reliability of breakpoint resuming. The steps for updating the flexible time slot plan include:

[0100] Collect the latest high-priority data. The collection frequency is synchronized with the network fluctuation cycle to avoid scheduling deviations caused by collection lags.

[0101] Determine whether the latest high-priority data needs to preempt the transmission slot of the current low-priority data. A preemption priority difference model is introduced, triggering preemption when the difference exceeds a preset threshold. If the required transmission time is greater than the remaining time in the current slot, the preemption condition is met.

[0102] Interrupt low-priority data transmission and give priority to the latest high-priority data. The interrupt response delay is usually controlled within 10μs.

[0103] Insert high-priority data into the current time slot. The insertion operation uses seamless splicing technology to avoid packet fragmentation and generate a new flexible time slot plan.

[0104] Low-priority data transmission is resumed in subsequent time slots. Traffic shaping is implemented during the recovery phase to prevent sudden traffic shocks. If low-priority data is preempted multiple times and times out, the timeout threshold is set to three times. If exceeded, the data downgrade process is triggered, and the data is downgraded to the lowest priority data.

[0105] Based on fixed and flexible time slot plans, time slot scheduling is performed and the latest queue status is output. A watchdog mechanism can be introduced during scheduling execution to monitor time slot synchronization accuracy in real time.

[0106] Based on the latest queue status and historical bandwidth usage, the system adjusts the bandwidth allocation ratio between high- and low-priority queues and outputs a transmission slot allocation policy. The adjustment range is subject to preset bandwidth fluctuation constraints.

[0107] Dynamically adjust the priority data transmission strategy based on the dynamic time slot allocation table and local load status. The steps of dynamically adjusting the priority data transmission strategy include:

[0108] The system determines whether to initiate a downgrade strategy based on the load status and outputs the result. This strategy includes multi-level response mechanisms, such as improving data compression and extending the cache period for non-critical data. This includes temporarily storing non-urgent data in low-priority queues in a memory buffer. This buffer is managed using a least-recently-used (LRU) replacement algorithm, with a maximum capacity not exceeding 15% of total memory. If the memory usage exceeds a preset rate, a flow control command is sent to the terminal device. This flow control command includes window scaling factors and pause duration parameters.

[0109] Based on the judgment results, the system optimizes directly related configurable variables and outputs tuning parameters. The optimized variables include core parameters such as transmission rate, number of retransmissions, and confirmation period.

[0110] Encapsulate the tuning parameters into executable transmission instructions to drive edge node behavior and generate a priority data transmission strategy. The steps to drive edge node behavior include:

[0111] Real-time monitoring of network status data at the core layer. Monitoring data includes real-time indicators in over 20 dimensions, including packet loss rate, delay jitter, and channel utilization.

[0112] Perform data analysis on network status data, use a streaming computing framework to implement millisecond-level latency data processing, and output abnormal events.

[0113] Combine exception events with a static priority rule base to generate a structured policy file. The policy file uses the Protobuf format to achieve efficient cross-platform parsing.

[0114] Push structured policy files to edge nodes through the core layer.

[0115] After receiving the policy, the edge node verifies the integrity and backs up the local original rules. The verification process uses the SHA-256 hash algorithm to ensure file integrity and output the stage policy file.

[0116] Updates the static priority rule base based on the stage policy file to generate intermediate state data. The update operation supports hot-swap mode and takes effect without restarting the system.

[0117] Based on intermediate status data, the stage policy file is optimized, and the optimization process is combined with A / B testing to verify the effectiveness of the policy. If a backlog is detected in a low-priority queue (determined by a queue length exceeding a threshold and persisting for a specified period), the bandwidth quota is dynamically increased. If the stage policy file fails to execute, the default rules are reverted and an alarm is issued. Failure causes are categorized into seven types: network failure, rule conflict, and hardware anomaly. The alarm information includes the error code, the scope of impact, and recommended remediation measures.

[0118] When multiple executor nodes initiate transmission requests at the same time, the final transmission sequence is output according to the priority data transmission strategy. The steps of outputting the final transmission sequence include:

[0119] Based on the key data feature information in the transmission request, the feature dimension is extracted and expanded to 512 dimensions to improve the discrimination, and a priority tag request queue is generated.

[0120] Based on the local load status, the priority of low-priority requests is dynamically adjusted. The adjustment algorithm includes a load prediction model, which can predict the load change trend 10ms in advance and output the latest priority queue.

[0121] According to the latest priority queue, the priority data transmission strategy is switched. The switching process ensures business continuity, the interruption time does not exceed 1 time slot cycle, and the selected arbitration strategy is output.

[0122] Combining the selected arbitration strategy with the latest priority queues, dynamic weight allocation and preemption logic are implemented to output a preliminary draft transmission sequence. Dynamic weight calculation incorporates the device health factor, automatically reducing the transmission weight of aging devices by 15%.

[0123] According to the transmission time slot allocation strategy and the preliminary transmission sequence draft, the start and end times of each time slot are adjusted, and the time slot boundary adjustment accuracy reaches ±5μs to avoid interference between adjacent time slot signals, and the final transmission sequence is output.

[0124] Example 1:

[0125] Total bandwidth allocation: Fixed time slot pool (60%): P0 (40%) + P1 (20%), flexible time slot pool (40%): allocated according to real-time proportion.

[0126] At a certain moment, the request queue is: P0 level: 3 emergency alarms (total demand 12Mbps), P1 level: 15 control instructions (total demand 24Mbps), P2 level: 50 status data (total demand 30Mbps).

[0127] Scheduling results: Fixed time slot: P0 occupies 40% (12 Mbps fully loaded), P1 occupies 20% (6 Mbps remaining); Flexible time slot: P1 is allocated an additional 18 Mbps (total 24 Mbps), and P2 is allocated the remaining 8 Mbps; Triggered preemption: The transmission of the two P2 status data is interrupted and their data packets are cached.

[0128] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units. That is, they may be located in one place or distributed across multiple network units. Some or all of the modules may be selected based on actual needs to achieve the objectives of the present embodiment. Persons of ordinary skill in the art will be able to understand and implement the present invention without inventive effort.

[0129] Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented using software plus a necessary general-purpose hardware platform, or of course, hardware. Based on this understanding, the essence of the above technical solution, or the portion that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, or an optical disk, and includes a number of instructions for causing a computer device (such as a personal computer, server, or network device) to execute the methods described in each embodiment or certain portions of the embodiments.

[0130] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims

1. A bus network data transmission control method based on priority scheduling, characterized in that: include: Divide the bus network into edge layer, core layer and terminal layer; The terminal layer includes a plurality of actuator nodes; Prioritizing the terminal data set at the edge layer and outputting priority rating data; The steps of performing the priority classification include: Set key data feature information and generate a static priority rule base; Performing preliminary priority screening on the terminal data set according to the static priority rule base, and outputting initial priority data; Performing TTL verification and service relevance correction on the initial priority data, and outputting phase priority data; further determining the stage priority data according to the local load status and outputting the priority rating data; Set key data feature information and generate a static priority rule base. The steps include: Analyzing data characteristics of the terminal data set; and setting the key data characteristic information according to the data characteristics; Setting priority classification standards based on the key data feature information; Formulate priority rules according to the priority classification standard, define conditions and expected priority results for each priority rule, and output a preliminary priority rule list; Building a static priority rule base framework based on the preliminary priority rule list; Verify the priority results in the preliminary priority rule list using historical data and output a validity evaluation report; Optimizing the priority rules according to the effectiveness evaluation report and outputting final priority rules; Inputting the final priority rule into the static priority rule base framework to generate the static priority rule base; Allocate transmission time slots of the priority rating data based on a preemptive scheduling algorithm at the core layer to generate a dynamic time slot allocation table; Dynamically adjust the priority data transmission strategy based on the dynamic time slot allocation table and local load status; When a plurality of the executor nodes initiate transmission requests simultaneously, a final transmission sequence is output according to the priority data transmission strategy.

2. A bus network data transmission control method based on priority scheduling according to claim 1, characterized in that: The steps of performing preliminary priority screening on the terminal data set include: Traversing each sub-data in the terminal data set; According to the static priority rule base, the priority of each sub-data is calculated and marked, and initial priority data is output.

3. A bus network data transmission control method based on priority scheduling according to claim 2, characterized in that: The steps of outputting the stage priority data include: Set TTL parameters according to business needs; Checking the validity of each sub-data in the initial priority data, marking the data exceeding the TTL parameter, and outputting the TTL verification result; According to the TTL check result, filtering and excluding invalid data in the initial priority data, and outputting the remaining priority data; The business relevance of the remaining priority data is further analyzed, and corrections are made according to preset business rules to output the stage priority data.

4. A bus network data transmission control method based on priority scheduling according to claim 1, characterized in that: The step of allocating transmission time slots for the priority rating data includes: Predefine fixed time slot pool and flexible time slot pool based on total bus bandwidth; Dividing the priority rating data into queues and outputting a real-time data queue; In combination with the real-time data queue, bandwidth is exclusively allocated; if the amount of data in the real-time data queue exceeds the fixed bandwidth of the fixed time slot pool, the excess portion is discarded and a fixed time slot plan is output; In combination with the elastic time slot pool, dynamically calculating the proportion of high-priority data and low-priority data in the real-time data queue; Allocate bandwidth for the high-priority data and the low-priority data according to the proportions, and output a flexible time slot bandwidth allocation result; Based on the preemptive scheduling algorithm and in combination with the flexible time slot bandwidth allocation result, the flexible time slot plan is updated; the current low-priority data transmission is interrupted, the interruption location is recorded, and the recovery information of the interrupted low-priority data is output; Execute time slot scheduling according to the fixed time slot plan and the flexible time slot plan, and output the latest queue status; According to the latest queue status and historical bandwidth usage, the high-priority and low-priority bandwidth allocation ratios are adjusted, and the transmission time slot allocation strategy is output.

5. A bus network data transmission control method based on priority scheduling according to claim 4, characterized in that: The steps of updating the flexible time slot plan include: Collect the latest high-priority data; Determine whether the latest high-priority data needs to preempt the transmission time slot of the current low-priority data; if the transmission time required is greater than the remaining time of the current time slot, the preemption condition is met; Interrupting the transmission of the low-priority data and giving priority to transmitting the latest high-priority data; Inserting the high priority data into the current time slot and generating a new flexible time slot plan; The low-priority data transmission is resumed in a subsequent time slot; if the low-priority data is preempted multiple times and causes timeout, it is downgraded to the lowest-priority data.

6. A bus network data transmission control method based on priority scheduling according to claim 5, characterized in that: The step of dynamically adjusting the priority data transmission strategy includes: Determine whether to start the degradation strategy according to the load status and output the judgment result; including: temporarily storing non-urgent data in the low-priority queue to the memory buffer; if the memory occupancy rate exceeds the preset occupancy rate, send a flow control instruction to the terminal device; Optimize directly related configurable variables according to the judgment result and output tuning parameters; The tuning parameters are encapsulated into executable transmission instructions to drive edge node behavior and generate the priority data transmission strategy.

7. A bus network data transmission control method based on priority scheduling according to claim 6, characterized in that: The step of outputting the final transmission sequence includes: generating a priority marking request queue according to the key data feature information in the transmission request; Dynamically adjust the priority of low-priority requests based on the local load status and output the latest priority queue; According to the latest priority queue, the priority data transmission strategy is switched and the selected arbitration strategy is output; Combining the selected arbitration strategy with the latest priority queue, outputting a preliminary transmission sequence draft through dynamic weight allocation and preemption logic execution; According to the transmission time slot allocation strategy and the preliminary transmission sequence draft, the start and end times of each time slot are adjusted, and the final transmission sequence is output.

8. The bus network data transmission control method based on priority scheduling according to claim 6 is characterized in that: The steps of driving the edge node behavior include: Real-time monitoring of network status data via the core layer; Performing data analysis on the network status data and outputting abnormal events; Combining the abnormal event with the static priority rule base, generating a structured policy file; Pushing the structured policy file to the edge node through the core layer; After receiving the policy, the edge node verifies the integrity and backs up the local original rules, and outputs the stage policy file; Updating the static priority rule base according to the stage strategy file to generate intermediate state data; The stage policy file is optimized according to the intermediate state data; if a backlog of the low priority queue is detected, its bandwidth quota is dynamically increased; if the execution of the stage policy file fails, it falls back to the default rule and issues an alarm.

Images