Data scheduling method and system for machine room switch

Abstract

The invention relates to the technical field of switch data transmission, in particular to a machine room switch-oriented data scheduling method and system, and the method specifically comprises the steps: adding a dynamic priority field in a data frame structure, and determining the weighted throughput of an interface based on the length, priority and dynamic priority of a data frame sent by a switch interface; based on the average contention period number of the data links, the collision severity of the switch interface in the sliding window is determined, and the congestion characteristic value of each data link in the sliding window is determined by combining the weighted throughput of the interface; based on the dynamic priority of each data frame and the congestion characteristic value of each data link, optimizing and adjusting the data transfer method of the switch; the overall data scheduling efficiency of the park network computer room switch is improved, the real-time performance of exchange of different production data is enhanced, and the adaptability of data scheduling of the computer room switch to different data priorities is improved.

Description

Technical Field

[0001] The present application relates to the technical field of switch data transmission, and in particular to a data scheduling method and system for computer room switches. Background Art

[0002] Modern industrial production typically involves parallel production across multiple modules. Within a factory, different production modules generate massive amounts of production data, including equipment operating status data, production process data, and material management data. To address this complex industrial production, production modules utilize the factory's campus network to coordinate data between different modules, ensuring coordinated and stable operation. However, the factory's campus network has limited switching capacity, and switches within the computer room are prone to collisions and congestion during the massive exchange of production data, hindering efficient data scheduling.

[0003] However, the data exchange priorities generated by different industrial production modules vary. In actual industrial production scenarios, some data, such as equipment fault alarm data and key parameter data, require higher priority transmission, while some data, such as the operating status data of non-critical equipment, can be transmitted with a slight delay. Traditional data scheduling methods do not distinguish between data categories and lack the ability to adapt to the data priorities of factory campus networks. When network congestion occurs, data frames that require priority transmission may be lost, causing instability in the production process and even leading to safety incidents. Summary of the Invention

[0004] In order to solve the above technical problems, the purpose of this application is to provide a data scheduling method and system for computer room switches. The technical solutions adopted are as follows: In a first aspect, an embodiment of the present application provides a data scheduling method for a computer room switch, the method comprising the following steps: Add a dynamic priority field to the data frame structure; set the dynamic priority of each data frame according to the waiting time of each data frame; A sliding window is preset, and based on the length, priority, and dynamic priority of each data frame sent by each switch interface within the sliding window, a weighted throughput of each switch interface within the sliding window is constructed; Calculating an average number of contention periods for each data link based on data frame collisions of each data link within the sliding window; determining a collision severity of the switch interface within the sliding window based on an overall distribution characteristic of the average number of contention periods for all data links of the switch interface; For all interfaces that each data link passes through, determining a congestion characteristic value of each data link in a sliding window based on the weighted throughput and the collision severity of the interface; Based on the dynamic priority of each data frame and the congestion characteristic value of each data link, the data mobilization method of the switch is optimized and adjusted.

[0005] In one embodiment, the process of obtaining the dynamic priority is as follows: The initial dynamic priority of each data frame is set to the lowest dynamic priority. When the waiting time for each data frame to be sent increases by the length of the contention period, the corresponding dynamic priority value increases by 1. When it increases to the preset highest dynamic priority, it remains unchanged.

[0006] In one embodiment, the process of obtaining the weighted throughput of the switch interface within the sliding window is as follows: Calculate the sum of the priority of each data frame and the dynamic priority, and record it as the first sum; calculate the sum of the highest priority of the data frame and the highest dynamic priority, and record it as the second sum; The weighted throughput of each interface of the switch within the sliding window is determined based on the length of each data frame sent by each interface of the switch within the sliding window, the first sum value, and the second sum value.

[0007] In one embodiment, the weighted throughput is expressed as: Where, Indicates the weighted throughput of the current switch interface within the sliding window; Indicates the time length of the sliding window; Indicates the number of data frames sent by the current switch interface within the sliding window; Indicates the number of packets sent by the current switch interface within the sliding window. The length of the data frame; and They represent the first Priority and dynamic priority of each data frame; and Respectively represent the highest priority and highest dynamic priority of the data frame; is a preset minimum positive number; is the first sum value, is the second sum.

[0008] In one embodiment, the process of obtaining the average number of contention periods is as follows: In the sliding window, the ratio of the number of contention periods for sending data frames on each data link of the switch interface to the number of data frames sent is calculated, and recorded as the average number of contention periods for each data link.

[0009] In one embodiment, the collision severity is expressed as: Where, is the collision severity of the current switch interface within the sliding window; Indicates the number of data links on the current switch interface; Indicates the number of packets passing through the current switch interface in the sliding window. Average number of contention periods per data link; Indicates the maximum value of the average contention period of all data links passing through the current switch interface within the sliding window; A preset minimum positive number.

[0010] In one embodiment, the process of obtaining the congestion characteristic value of each data link in the sliding window is as follows: Within the sliding window, obtain each interface through which each data link of the switch passes, and calculate the ratio of the weighted throughput of each interface through which each data link passes to the maximum weighted throughput of all interfaces passed through, which is recorded as a first ratio; Based on the collision severity of each interface passed by each data link and the first ratio, a congestion characteristic value of each data link in the sliding window is determined.

[0011] In one embodiment, the congestion characteristic value is: the sum of the products of the collision severity of all interfaces through which the data link passes within the sliding window and the first ratio.

[0012] In one embodiment, the process of optimizing and adjusting the data mobilization method of the switch is as follows: After receiving the data frame, the switch compares the sending time of the data frame and processes the data frame with earlier sending time first; If the sending time is the same, the priority fields of the data frames are compared and the data frame with higher priority is transmitted first; When the priorities are the same, the dynamic priority fields are compared and the data frame with the higher dynamic priority is transmitted first; Based on the remaining capacity of the buffer and the size of the data frame, determine whether the data frame can enter the buffer; if the remaining capacity of the buffer is insufficient to store the data frame, it is necessary to perform packet loss processing according to the packet loss policy; Data frames are assigned to links based on the value of the dynamic priority field and the existing link congestion: the highest dynamic priority data frame is assigned to the link with the smallest congestion characteristic value within its previous sliding window for transmission; The data frames in the buffer area are sorted in descending order according to the dynamic priority to ensure that the data frames with high dynamic priority can be transmitted first.

[0013] In a second aspect, an embodiment of the present application also provides a data scheduling system for a computer room switch, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, wherein the processor implements the steps of any one of the above methods when executing the computer program.

[0014] The embodiments of the present application have at least the following beneficial effects: Based on the existing switch data frame structure, this application adds a dynamic priority field to represent the dynamic changes in priority caused by data frame queuing, reduces frame waiting delay, and ensures real-time data exchange between different production modules. Based on the throughput and average number of contention periods of the switch interface within the sliding window, the congestion characteristic value of each data link, and further based on the priority of the data frame in the link, the switch data transmission link is dynamically adjusted to reduce the link congestion level during subsequent data scheduling, reduce frame loss due to collisions, and improve data scheduling efficiency. By comparing the priorities of different data frames and dynamic priorities, data scheduling is dynamically adjusted to achieve dynamic data scheduling for the switches in the factory campus network computer room, reducing frame loss caused by exceeding the cache area and avoiding data frame retransmission. While improving the overall data scheduling efficiency of the switches in the campus network computer room, it also enhances the real-time nature of the exchange of different production data, thereby improving the adaptability of the computer room switch data scheduling to different data priorities. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0016] Figure 1 A flowchart of the steps of a data scheduling method for a computer room switch provided in one embodiment of the present application; Figure 2 Schematic diagram of the process of obtaining weighted throughput. DETAILED DESCRIPTION

[0017] To further illustrate the technical means and effectiveness of this application to achieve the intended purpose, the following, in conjunction with the accompanying drawings and preferred embodiments, describes in detail the specific implementation, structure, features, and effectiveness of the data scheduling method and system for computer room switches proposed in this application. In the following description, different references to "one embodiment" or "another embodiment" do not necessarily refer to the same embodiment. Furthermore, specific features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.

[0018] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.

[0019] The specific scheme of the data scheduling method and system for computer room switches provided by this application is described in detail below with reference to the accompanying drawings.

[0020] See also Figure 1 , which shows a flowchart of a data scheduling method for a computer room switch provided by an embodiment of the present application, the method comprising the following steps: Step S1, adding a dynamic priority field to the data frame structure; setting the dynamic priority of each data frame according to the waiting time of each data frame.

[0021] In industrial production scenarios, different data has different impacts on the stability and security of the production process. The traditional static priority setting method cannot meet the dynamic network environment of the factory campus network and the data transmission requirements with high real-time requirements. By introducing a dynamic priority field, this application can more flexibly reflect the priority changes of data during transmission, enabling it to better adapt to the complex and changing data transmission requirements in industrial production.

[0022] A dynamic priority field is added to the data frame structure, and the range of the dynamic priority field is set to 0~7, represented by a 1-byte field, and the initial value of the dynamic priority of all data frames is set to 0.

[0023] The Ethernet data frame structure after adjustment in this application is: [Destination address field, source address field, type / length field, priority field, timestamp field, dynamic priority field, data field, frame check sequence field].

[0024] Among them, the destination address field is 6 bytes long, identifying the MAC address (LAN address) of the frame receiver; the source address field is 6 bytes long, identifying the MAC address of the frame sender; the type / length field is 2 bytes long, indicating the type or length of the subsequent data; the priority field is 3 bits long, indicating the priority transmission level of the data frame, with a value range of 0 to 7. The IEEE 802.1Q standard directly assigns priorities to different data frames; the dynamic priority field is 3 bits long, used to identify the dynamic priority of the data frame, and its value range is recorded as , preferably, in the embodiment of the present application, Set the value of 0 to The value of is set to 7 and the value range is 0~7; the data field is variable length, the default range is 46-1500 bytes, and the actual use process changes according to the specific protocol and requirements; the frame check sequence field length is 4 bytes and is used to detect whether there are errors in the frame during transmission.

[0025] The timestamp field is 4 bytes long and is used for the sending time of the data frame.

[0026] It should be noted that this application only provides one setting method for setting the value range of the dynamic priority. The implementer can set the value range of the dynamic priority according to actual conditions, and this application does not impose any specific restrictions.

[0027] Among them, the dynamic priority is adjusted in real time according to the waiting time of the data frame, thereby ensuring that data with a long waiting time can be transmitted in time, reducing the risk of data frame loss, and improving the coordination and stability of the entire industrial production process.

[0028] Specifically, the initial dynamic priority of each data frame is set to 0, indicating that it has not experienced a waiting period. The dynamic priority value increases by 1 for each additional contention period during which the data frame waits to be sent, and remains unchanged when it increases to 7. The contention period length for 10Mbit / s Ethernet in this application is 51.2 .

[0029] Step S2: preset a sliding window, and construct a weighted throughput of each switch interface within the sliding window based on the length, priority, and dynamic priority of each data frame sent by each switch interface within the sliding window.

[0030] In the switches in the factory campus network computer room, the usage and importance of different links vary. The throughput of the switch interface, the average number of contention periods within the data frame transmission time, and the priority and dynamic priority of the data frame can fully reflect the collision and congestion levels of different links.

[0031] First, a sliding window is set to capture the dynamic changes in the link in a timely manner, making congestion assessment more accurate and real-time. This application sets the sliding window time length to 100ms. As other embodiments of this application, implementers can set the sliding window time length according to actual circumstances.

[0032] Traditional congestion assessment methods often focus solely on a single metric, link throughput, and fail to comprehensively consider factors such as data frame priority and collisions. This application uses multiple metrics to comprehensively assess link congestion, better adapting to complex data transmission scenarios in industrial production and providing a more accurate basis for subsequent data scheduling. This effectively reduces frame loss due to collisions and improves data scheduling efficiency.

[0033] Furthermore, for each interface of each switch in the computer room, the weighted throughput of the switch interface within the sliding window is calculated based on the priority, dynamic priority, and data frame length of the data frame within the sliding window. The expression is: Where, Indicates the weighted throughput of the current switch interface within the sliding window; Indicates the time length of the sliding window; Indicates the number of data frames sent by the current switch interface within the sliding window; Indicates the number of packets sent by the current switch interface within the sliding window. The length of the data frame; and They represent the first Priority and dynamic priority of each data frame; and Respectively represent the highest priority and highest dynamic priority of the data frame, both of which are set to 7 in this application; is a very small positive number, which is used to avoid the value of the numerator being 0. Preferably, in the embodiment of the present application, The value of is set to 1. As other embodiments of this application, the implementer can set it according to the actual situation. The value of . is the first sum value, is the second sum.

[0034] Calculating weighted throughput by setting the weight as a combination of the data frame priority and dynamic priority can more accurately reflect the importance of data and the usage of network resources, thereby providing strong support for optimizing network resource allocation, improving the flexibility and adaptability of scheduling algorithms, and avoiding network congestion.

[0035] Step S3: Calculate the average number of contention periods for each data link based on the data frame collision conditions of each data link within the sliding window; and determine the collision severity of the switch interface within the sliding window based on the overall distribution characteristics of the average number of contention periods for all data links of the switch interface.

[0036] First, within the sliding window, the ratio of the number of contention periods experienced by each data link in the computer room switch interface to the number of data frames sent is recorded as the average contention period for that data link. The average contention period directly reflects the collision situation of the link. A higher number of contention periods indicates that data frames on the link frequently collide, leading to increased transmission delay and a higher risk of data frame loss. By incorporating the average contention period into the collision severity assessment, the collision severity of the link can be intuitively reflected.

[0037] Furthermore, each switch interface may have multiple links. For each data link of the switch interface, the collision severity of the switch interface within the sliding window is calculated based on the data frame transmission status of the data link of the interface within the sliding window. The expression is: Where, is the collision severity of the current switch interface within the sliding window; Indicates the number of data links on the current switch interface; Indicates the number of packets passing through the current switch interface in the sliding window. Average number of contention periods per data link; Indicates the maximum value of the average contention period of all data links passing through the current switch interface within the sliding window; is a preset minimum positive number, the purpose of which is to prevent the denominator from being zero. Preferably, in the embodiment of the present application, The value of is set to 0.001. As other embodiments of this application, the implementer can set it according to the actual situation. value.

[0038] Since the probability of link collision is small, usually only a few links have serious collisions, and their average contention periods are large. Therefore, to avoid affecting the use of other interfaces on the entire link due to serious collisions on a single link, the maximum value of the average contention periods of all links passing through the interface is used to normalize the collision severity, thereby improving the utilization of switch communication resources in subsequent dynamic data scheduling.

[0039] This value reflects the collision status and transmission efficiency of all links on an interface. A high collision severity indicates frequent collisions on all links on the interface, significantly impacting data transmission. Subsequently, appropriate congestion control measures may be required to improve the overall transmission efficiency and reliability of the interface.

[0040] Step S4: for all interfaces that each data link passes through, determine the congestion characteristic value of each data link in the sliding window based on the weighted throughput and the collision severity of the interface.

[0041] Within the sliding window, each data link in the computer room switch passes through multiple interfaces. For each data link in the computer room switch within the sliding window, the congestion characteristic value is calculated based on the weighted throughput and collision severity of each interface in the data link. The expression is: Where, represents the congestion characteristic value of the mth data link of the switch within the sliding window, which is used to evaluate the congestion status of the data link; S represents the number of interfaces that the mth data link of the switch passes through within the sliding window; Indicates the collision severity of the sth interface of the switch through which the mth data link passes within the sliding window; represents the weighted throughput of the sth interface of the switch through which the mth data link passes within the sliding window; It represents the maximum value of the weighted throughput of all interfaces passed by the mth data link of the switch within the sliding window. is the first ratio.

[0042] On the one hand, weighted throughput takes into account both link throughput and data frame priority. High-priority data frames have a greater impact on link transmission efficiency, while the transmission of low-priority data frames has a relatively smaller impact on overall link performance. Weighted throughput more accurately reflects link congestion when transmitting high-priority data.

[0043] On the other hand, throughput directly reflects the link's transmission capacity, while collision severity weight reflects the link's transmission efficiency. Combining these two metrics provides a comprehensive assessment of link congestion. Collision severity varies over time, and the link's congestion status also changes dynamically. The congestion characteristic value reflects the current link status in real time, providing a basis for subsequent dynamic data scheduling.

[0044] Step S5: Optimizing and adjusting the data transfer method of the switch based on the dynamic priority of each data frame and the congestion characteristic value of each data link.

[0045] In industrial production, the real-time and integrity of data are crucial. By comparing multiple metrics such as delivery time, priority, and dynamic priority, we can ensure that data is transmitted in the right order, meeting the data transmission requirements of different production modules.

[0046] Buffer management and packet loss policy development are crucial for ensuring the stability and reliability of data scheduling. Proper use of remaining buffer capacity and a packet loss priority boosting mechanism can effectively protect the transmission of high-priority data during network congestion.

[0047] The data of the current sliding window is scheduled according to the congestion characteristic value of the previous sliding window. The scheduling process is as follows: After receiving a data frame, the switch first compares the sending time of the data frame and prioritizes the data frame with an earlier sending time. If the sending time is the same, the priority fields of the data frames are compared and the data frame with higher priority is transmitted first; If the priorities are the same, the dynamic priority fields are further compared, and the data frame with the higher dynamic priority is transmitted first; Based on the remaining buffer capacity and the size of the data frame, it is determined whether the data frame can be stored in the buffer. If the remaining buffer capacity is insufficient to store the data frame, the packet is discarded according to the automatic repeat request (ARQ) packet loss policy. It should be noted that this application only provides one packet loss strategy. There are many existing packet loss strategies. Implementers can also use other packet loss strategies to process data frames. This application does not make specific restrictions. Data frames are assigned to links based on the value of the dynamic priority field and the link congestion status in the previous sliding window. The highest dynamic priority data frame is assigned to the link with the smallest congestion characteristic value in the previous sliding window for transmission, preventing further deterioration of the congested link. The data frames in the buffer area are sorted in descending order according to the dynamic priority to ensure that the data frames with high dynamic priority can be transmitted first.

[0048] By dynamically adjusting the link allocation and queuing mechanism, it is possible to flexibly respond to these changes, reduce frame loss due to exceeding the cache area, and avoid data frame retransmission, thereby improving the overall data scheduling efficiency of the campus network computer room switch, enhancing the real-time performance of data exchange between different production modules, and further improving the adaptability of the computer room switch data scheduling to different data priorities, ensuring the coordinated and stable progress of the entire industrial production process.

[0049] The diagram of the process of obtaining weighted throughput is as follows: Figure 2 shown.

[0050] Based on the same inventive concept as the above method, an embodiment of the present application also provides a data scheduling system for a computer room switch, including a memory, a processor, and a computer program stored in the memory and running on the processor. When the processor executes the computer program, the steps of any one of the above-mentioned data scheduling methods for a computer room switch are implemented.

[0051] In summary, the embodiments of the present application provide a data scheduling method for computer room switches. By adding a dynamic priority field to the existing switch data frame structure, the method represents the dynamic changes in priority caused by data frame queuing, reduces frame waiting delay, and ensures real-time data exchange between different production modules. Based on the throughput and average number of contention periods of the switch interface within the sliding window, the congestion characteristic value of each data link, and further based on the priority of the data frames in the link, the switch data transmission link is dynamically adjusted, thereby reducing the link congestion level during subsequent data scheduling, reducing frame loss due to collisions, and improving data scheduling efficiency. By comparing the priorities of different data frames and dynamic priorities, data scheduling is dynamically adjusted to achieve dynamic data scheduling for the switches in the factory campus network computer room, reducing frame loss caused by exceeding the cache area and avoiding data frame retransmission. While improving the overall data scheduling efficiency of the switches in the campus network computer room, it also enhances the real-time nature of the exchange of different production data, thereby improving the adaptability of the computer room switch data scheduling to different data priorities.

[0052] It should be noted that the order in which the embodiments of the present application are presented is for illustrative purposes only and does not necessarily represent the superiority or inferiority of the embodiments. Furthermore, the above descriptions are of specific embodiments of the present application. Furthermore, the processes depicted in the accompanying drawings do not necessarily require the specific order or sequential sequence shown to achieve the desired results. In certain embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0053] The various embodiments in this application are described in a progressive manner, and the same or similar parts between the various embodiments can be referred to each other. Each embodiment focuses on the differences from other embodiments.

[0054] The above description is only a preferred embodiment of the present application and is not intended to limit the present application. Any modifications, equivalent replacements, improvements, etc. made within the principles of the present application shall be included in the scope of protection of the present application.

Claims

1. A data scheduling method for a computer room switch, characterized in that: The method comprises the following steps: Add a dynamic priority field to the data frame structure; set the dynamic priority of each data frame according to the waiting time of each data frame; A sliding window is preset, and based on the length, priority, and dynamic priority of each data frame sent by each switch interface within the sliding window, a weighted throughput of each switch interface within the sliding window is constructed; Calculating an average number of contention periods for each data link based on data frame collisions of each data link within the sliding window; determining a collision severity of the switch interface within the sliding window based on an overall distribution characteristic of the average number of contention periods for all data links of the switch interface; For all interfaces that each data link passes through, determining a congestion characteristic value of each data link in a sliding window based on the weighted throughput and the collision severity of the interface; Based on the dynamic priority of each data frame and the congestion characteristic value of each data link, the data mobilization method of the switch is optimized and adjusted.

2. The data scheduling method for a computer room switch according to claim 1, wherein: The process of obtaining the dynamic priority is as follows: The initial dynamic priority of each data frame is set to the lowest dynamic priority. When the waiting time for each data frame to be sent increases by the length of the contention period, the corresponding dynamic priority value increases by 1. When it increases to the preset highest dynamic priority, it remains unchanged.

3. The data scheduling method for a computer room switch according to claim 2, wherein: The process of obtaining the weighted throughput of the switch interface within the sliding window is as follows: Calculate the sum of the priority of each data frame and the dynamic priority, and record it as the first sum; calculate the sum of the highest priority of the data frame and the highest dynamic priority, and record it as the second sum; The weighted throughput of each interface of the switch within the sliding window is determined based on the length of each data frame sent by each interface of the switch within the sliding window, the first sum value, and the second sum value.

4. The data scheduling method for a computer room switch according to claim 3, wherein: The expression of the weighted throughput is: Where thp represents the weighted throughput of the current switch interface in the sliding window; T represents the time length of the sliding window; N represents the number of data frames sent by the current switch interface in the sliding window; L n Indicates the length of the nth data frame sent by the current switch interface within the sliding window; P n and Q n They represent the priority and dynamic priority of the nth data frame sent by the current switch interface in the sliding window; P max and Q max They represent the highest priority and the highest dynamic priority of the data frame respectively; ε1 is a preset minimum positive number; Among them, P n +Q n is the first sum value, P max +Q max is the second sum.

5. The data scheduling method for a computer room switch according to claim 1, wherein: The process of obtaining the average contention period number is as follows: In the sliding window, the ratio of the number of contention periods for sending data frames on each data link of the switch interface to the number of data frames sent is calculated, and recorded as the average number of contention periods for each data link.

6. The data scheduling method for a computer room switch according to claim 1, wherein: The expression of the collision severity is: Where, coll is the collision severity of the current switch interface within the sliding window; M represents the number of data links of the current switch interface; C m C represents the average contention period of the mth data link passing through the current switch interface within the sliding window; max It represents the maximum value of the average number of contention periods of all data links passing through the current switch interface within the sliding window; ε2 is a preset very small positive number.

7. The data scheduling method for a computer room switch according to claim 1, wherein: The process of obtaining the congestion characteristic value of each data link in the sliding window is as follows: Within the sliding window, obtain each interface through which each data link of the switch passes, and calculate the ratio of the weighted throughput of each interface through which each data link passes to the maximum weighted throughput of all interfaces passed through, which is recorded as a first ratio; Based on the collision severity of each interface passed by each data link and the first ratio, a congestion characteristic value of each data link in the sliding window is determined.

8. The data scheduling method for a computer room switch according to claim 8, wherein: The congestion characteristic value is: the sum of the products of the collision severity of all interfaces through which the data link passes within the sliding window and the first ratio.

9. The data scheduling method for a computer room switch according to claim 1, wherein: The process of optimizing and adjusting the data transfer method of the switch is as follows: After receiving the data frame, the switch compares the sending time of the data frame and processes the data frame with earlier sending time first; If the sending time is the same, the priority fields of the data frames are compared and the data frame with higher priority is transmitted first; When the priorities are the same, the dynamic priority fields are compared and the data frame with the higher dynamic priority is transmitted first; Determine whether the data frame can enter the cache based on the remaining capacity of the cache and the size of the data frame; If the remaining capacity of the buffer is insufficient to store the data frame, packet loss processing needs to be performed according to the packet loss strategy; Data frames are assigned to links based on the value of the dynamic priority field and the existing link congestion: the highest dynamic priority data frame is assigned to the link with the smallest congestion characteristic value within its previous sliding window for transmission; The data frames in the buffer area are sorted in descending order according to the dynamic priority to ensure that the data frames with high dynamic priority can be transmitted first.

10. A data scheduling system for a computer room switch, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 9 are implemented.

Images