Wired transmission communication network path calculation method based on multi-handshake protocol

Abstract

The invention relates to the technical field of wired transmission communication, in particular to a wired transmission communication network path calculation method based on a multi-handshake protocol, which adopts the multi-handshake protocol to realize selection and connection establishment of a communication network path, and evaluates whether network resource dynamic adjustment needs to be carried out based on a network resource operation condition parameter factor P; specifically, the multi-handshake protocol implementation method comprises the steps of initiating a connection establishment request and generating a connection state report, synchronizing the connection state report and finishing cross connection, and notifying that the cross connection is finished to realize availability of a communication link. In the process of evaluating the parameter factor P of the network resource operation condition, whether dynamic adjustment of the network resources needs to be carried out is judged based on comparison of network parameters such as link transmission delay, link available bandwidth proportion and link reliability; and after the dynamic adjustment of the network resources is completed, the dynamic adjustment effect of the resources is re-evaluated and confirmed through the network resource operation state.

Description

A Path Calculation Method for Wired Transmission Communication Networks Based on a Multiple Handshake Protocol Technical Field

[0001] This invention relates to the field of wired transmission communication technology, and specifically to a method for calculating the path of a wired transmission communication network based on a multiple handshake protocol. Background Technology

[0002] Wired communication refers to a communication method that uses physical media such as cables (twisted pairs) or optical fibers to transmit data. This method relies on physical lines and offers higher stability and security compared to wireless communication. Currently, the mainstream wired transmission methods are fiber optic transmission and double-sided transmission. Fiber optic transmission uses light pulses to transmit information, offering high speed and bandwidth, making it suitable for long-distance and high-capacity data transmission. Double-sided transmission uses twisted-pair (UTP) cables to transmit data, offering lower construction and operation costs, ease of use, and suitability for short-distance, low-speed data transmission scenarios.

[0003] In the deployment and use of traditional wired transmission communication networks, fiber optic transmission and multiplexed transmission, due to the significant differences in their transmission systems, typically employ independent network deployment and static path selection configuration to achieve data communication functions, which has the following drawbacks:

[0004] 1. Low network resource utilization: Static configuration of communication paths cannot adjust network resources according to real-time data load, resulting in some communication links or nodes being overloaded while some network resources are idle.

[0005] 2. Insufficient dynamic adjustment capability of network resources: There is a lack of a real-time response mechanism for changes in network topology and fluctuations in business demand, making it difficult to meet the needs of differentiated data services. Summary of the Invention

[0006] The purpose of this invention is to provide a method for calculating the path of a wired transmission communication network based on a multiple handshake protocol. By optimizing path resource selection, real-time monitoring of network operation status, and dynamic adjustment of network resources, the method achieves dynamic optimization of wired transmission network resources.

[0007] To achieve the above objectives, this invention provides a method for calculating the path of a wired transmission communication network based on a multiple handshake protocol, comprising the following steps:

[0008] Step 1: Optimize path resource selection based on the multiple handshake protocol;

[0009] Step 2: Conduct a network resource operation status assessment;

[0010] Step 3: Generate a dynamic network resource adjustment strategy;

[0011] Step 4: Implement the network resource dynamic adjustment strategy and re-initiate the multiple handshake protocol;

[0012] Step 5: Reassess the operational status of network resources;

[0013] Step 6: Evaluation of the effect of dynamic resource adjustment.

[0014] Optionally, in step 1, the start and end points of data transmission, i.e., the information source node and the information destination node, are determined according to the communication needs of network users. The source node and the destination node initiate multiple handshake protocols, and the link transmission delay needs to be comprehensively considered during the handshake process. Percentage of available bandwidth on the link and link reliability During the initial handshake protocol process, priority is given to the proportion of available bandwidth on the link. .

[0015] Alternatively, the implementation steps of the multiple handshake protocol are as follows:

[0016] Initiate a connection establishment request and generate a connection status report;

[0017] Synchronize connection status reports and complete cross-connection;

[0018] The cross-connection is complete, and the communication link is now available.

[0019] Optionally, the core idea of ​​adjusting the network resource dynamic scheduling strategy in step 3 is to intentionally increase the weight value of link bandwidth during the subsequent initiation of multiple handshake protocols, and to select network paths with larger bandwidth in order to avoid the occurrence of problems.

[0020] Optionally, step 4 uses the network parameter values ​​determined during the generation of the network resource dynamic scheduling strategy in step 3. When the determination result is that network resources are scarce, multiple handshake protocols are re-initiated between the information source node and the information destination node to generate a new network path configuration strategy.

[0021] Optionally, after data transmission stabilizes in step 5, a network resource operation status assessment, similar to step 2, is performed to calculate the value of the current network resource operation parameter factor P.

[0022] Optionally, in step 6, when the value range of the resource operation parameter factor P is [ , ],Right now ≥P≥ When this occurs, it indicates that the communication network is operating well, the aforementioned dynamic adjustment of network resources is effective, and the network adjustment is complete.

[0023] Otherwise, repeat steps 2 through 5 until the condition is met. ≥P≥ conditions.

[0024] This invention provides a method for calculating wired transmission communication network paths based on a multiple handshake protocol. The method employs a multiple handshake protocol to select and establish communication network paths, and evaluates whether dynamic network resource adjustments are needed based on a network resource operation parameter factor P. Specifically, the multiple handshake protocol implementation method includes steps such as initiating a connection establishment request and generating a connection status report, synchronizing the connection status report and completing cross-connection, and notifying the completion of cross-connection to ensure the communication link is available. During the evaluation of the network resource operation parameter factor P, the method compares network parameters such as link transmission delay, available bandwidth ratio, and link reliability to determine whether dynamic network resource adjustments are needed. After dynamic adjustments are completed, the effectiveness of the adjustments is confirmed by re-evaluating the network resource operation status. This invention solves the problems of unreasonable resource utilization and insufficient dynamic adjustment capabilities caused by static configuration of network path resources in existing wired transmission communication technologies, achieving dynamic optimization of wired transmission network resources. Attached Figure Description

[0025] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0026] Figure 1 is a schematic diagram of the execution flow of the wired transmission communication network path calculation method based on the multiple handshake protocol of the present invention.

[0027] Figure 2 is a schematic diagram of the implementation steps of the multiple handshake protocol of the present invention. Detailed Implementation

[0028] Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and intended to explain the present invention, and should not be construed as limiting the present invention.

[0029] This invention provides a method for calculating the path in a wired transmission communication network based on a multiple handshake protocol, comprising the following steps:

[0030] Step S1: Optimize path resource selection based on the multiple handshake protocol;

[0031] Step S2: Conduct a network resource operation status assessment;

[0032] Step S3: Generate a dynamic network resource adjustment strategy;

[0033] Step S4: Implement the network resource dynamic adjustment strategy and re-initiate the multiple handshake protocol;

[0034] Step S5: Reassess the operational status of network resources;

[0035] Step S6: Evaluation of the effect of dynamic resource adjustment.

[0036] The specific implementation process is shown in Figure 1. The following is a further explanation of the implementation steps:

[0037] Step 1: Path resource optimization selection based on multiple handshake protocol

[0038] The origin and destination of data transmission, namely the source node and the destination node, are determined based on the communication needs of network users. Multiple handshake protocols are initiated between the source and destination nodes, and the link transmission delay needs to be comprehensively considered during the handshake process. Percentage of available bandwidth on the link and link reliability Network parameters such as bandwidth are used to select the transmission path and implement data transmission functionality. During the initial handshake protocol, the available bandwidth of the link is usually given priority to ensure that the network bandwidth is sufficient to meet the application requirements, thereby determining the data transmission path.

[0039] The multiple handshake protocol is a distributed message probing mechanism that requires the network to collect reported path information. Furthermore, the multiple handshake protocol is performed in real time, thus enabling rapid determination of available network resources when a connection is established. The multiple handshake protocol is completed in three message steps, as shown in Figure 2.

[0040] Step 1: Initiate a connection establishment request and generate a connection status report. Probe signaling is sent from the source (node ​​A) to the destination (node ​​Z) along each candidate working path, collecting information on link idleness in the network. Destination node Z receives this signaling message and then calculates the optimal network resources to meet the connection establishment requirements for each probe signaling message (based on parameters such as transmission latency, available bandwidth ratio, and link reliability). Finally, based on network parameter factors (… Taking into account the amount of available resources along the path, the destination node Z will select the optimal network path and generate a connection status report. Once the working path is selected, the physical links along that path are also determined, along with the bandwidth and transceivers reserved for the second step of the multiple handshake protocol. Completing the first step of the message process takes approximately 5ms.

[0041] Step 2: Synchronize connection status reports and complete cross-connection. Probe signaling is transmitted back from the destination (Node Z) to the source (Node A) along the selected path, informing Node A of the network resources reserved for this connection. In addition to reserving the bandwidth resources selected by Node Z, this message process will reserve additional transmission paths and transceivers when needed. The number of additional transmission paths required depends on the bandwidth of the connection request. If a path originally designated for a link is preempted by another connection establishment request during this message process, the reserved additional paths will replace the preempted link. Simulation results show that reserving a small number of additional path resources can significantly reduce backward congestion. Simultaneously, to minimize the increase in network load (only about 1%), the additional resources are reserved for a very short time.

[0042] During the transmission of probe signaling from the destination to the source, each node along the path immediately establishes a cross-connection to build the necessary link after receiving information from the probe signaling. The probe signaling does not wait for the cross-connection to complete but continues to be transmitted back to the source node. When the source node receives the probe signaling, node A determines the network resources to use based on the successfully established path connections. Simultaneously, node A establishes a cross-connection to its user port and notifies the user that the cross-connection for that port has been established.

[0043] Step 3: Notify the cross-connection is complete and the communication link is available. Node A sends a signaling message to the destination node Z, informing it that the connection has been successfully established and releasing unnecessary additional reserved resources. Upon receiving the signaling message, node Z informs its user connection that it has been established, the cross-connection of the node's user port has been completed, and the communication link is available.

[0044] In step 2, once node A completes the cross-connection of its user interface, the entire connection is established, and the user can begin transmitting data. The user uses a 15ms timer to determine when to start transmitting data.

[0045] Step S2: Conduct a network resource operation status assessment

[0046] a. Weighting coefficient settings: Default

[0047] b. Normalized evaluation value calculation: Map each network parameter to the interval [0,1] (e.g., when the service demand bandwidth is 8Mbps and the available link bandwidth is 10Mbps, the corresponding value is...). The service requires a latency of 10ms, and the corresponding link transmission latency is 3ms. );

[0048] c. Example of parameter factor calculation: Let... A parameter factor of a certain multiline transmission network ,at this time This indicates that the network resources are operating well and no adjustments are needed.

[0049] Step S3: Generation of dynamic network resource scheduling strategy

[0050] As in step S2 above, a certain multi-line transmission network parameter factor ≤ At this time, no network resource adjustments are required. The process jumps to the end, and subsequently, step S2 is repeated periodically at the set time intervals to conduct network resource operation status assessments.

[0051] Assuming other conditions in step S2 remain unchanged, the required bandwidth for the service becomes 9Mbps, corresponding to ,at this time ≥ This indicates "network resource strain," necessitating dynamic network adjustments and the generation of a dynamic network resource scheduling strategy. The core idea of ​​this adjustment is to intentionally increase the weight of link bandwidth during subsequent handshake protocol initiations, prioritizing network paths with higher bandwidth to mitigate potential problems.

[0052] Step S4: Implement the network resource dynamic adjustment strategy

[0053] Based on the network parameter values ​​(such as larger link bandwidth) determined when the network resource dynamic scheduling strategy is generated in step S3, multiple handshake protocol processes are carried out between the source node and the destination node to generate a new network path resource configuration.

[0054] Step S5: Reassess the operational status of network resources

[0055] After implementing the network resource dynamic adjustment strategy in step S4, a new wired transmission communication network is formed, and data service transmission begins. Once data transmission stabilizes, a network resource operation status assessment, as in step S2, is performed to calculate the value of the current network resource operation parameter factor P.

[0056] Step S6: Evaluation of the effect of dynamic resource adjustment

[0057] When the value range of the resource operation parameter factor P is [ , ],Right now ≥P≥ If the network is in good working order, the aforementioned dynamic adjustment of network resources is effective, and the network adjustment ends. Otherwise, repeat steps S2 to S5 until the condition is met. ≥P≥ conditions.

[0058] The above description discloses only one preferred embodiment of the present invention, and should not be construed as limiting the scope of the present invention. Those skilled in the art will understand that all or part of the processes of the above embodiments can be implemented, and equivalent changes made in accordance with the claims of the present invention are still within the scope of the invention.

Claims

1. A method for calculating the path in a wired transmission communication network based on a multiple handshake protocol, characterized in that, The process includes the following steps: Step 1: Optimize path resource selection based on the multiple handshake protocol; Step 2: Conduct network resource operation status assessment; Step 3: Generate network resource dynamic adjustment strategy; Step 4: Execute the network resource dynamic adjustment strategy and re-initiate the multiple handshake protocol; Step 5: Reassess network resource operation status; Step 6: Evaluate the effect of dynamic resource adjustment.

2. The wired transmission communication network path calculation method based on a multiple handshake protocol as described in claim 1, characterized in that, In step 1, the start and end points of data transmission are determined based on the communication needs of network users, namely the information source node and the information destination node. The source node and the destination node initiate multiple handshake protocols, and the link transmission delay needs to be comprehensively considered during the handshake process. Percentage of available bandwidth on the link and link reliability During the initial handshake protocol process, priority is given to the proportion of available bandwidth on the link. 。 3. The wired transmission communication network path calculation method based on a multiple handshake protocol as described in claim 2, characterized in that, The implementation steps of the multiple handshake protocol are as follows: initiate a connection establishment request and generate a connection status report; synchronize the connection status report and complete the cross-connection; notify that the cross-connection is complete and the communication link is available.

4. The method for calculating the path of a wired transmission communication network based on a multiple handshake protocol as described in claim 3, characterized in that, The execution process of step 2 includes the following steps: Step 2.1: Set weight coefficients; Step 2.2: Calculate normalized evaluation values; Step 2.3: Calculate and compare parameter factors for judgment.

5. The method for calculating the path of a wired transmission communication network based on a multiple handshake protocol as described in claim 4, characterized in that, The core idea behind the dynamic scheduling strategy adjustment for network resources in step 3 is to intentionally increase the weight value of link bandwidth during subsequent multiple handshake protocol initiations, and to select network paths with larger bandwidth to avoid problems.

6. The wired transmission communication network path calculation method based on a multiple handshake protocol as described in claim 5, characterized in that, Step 4, based on the network parameter values ​​determined during the generation of the network resource dynamic scheduling strategy in Step 3, when the determination result is that network resources are scarce, re-initiates multiple handshake protocols between the information source node and the information destination node to generate a new network path configuration strategy.

7. The method for calculating the path of a wired transmission communication network based on a multiple handshake protocol as described in claim 6, characterized in that, In step 5, after the data transmission has stabilized, the network resource operation status assessment is carried out as in step 2, and the value of the current network resource operation parameter factor P is calculated.

8. The method for calculating the path of a wired transmission communication network based on a multiple handshake protocol as described in claim 7, characterized in that, In step 6, when the value range of the resource operation parameter factor P is [ , ],Right now ≥P≥ If the network is in good working order, the aforementioned dynamic adjustment of network resources is effective, and the network adjustment ends; otherwise, repeat steps 2 to 5 until the desired result is achieved. ≥P≥ Conditions.

Images