Network jitter analysis method and system for network static transmission mode of a664

Abstract

The application discloses a network jitter analysis method and system for an A664 network static transmission mode, and belongs to the technical field of ARINC664 network determinacy analysis. The network jitter analysis method for the A664 network static transmission mode provided by the application constructs a worst transmission scene with the maximum to-be-transmitted traffic of each window in a transmission table as a target; total traffic, cumulative traffic, to-be-transmitted traffic and residual traffic of each window are calculated in turn according to the worst transmission scene; and the maximum sending jitter of each virtual link is calculated according to the to-be-transmitted traffic. The application can accurately analyze the sending jitter upper bound of the virtual link under the static transmission mode, effectively reduces the pessimism of the analysis result, provides a more accurate theoretical basis for A664 network configuration optimization and bandwidth resource allocation, and guarantees the determinacy and real-time performance of the A664 network.

Description

Technical Field

[0001] This invention relates to the field of network jitter analysis technology, specifically to a network jitter analysis method and system for A664 network static transmission mode. Background Technology

[0002] As the core data exchange network for avionics systems, the ARINC664 network, with its deterministic transmission and high reliability, has been widely used in data communication for civil aircraft avionics systems. The ARINC664 network implements flow control for data transmission through virtual links. Each virtual link is configured with bandwidth allocation intervals and jitter parameters to ensure the determinism and real-time performance of network transmission. Currently, the multiplexing scheduling of end-system output ports mainly includes two modes: FIFO scheduling mode and static transmission mode. The static transmission mode, by pre-configuring a transmission table, allocates the transmission times of each virtual link to a fixed time window, achieving lower transmission jitter and higher network determinism.

[0003] For FIFO scheduling, existing technologies have developed relatively mature methods for delay upper bound and jitter analysis, which can calculate the maximum delay and jitter of virtual links based on network calculus theory. However, for static transmission mode, due to the discretized scheduling characteristics of the transmission table window, the transmission permission of a virtual link only takes effect at the beginning of a specific window, and the traffic arrival curve exhibits discontinuous characteristics, making traditional analysis methods for FIFO scheduling mode inapplicable directly. Existing jitter analysis methods for static transmission mode often employ overly conservative estimation methods, resulting in highly pessimistic analysis results that fail to accurately reflect the jitter upper bound in actual network operation, hindering network configuration optimization and efficient utilization of bandwidth resources. Jitter analysis in static transmission mode needs to comprehensively consider multiple factors such as transmission table window allocation, bandwidth allocation interval constraints, and the superposition of traffic from multiple virtual links to construct an accurate worst-case traffic scenario and calculate the upper bound of the traffic to be transmitted.

[0004] Therefore, how to accurately analyze the jitter of virtual link transmission in the static transmission mode of A664 network has become a technical problem that urgently needs to be solved by those skilled in the art. Summary of the Invention

[0005] The purpose of this invention is to provide a network jitter analysis method for A664 network static transmission mode, so as to overcome the problem that the virtual link jitter analysis results in the static transmission mode of the prior art are highly pessimistic and cannot accurately reflect the upper limit of actual jitter.

[0006] The present invention solves the above-mentioned technical problems through the following technical solution: This invention provides a network jitter analysis method for A664 network static transmission mode, the method comprising: Step 1: For each window in the transmission table, with the goal of maximizing the amount of data to be transmitted in the corresponding window, construct the worst-case transmission scenario for that window. Step 2: For the worst-case transmission scenario corresponding to each window, calculate the total traffic, cumulative traffic, traffic to be transmitted, and remaining traffic for each window in sequence; Step 3: Calculate the maximum transmission jitter for each virtual link based on the traffic to be transmitted under the worst-case transmission scenario corresponding to each window.

[0007] A further improvement of the present invention is that step one specifically comprises: For the target window, obtain all virtual links allocated to the target window and record the transmission window for the virtual links in the target window; Starting from the window preceding the target window, traverse each window sequentially backward. For each traversed window, obtain all virtual links allocated to that window. While ensuring that the start time interval between two transmission windows of the same virtual link is not less than the bandwidth allocation interval, record as many transmission windows of the traversed window as possible that meet the conditions for virtual links, so as to maximize the traffic to be transmitted in the target window.

[0008] A further improvement of the present invention is that, in step two, the total traffic of each window is the sum of the maximum total frame length of all virtual links transmitted within the window under the worst transmission scenario corresponding to that window.

[0009] A further improvement of the present invention is that, for the first window, the accumulated flow is zero, the flow to be transmitted is equal to the total flow, and the remaining flow is equal to the larger of the difference between the flow to be transmitted and the maximum flow of the window and zero.

[0010] A further improvement of the present invention is that, for other windows after the first window, the cumulative flow of the current window is equal to the remaining flow of the previous window, the flow to be transmitted in the current window is equal to the sum of the total flow of the current window and the cumulative flow of the current window, and the remaining flow of the current window is equal to the larger of the difference between the flow to be transmitted in the current window and the maximum flow of the window and zero.

[0011] A further improvement of the present invention is that step three specifically comprises: Retrieve all windows allocated to the target virtual link; Select the maximum pending traffic value from the worst-case transmission scenarios corresponding to all windows allocated to the target virtual link; Calculate the maximum transmission jitter of the target virtual link based on the maximum pending transmission volume, the minimum total frame length of the target virtual link, and the network bandwidth.

[0012] This invention also provides a network jitter analysis system for A664 network static transmission mode, used to implement the network jitter analysis method for A664 network static transmission mode as described above, including: The worst-case scenario construction module is used to construct the worst-case transmission scenario for each window in the transmission table, with the goal of maximizing the amount of data to be transmitted in the corresponding window. The traffic calculation module is used to calculate the total traffic, cumulative traffic, traffic to be transmitted, and remaining traffic for each window in turn, based on the worst transmission scenario corresponding to each window. The jitter calculation module is used to calculate the maximum transmission jitter of each virtual link based on the traffic to be transmitted under the worst transmission scenario corresponding to each window.

[0013] The present invention also provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of the network jitter analysis method for the A664 network static transmission mode described above.

[0014] The present invention also provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the network jitter analysis method for the static transmission mode of the A664 network described above.

[0015] The present invention also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the network jitter analysis method for the A664 network static transmission mode described above.

[0016] Compared with the prior art, the positive and progressive effects of the present invention are as follows: The network jitter analysis method for A664 network static transmission mode provided by this invention achieves accurate analysis of virtual link jitter in A664 network static transmission mode through three core steps, effectively overcoming the deficiency of excessively pessimistic analysis results in existing technologies. First, a worst-case transmission scenario is constructed for each window in the transmission table, aiming to maximize the traffic to be transmitted, ensuring that the analysis result is the upper bound of the actual jitter rather than an overly conservative estimate, thus solving the bias problem caused by directly applying the FIFO scheduling model in traditional methods. Second, by sequentially calculating the total traffic, accumulated traffic, traffic to be transmitted, and remaining traffic of each window, a traffic recursive relationship between windows is established, accurately depicting the traffic backlog effect caused by discrete window scheduling in static transmission mode, making up for the inability of traditional network calculation methods to handle discontinuous arrival curves. Finally, the maximum transmission jitter of the virtual link is calculated based on the traffic to be transmitted under the worst-case transmission scenario. The obtained jitter upper bound is closer to the actual network operation, providing a more accurate theoretical basis for A664 network configuration optimization and bandwidth resource allocation, and enhancing the engineering practical value of network deterministic analysis.

[0017] Furthermore, the construction process of the worst-case transmission scenario was refined. By traversing backward from the target window and combining it with bandwidth allocation interval constraints, as many transmission windows of virtual links as possible were recorded. This ensured that the constructed scenario maximized the traffic to be transmitted while meeting protocol constraints, making the construction rules of the worst-case scenario clear and reproducible, and guaranteeing the rigor and consistency of the analysis results.

[0018] Furthermore, the total traffic is calculated as the sum of the maximum total frame lengths of all virtual transmission links within the window. Using the maximum total frame length of the virtual links as the calculation benchmark ensures that the total traffic value is the supremum, providing reliable input parameters for subsequent recursive calculations and avoiding the risk of underestimating the analysis results due to insufficient frame length values.

[0019] Furthermore, the cumulative traffic of the first window is set to zero, and the traffic to be transmitted and the remaining traffic of the first window are calculated accordingly. This establishes an accurate starting point for the recursive calculation of subsequent windows, ensuring that the initial state of the entire recursive chain conforms to the worst-case scenario analysis assumptions. The cumulative traffic of the current window is associated with the remaining traffic of the previous window, and the traffic to be transmitted and the remaining traffic are calculated sequentially. The recursive method accurately depicts the accumulation and transmission effect of traffic among multiple windows, fully covering the traffic change process of all windows in the static transmission mode. Attached Figure Description

[0020] The accompanying drawings are provided to further understand the invention and constitute a part of this invention. The illustrative embodiments of the invention and their descriptions are used to explain the invention and do not constitute an improper limitation of the invention.

[0021] Figure 1 This is a schematic flowchart of the method of the present invention; Figure 2 Example diagram for window transmission; Figure 3 This is a schematic diagram illustrating the calculation process for the traffic to be transmitted and the remaining traffic. Figure 4 Construct a process diagram for the worst-case scenario of window 7; Figure 5 This is a diagram illustrating the worst-case scenario for each window. Detailed Implementation

[0022] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0023] In the description of this invention, it should be understood that the terms "comprising" and "including" indicate the presence of the described features, integrals, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, integrals, steps, operations, elements, components and / or collections thereof.

[0024] It should also be understood that the terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the invention. As used in this specification and the appended claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms unless the context clearly indicates otherwise.

[0025] It should be understood that although terms such as first, second, third, etc., may be used in the embodiments of the present invention to describe the preset range, these preset ranges should not be limited to these terms. These terms are only used to distinguish the preset ranges from one another. For example, without departing from the scope of the embodiments of the present invention, the first preset range may also be referred to as the second preset range, and similarly, the second preset range may also be referred to as the first preset range.

[0026] Depending on the context, the word "if" as used here can be interpreted as "when," "when," "in response to determination," or "in response to detection." Similarly, depending on the context, the phrase "if determination" or "if detection (of the stated condition or event)" can be interpreted as "when determination," "in response to determination," "when detection (of the stated condition or event)," or "in response to detection (of the stated condition or event)."

[0027] As the core data exchange network for avionics systems, the ARINC664 network, with its deterministic transmission and high reliability, has been widely used in data communication for civil aircraft avionics systems. The ARINC664 network implements flow control for data transmission through virtual links. Each virtual link is configured with bandwidth allocation intervals and jitter parameters to ensure the determinism and real-time performance of network transmission. For static transmission modes, due to the discrete scheduling characteristics of the transmission table window, the transmission permission of a virtual link only takes effect at the beginning of a specific window, resulting in a discontinuous flow arrival curve. Traditional analysis methods for FIFO scheduling modes cannot be directly applied. Existing jitter analysis methods for static transmission modes often employ overly conservative estimation methods, leading to highly pessimistic results that fail to accurately reflect the upper bound of jitter in actual network operation.

[0028] Based on the above background, this application provides a network jitter analysis method for static transmission mode in A664 networks. This method constructs the worst-case transmission scenario for each window in the transmission table, aiming to maximize the traffic to be transmitted within that window. Then, for each worst-case transmission scenario, it sequentially calculates the total traffic, accumulated traffic, traffic to be transmitted, and remaining traffic for each window. Finally, based on the traffic to be transmitted under the worst-case transmission scenario for each window, it calculates the maximum transmission jitter for each virtual link. By constructing accurate worst-case traffic scenarios and calculating the upper bound of the traffic to be transmitted, this method can achieve accurate analysis of virtual link transmission jitter in static transmission mode, reducing the pessimism of the analysis results and providing support for network configuration optimization and efficient utilization of bandwidth resources.

[0029] For accurate description, the present invention is defined and described as follows: The transmission table consists of multiple windows, each with the same length, denoted as WT. Each Virtual Link (VL) is allocated to one or more windows in the transmission table at a fixed period, denoted as TTP, and the position of the VL in the first window of its allocation is denoted as TTO. An A664 frame scheduled via a Bandwidth Allocation Gap (BAG) is allowed to acquire a transmission license at the start of the window to which its VL is allocated. Frames that acquire a transmission license are transmitted sequentially in the order they acquired the license. The transmission table structure is as follows: Figure 2 As shown.

[0030] The maximum total length of all frames that may be granted transmission permission at the start of each window is defined as the total window throughput, denoted as TF; The total length of frames that have been granted transmission permission but have not yet been transmitted before the start of each window is defined as the window's cumulative traffic, denoted as AF; The total length of frames that have been granted transmission permission but have not yet been transmitted at the end of each window is defined as the window's remaining traffic, denoted as RF; At the start of each window, the total length of all frames that have obtained transmission permission (including the frames that obtained transmission permission at the start of this window) is defined as the traffic to be transmitted, denoted as WF; Define the theoretical maximum total throughput within a window of time as the window maximum throughput, denoted as MF. .

[0031] The technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings.

[0032] Example 1 This embodiment provides a network jitter analysis method for A664 network static transmission mode. (See also...) Figure 1 The method includes steps one through three.

[0033] Step 1: For each window in the transmission table, construct the worst-case transmission scenario for that window with the goal of maximizing the amount of data to be transmitted in that window.

[0034] In static transmission mode, the end system allocates the transmission time of each virtual link to a fixed time window according to a pre-configured transmission table. The transmission table consists of multiple windows, each of equal length, and each virtual link is allocated to one or more windows in the transmission table at a fixed period. An A664 frame scheduled through bandwidth allocation intervals is allowed to obtain a transmission license at the beginning of the window to which its virtual link is allocated, and frames that obtain transmission licenses are transmitted sequentially in the order in which they obtained the licenses. To analyze the pending transmission traffic for each window in the worst-case scenario, this step uses the currently examined window as the target window and constructs a worst-case transmission scenario by backtracking to maximize the pending transmission traffic in the target window, thereby obtaining the upper bound of the pending transmission traffic.

[0035] Step 2: For the worst-case transmission scenario corresponding to each window, calculate the total traffic, cumulative traffic, traffic to be transmitted, and remaining traffic for each window in sequence.

[0036] After constructing the worst-case transmission scenario for each window, the traffic parameters within the scenario need to be quantified. For each worst-case transmission scenario, the total traffic is defined as the sum of the maximum total frame lengths of all virtual links transmitted within that window; the accumulated traffic is the total length of frames that have obtained transmission permission before the window starts but have not yet been transmitted; the pending traffic is the total length of all frames that have obtained transmission permission at the start of the window; and the remaining traffic is the total length of frames that have obtained transmission permission at the end of the window but have not yet been transmitted. By calculating the above parameters for each window sequentially from beginning to end, the accumulation and resolution process of traffic through each window under the worst-case transmission scenario can be fully described.

[0037] Step 3: Calculate the maximum transmission jitter for each virtual link based on the traffic to be transmitted under the worst-case transmission scenario corresponding to each window.

[0038] For the virtual link to be analyzed, first, all windows allocated to that virtual link are obtained. From the traffic to be transmitted under the worst-case transmission scenario corresponding to these windows, the largest traffic value to be transmitted is selected. Based on this largest traffic value to be transmitted, the minimum total frame length of the virtual link, and the network bandwidth, the maximum transmission jitter of the virtual link is calculated. The maximum transmission jitter reflects the maximum time deviation that the frames of the virtual link may introduce under the worst-case transmission scenario due to waiting for other traffic transmissions within the window, providing a basis for network determinism and real-time performance evaluation.

[0039] Example 2 This embodiment further explains the specific implementation of steps one to three in embodiment 1.

[0040] In step one, the process of constructing the worst-case transmission scenario for the target window can be as follows: Obtain all virtual links allocated to the target window and record the transmission windows for which the target window is a virtual link. Then, starting from the window preceding the target window, traverse each window backwards. For each traversed window, obtain all virtual links allocated to that window. While ensuring that the start time interval between two transmission windows of the same virtual link is not less than the bandwidth allocation interval, record as many traversed windows as possible that are transmission windows for virtual links that meet the conditions, so as to maximize the traffic to be transmitted in the target window.

[0041] By employing the above method, when constructing the worst-case transmission scenario for the target window, not only are the virtual links allocated within the target window itself included in the transmission, but also, through backward look-back, those virtual links that can obtain transmission permission in advance under the bandwidth allocation interval constraint are included in the transmission. When a virtual link is recorded as being transmitted in a certain window, all windows within the preceding bandwidth allocation interval from that window are not allowed to transmit that virtual link again, thus ensuring that the constructed scenario conforms to the virtual link bandwidth allocation interval constraint. The scenario constructed in this way ensures that the accumulated pending traffic reaches its maximum at the beginning of the target window, representing the upper bound that may occur in actual operation.

[0042] In step two, the total traffic for each window is the sum of the maximum total frame lengths of all virtual links transmitted within that window under the worst-case transmission scenario. For the first window, the accumulated traffic is zero, the traffic to be transmitted equals the total traffic, and the remaining traffic is the greater of the difference between the traffic to be transmitted and the maximum traffic of the window, and zero. The maximum traffic of the window is the theoretical maximum total traffic transmitted within a window period, which can be calculated based on the window length and network bandwidth.

[0043] For windows following the first window, the cumulative traffic of the current window equals the remaining traffic of the previous window. The traffic to be transmitted in the current window equals the sum of the total traffic and the cumulative traffic of the current window. The remaining traffic in the current window equals the greater of the difference between the traffic to be transmitted and the maximum traffic of the window, and zero. This calculation process proceeds sequentially from front to back, accurately describing the transmission and resolution of traffic between windows: the remaining traffic not fully transmitted in the previous window accumulates in the current window and is added to the total traffic newly granted transmission permission in the current window to constitute the traffic to be transmitted in this window; if the traffic to be transmitted exceeds the maximum transmission capacity of this window, the excess portion forms new remaining traffic and is transmitted to the next window.

[0044] For the i-th window, the total flow for:

[0045] In the formula, For virtual links The maximum total frame length; j is any VL within the i-th window; i is any window among all windows; For window 0, the window's cumulative flow... Traffic to be transmitted Remaining flow Window 0 is the first window; For window k, the cumulative flow of the window Traffic to be transmitted Remaining flow ;k represents any window other than the first window; The above flow calculation process can be found in [reference]. Figure 3 The diagram illustrates the process. Starting with window 0, its accumulated traffic is set to zero. The traffic to be transmitted is derived from its total traffic, and the remaining traffic is calculated based on the window's maximum traffic. For window 1, its accumulated traffic equals the remaining traffic of window 0. The traffic to be transmitted is derived from window 1's own total traffic, and then the remaining traffic is calculated. This process is repeated for subsequent windows until all windows have been calculated.

[0046] In step three, all windows allocated to the target virtual link are obtained, and the maximum pending transmission traffic value is selected from the pending transmission traffic under the worst transmission scenario corresponding to these windows. Based on the maximum pending transmission traffic value, the minimum total frame length of the target virtual link, and the network bandwidth, the maximum transmission jitter of the target virtual link is calculated.

[0047] As an optional calculation method, the maximum transmit jitter can be calculated using the following formula:

[0048] In the formula, The maximum transmit jitter of the target virtual link. This represents the maximum pending traffic value under the worst-case transmission scenario across all windows allocated to the target virtual link. The minimum total frame length of the target virtual link. The formula represents the network bandwidth. The physical meaning of this formula is: in the worst-case transmission scenario, the frame of the target virtual link arrives at the beginning of the window, but its transmission permission is placed last among all pending traffic. It must wait for all traffic preceding it within the window to be transmitted before it can be transmitted. Therefore, the upper bound of the waiting time is the time value obtained by dividing the maximum pending traffic by the network bandwidth, and the lower bound of the waiting time is the time value obtained by dividing the minimum total frame length of this virtual link by the network bandwidth. The maximum transmission jitter of the virtual link is the difference between the upper and lower bounds of the waiting time, which is the time value obtained by subtracting the minimum total frame length of this virtual link from the maximum pending traffic and then dividing by the network bandwidth.

[0049] Example 3 The following example, using a specific static transmission mode configuration scenario, will provide a complete explanation of the method in this application.

[0050] Construct the following scenario: Assume a transfer table contains 8 windows, numbered 0 to 7, each window is 50 microseconds long, the network bandwidth is 100Mbps, and 50µs... 100Mbps = 5000 bits = 625 bytes, meaning the maximum flow rate (MF) per window is 625 bytes. The network contains 6 virtual links, and the parameters of each virtual link are shown in Table 1.

[0051] Table 1 Virtual Link Attribute Table

[0052] First, obtain the list of virtual links allocated to each window to obtain the virtual link-window allocation relationship. Referring to Table 2, window 0 is allocated with VL1, VL2, VL3, and VL4; window 1 is allocated with VL2 and VL3; window 2 is allocated with VL2 and VL4; window 3 is allocated with VL2 and VL3; window 4 is allocated with VL1, VL2, and VL4; window 5 is allocated with VL2 and VL3; window 6 is allocated with VL2 and VL4; and window 7 is allocated with VL2.

[0053] Table 2 VL-Window Allocation

[0054] Based on step one, construct the worst-case transmission scenario for each window. Taking window 7 as the target window as an example, the construction process is as follows: Obtain the list of virtual links allocated to each window. Starting from window 7 to window 0, confirm the list of virtual links to be transmitted in that window based on the window's virtual link allocation list. Provided that the start time of two transmission windows for a virtual link is not less than the bandwidth allocation interval, when a virtual link is recorded as being transmitted in a certain window, then all windows within the preceding bandwidth allocation interval from that window are not allowed to transmit that virtual link, and the virtual link is deleted from the virtual link allocation list of the corresponding window. See [link to relevant documentation]. Figure 4 Marked with red text and strikethrough; finally, we obtain the list of virtual links actually transmitted in each window under the worst-case transmission scenario corresponding to window 7. Using the same construction process, we construct the worst-case transmission scenarios for windows 6 to 0 in sequence, see [link to documentation]. Figure 5 .

[0055] Based on step two, for each window's worst-case transmission scenario, calculate the total traffic, cumulative traffic, pending traffic, and remaining traffic for each window. Taking the worst-case transmission scenario of window 7 as an example, set the cumulative traffic of window 0 to 0 bytes, and calculate sequentially from front to back. The pending traffic of window 7 in the worst-case transmission scenario is found to be 575 bytes, as shown in Table 3.

[0056] Table 3. Calculation results of the flow rate to be transmitted under the worst-case scenario.

[0057] The worst transmission scenarios for windows 6 to 0 were calculated separately to obtain the transmission traffic value under the worst transmission scenario for each window, as shown in Table 4.

[0058] Table 4. Worst-case data transfer volume for each window

[0059] Based on step three, calculate the maximum transmission jitter for each virtual link. For VL1, it is assigned to windows 0 and 4. Obtain the transmission traffic values ​​under the worst-case transmission scenarios corresponding to windows 0 and 4, and take the maximum value. Assuming the minimum total frame length for each virtual link is 84 bytes, calculate the maximum transmission jitter for each virtual link using the formula, as shown in Table 5.

[0060] Table 5 Maximum Transmit Jitter

[0061] In this application, by constructing the worst-case transmission scenario corresponding to each window and accurately calculating the traffic to be transmitted, the maximum transmission jitter obtained is the upper bound of the actual jitter of the network operation. Compared with the traditional conservative estimation method, it reduces the pessimism of the analysis results and can more realistically reflect the upper bound of the jitter of the virtual link under the static transmission mode, providing an effective basis for the deterministic analysis and resource allocation optimization of the A664 network.

[0062] Based on the same inventive concept, this application provides a computer device including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps of a network jitter analysis method for A664 network static transmission mode. The memory may include main memory, such as high-speed random access memory, or it may also include non-volatile memory, such as at least one disk storage device. The processor, network interface, and memory are interconnected via an internal bus, which may be an industry-standard architecture bus, a peripheral component interconnection standard bus, an extended industry-standard architecture bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. The memory stores the program; specifically, the program may include program code, which includes computer operation instructions. The memory may include main memory and non-volatile memory, and provides instructions and data to the processor.

[0063] Based on the same inventive concept, embodiments of this application provide a computer-readable storage medium storing a computer program. When executed by a processor, the computer program implements the steps of the network jitter analysis method for the static transmission mode of the A664 network. Specifically, the computer-readable storage medium includes, but is not limited to, volatile memory and / or non-volatile memory. The volatile memory may include RAM (Random Access Memory) and / or cache memory, etc. The non-volatile memory may include ROM (Read-Only Memory), hard disk, flash memory, optical disk, magnetic disk, etc.

[0064] Based on the same inventive concept, this application provides a computer program product, which includes a computer program stored on a computer-readable storage medium. The computer program includes program instructions that, when executed by a computer device, cause the computer device to perform the steps of the network jitter analysis method for the A664 network static transmission mode described above.

[0065] Those skilled in the art will understand that embodiments of the present invention can be provided as methods or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM (Compact Disc Read-Only Memory), optical storage, etc.) containing computer-usable program code.

[0066] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, as well as combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer apparatus or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0067] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer device or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0068] These computer program instructions may also be loaded onto a computer device or other programmable data processing equipment to cause a series of operational steps to be performed on the computer device or other programmable equipment to produce a process implemented by the computer device, thereby providing instructions that execute on the computer device or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0069] Although preferred embodiments of the invention have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including both the preferred embodiments and all changes and modifications falling within the scope of the invention.

[0070] Obviously, those skilled in the art can make various modifications and variations to this invention without departing from its spirit and scope. Therefore, if these modifications and variations fall within the scope of the claims of this invention and their equivalents, this invention also intends to include these modifications and variations.

Claims

1. A network jitter analysis method for A664 network static transmission mode, characterized in that, The method includes: Step 1: For each window in the transmission table, with the goal of maximizing the amount of data to be transmitted in the corresponding window, construct the worst-case transmission scenario for that window. Step 2: For the worst-case transmission scenario corresponding to each window, calculate the total traffic, cumulative traffic, traffic to be transmitted, and remaining traffic for each window in sequence; Step 3: Calculate the maximum transmission jitter for each virtual link based on the traffic to be transmitted under the worst-case transmission scenario corresponding to each window.

2. The network jitter analysis method for A664 network static transmission mode according to claim 1, characterized in that, Step one is as follows: For the target window, obtain all virtual links allocated to the target window and record the transmission window for the virtual links in the target window; Starting from the window preceding the target window, traverse each window sequentially backward. For each traversed window, obtain all virtual links allocated to that window. While ensuring that the start time interval between two transmission windows of the same virtual link is not less than the bandwidth allocation interval, record as many transmission windows of the traversed window as possible that meet the conditions for virtual links, so as to maximize the traffic to be transmitted in the target window.

3. The network jitter analysis method for A664 network static transmission mode according to claim 1, characterized in that, In step two, the total traffic for each window is the sum of the maximum total frame length of all virtual links transmitted within that window under the worst-case transmission scenario corresponding to that window.

4. The network jitter analysis method for A664 network static transmission mode according to claim 1, characterized in that, For the first window, the accumulated traffic is zero, the traffic to be transmitted is equal to the total traffic, and the remaining traffic is equal to the larger of the difference between the traffic to be transmitted and the maximum traffic of the window and zero.

5. A network jitter analysis method for A664 network static transmission mode according to claim 4, characterized in that, For windows after the first window, the cumulative traffic of the current window is equal to the remaining traffic of the previous window, the traffic to be transmitted in the current window is equal to the sum of the total traffic of the current window and the cumulative traffic of the current window, and the remaining traffic of the current window is equal to the larger of the difference between the traffic to be transmitted in the current window and the maximum traffic of the window and zero.

6. The network jitter analysis method for A664 network static transmission mode according to claim 1, characterized in that, Step three specifically involves: Retrieve all windows allocated to the target virtual link; Select the maximum pending traffic value from the worst-case transmission scenarios corresponding to all windows allocated to the target virtual link; Calculate the maximum transmission jitter of the target virtual link based on the maximum pending transmission volume, the minimum total frame length of the target virtual link, and the network bandwidth.

7. A network jitter analysis system for A664 network static transmission mode, characterized in that, A network jitter analysis method for implementing the A664 network static transmission mode as described in any one of claims 1 to 6, comprising: The worst-case scenario construction module is used to construct the worst-case transmission scenario for each window in the transmission table, with the goal of maximizing the amount of data to be transmitted in the corresponding window. The traffic calculation module is used to calculate the total traffic, cumulative traffic, traffic to be transmitted, and remaining traffic for each window in turn, based on the worst transmission scenario corresponding to each window. The jitter calculation module is used to calculate the maximum transmission jitter of each virtual link based on the traffic to be transmitted under the worst transmission scenario corresponding to each window.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the network jitter analysis method for A664 network static transmission mode as described in any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the steps of the network jitter analysis method for A664 network static transmission mode as described in any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that, When executed by a processor, the computer program implements the steps of the network jitter analysis method for A664 network static transmission mode as described in any one of claims 1 to 6.

Images