Bus network dynamic reconstruction system supporting multi-priority flow

By introducing feasibility prediction units and elastic reconstruction modules in the integrated electronic system, the access configuration and traffic compression of TT flow are optimized, and the problem of low-priority traffic delay timeout is solved, and the stability of the network and efficient utilization of resources are achieved. .

CN119052188AActive Publication Date: 2024-11-29COMP APPL TECH INST OF CHINA NORTH IND GRP
View PDF 6 Cites 0 Cited by

Patent Information

Application Number
CN202411079835.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-07
Publication Date
2024-11-29
Estimated Expiration
2044-08-07

AI Technical Summary

Technical Problem

In integrated electronic systems, the reconfiguration of time-triggered traffic may cause end-to-end delay timeout of low-priority traffic, resulting in waste of resources and instability of communication. Especially in multi-priority traffic environments, it is difficult for the prior art to effectively avoid low-priority traffic. Packet loss and communication interruption of priority traffic.

Method used

Introduce feasibility prediction unit and elastic reconstruction module to obtain network topology and traffic information in real time, optimize the access configuration scheme of new TT streams, compress and decompress low-priority traffic, adjust bandwidth utilization, and ensure the delay of low-priority traffic No timeout, reducing the impact of new TT streams on their quality of service.

Benefits of technology

It effectively avoids packet loss and communication interruption of low-priority traffic, ensures the robustness and certainty of the network, reduces resource waste, and improves communication stability.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119052188A_ABST
    Figure CN119052188A_ABST
Patent Text Reader

Abstract

The invention relates to a bus network dynamic reconstruction system supporting multi-priority flow, and belongs to the technical field of wired communication network resource dynamic scheduling and planning. The system comprises a network awareness and management module which is used for acquiring topology information and network flow information of a bus network in real time; the end node demand processing module is used for identifying the demand type of the source end node, and calling the control center subsystem to solve a corresponding configuration scheme based on the demand type, the topological information and the network flow information; and the control center subsystem is used for solving the configuration scheme and distributing the configuration scheme to the corresponding switch and the target end node when the solving is successful. According to the system, the feasibility prediction unit is introduced to preferentially select a new TT flow admission configuration scheme which does not influence the end-to-end delay constraint of the RC flow in the network, the elastic reconstruction module is introduced to elastically adjust the bandwidth utilization rate of the RC flow so as to weaken the influence of the new TT flow on the service quality of the RC flow, and the problems of RC flow packet loss and communication interruption caused by the admission of the new TT flow are solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the technical field of dynamic scheduling and planning of wired communication network resources, and in particular relates to a bus network dynamic reconstruction system supporting multi-priority traffic. Background Art

[0002] In order to save costs and benefit from the rapid development of Ethernet technology, which is becoming more and more widely used and perfect, there is a strong trend to merge the bus networks of various integrated electronic systems such as aerospace, aviation, and vehicles with Ethernet. This trend is reflected in the activities of standardization organizations, such as the IETF Deterministic Networking (DetNet) program and the IEEE Time-Sensitive Networking (TSN). Software-defined networking (SDN) is increasingly being introduced into real-time control systems, further enhancing the network's explicit control over traffic and promoting research in dynamic planning and configuration of time-triggered network traffic that previously required static verification and deployment.

[0003] However, even if the scheduling verification is passed, the reconfiguration scheme of TT flow (time-triggered traffic) (such as the addition of new traffic, etc.) may cause changes in the switch port load and network bandwidth resources, thereby affecting the end-to-end delay of rate-limited low-priority traffic (RC traffic), and even causing them to miss the worst-case deadline, resulting in resource waste or more serious consequences, thereby triggering the secondary configuration of RC traffic, which is not conducive to maintaining the stability and reliability of network traffic communication. Therefore, how to generate a more optimized new TT flow admission configuration scheme to avoid the transmission time of low-priority traffic exceeding the end-to-end delay period and causing secondary configuration is an urgent problem to be solved. Summary of the invention

[0004] In view of the above analysis, the present invention aims to provide a bus network dynamic reconstruction system that supports multi-priority traffic. By introducing a feasibility prediction unit, a new TT flow admission configuration scheme that does not affect the end-to-end delay constraints of all low-priority traffic (RC flows) in the network is preferentially selected, and an elastic reconstruction module is introduced. By solving and distributing RC flow compression schemes and RC flow decompression schemes, the bandwidth utilization of low RC flows is flexibly adjusted, thereby weakening the impact of new TT flows on the service quality of RC flows and avoiding packet loss and communication interruption.

[0005] The bus network dynamic reconstruction system supporting multi-priority traffic of the present invention comprises:

[0006] Network perception and management module, used to obtain the topology information and network traffic information of the bus network in real time;

[0007] The end node demand processing module is used to identify the demand type of the source end node, the demand type includes multiple new TT flow admission requests and TT flow network exit notifications of the source end node; and based on the demand type, the topology information and the network flow information, call the control center subsystem to solve the configuration scheme corresponding to each demand type, if the solution is successful, feed back the corresponding configuration scheme to the source end node, if the solution fails, when the demand type is multiple new TT flow accurate requests, feed back to the source end node that the admission request is not passed, when the demand type is a TT flow network exit notification, only feed back the failure result to the end node;

[0008] The control center subsystem is used to solve the configuration plan and distribute the configuration plan to the corresponding switch and target end node when the solution is successful.

[0009] Furthermore, the control center subsystem executes the following process to solve the configuration solution:

[0010] When the demand type is the multiple new TT flow admission request, solving a first configuration scheme of the multiple new TT flows that satisfies that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit; if solving the first configuration scheme fails, solving a second configuration scheme of the multiple new TT flows and RC flows that satisfies that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit;

[0011] When the traffic withdrawal notification of the demand type is TT flow, if there is RC flow in a compressed state in the network, the RC flow decompression scheme that satisfies the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit is solved as the third configuration scheme.

[0012] Furthermore, the control center subsystem includes:

[0013] A routing solution module, configured to solve, based on the multiple new TT flow admission requests, a first routing solution for the multiple new TT flows that satisfies that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit;

[0014] A scheduling solution module, used for solving a first scheduling solution based on the first routing solution, and using the successfully solved first scheduling solution as a first configuration solution;

[0015] The elastic reconstruction module is used to solve the second scheduling scheme of the multiple new TT flows with the least number of RC flows whose end-to-end worst-case delay exceeds the corresponding end-to-end delay limit when the first routing scheme or the first scheduling scheme fails to be solved, and if the solution fails, the second configuration scheme fails to be solved, and if the solution succeeds, a partial RC flow compression scheme that satisfies that the end-to-end worst-case delay of all RC flows does not exceed the corresponding end-to-end delay limit is solved based on the second scheduling scheme, and the successfully solved partial RC flow compression scheme and the second scheduling scheme are used as the second configuration scheme; and when the demand type is a traffic network exit notification of TT flow, a decompression scheme of RC flow is solved as the third configuration scheme;

[0016] The comprehensive interface module is used to distribute the first, second or third configuration schemes that are successfully solved to the corresponding switches, target end nodes and end node demand processing modules respectively; and when the second configuration scheme fails to be solved, feedback the access request failure to the end node demand processing module; when the third configuration scheme fails to be solved, feedback the failure result to the end node demand processing module;

[0017] Furthermore, the elastic reconstruction module solves the partial RC flow compression scheme based on the second scheduling scheme to ensure that the end-to-end worst-case delay of all RC flows does not exceed the corresponding end-to-end delay limit, and also includes: if the solution of the partial RC flow compression scheme fails, the second scheduling scheme is used as the second configuration scheme, and the second configuration scheme is fed back to the source node through the integrated interface module, and the traditional RC traffic reconstruction method is implemented for the RC flow whose worst-case delay exceeds the corresponding end-to-end delay limit.

[0018] Furthermore, the routing solution module includes:

[0019] A routing pool solving unit, configured to calculate a set of optional routing solutions based on the multiple new TT flow admission requests and the topology information;

[0020] A routing allocation unit, configured to iteratively solve a preferred routing solution based on the optional routing solutions within a maximum number of iterations based on the network traffic information and with the goal of optimizing the delay time rate of each RC flow affected by the new TT flow;

[0021] The feasibility prediction unit is used to determine whether the preferred routing solution obtained in each round of iteration is feasible. If the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit, the preferred routing solution is determined to be feasible and used as the first routing solution. Otherwise, it is not feasible and is returned to the routing allocation unit for the next round of iteration.

[0022] Further, the method for the feasibility prediction unit to calculate the worst-case end-to-end delay of each RC stream includes:

[0023] Calculating the worst transmission interval of each RC flow between every two nodes in the network link based on the preferred routing scheme includes:

[0024]

[0025] in, Indicates that any frame of the RC flow is from network node v α Transmit to network node v β The worst time interval; and Respectively represent any frame of the RC flow transmitted to the network node v β and v α moment; represents the technical delay introduced by each data frame; represents the delay effect of the TT flow on the RC flow, where F TT represents a set of other TT streams other than the new TT stream, f k Indicates other TT flows other than the new TT flow. Indicates that any frame of the RC flow is from the network node v α Transmit to network node v β The time offset between k represents the data stream frame time length of the new TT stream described in the kth item, p k represents the new TT data flow period described in Article k; Indicates the delay impact of other RC flows on this RC flow, where F RC represents the RC flow set, f l represents the new TT flow, F TTRec represents the new TT flow set, l l Indicates the time length of the lth other RC stream frame, p k It indicates the lth other RC flow cycle; It indicates the additional delay of TT flow to the RC due to the preemptive integration strategy; l i Indicates the frame time length of the RC stream;

[0026] The worst-case delay of the corresponding RC stream is calculated based on all the worst transmission intervals of each RC stream.

[0027] Furthermore, the elastic reconstruction module includes:

[0028] The TT flow planning and allocation unit is used to select, based on the multiple preferred routing schemes iterated by the routing allocation unit, a preferred routing scheme with as few RC flows as possible whose end-to-end worst-case delay exceeds the corresponding end-to-end delay limit when solving the first routing scheme or the first scheduling scheme fails, as a second routing scheme, and call the scheduling solution unit to solve the second scheduling scheme based on the second routing scheme;

[0029] An RC stream compression solving unit, configured to solve, based on the second scheduling scheme, a partial RC stream compression scheme satisfying that the end-to-end worst-case delay of all RC streams does not exceed the corresponding end-to-end delay limit;

[0030] A reconstruction scheme dispatching unit is used to send the partial RC flow compression scheme and the second scheduling scheme as the second configuration scheme to the integrated interface module when the second routing scheme and the partial RC flow compression scheme are successfully solved; or when the second routing scheme is successfully solved but the partial RC flow compression scheme fails to be solved, send the second scheduling scheme as the second configuration scheme to the integrated interface module, and implement the traditional RC traffic reconstruction method for the RC flow whose worst-case delay exceeds the corresponding end-to-end delay limit; or when the second routing scheme fails to be solved, send the second configuration scheme solution failure result to the integrated interface module.

[0031] Further, the RC stream compression solving unit solves the partial RC stream compression schemes that satisfy the requirement that the end-to-end worst-case delay of all RC streams does not exceed the corresponding end-to-end delay limit based on the second scheduling scheme, including:

[0032] Determine a set of RC flows to be solved based on RC flows whose end-to-end worst-case delay exceeds the corresponding end-to-end delay limit and RC flows that share the same directed link with their routes;

[0033] Number the compression schemes corresponding to each RC flow in the RC flow set to be solved;

[0034] A combination of the corresponding compression schemes is used as a particle, a combination of numbers corresponding to the corresponding compression schemes in each particle is used to describe the particle position, and a particle swarm is randomly initialized based on the compression scheme corresponding to each RC flow of the RC flow set to be solved;

[0035] A fitness function is constructed based on the end-to-end delay and maximum bandwidth constraints of all affected RC flows;

[0036] Based on the fitness function, the optimal solution of the particle swarm is obtained, and some RC flow compression schemes are obtained.

[0037] Furthermore, the fitness function of the RC flow compression solving unit is expressed as:

[0038] F(X) = Q(X) + γE(X);

[0039] Among them, Q(X) is the objective function, Q(X) = max{D ave -min{δ}};D averepresents the average delay time rate of all RC flows; min{δ} represents the minimum value of the end-to-end delay that does not exceed the corresponding end-to-end delay limit for all affected RC flows due to compression, and δ satisfies Among them, F RC ' represents the set of RC flows to be solved, f h represents the hth RC flow in the set, Indicates the offset of the hth RC stream reaching the destination. The data flow route vl represents the kth RC flow h The initial offset of dl h represents the end-to-end delay limit of the h-th RC flow;

[0040] γ is the penalty weight;

[0041] E(X) is the penalty function,

[0042]

[0043] in, Indicates the number of affected RC flows; vl j Indicates the route of the TT flow to be admitted or the RC flow in the network described in item j; αβ Represents the connected network node v α 、v β ; Indicates that any frame of the RC flow is from network node v α Transmit to network node v β The worst time interval; dl i represents the end-to-end delay of the i-th RC flow; E represents the set of directed communication links between network topology nodes; e represents the directed communication links between network topology nodes; l j Indicates the data stream frame length of the jth TT stream to be admitted or the RC stream in the network; p j represents the data flow period of the jth TT flow to be admitted or the RC flow in the network; C j Indicates the maximum bandwidth service rate of the directed link; It indicates that the TT flows to be admitted and the RC flows in the network are expected to meet the maximum bandwidth constraint.

[0044] Furthermore, the elastic reconstruction module also includes:

[0045] A decompression RC flow identification unit, used to determine a set of RC flows to be solved for a decompression solution based on a set of RC flows in a compressed state existing in the network and a set of RC flows involved in the routing of the off-network traffic;

[0046] An RC stream decompression solving unit, used for solving a set of RC streams to be solved based on a decompression solution, and solving a decompression solution for the RC streams that satisfies that the end-to-end worst-case delay of each RC stream does not exceed a corresponding end-to-end delay limit;

[0047] The decompression scheme dispatching unit is used to send the decompression scheme of the successfully solved RC stream as the third configuration scheme to the integrated interface module.

[0048] The present invention can achieve at least one of the following beneficial effects:

[0049] By considering the impact of the new TT flow on the RC flow in the network, a configuration scheme of the multiple new TT flows that satisfies the requirement that the end-to-end worst-case delay of each RC flow already existing in the network does not exceed the corresponding end-to-end delay limit is solved based on the new TT flow admission request, and when the solution fails, a second configuration scheme of the multiple new TT flows and RC flows that satisfies the requirement that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit is solved, thereby reducing the impact on the existing RC flows in the network and avoiding the problem of packet loss and communication interruption of the RC flows caused by the secondary configuration from the source.

[0050] By introducing a feasibility prediction unit, the new TT flow admission configuration scheme that does not affect the end-to-end delay constraint of the RC flow in the network is preferentially selected. By introducing an elastic reconstruction module, the bandwidth utilization of the RC flow is elastically adjusted to weaken the impact of the new TT flow on the service quality of the RC flow. The change in bandwidth is exchanged for the uninterrupted communication of the RC flow, ensuring the robustness and determinism of the network, avoiding the situation of secondary reconstruction of the RC flow as much as possible, and solving the problem of RC flow packet loss and communication interruption. By decompressing the RC flow when receiving the TT flow network withdrawal notification, the network bandwidth resources are fully utilized, and the impact on the transmission quality of the RC flow is further reduced.

[0051] By constructing a fitness function based on the delay time and maximum bandwidth constraints of the RC flow, the particle swarm algorithm is used to solve the first routing solution, the second routing solution, the partial RC flow compression solution and the RC flow decompression solution respectively, ensuring that each module of the system obtains the optimal solution of the corresponding solution in each link when solving the configuration solution.

[0052] Other features and advantages of the present invention will be described in the following description, and some advantages may become apparent from the description, or may be understood by practicing the present invention. The purpose and other advantages of the present invention may be realized and obtained through the contents particularly pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] The accompanying drawings are only used for the purpose of illustrating specific embodiments and are not to be considered as limiting the present invention. In the entire drawings, the same reference symbols represent the same components;

[0054] Figure 1 It is a schematic diagram of the system architecture of the present invention;

[0055] Figure 2 A flow chart for solving the first and second configuration schemes for the present invention. DETAILED DESCRIPTION

[0056] The preferred embodiments of the present invention are described in detail below in conjunction with the accompanying drawings, wherein the accompanying drawings constitute a part of this application and are used together with the embodiments of the present invention to illustrate the principles of the present invention, but are not used to limit the scope of the present invention.

[0057] A specific embodiment of the present invention discloses a bus network dynamic reconstruction system supporting multi-priority traffic, such as Figure 1 As shown, specifically including:

[0058] Network perception and management module, used to obtain the topology information and network traffic information of the bus network in real time;

[0059] The end node demand processing module is used to identify the demand type of the source end node, the demand type includes multiple new TT flow admission requests and TT flow network exit notifications of the source end node; and based on the demand type, the topology information and the network traffic information, call the control center subsystem to solve the configuration scheme corresponding to each demand type, if the solution is successful, feed back the corresponding configuration scheme to the source end node, if the solution fails, when the demand type is multiple new TT flow accurate requests, feed back to the source end node that the admission request is not passed, when the demand type is a TT flow network exit notification, only feed back the failure result to the end node;

[0060] The control center subsystem is used to solve the configuration scheme and distribute the configuration scheme to the corresponding switch and the target end node when the solution is successful; the control center subsystem executes the following process to solve the configuration scheme: when the demand type is the multiple new TT flow admission request, solve the first configuration scheme of the multiple new TT flows that satisfies that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit; if the first configuration scheme fails to be solved, solve the second configuration scheme of the multiple new TT flows and RC flows that satisfies that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit; when the demand type is the traffic network exit notification of the TT flow, if there is an RC flow in a compressed state in the network, solve the RC flow decompression scheme that satisfies that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit as the third configuration scheme.

[0061] The present embodiment discloses a bus network dynamic reconstruction system supporting multi-priority traffic, which solves the configuration schemes of the multiple new TT flows that meet the requirement that the end-to-end worst-case delay of each RC flow existing in the network does not exceed the corresponding end-to-end delay limit based on multiple new TT flow admission requests, and solves the second configuration scheme of the multiple new TT flows and RC flows that meet the requirement that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit when the solution fails, thereby minimizing the impact on the existing RC flows in the network and avoiding the problem of packet loss and communication interruption of RC flows caused by secondary configuration from the source.

[0062] Network perception and management module

[0063] Specifically, the network perception and management module includes an OFDP and ARP packet parsing unit, a Flowtable unit, a health management unit, and a network status storage unit.

[0064] Further, the OFDP and ARP packet parsing unit is used to obtain network topology information in real time based on the OFDP packet containing its switch ID and the copy of the ARP packet at each network port of the switch;

[0065] The Flowtable unit is used to communicate with the switch on the data plane to obtain network traffic information;

[0066] The health management unit regularly uses the handshake protocol to ensure the consistency of communication between the network perception and management module and the data plane, and the real-time nature of topology information and network traffic information;

[0067] The network status storage unit is used to update and store the current topology information and network traffic information in real time.

[0068] It should be noted that the access control and planning of multi-priority traffic in a bus network dynamic reconstruction system supporting multi-priority traffic described in the present invention adopts a TAS scheduling model based on IEEE 802.1Qbv, and its traffic includes time-triggered (TT) traffic, rate-limited, i.e., low-priority (RC) traffic (such as audio and video AVB traffic) and traditional Ethernet best-effort (BE) traffic. In the present invention, only TT traffic and RC traffic are considered. Without loss of generality, the RC traffic in the present invention is only sent periodically in the source system, and no additional scheduling algorithm is executed in the port passing through the switch, and only the basic first-in, first-out principle (FIFO) is followed. This assumption is reasonable and is backward compatible with more complex scheduling algorithms, so it has the widest scope of application.

[0069] Specifically, the TSN network topology is represented as a directed graph G(V,E), where V represents the set of network nodes of the terminal system (ES) and the switch (SW), and E represents the set of directed communication links between the network nodes. Let v1 and v2 represent two adjacent nodes, and satisfy v1,v2∈V, then [v1,v2] and [v2,v1] can be used to represent bidirectional data flow links. Edge e st Described as st =[v s ,v t ]∈E,v s ,v t ∈V. The multi-priority traffic in time-sensitive networking (TSN) mainly includes TT, rate-limited (RC) and best-effort (BE) traffic. TT traffic is forwarded according to the offline scheduled schedule and has the highest priority. RC traffic is only sent during the execution period of the source system and is subject to the rate limit of the bandwidth allocation gap (BAG). Its priority is lower than TT traffic. BE traffic is traditional Ethernet traffic without any QoS guarantee and has the lowest priority, which is not discussed in this invention.

[0070] Furthermore, all communication tasks in the network are transmitted through data streams, including data frame instances. Let F = F TT ∪F RC Represents the set of all data flows. Any TT flow f m ∈F TT and any RC flow f n ∈F RC They can be represented by the following seven-tuple and six-tuple respectively:

[0071] f m ={s m ,d m ,l m ,p m ,dl m ,vl m ,O m} and f n ={s n ,d n ,l n ,p n ,dl n ,vl n};

[0072] where s m ,d m , l m 、p m 、dl m and vl mRespectively represent the source ES, destination ES, frame length in the time dimension (frame length divided by link bandwidth), traffic period, end-to-end (ETE) delay limit, and routing information. m Exclusive to TT traffic, it represents the offset set between the first data frame instance and the cycle start time of the TT flow on each directed link. The offset set of all TT flows together constitutes the time schedule of the network. In simple terms, the admission control and dynamic planning of TT flows means reallocating the routing information and corresponding offset time of TT flows.

[0073] End node demand processing module

[0074] Specifically, the end node demand processing module includes a user demand identification unit, a user demand processing unit and a user demand response unit.

[0075] Further, the user identification demand unit is used to identify the demand type of the source node. As mentioned above, in the present invention, only TT traffic and RC traffic are considered. The demand type of the source node of the present invention includes multiple new TT flow admission requests of the source node and traffic exit notification of the TT flow;

[0076] The user demand processing unit is used to call the control center subsystem to solve the configuration scheme corresponding to each demand type based on the demand type, the topology information and the network flow traffic information; it should be noted that the user demand processing unit has different calling orders for each unit in the control center subsystem based on different demand types. When the demand type is a plurality of new TT flow admission requests, the user demand processing unit first calls the routing solution module of the control center subsystem. When the demand type is a traffic withdrawal notification of the TT flow, the user demand processing unit first calls the elastic reconstruction module of the control center subsystem. The present invention will be further described in detail when introducing each module of the control center subsystem (the calling order between each module is as follows Figure 2 As shown); further, when the user demand processing unit calls the control center subsystem, it obtains the topology information and network traffic information from the network state storage unit of the network perception and management module;

[0077] The user demand response unit is used to feed back the configuration plan corresponding to each demand type successfully solved by the control center subsystem to the source end node, and if the solution fails, when the demand type is an accurate request for multiple new TT flows, it is used to feed back to the source end node that the access request is not passed. When the demand type is a TT flow network exit notification, only the failure result is fed back to the end node.

[0078] Control center subsystem

[0079] Specifically, the control center subsystem includes a routing solution module, a scheduling solution module, a flexible reconstruction module and a comprehensive interface module.

[0080] Routing solution module

[0081] The routing solution module is used to solve the first routing solution of the multiple new TT flows based on the multiple new TT flow admission requests so that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit. That is, when the user identification demand module in the end node demand processing module identifies that the demand type is a multiple new TT flow admission request, the user demand processing unit first calls the routing solution module in the control center subsystem to solve the first routing solution (such as Figure 2 shown).

[0082] Specifically, the routing solution module includes a routing pool solution unit, a routing allocation unit and a feasibility prediction unit.

[0083] Furthermore, the routing pool solving unit is used to calculate multiple optional routing solutions using a Dijkstra algorithm based on multiple new TT flow admission requests and topology information.

[0084] The routing allocation unit is used to iteratively solve the optimal routing solution based on the optional routing solution using a particle swarm algorithm within a maximum number of iterations based on the network traffic information with the goal of optimizing the delay time rate of each RC flow affected by the new TT flow.

[0085] Specifically, using the particle swarm algorithm to solve the optimal routing solution includes processes s1 to s4.

[0086] s1. Construct particles.

[0087] Specifically, the optional routing solutions are numbered, with values ​​ranging from 1 to k.

[0088] Furthermore, the combination of the routing schemes of the TT flows to be admitted is taken as a particle, and the particle position is described by the combination of the corresponding numbers of the routing schemes of the TT flows in each particle. The position of each particle is represented by an M-dimensional vector X = [x1, x2, ..., x M ], where x m (m∈[1,M]) represents the TT flow f to be admitted m The routing scheme number is determined based on the optional routing range. The routing number ranges from 1 to k. The speed of the particle is expressed as V = [v1, v2, ..., v M ], where v m Indicates the distance the particle moves in the mth dimension, ranging from -(k-1) to (k-1).

[0089] s2. Construct objective function and penalty function.

[0090] Specifically, an objective function is constructed based on the delay time rate of the affected RC flows.

[0091] The objective function is expressed as:

[0092]

[0093] Where Q(X) is the objective function used to calculate the delay time rate of the affected RC flow; X is a c-dimensional vector representing the particle position, X = [x1, x2, ..., x m ]; c is the number of TT flows to be admitted; Indicates the number of affected RC flows; represents the worst end-to-end delay of the ith RC flow, where vl i represents the route e of the i-th RC flow αβ Represents the connected network node v α 、v β The directed edge of Indicates that any frame of the RC flow is from network node v α Transmit to network node v β The worst time interval; dl i represents the end-to-end delay of the i-th RC flow; D ave represents the average delay time rate of all RC flows, F RC |Indicates the total number of RC flows in the network.

[0094] Furthermore, a penalty function is constructed based on the maximum bandwidth constraint.

[0095] The penalty function is expressed as:

[0096]

[0097] Where E represents the set of directed communication links between network topology nodes; vl j represents the route of the jth TT flow to be admitted or the RC flow in the network; e represents the directed communication link between the nodes in the network topology; l j Indicates the data stream frame length of the jth TT stream to be admitted or the RC stream in the network; p j represents the data flow period of the jth TT flow to be admitted or the RC flow in the network; C j Indicates the maximum bandwidth service rate of the directed link; It indicates that the TT flows to be admitted and the RC flows in the network are expected to meet the maximum bandwidth constraint.

[0098] s3. Construct fitness function.

[0099] Specifically, a fitness function is constructed based on the objective function, the penalty function and the weight coefficient of the penalty function to evaluate the performance of the routing solution represented by the particle position. The lower the fitness function value, the better the performance of the selected route.

[0100] The fitness function is expressed as: F(X)=Q(X)+γE(X); wherein γ is a penalty weight, which varies according to different topologies and traffic flows, and preferably, is 300.

[0101] s4. Iterative solution.

[0102] Specifically, in each round of iteration, the optimal solution for the particle swarm is sought based on the fitness function, and the optimal routing solution for this round of iteration is obtained and recorded.

[0103] Specifically, in the process of searching for the optimal solution, the position and velocity of the particle are updated according to two values: the current optimal solution pBest of a single particle and the optimal solution gBest of all particles in the population; the search process is expressed as:

[0104] V t+1 =ωV t +c1r1(pBest-X t )+c2r2(gBest-X t );

[0105] X t+1 =X t +V t ;

[0106] Among them, ω is the inertia weight, which is used to adjust the degree to which the particle maintains its original speed. The value range is between 0-1, and it is preferably set to 0.9; c1 and c2 represent self-learning and social learning factors respectively, which are used to balance local and global search capabilities. c1 controls the speed and direction of self-update of particles in the search space. The larger the value, the more inclined it is to search in the direction of its own historical optimal solution, and the smaller the value, the more inclined it is to random exploration; c2 controls the speed at which particles update according to the optimal solution of neighboring particles in space. The larger the value, the more inclined it is to search under the influence of neighboring particles, and the smaller the value, the more inclined it is to search independently; the sum of c1 and c2 is not greater than 4. Preferably, c1 and c2 are set to 2 and 0.9 respectively; r1 and r2 are random numbers between 0 and 1; t represents the number of searches in the solution process.

[0107] Furthermore, the feasibility prediction unit is used to determine whether the preferred routing solution obtained by the routing allocation unit in each round of iteration is feasible. If the end-to-end worst-case delay of each RC stream does not exceed the corresponding end-to-end delay limit, the preferred routing solution is determined to be feasible and used as the first routing solution. Otherwise, it is not feasible and is returned to the routing allocation unit for the next round of iteration.

[0108] Specifically, the calculation method of the worst-case end-to-end delay of each RC flow is:

[0109] Calculate the worst transmission interval of each RC flow between every two nodes of the network link based on the preferred routing solution;

[0110] The worst-case delay of the corresponding RC stream is calculated based on all the worst transmission intervals of each RC stream.

[0111] Further, the calculation of the worst transmission interval of each RC flow between every two nodes in the network link based on the preferred routing solution includes:

[0112]

[0113] in, Indicates that any frame of the RC flow is from network node v α Transmit to network node v β The worst time interval; and Respectively represent any frame of the RC flow transmitted to the network node v β and v α moment; represents the technical delay introduced by each data frame; represents the delay effect of the TT flow on the RC flow, where F TT Indicates the set of other TT flows that are not waiting to be admitted, f k Indicates other TT flows to be admitted to the TT flow. Indicates that any frame of the RC flow is from the network node v α Transmit to network node v β The time offset between k represents the data stream frame time length of the kth TT stream to be admitted, p k Indicates the kth TT flow data cycle to be admitted; Indicates the delay impact of other RC flows on this RC flow, where F RC represents the RC flow set, f l Indicates the TT flow to be admitted, F TTRec Indicates the set of TT flows to be admitted, l l Indicates the time length of the lth other RC stream frame, p k It indicates the lth other RC flow cycle; It indicates the additional delay of TT flow to the RC due to the preemptive integration strategy; l i Indicates the frame time length of the RC stream.

[0114] The following describes the principle of calculating the worst transmission interval of each RC flow between every two nodes in the network link:

[0115] In the method of this embodiment, it is reasonably assumed that all RC flows have passed the worst-case end-to-end delay verification in the design phase, that is, wcdn ≤dl n (wcd n represents the worst-case end-to-end delay of the nth RC flow). When judging whether the worst-case end-to-end delay of each RC flow does not exceed the corresponding end-to-end delay limit, it is only necessary to judge the RC flows that have an intersection with the routes of the TT flow to be admitted. This is because in the delay analysis, the end-to-end delay of non-intersecting RC flows may change, but their worst-case end-to-end delay wcd remains unchanged (regardless of the delay calculation method such as network calculation or trajectory method).

[0116] Furthermore, the end-to-end delay of the RC flow is mainly affected by four aspects in addition to the transmission delay: ① related technical delay, such as the delay caused by the data validity and integrity check between nodes, the delay caused by the bandwidth allocation interval error containment delay, etc.; ② the delay caused by the competition for bandwidth resources between RC flows; ③ the delay caused by high-priority TT traffic to the RC flow; ④ the delay caused by the integration of TT and RC flows, which is mainly divided into three types according to different integration strategies: shuffling, preemption and timely blocking. The most common preemption strategy (this strategy is the most general, representative and practical) is adopted in the method of the present invention.

[0117] Furthermore, the end-to-end delay of the RC flow mainly consists of two parts: ① the queuing delay of the source ES; ② the delay of each intermediate node (link).

[0118] First, consider the queuing delay at the source ES. Specifically, the set of RC flows that have an intersection with the routes of the TT flows to be admitted is identified as F RC ′. Since the initial phase (offset) of the route corresponding to the RC flow can be allocated by the traditional offset allocation algorithm, vl i The initial offset is recorded as Furthermore, the transmission time when it leaves the end node and enters the network (denoted as ) can be calculated as follows:

[0119]

[0120] Where FIFO(j,i) represents TT flow f j The data frame is earlier than the RC stream f i The data frame enters the buffer; when FIFO(j,i) is an empty set, Therefore, the RC flow f entering the network i The offset can be represented by several possible discrete values.

[0121] Secondly, the delay calculation of each intermediate node (link) is considered. Specifically, the present invention adopts an iterative strategy of overall timing analysis and uses the concept of busy period to analyze the delay of the affected RC flow in the network. For any data frame of the RC flow, its busy period on a certain link can be defined as a time interval, that is, from the time when the frame arrives at the node v α To transmit the frame to the next node v β The time interval is expressed as Define the frame arrival node v α To transmit the frame to the next node v β Time interval The end-to-end delay of the RC flow is expressed as To ensure that the worst-case end-to-end delay of each RC flow does not exceed the corresponding end-to-end delay limit dl i , the worst time interval Described as (for any known ):

[0122]

[0123] in, represents the technical delay introduced by each data frame; Indicates the delay impact of the TT flow on the RC flow; Indicates the delay impact of other RC flows on this RC flow; It indicates the additional delay of TT flow to this RC due to the preemptive integration strategy.

[0124] Since the above formula contains both sides is a recursive function, so we can use the recursive tree method to solve it. Indicates from At the beginning of time, link e αβ Medium RC flow i The worst-case end-to-end delay, which guarantees the transmission of all TT flows and other backlogged RC flows that arrive earlier within the time period. Can be used as vl i The start time of the next link in the process is used to solve the busy period until the until.

[0125] Furthermore, it is determined whether the worst-case end-to-end delay of each RC flow does not exceed the corresponding end-to-end delay limit, which can be expressed as:

[0126]

[0127] Furthermore, if the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit, the preferred routing solution is determined to be feasible and is used as the first routing solution. Otherwise, the preferred routing solution is determined to be infeasible and returns to the routing allocation unit for the next round of iteration until the maximum number of iterations solved by the routing allocation unit is reached. If the preferred routing solution obtained by the iteration is still infeasible at this time, the solution of the first routing solution fails.

[0128] Scheduling solution module

[0129] Specifically, the scheduling solution module is used to solve the first scheduling solution based on the first routing solution, and use the successfully solved first scheduling solution as the first configuration solution.

[0130] The scheduling solution module includes a scheduling solution unit and a scheduling dispatch unit.

[0131] Furthermore, the scheduling solution unit is used to use an integer linear programming solver to solve the first scheduling solution that satisfies the scheduling constraint based on the first routing solution. Optionally, the solver may be gurobi, cplex, etc. Since the solver and the solution method are both prior art, they will not be discussed in detail here.

[0132] It should be noted that when the scheduling solution unit fails to solve the first scheduling solution based on the first routing solution, the routing allocation unit of the routing solution module continues to iteratively solve the first routing solution until the maximum number of iterations of the routing allocation unit is reached. It should be noted that, in general, solving the first scheduling solution based on the first routing solution is related to the network load, and the probability of failure in actual applications is extremely small.

[0133] Furthermore, the scheduling dispatching unit is used to send the successfully solved first scheduling solution as the first configuration solution to the integrated interface module.

[0134] Elastic Reconstruction Module

[0135] Specifically, the elastic reconstruction module is used to solve the second scheduling scheme for the multiple new TT flows with the least number of RC flows whose end-to-end worst-case delay exceeds the corresponding end-to-end delay limit when the first routing scheme or the first scheduling scheme fails. If the solution fails, the failure result of the second configuration scheme is solved. If the solution is successful, a partial RC flow compression scheme that satisfies the requirement that the end-to-end worst-case delay of all RC flows does not exceed the corresponding end-to-end delay limit is solved based on the second scheduling scheme, and the successfully solved partial RC flow compression scheme and the second scheduling scheme are used as the second configuration scheme; and when the demand type is a traffic withdrawal notification for TT flow, a decompression scheme for the RC flow is solved as the third configuration scheme.

[0136] The elastic reconstruction module includes a TT flow planning and allocation unit, an RC flow compression solution unit, a reconstruction solution dispatching unit, a decompression RC flow identification unit, an RC flow decompression solution unit and a decompression solution dispatching unit.

[0137] Furthermore, the TT flow planning and allocation unit is used to select a preferred routing scheme with as few RC flows as possible whose end-to-end worst-case delay exceeds the corresponding end-to-end delay limit based on multiple preferred routing schemes iterated by the routing allocation unit when the first routing scheme fails or the first scheduling scheme fails, and call the scheduling solution unit to solve the second scheduling scheme based on the second routing scheme.

[0138] It should be noted that when the first routing solution fails or the first scheduling solution fails, it means that the first configuration solution of the multiple new TT flows that satisfies the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit cannot be obtained, that is, the first configuration solution fails. In this case, the present invention considers compressing the RC flows that already exist in the network, reducing the service quality of some RC flows in exchange for their delay performance and communication continuity.

[0139] Furthermore, the process of the TT flow planning and allocation unit solving the second routing solution includes:

[0140] Based on all the preferred routing solutions obtained by the routing allocation unit, the second routing solution is iteratively solved. In each round of iteration:

[0141] Selecting a preferred routing scheme with the least number of RC flows whose end-to-end delay exceeds the corresponding worst delay among the preferred routing schemes;

[0142] Based on the preferred routing solution and the scheduling constraints, the scheduling solution unit is called to use the integer linear programming solver to solve the second scheduling solution:

[0143] If successful, the preferred routing solution becomes the second routing solution, and the iteration ends;

[0144] If it fails, it is determined whether all the preferred routing solutions have been traversed. If not, the next round of iteration is continued; if yes, it means that the second scheduling solution has failed.

[0145] It should be noted that, since in each round of iteration, solving the second scheduling solution based on the preferred routing solution and scheduling constraints selected in that round is related to the network load, in practical applications, the probability of failure in solving the second scheduling solution is extremely small.

[0146] Furthermore, if the second scheduling solution fails, it indicates that the second configuration solution fails, and the TT flow planning and allocation unit sends the failure result to the integrated interface module.

[0147] Furthermore, when the second scheduling scheme is successfully solved, the RC stream compression solving unit is used to solve a partial RC stream compression scheme based on the second scheduling scheme so that the end-to-end worst-case delay of all RC streams does not exceed the corresponding end-to-end delay limit.

[0148] Specifically, the process of the RC flow compression solving unit solving a partial RC flow compression solution includes steps s21-s25.

[0149] s21. Determine a set of RC flows to be solved based on RC flows whose end-to-end worst-case delay exceeds a corresponding end-to-end delay limit and RC flows that share the same directed link with their routes.

[0150] Specifically, based on the second scheduling scheme, the RC flows whose corresponding end-to-end worst-case delay exceeds the corresponding end-to-end delay limit and the RC flows that share the same directed link with their routes are determined to form a set F RC ', the set F RC The number of RC flows of ' is denoted as M'.

[0151] s22. Number the compression schemes corresponding to each RC flow set to be solved, and assign the set F RC The total number of periodic scheme numbers for each RC flow in ' is denoted as k'.

[0152] s23, taking the combination of the corresponding compression schemes as particles, describing the particle position with the combination of the corresponding numbers of the corresponding compression schemes in each particle, based on the RC flow set to be solved F RC The particle swarm is randomly initialized according to the compression scheme corresponding to each RC flow in '.

[0153] Specifically, the position of each particle is represented by an M'-dimensional vector X' = [x'1, x'2, ..., x' M ], where x' m' (m'∈[1,M']) represents the RC flow to be solved f m' The compression scheme number of , the movement range of the particle is -(k'-1) to (k'-1).

[0154] s24. Construct a fitness function based on the end-to-end delay and maximum bandwidth constraints of all affected RC flows.

[0155] Specifically, an objective function is constructed based on the end-to-end delay of all affected RC flows. The objective function is expressed as:

[0156] Q(X)=max{D ave -min{δ}};

[0157] Among them, D averepresents the average delay time rate of all RC flows; min{δ} represents the minimum value of the end-to-end delay that does not exceed the corresponding end-to-end delay limit for all affected RC flows due to compression, and δ satisfies where F RC ' represents the set of RC flows to be solved, f h represents the hth RC flow in the set, represents the offset of the hth RC stream reaching the destination. The calculation method and principle of the offset have been described in the previous embodiment and will not be discussed here. The data flow route vl represents the kth RC flow h The initial offset of dl h Indicates the end-to-end delay limit of the hth RC flow.

[0158] Furthermore, a penalty function is constructed based on the maximum bandwidth constraint. The penalty function is expressed as:

[0159]

[0160] in, Indicates the number of affected RC flows; vl j represents the route of the new TT flow or RC flow in the network described in item j; αβ Represents the connected network node v α 、v β The directed edges of Indicates that any frame of the RC flow is from network node v α Transmit to network node v β The worst time interval; dl i represents the end-to-end delay of the i-th RC flow; E represents the set of directed communication links between network topology nodes; e represents the directed communication links between network topology nodes; l j p represents the data stream frame length of the new TT stream or RC stream in the network described in item j; j represents the data flow period of the new TT flow or RC flow in the network described in item j; C j Indicates the maximum bandwidth service rate of the directed link; It indicates that the TT flows to be admitted and the RC flows in the network are expected to meet the maximum bandwidth constraint.

[0161] Furthermore, a fitness function is constructed based on the objective function, the penalty function and the weight coefficient of the penalty function. The fitness function is expressed as:

[0162] F(X) = Q(X) + γE(X);

[0163] Where γ is the penalty weight; preferably, the value is 300.

[0164] s25. Based on the fitness function, the optimal solution for the particle swarm is obtained to obtain a partial RC flow compression solution.

[0165] Specifically, in each round of iteration of the particle swarm that reaches the maximum number of iterations, the current optimal solution pBest of a single particle and the optimal solution gBest of all particles in the swarm are calculated based on the fitness function. According to the fitness function constructed in s24, it can be seen that the solution obtained needs to satisfy Furthermore, in the desired iterations that reach the maximum number of iterations, an optimal solution is determined based on the best fitness function value, and a partial RC stream compression solution is obtained.

[0166] Further, if the RC stream compression solving unit solves the partial RC stream compression solution successfully, the reconstruction solution dispatching unit sends the partial RC stream compression solution and the second scheduling solution as the second configuration solution to the integrated interface module.

[0167] If the RC flow compression solution unit fails to solve part of the RC flow compression solution, the reconstruction solution dispatching unit sends the second scheduling solution as the second configuration solution to the integrated interface module, and implements the traditional RC traffic reconstruction method for the RC flow whose worst-case delay exceeds the corresponding end-to-end delay limit; or when the solution of the second routing solution fails, the failure result of solving the second configuration solution is sent to the integrated interface module.

[0168] It should be noted that the traditional RC traffic reconstruction method is a method for the network to handle RC flows when new TT flows are admitted in the prior art. Specifically, the traditional RC traffic reconstruction method is a post hoc traffic reconfiguration method, that is, in the design stage, only the routing and scheduling schemes of the newly added TT flows are considered to meet the relevant delay and jitter constraints; after the newly added TT flows are distributed to the nodes, it is determined whether to reconfigure the specified RC flows according to the specific frame loss situation in the network nodes (continuous periodic frame loss or communication timeout); at this time, the communication of these timed RC flows is interrupted (that is, data transmission is stopped), and the routing scheme is re-solved and distributed according to the link load information; the process is repeated until there is no communication timeout of RC flows in the network, or when the problem cannot be solved after a sufficient number of iterations, a subset of the set of these RC flows is gradually tried to be restored; when the problem cannot be solved after a sufficient number of further iterations, the subset is gradually tried to be reduced until the subset is an empty set (an empty set means that all specified RC flows are not restored and all no longer communicate). Among them, the strategy of reducing the subset is determined based on expert experience and the importance ranking of RC traffic, which is pre-defined during the initial design.

[0169] It should be further explained that, in practical applications, the probability of failure in solving the compression scheme for some RC streams in steps s21-s25 is extremely small, and the communication continuity of all RC streams can be maximized by reducing the service quality of some RC streams, thereby avoiding packet loss and communication interruption of RC streams.

[0170] Further, when the demand type identified by the user demand identification unit is a traffic network exit notification of a TT flow, the user demand processing unit first calls the decompression RC flow identification unit of the elastic reconstruction module.

[0171] Furthermore, the decompression RC flow identification unit determines the set of RC flows to be solved for the decompression solution based on the intersection of the set of RC flows in the compressed state existing in the network and the set of RC flows involved in the routing of the exiting network traffic, which is recorded as F RC ”.

[0172] Furthermore, the RC stream decompression solution unit is used to solve the set of RC streams to be solved based on the decompression scheme, and solve the decompression scheme of the RC streams so that the worst-case end-to-end delay of each RC stream does not exceed the corresponding end-to-end delay limit; specifically, the solution process is the same as the process of the RC stream compression solution unit solving some RC stream compression schemes, which will not be repeated here.

[0173] Furthermore, if the decompression solution of the RC stream is successfully solved, the decompression solution dispatching unit will send the successfully solved decompression solution of the RC stream as the third configuration solution to the integrated interface module; if the decompression solution of the RC stream is successfully solved, the decompression solution dispatching unit will send the result of the failed solution to the integrated interface module.

[0174] Integrated interface module

[0175] The integrated interface module is used to distribute the successfully solved first, second or third configuration scheme to the corresponding switch, target end node and end node demand processing module respectively; and when the solution of the second configuration scheme fails, feedback the access request failure to the end node demand processing module; when the solution of the third configuration scheme fails, feedback the failure result to the end node demand processing module.

[0176] Specifically, the integrated interface module includes a northbound interface and a southbound interface.

[0177] Furthermore, the southbound interface is used to centrally control the communication between the subsystem and the switch, and to distribute the successfully solved first, second or third configuration solution to the corresponding switch and the target end node respectively.

[0178] Furthermore, the northbound interface is used for communication between the centralized control subsystem and the end node demand processing module, and is used to feedback the successfully solved configuration scheme to the end node demand processing module, and, when the solution of the second configuration scheme fails, feedback the failure result to the end node demand processing module, and the access request of the TT flow is not passed; when the solution of the third configuration scheme fails, feedback the failure result to the end node demand processing module.

[0179] The present embodiment discloses a bus network dynamic reconstruction system supporting multi-priority traffic. By considering the impact of new TT flows on RC flows in the network, a configuration scheme of the multiple new TT flows is solved based on the new TT flow admission request so that the end-to-end worst-case delay of each RC flow existing in the network does not exceed the corresponding end-to-end delay limit. When the solution fails, a second configuration scheme of the multiple new TT flows and RC flows is solved so that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit, thereby reducing the impact on the existing RC flows in the network and avoiding the problem of packet loss and communication interruption of RC flows caused by secondary configuration from the source.

[0180] In this embodiment, by introducing a feasibility prediction unit, a new TT flow admission configuration scheme that does not affect the end-to-end delay constraint of the RC flow in the network is preferentially selected. By introducing an elastic reconstruction module, the bandwidth utilization of the RC flow is elastically adjusted to weaken the impact of the new TT flow on the service quality of the RC flow, the robustness and determinism of the network are ensured, and the secondary reconstruction of the RC flow is avoided as much as possible, solving the problem of RC flow packet loss and communication interruption. By decompressing the RC flow when receiving the TT flow network exit notification, the network bandwidth resources are fully utilized, and the impact on the transmission quality of the RC flow is further reduced.

[0181] Furthermore, by constructing a fitness function based on the delay time and maximum bandwidth constraints of the RC flow, the particle swarm algorithm is used to solve the first routing solution, the second routing solution, the partial RC flow compression solution and the RC flow decompression solution respectively, ensuring that each module of the system obtains the optimal solution of the corresponding solution in each link when solving the configuration solution.

[0182] The above description is only a preferred specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily conceived by any technician familiar with the technical field within the technical scope disclosed by the present invention should be covered within the protection scope of the present invention.

Claims

1. A bus network dynamic reconstruction system supporting multi-priority traffic, characterized in that: include: Network perception and management module, used to obtain the topology information and network traffic information of the bus network in real time; The end node demand processing module is used to identify the demand type of the source end node, the demand type includes multiple new TT flow admission requests and TT flow network exit notifications of the source end node; and based on the demand type, the topology information and the network flow information, call the control center subsystem to solve the configuration scheme corresponding to each demand type, if the solution is successful, feed back the corresponding configuration scheme to the source end node, if the solution fails, when the demand type is multiple new TT flow accurate requests, feed back to the source end node that the admission request is not passed, when the demand type is a TT flow network exit notification, only feed back the failure result to the end node; The control center subsystem is used to solve the configuration plan and distribute the configuration plan to the corresponding switch and target end node when the solution is successful.

2. The bus network dynamic reconstruction system according to claim 1, characterized in that: The control center subsystem executes the following process to solve the configuration solution: When the demand type is the multiple new TT flow admission request, solving a first configuration scheme of the multiple new TT flows that satisfies that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit; if solving the first configuration scheme fails, solving a second configuration scheme of the multiple new TT flows and RC flows that satisfies that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit; When the traffic withdrawal notification of the demand type is TT flow, if there is RC flow in a compressed state in the network, the RC flow decompression scheme that satisfies the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit is solved as the third configuration scheme.

3. The bus network dynamic reconstruction system according to claim 2, characterized in that: The control center subsystem includes: A routing solution module, configured to solve, based on the multiple new TT flow admission requests, a first routing solution for the multiple new TT flows that satisfies that the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit; A scheduling solution module, used for solving a first scheduling solution based on the first routing solution, and using the successfully solved first scheduling solution as a first configuration solution; The elastic reconstruction module is used to solve the second scheduling scheme of the multiple new TT flows with the least number of RC flows whose end-to-end worst-case delay exceeds the corresponding end-to-end delay limit when the first routing scheme or the first scheduling scheme fails to be solved, and if the solution fails, the second configuration scheme fails to be solved, and if the solution succeeds, a partial RC flow compression scheme that satisfies that the end-to-end worst-case delay of all RC flows does not exceed the corresponding end-to-end delay limit is solved based on the second scheduling scheme, and the successfully solved partial RC flow compression scheme and the second scheduling scheme are used as the second configuration scheme; and when the demand type is a traffic network exit notification of TT flow, a decompression scheme of RC flow is solved as the third configuration scheme; The integrated interface module is used to distribute the successfully solved first, second or third configuration scheme to the corresponding switch, target end node and end node demand processing module respectively; and when the solution of the second configuration scheme fails, feedback the access request failure to the end node demand processing module; when the solution of the third configuration scheme fails, feedback the failure result to the end node demand processing module.

4. The bus network dynamic reconstruction system according to claim 3, characterized in that: The elastic reconstruction module solves the partial RC flow compression scheme based on the second scheduling scheme to ensure that the end-to-end worst-case delay of all RC flows does not exceed the corresponding end-to-end delay limit, and also includes: if the solution of the partial RC flow compression scheme fails, the second scheduling scheme is used as the second configuration scheme, and the second configuration scheme is fed back to the source node through the integrated interface module, and the traditional RC traffic reconstruction method is implemented for the RC flow whose worst-case delay exceeds the corresponding end-to-end delay limit.

5. The bus network dynamic reconstruction system according to claim 4, characterized in that: The routing solution module includes: A routing pool solving unit, configured to calculate a set of optional routing solutions based on the multiple new TT flow admission requests and the topology information; A routing allocation unit, configured to iteratively solve a preferred routing solution based on the optional routing solutions within a maximum number of iterations based on the network traffic information and with the goal of optimizing the delay time rate of each RC flow affected by the new TT flow; The feasibility prediction unit is used to determine whether the preferred routing solution obtained in each round of iteration is feasible. If the end-to-end worst-case delay of each RC flow does not exceed the corresponding end-to-end delay limit, the preferred routing solution is determined to be feasible and used as the first routing solution. Otherwise, it is not feasible and is returned to the routing allocation unit for the next round of iteration.

6. The bus network dynamic reconstruction system according to claim 5, characterized in that: The method for the feasibility prediction unit to calculate the worst-case end-to-end delay of each RC stream includes: Calculating the worst transmission interval of each RC flow between every two nodes in the network link based on the preferred routing scheme includes: in, Indicates that any frame of the RC flow is from network node v α Transmit to network node v β The worst time interval; and Respectively represent any frame of the RC flow transmitted to the network node v β and v α moment; represents the technical delay introduced by each data frame; represents the delay effect of the TT flow on the RC flow, where F TT represents a set of other TT streams other than the new TT stream, f k Indicates other TT flows other than the new TT flow. Indicates that any frame of the RC flow is from the network node v α Transmit to network node v β The time offset between k represents the data stream frame time length of the new TT stream described in the kth item, p k represents the new TT data flow period described in Article k; Indicates the delay impact of other RC flows on this RC flow, where F RC represents the RC flow set, f l represents the new TT flow, F TTRec represents the new TT flow set, l l Indicates the time length of the lth other RC stream frame, p k It indicates the lth other RC flow cycle; It indicates the additional delay of TT flow to the RC due to the preemptive integration strategy; l i Indicates the frame time length of the RC stream; The worst-case delay of the corresponding RC stream is calculated based on all the worst transmission intervals of each RC stream.

7. The bus network dynamic reconstruction system according to claim 4, characterized in that: The elastic reconstruction module includes: The TT flow planning and allocation unit is used to select, based on the multiple preferred routing schemes iterated by the routing allocation unit, a preferred routing scheme with as few RC flows as possible whose end-to-end worst-case delay exceeds the corresponding end-to-end delay limit when solving the first routing scheme or the first scheduling scheme fails, as a second routing scheme, and call the scheduling solution unit to solve the second scheduling scheme based on the second routing scheme; An RC stream compression solving unit, configured to solve, based on the second scheduling scheme, a partial RC stream compression scheme satisfying that the end-to-end worst-case delay of all RC streams does not exceed a corresponding end-to-end delay limit; A reconstruction scheme dispatching unit is used to send the partial RC flow compression scheme and the second scheduling scheme as the second configuration scheme to the integrated interface module when the second routing scheme and the partial RC flow compression scheme are successfully solved; or when the second routing scheme is successfully solved but the partial RC flow compression scheme fails to be solved, send the second scheduling scheme as the second configuration scheme to the integrated interface module, and implement the traditional RC traffic reconstruction method for the RC flow whose worst-case delay exceeds the corresponding end-to-end delay limit; or when the second routing scheme fails to be solved, send the second configuration scheme solution failure result to the integrated interface module.

8. The bus network dynamic reconstruction system according to claim 7, characterized in that: The RC stream compression solving unit solves the partial RC stream compression schemes that satisfy the requirement that the end-to-end worst-case delay of all RC streams does not exceed the corresponding end-to-end delay limit based on the second scheduling scheme, including: Determine a set of RC flows to be solved based on RC flows whose end-to-end worst-case delay exceeds the corresponding end-to-end delay limit and RC flows that share the same directed link with their routes; Number the compression schemes corresponding to each RC flow in the RC flow set to be solved; A combination of the corresponding compression schemes is used as a particle, a combination of numbers corresponding to the corresponding compression schemes in each particle is used to describe the particle position, and a particle swarm is randomly initialized based on the compression scheme corresponding to each RC flow of the RC flow set to be solved; A fitness function is constructed based on the end-to-end delay and maximum bandwidth constraints of all affected RC flows; Based on the fitness function, the optimal solution of the particle swarm is obtained, and some RC flow compression schemes are obtained.

9. The bus network dynamic reconstruction system according to claim 8, characterized in that: The fitness function of the RC flow compression solving unit is expressed as: F(X) = Q(X) + γE(X); Among them, Q(X) is the objective function, Q(X) = max{D ave -min{δ}};D ave represents the average delay time rate of all RC flows; min{δ} represents the minimum value of the end-to-end delay that does not exceed the corresponding end-to-end delay limit for all affected RC flows due to compression, and δ satisfies where F RC ' represents the set of RC flows to be solved, f h represents the hth RC flow in the set, Indicates the offset of the hth RC stream reaching the destination. The data flow route vl represents the kth RC flow h The initial offset of dl h represents the end-to-end delay limit of the h-th RC flow; γ is the penalty weight; E(X) is the penalty function, in, Indicates the number of affected RC flows; vl j Indicates the route of the TT flow to be admitted or the RC flow in the network described in item j; αβ Represents the connected network node v α 、v β ; Indicates that any frame of the RC flow is from network node v α Transmit to network node v β The worst time interval; dl i represents the end-to-end delay of the i-th RC flow; E represents the set of directed communication links between network topology nodes; e represents the directed communication links between network topology nodes; l j Indicates the data stream frame length of the jth TT stream to be admitted or the RC stream in the network; p j represents the data flow period of the jth TT flow to be admitted or the RC flow in the network; C j Indicates the maximum bandwidth service rate of the directed link; It indicates that the TT flows to be admitted and the RC flows in the network are expected to meet the maximum bandwidth constraint.

10. The bus network dynamic reconstruction system according to claim 7, characterized in that: The elastic reconstruction module also includes: A decompression RC flow identification unit, used to determine a set of RC flows to be solved for a decompression solution based on a set of RC flows in a compressed state existing in the network and a set of RC flows involved in the routing of the off-network traffic; An RC stream decompression solving unit, used for solving a set of RC streams to be solved based on a decompression solution, and solving a decompression solution for the RC streams that satisfies that the end-to-end worst-case delay of each RC stream does not exceed a corresponding end-to-end delay limit; The decompression scheme dispatching unit is used to send the decompression scheme of the successfully solved RC stream as the third configuration scheme to the integrated interface module.

Citation Information

Patent Citations

  • Power communication network transmission time delay control method combining routing and gating planning

    CN116132374A

  • Time-sensitive network scheduling method based on bandwidth reservation

    CN116192651A

  • Method for dynamically adjusting Qos (Quality of Service) based on data stream

    CN117336249A

  • Accurate conflict traceability incremental scheduling method suitable for time-sensitive network

    CN117459461A

  • AVB flow-aware time-sensitive flow fault-tolerant routing and scheduling method and system

    CN117640500A