Optimal path selection method for data exchange in cross-network scene

Abstract

The invention relates to an optimal path selection method for data exchange in a cross-network scene, and belongs to the field of computers. The method comprises the following steps of: initializing a communication relationship among nodes in all network systems exchanged and associated across the network systems into a data exchange routing information table; enumerating a switching path and calculating a path length; obtaining QoS attribute vectors of the enumerated exchangeable path link, including response time, reliability and stability, as link quality parameters, and meanwhile, comprehensively forming an exchange path attribute parameter by taking an exchange path length as a security evaluation factor; weight is distributed to each parameter, and optimal path calculation is carried out, so that the optimal path of data exchange in the cross-network scene is obtained. According to the method and the device, the data exchange can be completed when the direct path is blocked in the cross-network scene without opening the exchange link, so that the economic cost caused by opening the link and the time overhead of offline exchange can be effectively saved.

Description

Technical Field

[0001] The present invention belongs to the field of computers, and in particular relates to a method for selecting an optimal path for data exchange in a cross-network scenario. Background Art

[0002] In recent years, the demand for cross-departmental, cross-field, and cross-functional business collaboration and information sharing has increased, which needs to rely on data exchange. However, since departments in different fields and with different functions mainly rely on their own networks to handle business, data exchange faces the challenge of no direct path across the network during business collaboration and information sharing. In response to the above challenges, the main solutions are currently offline exchange methods such as CD-ROM ferrying or adding physical exchange equipment to open up data links. However, the above methods increase time overhead for offline exchange, increase economic costs for opening up data links, and have a certain degree of data security risks.

[0003] The present invention comprehensively considers factors such as the link quality of the exchange path, the length of the path, the demand for the path by the data exchange task, and proposes a method for selecting the optimal path for data exchange in a cross-network scenario, which provides a new idea for the development of data exchange-related products, business collaboration, and information sharing in such scenarios, and avoids the time overhead, economic cost, and increased security risks caused by offline exchange or the opening of exchange links. Summary of the invention

[0004] 1. Technical issues to be resolved

[0005] The technical problem to be solved by the present invention is how to provide a method for selecting an optimal path for data exchange in a cross-network scenario, so as to solve the problem that offline exchange increases time overhead and opens data links and presents data security risks.

[0006] (II) Technical solution

[0007] In order to solve the above technical problems, the present invention proposes a method for selecting an optimal path for data exchange in a cross-network scenario, the method comprising the following steps:

[0008] Step 1: Initialize and update the routing table: Initialize the inter-node communication relationship in all networks associated with cross-network exchange into the data exchange routing information table, and complete the update of the routing table when the inter-node communication relationship is updated;

[0009] Step 2: Enumerate the exchange paths and calculate the path length: After determining the exchange sender and receiver, enumerate the exchange paths according to the routing table, record the number of nodes the exchange paths pass through, and clarify the length of each path;

[0010] Step 3: Path quality perception: Obtain the QoS attribute vector of the enumerated exchangeable path link, including response time, reliability and stability, as link quality parameters, and use the exchange path length as a security assessment factor to comprehensively form the exchange path attribute parameters;

[0011] Step 4: Weight allocation and optimal path calculation: Consider the different requirements of data exchange tasks for response time, security, reliability, and stability, assign weights to each parameter, and perform optimal path calculation to obtain the optimal path for data exchange in cross-network scenarios.

[0012] (III) Beneficial effects

[0013] The present invention proposes a method for selecting an optimal path for data exchange in a cross-network scenario. Compared with the prior art, the present invention implements the initialization and update of a data exchange routing information table, exchange path quality perception, weight allocation, and optimal path calculation, thereby achieving data exchange when a direct path is blocked in a cross-network scenario without opening an exchange link. This method can effectively save the economic cost of opening a link and the time overhead of offline exchange, and meet the needs of user business systems and information sharing. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] Figure 1 This is a flow chart for selecting the optimal path for data exchange in a cross-network scenario of the present invention;

[0015] Figure 2 This is an example diagram of the communication relationship between networks. DETAILED DESCRIPTION

[0016] In order to make the purpose, content and advantages of the present invention more clear, the specific implementation methods of the present invention are further described in detail below in conjunction with the drawings and examples.

[0017] The present invention relates to the field of computers, and in particular to a method for selecting an optimal path for data exchange in a cross-network scenario, which aims to select an effective and optimal path to complete data exchange when two data exchange nodes are located in different networks and a direct path is blocked, thereby meeting user business collaboration and information sharing requirements.

[0018] The purpose of the present invention is to propose a method for selecting the optimal path for data exchange in a cross-network scenario. When two data exchange nodes are located in different networks and the direct path is blocked, a method is used to comprehensively consider factors such as the link quality of the exchange path, the length of the path, and the path requirements of the data exchange task, and select an effective and optimal path to complete the data exchange and meet the user's business collaboration needs.

[0019] In order to solve the problem that direct paths between nodes are blocked in cross-network data exchange scenarios, the present invention proposes a method for selecting the optimal path for data exchange in cross-network scenarios. The technical ideas are as follows:

[0020] Step 1: Initialize and update the routing table: Initialize the inter-node communication relationship in all networks associated with cross-network exchange into the data exchange routing information table, and complete the update of the routing table when the inter-node communication relationship is updated;

[0021] Step 2: Enumerate the exchange paths and calculate the path length: After determining the exchange sender and receiver, enumerate the exchange paths according to the routing table, record the number of nodes the exchange paths pass through, and clarify the length of each path;

[0022] Step 3: Path quality perception: Obtain the QoS attribute vector of the enumerated exchangeable path link, including response time, reliability and stability, etc., as link quality parameters, and use the exchange path length as a security assessment factor to comprehensively form the exchange path attribute parameters;

[0023] Step 4: Weight allocation and optimal path calculation: Consider the different requirements of data exchange tasks for response time, security, reliability, and stability, assign weights to each parameter, and perform optimal path calculation to obtain the optimal path for data exchange in cross-network scenarios.

[0024] Embodiment 1:

[0025] like Figure 1 As shown, the above technical ideas can select an optimal path for data exchange in cross-network scenarios, providing a new idea for the development of data exchange related products, business collaboration and information sharing in such scenarios.

[0026] The above technical ideas will be elaborated in detail below.

[0027] Step 1: Initialize and update the routing table.

[0028] The routing table initialization and update includes two phases, namely the initialization phase and the update phase. In the initialization phase, the communication relationship between nodes in all networks that exchange associations across networks is initialized into the routing table.

[0029] like Figure 2 As shown in the figure, it is an example of the communication relationship between networks, where the double arrows indicate two-way communication between two networks, and the single arrow indicates one-way communication. Figure 2 The data exchange routing table formed by the network communication relationship is shown in Table 1.

[0030] Table 1 Data exchange routing information table

[0031]

[0032] The steps to obtain the communication relationship in the above table are as follows:

[0033] S11: Enumerate all networks involved in cross-network switching;

[0034] S12: Perform inter-network communication test through ping command to obtain all sending node information and receiving node information.

[0035] For the update of exchange routing information, by setting the execution cycle of the ping command, the nodes are tested for connectivity at regular intervals, and updates are performed if there are any changes; if the networks involved in the cross-network exchange increase or decrease, S11 to S13 are re-executed.

[0036] Step 2: Enumerate the exchange paths and path lengths.

[0037] like Figure 2 As shown, assuming that the two parties of the exchange are node a and node d, the sender is node a, and the receiver is node d, by looking up the data exchange routing information table in Table 1, the following exchange path and path length can be obtained:

[0038] Path 1: P1 = ((a, b, d), 2);

[0039] Path 2: P2 = ((a,c,d),2);

[0040] Path 3: P3 = ((a,b,c,d),3).

[0041] Wherein, P represents a path, and a switching path and a path length are represented by two tuples, the first tuple (a,…,d) represents the switching path, and the second tuple number represents the length of the switching path.

[0042] Step 3: Path quality perception.

[0043] Path quality perception is to perceive the quality of all exchange paths from the sender to the receiver. The present invention mainly selects three QoS attributes, namely response time, reliability and stability, as link quality parameters of the path. At the same time, the security of the exchange path is considered, and the path length is used as a security assessment factor to comprehensively form the exchange path attribute parameters to perceive the path quality.

[0044] Response time: It is mainly used to measure the link response speed, that is, the total time from the sender sending a communication request to the receiver returning the request result, which is mainly the time consumed by the communication process. The response time is obtained through the ping command, which is the sum of the time from the sender to the receiver through all the links between nodes.

[0045] When the exchange sender is node a and the receiver is node d, the response time of all exchange paths is as follows:

[0046] Path 1: P1(t) = t ab +t bd ;

[0047] Path 2: P2(t) = tac +t cd ;

[0048] Path 3: P3(t) = t ab +t bc +t cd .

[0049] t mn Indicates the response time of the link (m,n), where m represents the previous hop node in the switching path, and n represents the next hop node of node m. The smaller the t value, the higher the link response speed.

[0050] Reliability: It represents the probability of successful data exchange on a link per unit time. It is the product of the probability of successful data exchange on the links from the sender to the receiver. Initially, all exchange paths have the same reliability. As the number of data exchange tasks increases, the success probability changes, and the reliability changes accordingly.

[0051] When the exchange sender is node a and the receiver is node d, the reliability of all exchange paths is as follows:

[0052] Path 1: P1(r) = r ab × bd ;

[0053] Path 2: P2(r) = r ac × cd ;

[0054] Path 3: P3(r) = r ab × bc × cd .

[0055] r mn It indicates the probability of successful data exchange on link (m,n). The larger the r value, the higher the link reliability.

[0056] Stability: describes the stability of the link to maintain normal communication. The communication status is obtained through the ping command. It is the product of the normal communication probabilities of the links from the sender to the receiver.

[0057] When the exchange sender is node a and the receiver is node d, the reliability of all exchange paths is as follows:

[0058] Path 1: P1(s) = s ab ×s bd ;

[0059] Path 2: P2(s) = s ac ×s cd ;

[0060] Path 3: P3(s) = sab ×s bc ×s cd .

[0061] s mn Indicates the probability of link (m,n) being connected. The larger the s value, the higher the link stability.

[0062] In addition to considering link response time, reliability, and stability as factors for optimal path selection, we also consider the possible security risks in data exchange and use path security as a measurement parameter. Since the more nodes passed through during data exchange, the greater the risk of data leakage, the path length (obtained in "Step 2: Enumerate exchange paths and path lengths") is used as security assessment data. The longer the path, the lower the security.

[0063] When the exchange sender is node a and the receiver is node d, the security of all exchange paths is as follows:

[0064] Path 1: P1(l)=Length(P1);

[0065] Path 2: P2(l)=Length(P2);

[0066] Path 3: P3(l)=Length(P3).

[0067] Length(P i ) is the length of path i. The larger the value, the more nodes the path passes through and the lower the path security.

[0068] After the above calculation, the path attribute parameter (P i (t),P i (r),P i (s),P i (l)), where P i (t) is the response time, P i (r) is reliability, P i (s) is stability, P i (l) is the path length.

[0069] Step 4: Weight allocation and optimal path calculation.

[0070] (1) Weight distribution

[0071] When assigning weights to the response time, reliability, stability, and security obtained by path quality perception, it is necessary to consider the different requirements of data exchange tasks on the path. Therefore, it is necessary to classify data exchange tasks. The tasks are mainly divided into the following four categories:

[0072] 1) Time-sensitive tasks: The data exchange between two nodes has low tolerance for time delay and has high requirements for path response speed and stability;

[0073] 2) Security tasks: The exchanged data has high requirements for the security and reliability of the exchange path and has a high tolerance for exchange delays;

[0074] 3) Intensive tasks: high-frequency exchange tasks occur between two nodes, which have high requirements for path reliability and stability;

[0075] 4) Balanced tasks: tasks with similar requirements on path response time, reliability, stability, and security in the entire switching task, and without obvious characteristics.

[0076] According to the above task classification, weights can be assigned to the four parameters of response time, reliability, stability, and security as needed. When designing relevant data exchange products, the weight allocation can be set to user-defined allocation, and the user can allocate it according to his own exchange task, and obtain the weight vector W = (w t ,w r ,w s ,w l ).

[0077] (2) Optimal Path Calculation

[0078] First, through path quality perception, we can know that the larger the response time value, the slower the link speed; the larger the reliability and stability values, the more reliable and stable the link; the security data is represented by the path length. The larger the value, the lower the security. Since the positive and negative proportional relationships between the data are not uniform, we need to first take the inverse of the response time and path length to unify the positive and negative proportional relationships.

[0079] Secondly, the data after preliminary processing is normalized to the [0,1] threshold, so as to unify the path attributes of different units and different value ranges. Data normalization is to scale the original path attribute data proportionally. The present invention uses linear transformation for normalization, and the calculation formula is as follows:

[0080] y=(x-Minvalue) / (Maxvalue-Minvalue)

[0081] Among them, y and x represent the values ​​of the path attribute data after and before conversion, respectively. Minvalue and Maxvalue represent the minimum and maximum values ​​of the original data, respectively.

[0082] Finally, the weight is multiplied by the normalized path attribute data and the sum is calculated. The path corresponding to the maximum value is selected as the optimal path. The calculation formula is as follows:

[0083]

[0084] V=maxx((Vi)

[0085] Among them, pi(t) is the normalized response time, pi(r) is the normalized reliability, pi(s) is the normalized stability, and pi(l) is the normalized path length.

[0086] Compared with the prior art, the present invention implements the initialization and update of data exchange routing information tables, exchange path quality perception, weight allocation, and optimal path calculation, thereby achieving data exchange when the direct path is blocked in cross-network scenarios without opening up exchange links. This can effectively save the economic cost of opening up links and the time overhead of offline exchange, and meet the needs of user business systems and information sharing.

[0087] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the technical principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A method for selecting an optimal path for data exchange in a cross-network scenario, characterized in that: The method comprises the following steps: Step 1: Initialize and update the routing table: Initialize the inter-node communication relationship in all networks associated with cross-network exchange into the data exchange routing information table, and complete the update of the routing table when the inter-node communication relationship is updated; Step 2: Enumerate the exchange paths and calculate the path length: After determining the exchange sender and receiver, enumerate the exchange paths according to the routing table, record the number of nodes the exchange paths pass through, and clarify the length of each path; Step 3: Path quality perception: Obtain the QoS attribute vector of the enumerated exchangeable path link, including response time, reliability and stability, as link quality parameters, and use the exchange path length as a security assessment factor to comprehensively form the exchange path attribute parameters; Step 4: Weight allocation and optimal path calculation: Consider the different requirements of data exchange tasks for response time, security, reliability, and stability, assign weights to each parameter, and perform optimal path calculation to obtain the optimal path for data exchange in cross-network scenarios.

2. The method for selecting the optimal path for data exchange in a cross-network scenario according to claim 1, characterized in that: In the first step, the steps of obtaining the communication relationship are as follows: S11: Enumerate all networks involved in cross-network switching; S12: Perform inter-network connectivity test through ping command to obtain all sending node information and receiving node information, and construct a routing information table.

3. The method for selecting the optimal path for data exchange in a cross-network scenario according to claim 2, characterized in that: In the first step, the execution cycle of the ping command is set to test whether the nodes are connected at regular intervals, and update if there is any change; if the network involved in the cross-network exchange increases or decreases, S11 to S12 are re-executed.

4. The method for selecting the optimal path for data exchange in a cross-network scenario according to any one of claims 1 to 3, characterized in that: In the third step, the response time is used to measure the link response speed, that is, the sum of the time from the sender sending a communication request to the receiver returning the request result. The response time is obtained through the ping command, which is the sum of the time from the sender to the receiver through all the links between nodes.

5. The method for selecting the optimal path for data exchange in a cross-network scenario according to claim 4, characterized in that: In the third step, reliability represents the probability of successful data exchange performed by the link per unit time, which is the product of the probabilities of successful data exchange performed by the links from the sender to the receiver. Initially, all exchange paths have the same reliability. As the number of executions of the data exchange task increases, the success probability changes, and the reliability changes accordingly.

6. The method for selecting the optimal path for data exchange in a cross-network scenario according to claim 5, characterized in that: In the third step, stability describes the stability of the link maintaining normal communication. The communication status is obtained through the ping command, which is the product of the normal communication probabilities of the links from the sender to the receiver.

7. The method for selecting the optimal path for data exchange in a cross-network scenario according to claim 6, characterized in that: In the third step, the comprehensive formation of the switching path attribute parameters includes: obtaining the path attribute parameters (P i (t),P i (r),P i (s),P i (l)), where P i (t) is the response time, P i (r) is reliability, P i (s) is stability, P i (l) is the path length.

8. The method for selecting the optimal path for data exchange in a cross-network scenario according to claim 7, characterized in that: In the fourth step, considering the different requirements of the data exchange task on response time, security, reliability, and stability, the weights assigned to the parameters include: Data exchange tasks include four categories: Time-sensitive tasks: The data exchange between two nodes has low tolerance for time delay and has high requirements for path response speed and stability; Security tasks: The exchanged data has high requirements for the security and reliability of the exchange path and has a high tolerance for exchange delays; Intensive tasks: high-frequency exchange tasks occur between two nodes, which have high requirements for path reliability and stability; Balanced tasks: tasks with similar requirements on path response time, reliability, stability, and security in the entire switching task, and without obvious characteristics; According to the above task classification, weights are assigned to the four parameters of response time, reliability, stability, and security as needed to obtain the weight vector W = (w t ,w r ,w s ,w l ).

9. The method for selecting the optimal path for data exchange in a cross-network scenario according to claim 8, characterized in that: In the fourth step, the optimal path calculation is performed to obtain the optimal path for data exchange in the cross-network scenario, including: The weight is multiplied by the normalized path attribute data and the sum is calculated. The path corresponding to the maximum value is selected as the optimal path. The calculation formula is as follows: V=max(V i ) Among them, p i (t) is the normalized response time, p i (r) is the normalized reliability, p i (s) is the normalized stability, p i (l) is the normalized path length.

10. The method for selecting the optimal path for data exchange in a cross-network scenario according to claim 9, characterized in that: Linear transformation is used for normalization, and the calculation formula is as follows: y=(x-Minvalue) / (Maxvalue-Minvalue) Among them, y and x represent the values ​​of the path attribute data before and after conversion, respectively, and Minvalue and Maxvalue represent the minimum and maximum values ​​of the original data, respectively.

Images