Virtual link scheduling method and device based on time window

Abstract

The embodiment of the invention discloses a virtual link scheduling method based on a time window, and the method comprises the steps: determining the type of a message according to the reference information of the message; determining a virtual link corresponding to the message according to the type of the message, and generating a virtual link scheduling strategy based on a time window; and performing scheduling operation of the virtual link according to the virtual link scheduling strategy so as to enable the message to be transmitted between the end systems.

Description

Technical Field

[0001] This application relates to the technical field of avionics systems, and in particular, to a virtual link scheduling method and device based on a time window. Background Art

[0002] Most of the existing large aircraft adopt an integrated modular avionics system architecture (IMA, hereinafter referred to as IMA). The IMA system provides computing resources, network resources, interface resources, etc. for the aircraft's on-board systems. The data transmission function of the avionics core processing system is implemented through the backbone network full-duplex switched Ethernet (Avionics Full Duplex Switched Ethernet, AFDX), which is similar to a highway for aircraft data transmission built using the AFDX bus. The data of each system is directly connected to the backbone network or indirectly connected to the core network through conversion into Arinc664 data for communication.

[0003] AFDX is based on Ethernet technology, but different from Ethernet, it is a partitioned network that adopts the mechanism of virtual links (VLs) and can provide guaranteed network bandwidth, sequential integrity, time integrity, and delay and jitter within a certain range for all users. The AFDX end system (End System, ES) is a component of the AFDX network. The main function of the end system is to provide a secure and reliable data exchange between avionics subsystems. In an avionics network, the guaranteed service of the ES provides an upper limit of the delay boundary and a constant bandwidth. Therefore, a logical open connection method is adopted between a sending node and one or more receiving nodes. The guaranteed service of the ES has the following characteristics:

[0004] 1) The bandwidth and delay boundary are determined (guaranteed);

[0005] 2) The specific delay jitter of an information flow is not fixed. At a given time, because it depends on the global network traffic. However, in any case, a boundary of the delay jitter can be calculated.

[0006] The ES exchanges Ethernet frames through the virtual link VL. An ES is the source of 0 to multiple VLs. In an avionics network, any one VL can only have one ES as the source.

[0007] Traditional AFDX end systems adopt a polling scheduling strategy, polling based on VLs and sending data frame information from the end system. Generally, a fast fair polling strategy is adopted, where all VLs have the same priority to ensure the fairness of scheduling. However, since the data transmission by the AFDX end system and the data generation by the airborne system are asynchronous, data may appear concentrated at a certain moment. When different VLs appear in the queue simultaneously, congestion will occur, resulting in excessive jitter and an uncontrollable jitter value. For airborne systems with strong real-time requirements, an uncontrollable data transmission interval will cause the system to fail to complete data processing on time, thus resulting in the integrated modular avionics system platform being unable to meet the functions of airborne systems with strong real-time requirements. Therefore, when designing the AFDX end system, reducing the upper limit of delay jitter is very necessary for improving time determinacy and system reliability. Currently, the design of the end system is based on the maximum jitter of VLs being less than 500 us, and strong real-time applications do not reside on the IMA platform temporarily.

[0008] Chinese patent document CN117971298A proposes a method for generating the configuration of an AFDX end system based on an ICD interface control document and gives the specific steps for generating the configuration of the AFDX end system. This document focuses on improving the flexibility and efficiency of the device configuration process, which is the configuration of the end system, but does not involve the design of a scheme to change the virtual link scheduling.

[0009] Chinese patent document CN117834313A relates to a host interface applicable to a time-triggered network end system, including a sending host interface and a receiving host interface, which can be applied to the reliable transmission of service frames between the HOST host and the end system interface of the time-triggered network and the AFDX network end system. This document focuses on the host interface but does not involve the design of a scheme to change the virtual link scheduling.

[0010] Chinese patent document CN114726678A discloses a scheduling method and device for AFDX bus data, dividing each virtual link into at least one sub-virtual link, dividing the bandwidth of the virtual link based on the sub-virtual link, each sub-virtual link corresponding to at least one communication port, each communication port corresponding to a sub-virtual link and an application task. When performing data scheduling, a target virtual link that meets the bandwidth allocation interval period is found from each virtual link, and according to the sub-virtual link polling scheduling strategy, a target communication port that meets the preset message data scheduling conditions is found from the communication ports corresponding to the target virtual link, and the bus data scheduling is completed using the target communication port. A polling scheduling strategy is still adopted between multiple sub-virtual links.

[0011] Chinese Patent Document CN115567156A discloses a new delay analysis method for an ARINC664 transmission table mode terminal, which arranges the data frames on each VL in the order of scheduling on the time axis at the shortest interval of two frames according to the transmission table. This document focuses on calculating better delay results, but does not involve the design of a scheme to change the virtual link scheduling.

[0012] It can be seen that what the prior art mainly focuses on is the configuration generation of the end system, interfaces, delay analysis, and division of sub-virtual links, and does not really involve the design of the end system and the way to change the virtual link scheduling, and thus cannot achieve the purpose of reducing the maximum delay jitter. Summary of the Invention

[0013] The embodiments of this specification provide a virtual link scheduling method and device based on a time window to solve the technical problem of how to improve the virtual link scheduling efficiency.

[0014] The embodiments of this specification provide a virtual link scheduling method based on a time window, and the method includes:

[0015] Determine the category of the message according to the reference information of the message;

[0016] Determine the virtual link corresponding to the message according to the category of the message, and generate a virtual link scheduling strategy based on a time window;

[0017] Perform a scheduling operation on the virtual link according to the virtual link scheduling strategy, so that the message is transmitted between end systems.

[0018] Optionally, the categories of the message include critical application messages and non-critical application messages;

[0019] Determining the virtual link corresponding to the message includes:

[0020] First determine the virtual links corresponding to each critical application message, and then determine the virtual links corresponding to each non-critical application message.

[0021] Optionally, the virtual link scheduling strategy includes a time window scheduling table, the time window scheduling table contains multiple time windows, and the virtual link is matched with a time window.

[0022] Optionally, the method further includes:

[0023] For any one of the virtual links, determine the time window matched by the virtual link according to the BAG and period of the virtual link.

[0024] Optionally, the size of the time window is determined according to the period of the virtual link.

[0025] Optionally, performing scheduling operations on the virtual link according to the virtual link scheduling policy includes:

[0026] Performing scheduling on the virtual links matched by each time window within each first period in sequence according to the order of each first period; wherein each first period includes a plurality of time windows with the same quantity;

[0027] After scheduling all the virtual links matched by the time windows within the second period is completed, regenerating a virtual link scheduling policy, and performing scheduling operations on the virtual link according to the newly generated virtual link scheduling policy; wherein the second period includes a plurality of first periods.

[0028] Optionally, performing scheduling operations on the virtual link according to the virtual link scheduling policy includes:

[0029] For any time window, determining the virtual link matched by this time window according to the virtual link scheduling policy, and sending the data frame on the virtual link matched by this time window.

[0030] Optionally, performing scheduling operations on the virtual link according to the virtual link scheduling policy includes:

[0031] For any one of the virtual links, when reaching the time window matched by this virtual link, sending the data frame on this virtual link.

[0032] Optionally, performing scheduling operations on the virtual link according to the virtual link scheduling policy to enable messages to be transmitted between end systems includes:

[0033] For any one of the virtual links, when performing scheduling operations on this virtual link according to the virtual link scheduling policy, sending the data frame on this virtual link to the destination end system.

[0034] An embodiment of this specification provides a virtual link scheduling device based on time windows, and the device includes:

[0035] An information collection module, configured to determine the category of the message according to the reference information of the message;

[0036] A policy formulation module, configured to determine the virtual link corresponding to the message according to the category of the message, and generate a virtual link scheduling policy based on time windows;

[0037] A message transmission module, configured to perform scheduling operations on the virtual link according to the virtual link scheduling policy to enable messages to be transmitted between end systems.

[0038] At least one of the above technical solutions adopted in the embodiments of this specification can achieve the following beneficial effects:

[0039] For the target application, the virtual link scheduling is performed through a virtual link scheduling policy based on a time window to transmit the messages of each target application between end systems, which can improve the virtual link scheduling efficiency, further restrict the worst jitter condition of data frames, control the jitter range of virtual links within the required range, reduce the upper limit of VL delay jitter, reduce the congestion condition of each VL, improve the time determinacy of AFDX data transmission, and thus increase the possibility of the strong real-time application staying. Description of the Drawings

[0040] To more clearly illustrate the technical solutions in the embodiments of this specification or the prior art, the following will briefly describe the drawings required for the description of the embodiments of this specification or the prior art. Obviously, the following only shows the drawings required for some embodiments of this application. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained based on these drawings.

[0041] Figure 1 It is a schematic flowchart of the virtual link scheduling method based on a time window provided by the first embodiment of this specification.

[0042] Figure 2 It is a schematic flowchart of the virtual link scheduling process in the first embodiment of this specification.

[0043] Figure 3 It is a schematic diagram of the matching between the virtual link and the time window in the first embodiment of this specification.

[0044] Figure 4 It is a schematic flowchart of the data sending process in the first embodiment of this specification.

[0045] Figure 5 It is a schematic structural diagram of the virtual link scheduling device based on a time window provided by the second embodiment of this specification. Detailed Embodiments

[0046] To enable those skilled in the art to better understand the technical solutions in this specification, the following will clearly and completely describe the technical solutions in the embodiments of this specification in conjunction with the drawings. Obviously, the embodiments involved in the detailed embodiments are only some embodiments of this application, rather than all embodiments. All other embodiments obtained by those of ordinary skill in the art without creative efforts based on the embodiments in the detailed embodiments shall fall within the protection scope of this application.

[0047] The first embodiment of this specification (hereinafter referred to as "Embodiment 1") provides a virtual link scheduling method based on a time window. The execution subject of Embodiment 1 includes, but is not limited to, a terminal, a server, an operating system, or an application program. That is, the execution subject can be diverse and can be set, used, or transformed according to needs. In addition, a third-party application program can assist the execution subject in executing Embodiment 1. For example, the method provided in Embodiment 1 can be executed by a server, and a corresponding application program can be installed on a terminal (which can be held by a user). Data transmission can occur between the terminal or the application program and the server to assist the server in executing the method provided in Embodiment 1.

[0048] Referring to Figure 1 and Figure 2 , the virtual link scheduling method based on a time window provided by Embodiment 1 includes:

[0049] S101: Determine the category of the message according to the reference information of the message;

[0050] In an AFDX network or AFDX protocol, a message is transmitted between a source-end system (or sending-end system) and a destination-end system (or receiving-end system).

[0051] In Embodiment 1, the category (or characteristics) of the message can be determined according to the reference information of the message. Among them, the reference information includes, but is not limited to, information about the function or application that generates the message (including the function or application where IMA resides) and / or information about the function or application that receives the message and / or the requirements of the message for jitter and / or latency and / or reliability. Embodiment 1 does not limit the specific content of the reference information and how to collect or determine the reference information.

[0052] Preferably, the category of the message can include critical application messages and non-critical application messages. For example, a message generated by a critical application and received by a critical application is a critical application message; a message generated by a non-critical application and received by a critical application can also be a critical application message; a message generated by a critical application and received by a non-critical application is a non-critical application message; a message generated by a non-critical application and received by a non-critical application is a non-critical application message. Embodiment 1 does not limit the division of critical applications and non-critical applications.

[0053] S103: Determine the virtual link corresponding to the message according to the category of the message, and generate a virtual link scheduling policy based on a time window;

[0054] In Embodiment 1, according to the category of the message, the virtual link corresponding to the message can be determined, and a virtual link scheduling policy based on a time window can be generated.

[0055] Among them, determining the virtual link corresponding to a message may include: first determining the virtual links corresponding to each critical application message, and then determining the virtual links corresponding to each non-critical application message. The virtual links corresponding to each critical application message and non-critical application message form a virtual link list. For example Figure 2 in, assuming there are m critical application messages and n non-critical application messages, the virtual links corresponding to these m critical application messages can be allocated first. For example, the virtual links corresponding to these m critical application messages are VL i1 , VL i2 , VL i3 , …, VL im . After that, the virtual links corresponding to these n non-critical application messages are allocated. For example, the virtual links corresponding to these n non-critical application messages are VL j1 , VL j2 , VL j3 , …, VL jn . Between allocating the virtual links corresponding to these n critical application messages and allocating the virtual links corresponding to these n non-critical application messages, there can be other operations, which are not limited in Embodiment 1.

[0056] In Embodiment 1, the generated virtual link scheduling policy may include a time window scheduling table. The time window scheduling table contains multiple time windows, and the virtual link corresponding to a message is matched with a time window.

[0057] The following describes how to generate the time window scheduling table:

[0058] The time axis can be divided into configurable time windows, and each time window represents a certain time length. Among them, the size of the time window (i.e., the time length represented by the time window) can be determined according to the BAG value and the period of the virtual link (referring to the time length required for the virtual link to transmit a data frame once, for example, within 0 - 125 us). Preferably, a single time window is 25 us or an integer multiple of 25 us, which is convenient for reducing jitter.

[0059] In Embodiment 1, a first period and a second period can be set. Each first period contains the same number of multiple time windows, and the second period includes multiple first periods. Generally, the BAG range of the virtual link is [1, 128], so the first period can be set to 1 ms, and the second period is set to 128 ms. For example, if a single time window is 25 us, then the first period contains 40 time windows, the second period contains 128 first periods, and the forms of the first period and the second period are as shown in Figure 3 . In addition, if the BAG range of the virtual link changes in actual situations, for example, the BAG range expands, then the second period can also change accordingly, for example, keeping the second period equal to the actual maximum value of the virtual link BAG.

[0060] Reference Figure 2 After determining the virtual links corresponding to each key application message, the virtual links corresponding to each key application message can be first matched with the time window. After matching the virtual links corresponding to each key application message with the time window, the virtual links corresponding to each non-key application message are then matched with the time window.

[0061] The matching principles between virtual links and time windows include:

[0062] 1. Each time window corresponds to at most one virtual link, and each virtual link corresponds to one or more time windows.

[0063] 2. For a single virtual link, if the virtual link corresponds to multiple time windows within a single first period, then these multiple time windows belonging to the same first period corresponding to the virtual link are consecutive.

[0064] After matching the virtual links with the time windows, the virtual links can be scheduled according to the time windows, thus forming a virtual link scheduling policy based on time windows. In this case, a time window scheduling table (i.e., a table used for virtual link scheduling, such as Figure 3 shown) is formed.

[0065] Preferably, for any virtual link, the time window matched by the virtual link is determined according to the BAG and period of the virtual link. The following is a specific description:

[0066] For any virtual link, the BAG of the virtual link can be determined, for example, determined among the values of 1, 2, 4, 8, 16, 32, 64, 128 (unit: ms). If the BAG of the virtual link is 1 millisecond, it means that 128 data transmissions are required on the virtual link in the second period; if the BAG of the virtual link is 2 milliseconds, it means that 64 data transmissions are required on the virtual link in the second period; and so on. If the BAG of the virtual link is a, then 128 / a data transmissions are required on the virtual link in the second period.

[0067] Since the second period contains 128 first periods, the virtual link can be matched with one or more time windows within the first periods according to the number of data transmissions required on the virtual link in the second period. The matching principles between the virtual link and the time window include:

[0068] 1. If the BAG of the virtual link is a, then the time windows corresponding to the virtual link need to be distributed within 128 / a first periods.

[0069] 2. In each of these 128 / a first periods, the number of time windows (denoted as b) matched by the virtual link is the same, and b is determined according to the following formula:

[0070] b=Lmax*8*10 3 *c / B.

[0071] Wherein, Lmax represents the maximum virtual link frame length, that is, the maximum length of the data frame that can be sent on the virtual link; c represents the number of time windows contained in the first cycle; B represents the physical link bandwidth where the virtual link is located. If the result of the above formula is not an integer, b is rounded up.

[0072] 3. Starting from the first first cycle, in every a first cycles, there is b time windows matching the virtual link in one first cycle, and the b time windows matching the virtual link in the same first cycle are continuous.

[0073] For example, if the BAG of the virtual link is 2ms, the time window corresponding to the virtual link needs to be distributed in 64 first cycles. In each of the 64 first cycles, the virtual link matches b time windows, and starting from the first first cycle, in every 2 first cycles, there are b time windows matching the virtual link in one and only one first cycle, and the b time windows matching the virtual link in the same first cycle are continuous.

[0074] 4. For any first cycle, if there are multiple virtual links that match the time windows in the first cycle, the matching starts from the first time window in the first cycle. Specifically, the time window that does not match the virtual link is called an empty time window. First, the first virtual link among the multiple virtual links is matched from the first time window in the first cycle, and the number of time windows matched by the first virtual link is calculated as above; then the second virtual link among the multiple virtual links is matched from the first empty time window of the first cycle, and the number of time windows matched by the second virtual link is calculated as above; and so on, when it is the turn of a certain virtual link among the multiple virtual links, the virtual link that is in turn is matched from the first empty time window of the first cycle, and the number of time windows matched by the virtual link that is in turn is calculated as above, until all the multiple virtual links have completed the matching with the time windows in the first cycle.

[0075] Specifically, for the virtual links corresponding to each critical application message and non-critical application message, as mentioned above, first match the virtual links corresponding to each critical application message with the time window. After matching the virtual links corresponding to each critical application message with the time window, then match the virtual links corresponding to each non-critical application message with the time window. For example, refer to Figure 2 , first VL i1 , VL i2 ,VL i3 ,…,VL imMatch according to the above matching principle and time window respectively, and then the VL j1 , VL j2 , VL j3 , …, VL jn Match according to the above matching principle and time window respectively.

[0076] After the above content, the matching between the virtual link and the time window is achieved, and the time window scheduling table is obtained. For example Figure 3 shows the effect of matching VL1 with a period of 100 us (i.e., 1 in the figure) and VL2 with a period of 200 us (i.e., 2 in the figure) with the time window within a single first period.

[0077] After determining the matching relationship between the virtual links corresponding to each critical application message and non-critical application message and the time window, a virtual link scheduling strategy based on the time window is formed, that is, a strategy for scheduling virtual links according to the time window.

[0078] S105: Perform the scheduling operation of the virtual link according to the virtual link scheduling strategy, so that messages are transmitted between end systems.

[0079] After obtaining the virtual link scheduling strategy, the scheduling operation of the virtual link can be performed according to the virtual link scheduling strategy, so that messages are transmitted between end systems.

[0080] Among them, performing the scheduling operation of the virtual link according to the virtual link scheduling strategy may include: scheduling the virtual links matching each time window within each first period in sequence according to the order of each first period; after the scheduling of the virtual links matching all time windows within the second period is completed, regenerating the virtual link scheduling strategy and performing the scheduling operation of the virtual link according to the newly generated virtual link scheduling strategy.

[0081] Specifically, performing the scheduling operation of the virtual link according to the virtual link scheduling strategy may include: for any time window, determining the virtual link matching the time window according to the virtual link scheduling strategy and sending the data frame on the virtual link matching the time window. Or, performing the scheduling operation of the virtual link according to the virtual link scheduling strategy may include: for any of the virtual links, when the time window matching the virtual link is reached, sending the data frame on the virtual link.

[0082] Preferably, refer to Figure 4, before performing the scheduling operation of the virtual link according to the virtual link scheduling policy, the message to be transmitted can be encapsulated into a data frame and the data frame can be placed in the buffer. Then, performing the scheduling operation of the virtual link according to the virtual link scheduling policy to enable the message to be transmitted between end systems may include: for any virtual link, when performing the scheduling operation of this virtual link according to the virtual link scheduling policy, sending the data frame on this virtual link in the buffer to the destination end system.

[0083] The following further describes the virtual link scheduling operation (which can be performed by an end system):

[0084] As described above, since the time window scheduling table has been established, each time window in the time window scheduling table represents a period of time, so each time window has a time sequence. Correspondingly, each first cycle also represents a period of time, so each first cycle also has a time sequence. Then, starting from the first non-empty time window in the first first cycle, in the order of time windows, every time a non-empty time window is reached, schedule the data frame on the virtual link matched by this non-empty time window within the time range represented by this non-empty time window (when the BAG shaping of the virtual link passes), and skip the empty time window (if any). If there are multiple consecutive non-empty time windows that match the same virtual link, then within the time range represented by these multiple consecutive non-empty time windows, schedule the data frame on the virtual link matched by these multiple consecutive non-empty time windows (when the BAG shaping of the virtual link passes). This is equivalent to forming a transmission queue for data frames.

[0085] When all the virtual links matched by the non-empty time windows in the second cycle have been scheduled, regenerate a new virtual link scheduling policy based on time windows and perform the scheduling operation of the virtual link according to the newly generated virtual link scheduling policy. That is to say, repeatedly generate a new virtual link scheduling policy based on the second cycle and perform the scheduling operation of the virtual link according to the newly generated virtual link scheduling policy.

[0086] Since there is no time overlap between time windows, when scheduling virtual links in the order of time windows, the scheduled virtual links are staggered in terms of scheduling time, and there will be no situation where multiple virtual links are scheduled simultaneously, thus avoiding scheduling conflicts of virtual links. Since the time window matched by a single virtual link within a single first cycle in the time window scheduling table is determined according to the BAG of the virtual link, this ensures that within every 128 ms, each virtual link can be allocated an appropriate time for data frame transmission, and the data frame sending interval of a single virtual link (i.e., the interval between "the previous first cycle with a time window matching this virtual link" and "the next first cycle with a time window matching this virtual link") exactly matches its BAG, that is, a single virtual link can transmit data frames according to its BAG. In this way, the occurrence of virtual link and end system delay jitter can be avoided.

[0087] Since messages are transmitted between end systems through virtual links, through the above scheduling of virtual links, the transmission of messages between end systems is also realized.

[0088] In addition, if after starting a new second cycle, there are still data frames of virtual links remaining in the buffer that were not completely sent before, the remaining data frames of virtual links are sent first, and then the virtual link scheduling is carried out according to the time windows of the new second cycle. This can also be part of the virtual link scheduling strategy.

[0089] Embodiment 1 can achieve the following beneficial effects:

[0090] In Embodiment 1, a virtual link scheduling strategy based on time windows is added on the basis of the traditional polling scheduling strategy. According to the characteristics of VL (including requirements for jitter time), different scheduling strategies are selected: if the jitter time can still meet the system delay requirements in the worst conflict scenario (system delay refers to the real-time requirements of the system receiving the message, that is, the refresh time requirement of the system receiving the message for the data sent), the polling method can be selected to reduce data delay; for target applications, such as system applications with strong real-time requirements, especially applications with the upper bound of the worst jitter time for VL data transmission less than 500 us, the messages of these applications adopt the virtual link scheduling strategy based on time windows to realize the transmission of messages of these applications between end systems. The overall planning idea of this virtual link scheduling strategy makes the delay jitter of virtual links controllable, thereby improving the virtual link scheduling efficiency and message transmission efficiency, and ensuring that the message transmission time and jitter of various applications can meet the deterministic requirements of the AFDX network.

[0091] In the first embodiment, the event-driven message array is changed into a time-driven message array. That is, the time axis is divided into configurable time windows to form a time window array, and virtual links are matched to the time windows. When the time window corresponding to a certain virtual link arrives, the AFDX network or the end system will issue a transmission command to send out the data frames on this virtual link in the buffer. By configuring the parameters of the time window (including the size of the time window and the first and second periods), it is possible to avoid the delay jitter of the virtual link, increase the determinacy of virtual link scheduling, and ensure that the frame jitter time of each virtual link meets the deterministic requirements of the network.

[0092] Through the time-window-based virtual link scheduling strategy provided by the first embodiment, the scheduling between virtual links is independent of each other, there will be no scheduling conflicts, it can constrain the worst-case jitter of data frames, and it will not affect other data frames, thereby reducing the jitter boundary of data frames and controlling the jitter range of VL within the required range, improving the scheduling efficiency of virtual links.

[0093] In the traditional event-driven virtual link scheduling, since the applications corresponding to VLs may be asynchronous with each other and the data of each VL is also asynchronous, there is a situation where the BAG timers of different VLs expire simultaneously. In the first embodiment, the virtual link is matched with the time window in the time window scheduling table. When there is a data frame to be transmitted, the data is not transmitted immediately, but is sent to the buffer, and the virtual link is scheduled according to the time window to achieve data transmission and improve data transmission efficiency.

[0094] The method provided by the first embodiment can be used in the design of the AFDX end system, provide corresponding virtual link scheduling strategies for airborne systems with different delay requirements, be able to reduce the jitter of the end system, improve the performance of the network, improve the real-time performance of bus transmission, expand the applicable range of the AFDX network, and provide guarantee for the data transmission of strong real-time and high-reliability applications.

[0095] The second embodiment of this specification provides a time-window-based virtual link scheduling device corresponding to the method described in the first embodiment. Refer to Figure 5 , the device includes:

[0096] An information collection module 202, configured to determine the category of the message according to the reference information of the message;

[0097] A policy formulation module 204, configured to determine the virtual link corresponding to the message according to the category of the message, and generate a time-window-based virtual link scheduling policy;

[0098] A message transmission module 206, configured to perform scheduling operations on the virtual link according to the virtual link scheduling policy, so that messages are transmitted between end systems.

[0099] Optionally, the categories of the messages include critical application messages and non-critical application messages;

[0100] Determining the virtual link corresponding to the message includes:

[0101] First, determine the virtual links corresponding to each critical application message, and then determine the virtual links corresponding to each non-critical application message.

[0102] Optionally, the virtual link scheduling policy includes a time window schedule, the time window schedule contains multiple time windows, and the virtual link is matched with a time window.

[0103] Optionally, the policy formulation module 204 is further configured to, for any one of the virtual links, determine the time window matched by the virtual link according to the BAG and the period of the virtual link.

[0104] Optionally, the size of the time window is determined according to the period of the virtual link.

[0105] Optionally, performing the scheduling operation of the virtual link according to the virtual link scheduling policy includes:

[0106] In the order of each first period, sequentially perform the scheduling of the virtual links matched by each time window within each first period; wherein, each first period contains the same number of multiple time windows;

[0107] After all the virtual links matched by the time windows within the second period are scheduled, regenerate the virtual link scheduling policy, and perform the scheduling operation of the virtual link according to the newly generated virtual link scheduling policy; wherein, the second period contains multiple first periods.

[0108] Optionally, performing the scheduling operation of the virtual link according to the virtual link scheduling policy includes:

[0109] For any time window, determine the virtual link matched by the time window according to the virtual link scheduling policy, and send the data frame on the virtual link matched by the time window.

[0110] Optionally, performing the scheduling operation of the virtual link according to the virtual link scheduling policy includes:

[0111] For any one of the virtual links, when the time window matched by the virtual link is reached, send the data frame on the virtual link.

[0112] Optionally, the message transmission module 206 is further configured to, before performing the scheduling operation of the virtual link according to the virtual link scheduling policy, encapsulate the message to be transmitted into a data frame and put the data frame into the cache.

[0113] Optionally, performing scheduling operations on the virtual link according to the virtual link scheduling policy to enable message transmission between end systems includes:

[0114] For any of the virtual links, when performing scheduling operations on the virtual link according to the virtual link scheduling policy, send the data frames on the virtual link to the destination end system.

[0115] For parts not detailed in the second embodiment, refer to the first embodiment. The second embodiment can achieve the same beneficial effects as the first embodiment.

[0116] The above are only examples of this specification and are not used to limit this application. For those skilled in the art, various changes and modifications can be made to this application. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principle of this application shall be included within the scope of the claims of this application.

Claims

1. A virtual link scheduling method based on a time window, characterized in that The method includes: Determining the category of the message according to the reference information of the message; Determining the virtual link corresponding to the message according to the category of the message, and generating a virtual link scheduling policy based on a time window; Performing a scheduling operation on the virtual link according to the virtual link scheduling policy, so that the message is transmitted between end systems.

2. The method according to claim 1, wherein The categories of messages include critical application messages and non-critical application messages; Determining the virtual link corresponding to the message includes: First determining the virtual links corresponding to each critical application message, and then determining the virtual links corresponding to each non-critical application message.

3. The method according to claim 1, characterized in that The virtual link scheduling policy includes a time window scheduling table, the time window scheduling table contains multiple time windows, and the virtual link is matched with a time window.

4. The method according to claim 3, wherein The method further includes: For any one of the virtual links, determining the time window matched by the virtual link according to the BAG and period of the virtual link.

5. The method according to claim 1, wherein The size of the time window is determined according to the period of the virtual link.

6. The method according to any one of claims 3 to 5, characterized in that, Performing the scheduling operation on the virtual link according to the virtual link scheduling policy includes: Sequentially performing scheduling of the virtual links matched by the time windows within each first period in the order of each first period; wherein, each first period contains the same number of multiple time windows; After the scheduling of the virtual links matched by all the time windows within the second period is completed, regenerating a virtual link scheduling policy, and performing a scheduling operation on the virtual link according to the newly generated virtual link scheduling policy; wherein, the second period contains multiple first periods.

7. The method according to any one of claims 1 to 5, characterized in that Performing the scheduling operation on the virtual link according to the virtual link scheduling policy includes: For any time window, determining the virtual link matched by the time window according to the virtual link scheduling policy, and sending the data frame on the virtual link matched by the time window.

8. The method according to any one of claims 1 to 5, characterized in that, Performing the scheduling operation on the virtual link according to the virtual link scheduling policy includes: For any one of the virtual links, when the time window matched by the virtual link is reached, sending the data frame on the virtual link.

9. The method according to claim 1, wherein Performing the scheduling operation on the virtual link according to the virtual link scheduling policy, so that the message is transmitted between end systems, includes: For any one of the virtual links, when performing the scheduling operation on the virtual link according to the virtual link scheduling policy, sending the data frame on the virtual link to the destination end system.

10. A virtual link scheduling device based on a time window, characterized in that, The device includes: An information collection module, configured to determine the category of the message according to the reference information of the message; A policy formulation module, configured to determine the virtual link corresponding to the message according to the category of the message, and generate a virtual link scheduling policy based on a time window; A message transmission module, configured to perform a scheduling operation on the virtual link according to the virtual link scheduling policy, so that the message is transmitted between end systems.

Images