A networking method based on SDN
By adopting the control-level routing establishment method and virtual IP mapping table with hop-by-hop addition in the SDN environment, network stability and performance problems in the SDN environment are solved, rapid network formation and efficient fault response are achieved, and resource utilization is improved. Network adaptability.
Patent Information
- Application Number
- CN202111641070.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-12-29
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2041-12-29
AI Technical Summary
In the SDN environment, complex protocols of traditional network equipment have increased the difficulty of customized optimization for operators, lack of network stability and performance research in high mobile scenarios, unable to effectively deal with node area switching problems, low resource utilization rate, and untimely response. And lack of adaptability to special environments.
Using the control-level routing establishment method that joins hop-by-hop, it can realize routing information by accumulating nodes with ONOS system and LLDP protocols, build a virtual IP mapping table, sense node failure in real time, adjust routing strategies to achieve optimal path selection, and improve resource utilization and fault response capabilities.
It realizes rapid networking, improves network resource utilization and fault response capabilities, ensures network stability and performance in emergencies, reduces network overhead, and realizes single-node fine-grained fault perception and adjustment.
Smart Images

Figure CN114553768B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of SDN (Software Defined Network), and in particular to a networking method and system based on SDN. Background Art
[0002] The hierarchical structure of traditional networks is the key to the great success of the Internet. However, as the scale of the network continues to expand, closed network devices have too many complex protocols built in, which increases the difficulty for operators to customize and optimize the network. Faced with rich application scenarios and diverse business needs, software-defined networks have become a key technology for flexible resource allocation and dynamic service provision. SDN realizes the decoupling of the control plane and the data plane, increasing the flexibility of the network. SDN has brought great innovation to networking architecture and networking applications. However, in environments with dynamic environments and complex influencing factors, the performance of SDN is subject to certain limitations, and the handling of some networking failures is still insufficient. The existing technology involves fewer wired networks, and pays little attention to the adaptability of networking to special environments. There is no solution for the same IP situation in the real network and the research on the stability and performance of networking in high-mobility scenarios. It cannot handle the regional switching problem of nodes well, and wastes controller resources. The traditional routing protocol uses flooding to build networking routes. The controller cannot fully grasp the networking information, the resource utilization rate is low, the response to sudden networking problems is not timely, and the networking is adjusted in a coarse-grained manner. Summary of the invention
[0003] In order to solve the problem of rapid networking in an SDN environment, the present invention proposes a rapid networking solution.
[0004] The present invention provides a method for SDN-based networking, comprising the following steps:
[0005] Set the aggregation node as the control node;
[0006] Taking the control node as the starting node, a control plane routing establishment method is used to complete one-hop routing planning between the control node and surrounding nodes connected in a wired direct connection mode;
[0007] The remaining nodes that are operating normally establish control plane communication with the control node in a hop-by-hop manner to build a complete network.
[0008] Preferably, the aggregation node is equipped with an ONOS system, and the control node senses and collects routing information between nodes through the LLDP protocol integrated in ONOS.
[0009] Preferably, when the control node sends a broadcast data packet, the data packet field includes destination IP information, source IP information, control node port information, hop count information, sequence number information, and verification information; the sequence number information is the data packet flag field, and the next step operation is performed according to the sequence number information in the data packet.
[0010] Preferably, after receiving the broadcast data packet, the node directly connected to the control node constructs and maintains routing table information, wherein the routing table information includes reverse routing information of the node.
[0011] Preferably, when the node directly connected to the control node receives the broadcast data packet sent by the control node, the node performs the following steps:
[0012] Extract source IP information and sequence number information from the broadcast data packet and load them into the routing table maintained by itself;
[0013] The hop count information is increased by 1, and the sequence number information remains unchanged, to form a modified broadcast data packet;
[0014] Forwarding the modified broadcast data packet to other ports except the receiving port;
[0015] The same modified broadcast data packet is constructed and sent back to the control node according to the reverse routing information of the routing table.
[0016] Preferably, when there is a node group with the same IP in the network, a virtual IP mapping table is constructed and maintained in the node with the same IP; the virtual IP mapping table includes the IP information of the node group to which the node with the same IP belongs, the MAC address information corresponding to the node with the same IP, and the virtual IP information corresponding to the node;
[0017] When the IP same node sends a data packet, the step of converting the IP address of the IP same node into a virtual IP is also included;
[0018] When receiving a data packet, the IP same node determines whether the destination IP information of the received data packet is the IP address of the IP same node, and then converts the source IP information of the data packet into a virtual IP according to the virtual IP mapping table.
[0019] Preferably, in the case where a failed node in the middle of the network suddenly disappears: the control node senses the disappearance of the failed node in real time;
[0020] The control node collects node information adjacent to the failed node;
[0021] If there is a data packet that needs to be forwarded to the destination node via the failed node, the control node constructs a centralized adjustment data packet, and the sequence number information of the centralized adjustment data packet increases according to a preset centralized adjustment rule;
[0022] After receiving the centralized adjustment data packet with increased sequence number information, the destination node updates the routing table of the destination node according to the upper-level node information that forwards the data packet, and sends a confirmation packet back to the control node.
[0023] Preferably, in the step of updating the routing table of the destination node, the routing table selects a path with the shortest delay among the paths, and the method for calculating the path with the shortest delay is specifically:
[0024] Among them, a1, a2, a3... are the weight ratios of factors such as the neighboring node system status, Rn is the delay of the current path, and Rn,min is the minimum delay among all paths.
[0025] Preferably, each node in the network is equipped with a state information perception mechanism. When a failed node in the middle of the network suddenly disappears, the destination node that originally needs to forward the data packet through the failed node perceives the failure of the previous node through the state information perception mechanism.
[0026] The destination node deletes the original routing information in the routing table maintained by itself;
[0027] The destination node constructs a distribution adjustment data packet, increases the sequence number information of the distribution adjustment data packet according to a preset distribution adjustment rule, and broadcasts the distribution adjustment data packet;
[0028] After receiving the distribution adjustment data packet, the control node extracts the port information and constructs an adjustment response message and sends it back to the destination node;
[0029] The destination node constructs a new routing table according to the adjustment response information.
[0030] The present invention also provides a network system built based on SDN, which is used to execute any of the above-mentioned networking methods. The network system includes a convergence node equipped with an ONOS system, and also includes a networking state perception module for sensing the current network state; a path optimization module for selecting the optimal path when adjusting the route; and an adjustment strategy module for setting or adjusting the broadcast data packet forwarding strategy and routing strategy when a node is missing in the network system.
[0031] Compared with the existing solutions, at least one of the above technical solutions adopted in the embodiments of the present application can achieve the following beneficial effects: 1) A method for establishing dynamic control plane routing in a simple network by hop-by-hop. The control plane routing establishment process between each node and the controller follows a method of gradually spreading outward with the controller as the center. The joining of the inner node to the control plane routing is a prerequisite and reliable guarantee for the establishment of the routing path of the outer node. The nodes rely on and interact with each other to achieve the goal of establishing a complete control plane routing path network. 2) It solves the problem that many problems and mechanisms in the network cannot be viewed from the perspective of the traditional network due to the same IP, the dual attributes of the address geographical location and identity are lost, and the IP address loses its specificity. 3) In the case of a sudden disappearance of an intermediate node, the control node can effectively play its own role and regulate the network, thereby re-establishing the two-way communication of the control plane routing between the control node and other nodes. 4) An adjustment strategy is adopted to deal with the sudden exit of nodes in the network. The control node perceives the networking failure and performs a series of local adjustments to achieve the goal of rejoining the affected node to the network. In this process, the control node needs to perform "path optimization" to execute the strategy on the optimal path to ensure that the network with sudden interruption still has good performance. 5) The present invention is based on the actual battlefield environment and proposes a networking routing strategy and solution in combination with a special IP mechanism. It proposes to design an in-band networking mechanism of SDN network and virtual IP based on ONOS and P4 in the context of SDN network scenario and ONOS, P4 and bmv2 technology, optimize the network status perception method, improve the utilization rate of network resources, comprehensively consider the causes and correlation of network failures from the perspective of centralized control functions, solve the problems of network failure perception and repair in special environmental scenarios, improve the adaptability of networking to sudden problems, reduce network overhead and improve accuracy in fault adjustment, and realize single-node execution of fine-grained fault perception and effective adjustment. BRIEF DESCRIPTION OF THE DRAWINGS
[0032] Figure 1 It is a schematic diagram of the process flow of the networking method according to an embodiment of the present invention;
[0033] Figure 2 is a flow chart of a control plane routing establishment method according to an embodiment of the present invention;
[0034] Figure 3 It is a strategy adjustment flow chart of network self-adaptation when an intermediate node suddenly fails in an embodiment of the present invention;
[0035] Figure 4 It is a schematic diagram of a strategy adjustment principle of network self-adaptation when an intermediate node suddenly fails in an embodiment of the present invention;
[0036] Figure 5It is a schematic diagram of the second strategy adjustment principle of network adaptation when an intermediate node suddenly fails in an embodiment of the present invention. DETAILED DESCRIPTION
[0037] 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.
[0038] Figure 1 A flow chart of the networking method of the present invention is provided, which includes the following steps:
[0039] Set the aggregation node as the control node;
[0040] First, according to the actual environment and needs, the aggregation node equipped with ONOS is set as the control node, and it is regarded as the starting node in the routing establishment process.
[0041] Taking the control node as the starting node, a control plane routing establishment method is used to complete one-hop routing planning between the control node and surrounding nodes connected in a wired direct connection mode;
[0042] The surrounding nodes connected to the control node in a wired direct connection are regarded as "first hop connections". The one-hop routing planning is completed with the control node through the control plane routing establishment method, which can ensure that the directly connected nodes can communicate normally with the control node at the control plane.
[0043] The remaining nodes that are operating normally establish control plane communication with the control node in a hop-by-hop manner to build a complete network.
[0044] Except for the nodes with one hop, the other nodes that are operating normally establish control-level communication with the starting node by means of directly connected nodes. It can be determined that all directly connected nodes connected to the starting control node have the correct route. These directly connected nodes will play a relay role, and the peripheral nodes will use the relay relationship to establish control-level routing with the starting node; finally, the relatively edge nodes iteratively connect through other nodes that have established connections until all nodes that need to be connected are involved in the network, and then establish a routing path with the control node. In particular, the dynamic scheduling and collaboration of nodes in battlefield environments improves the efficiency and accuracy of special dynamic networking fault detection and processing, further reduces network overhead and improves network efficiency, and prepares for traditional networking to adapt to special environments such as battlefields.
[0045] Figure 2A flow chart of a method for establishing control-layer routing in an embodiment of the present invention is given. In the network system of the present invention, the node that carries the role of the controller needs to be able to perform control-layer routing communication with other nodes. After the control node is correctly configured and notified of information to other nodes, it can know the basic information of all bmv2-enabled nodes. However, this alone cannot realize control-layer functions such as flow table delivery. By notifying the controller of relevant information, it can only prove the existence of other nodes.
[0046] Usually, the control node will correctly receive the file information and know the basic information of other nodes, but it cannot automatically establish a two-way connection on the control plane. Considering the difficulty of how to establish the control plane routing, the present invention proposes a control plane routing establishment method that joins hop by hop. First, according to the actual environment and needs, the aggregation node equipped with ONOS is set as the control node, and it is regarded as the starting node in the routing establishment process; secondly, the surrounding nodes connected to the control node in a wired direct connection manner are regarded as "first hop connection", and the one-hop routing planning is completed with the control node through the control plane routing establishment method, so that the directly connected nodes can communicate normally with the control node on the control plane; then, except for the nodes with one hop, the remaining normally operating nodes establish control plane communication with the starting node by means of directly connected nodes, and it can be determined that all directly connected nodes connected to the starting control node have the correct routing, and these directly connected nodes will play a relay role, and the peripheral nodes use the relay relationship to establish control plane routing with the starting node; finally, the relatively edge nodes iterate the connection process through other nodes that have established connections, and then establish a routing path with the control node.
[0047] The control node is the starting node equipped with ONOS and is also the aggregation node. Node 1 is directly connected to the control node, and node 2 is physically connected to the control node through node 1. Each node is driven by bmv2, and there is no wireless connection method in the system.
[0048] Destination IP (broadcast) Source IP (controller node port) Hop Count Serial Number Checksum ......
[0049] Table 1 Field format of the broadcast data packet of each port of the control node (starting node)
[0050] The control node sends a broadcast packet through the port directly connected to node 1. Node 1 receives the packet and performs three actions based on the arriving data packet: first, it learns and retrieves the IP address of the control node port directly connected to it and the sequence number of the data packet information, and loads them into the routing table maintained by itself; second, it does not change the data packet fields, keeps the destination IP address as the broadcast address, the source IP address remains unchanged, increases the hop count by 1, and does not change the sequence number; third, it forwards the modified data packet to ports other than the receiving port.
[0051] Before executing the three actions, it builds and maintains a routing table based on the datagram information. The information contained in the routing table solves the problem of how the access node can reach the control node, that is, the "reverse route" entry. Node 1 receives the data packet and builds the reverse route. In addition, after completing the execution of the three actions, node 1 builds a data packet of the same format and sends it back according to the reverse route, so as to achieve the purpose of enabling the control node to establish a forward route with the target of node 1. The reverse route information records the routing information of the node to the control node.
[0052] Destination IP (broadcast) Source IP (controller node port) Hop Count Serial Number Checksum ......
[0053] Table 2 Field format of the data packet forwarded by node 1
[0054] Destination IP (control node port) Source IP (node 1 IP) Hop Count Serial Number Checksum ......
[0055] Table 3 Field format of the data packet sent back by node 1 to the control node
[0056] The strategy proposed in the present invention enables node 1 and the control node to successfully establish a two-way control plane routing communication, and then the control node perceives and collects the path information between nodes through the LLDP protocol integrated in ONOS.
[0057] The discovery process of the control plane path relies on the periodic sending mechanism of LLDP data packets. As a link layer protocol, LLDP provides functions such as link perception, link discovery, and periodic collection of link information, and ONOS has integrated the LLDP protocol. When the control node (aggregation node) correctly starts the control function, it periodically sends LLDP broadcast packets to all ports to detect the link status. For the nodes that receive the broadcast packets, they will form a unidirectional TCP packet based on their own information and return it to the control node. Such a data packet contains the connection port number, path information, etc. The control node updates the known path information based on the returned TCP packet, and continues to maintain the real-time and validity of the path information by periodically sending broadcast packets. In addition, the return process of the unidirectional TCP packet depends on the established reverse route.
[0058] The connection process with node 3 is designed on the basis that node 1 and the control node have established control plane routing. In the present invention, node 1, as a node directly connected to the control node, will become the first object to establish control plane routing and provide assistance for subsequent connections of other nodes. Node 2 receives the data packet from node 1 from the port and executes the same process as node 1 to achieve the goal of establishing a two-way routing of the control plane between node 2 and the control node. The principle is: if a data packet is to be sent to the control node, it must be delivered to node 1 first, and the rest of the work is transparent.
[0059] As an embodiment of the present invention, in actual networking, there are situations where nodes of the same type have the same IP, which is called a node group with the same IP. The IP address loses its specificity by losing the dual attributes of the address's geographical location and identity. For a special node group, although the IP addresses of each node are the same, the MAC address remains unique. When the network structure consists of a control node and a group of nodes with the same IP. Each node uses the IP address of the node in the node group and the unique serial number information of each node, and generates a specific "virtual IP" through a special address conversion algorithm with the help of a functional module. After the algorithm is executed, each node uses the "virtual IP" to communicate, and at the same time maintains a routing table with the converted virtual IP as the main content.
[0060] IP address MAC Address Virtual IP IP_1 MAC_1 IP-1 IP_1 MAC_1.1 IP-1.1
[0061] Table 4 Virtual IP mapping table
[0062] Since the serial number of each node is unique, a virtual IP mapping table as shown in Table 4 can be constructed according to the serial number of each node. Each node selects a virtual IP according to the serial number and continues the subsequent packet forwarding and processing process.
[0063] For each node with the same IP, a "virtual IP" can be used every time a data packet is sent or received, but such a sending and receiving process needs to be implemented in cooperation with the controller, P4, etc. Consider the data packet sending and receiving process of two nodes in the same IP node group.
[0064] Each node has a virtual IP mapping table. In a node group under traditional network rules, nodes with the same IP cannot send packets to each other. Assuming that nodes 1 and 2 are both nodes in the node group with the same IP, if node 1 needs to send a data packet to node 2, it needs to convert the destination IP address of the data packet into a virtual IP address according to the mapping table before sending it. Similarly, for node 2, if the destination IP address of the data packet is not IP_1, it will not receive the data packet, so it still needs to convert the source IP address of the data packet into a virtual IP, and convert the destination address (this time is the virtual IP) into the "original" IP, that is, IP_1. Through this conversion process, node 2 can correctly receive the data packet. If the data packet needs to be forwarded to node 3 at this time, and node 2 only acts as an intermediate forwarding node, node 2 will not perform the conversion action, but simply forward the data packet.
[0065] Achieving the above-mentioned packet forwarding goals depends on the collection, calculation, formation and maintenance of information mapping tables by each node in the network. The prerequisite is that the node must have a complete conversion module so that it can convert the same IP into a virtual IP in combination with specific identifiers (serial number, MAC address, etc.).
[0066] After executing the virtual IP generation action, the routing establishment method described in the previous section is executed during the connection between the control node and the subsequent node (non-first-hop node). As long as the node has established bidirectional routing at the control level and formed a virtual IP mapping table, the virtual IP will be used for each subsequent data packet transmission, that is, the data packet sending process described in this section is executed.
[0067] From a macro perspective, the control plane routing establishment process for the same IP node group is to add the important steps of collecting information, converting addresses, generating and maintaining virtual IP mapping tables for each node after each routing is established. Each node uses the virtual IP after this step, which ensures that the node that has established the routing and the node that is about to join the routing have different "IPs", which is consistent with the control plane routing establishment method under different IP backgrounds.
[0068] Figure 3 Schematic diagram of the process of adjusting the network adaptive strategy when the intermediate node of the network system suddenly fails
[0069] When a node in the middle of the network suddenly disappears, the adjacent nodes and peripheral nodes with control plane routes through this node will be affected. Assuming that node 2 suddenly disappears, the control node performs a series of local adjustments to achieve the goal of rejoining node 3 to the network. In the centralized adjustment strategy, the control node is responsible for sensing the exit of node 2. ONOS carried by the control node provides such a functional interface, that is, to query and know the status of the networking node on a visual interface or command line. Once node 3 exits the network, ONOS will obtain relevant information in real time, that is, to sense and collect the real-time status information of the network.
[0070] Figure 4 The schematic diagram is a flow chart of the network adaptive strategy adjustment process when an intermediate node in the network system suddenly fails.
[0071] The control node knows the specific information of the affected adjacent nodes after a node exits. The reason for only considering adjacent nodes is that the control routes relatively close to the control node will not be invalid, and the subordinate nodes of node 3 still follow the principle of only delivering data to node 3 regardless of the subsequent forwarding process. The control node constructs a data packet, the destination IP of the data packet is the port IP of node 3, the source IP is the port IP of the aggregation node connected to node 4, and the sequence number increases according to a unified rule. Since the control plane route of node 4 is not affected, the controller will send the flow table to it normally and use P4 to implement the action. The goal of this action is to send the data packet to the next node with normal control plane routing. In this iterative process, each intermediate node also updates the routing path of node 3, and finally forwards the data packet to node 3. Node 3 receives the data packet with a larger sequence number and identifies it as the notification information formed by the controller after the network update. Then, the control plane route is updated according to the data packet field and the interface information of the received data packet. That is, node 3 updates the routing table by receiving the data packet from node 4, and locates the next hop as node 4. Node 3 will construct a confirmation packet and send it back to the control node to achieve the purpose of confirming the notification. The control node can effectively perform its functions and centrally control the networking, thereby re-establishing two-way communication of the control plane routing with node 3.
[0072] The above adjustment strategy is used to deal with the sudden exit of nodes in the network. The control node senses the network failure and performs a series of local adjustments to achieve the goal of enabling the affected nodes to rejoin the network. In this process, the control node needs to perform "path optimization" and execute the strategy on the optimal path to ensure that the network with sudden interruption still has good performance.
[0073] When the parent node of a node goes down, the current network routing will be invalid. The controller senses the change, quickly finds the normal neighbor node and plans the physical link that can re-establish the routing. Then the path selection algorithm is executed. After the path is determined, the application layer executes the policy. The intermediate node forwards the request data packet to the affected device according to the P4 logic. The affected device returns the response data packet and updates the routing table to rejoin the routing network.
[0074] The execution process of the path optimization algorithm is explained with the actual project networking. The aggregation node perceives the status of the networking nodes and executes the algorithm in combination with the parameters (json format file). The algorithm will generate the weighted values of the optional paths according to a certain calculation logic. It will compare and determine the path object with the minimum weighted value. This is the process of path optimization. After determining the optimal path, the controller executes the centralized adjustment strategy, that is, sends down the flow table and other actions to achieve the goal of re-establishing two-way communication at the control level with the affected nodes.
[0075]
[0076] Table 5 Influencing factors and weight ratios (subscript n represents the nth alternative path)
[0077] This solution uses the “minimum” path weight value to measure the “optimal” concept, that is, the weighted value generated by factors such as path delay, number of path nodes (or number of destination node hops), and neighboring node system status combined with weight ratios (a1, a2, a3, etc.) is considered, as shown in the following formula: R n,min The value is the basis for selecting the optimal path, and the path with the smallest R n The path to the value to execute the adjustment strategy.
[0078] R n =a1*x n,1 +a2*x n,2 +a3*x n,3 +... (1)
[0079] R n,min =min{R1,R2,R3,...} (2)
[0080] In this design, the algorithm for determining the optimal path is named the weighted optimized Floyd algorithm, which helps control nodes process parameters, generate weighted values, and select a routing path that best meets the requirements to execute adjustment strategies, thereby comprehensively improving networking performance and operating efficiency.
[0081] Figure 5 This is a schematic diagram of the second strategy adjustment principle of network adaptation when an intermediate node suddenly fails in an embodiment of the present invention.
[0082] The aforementioned adjustment strategy is adopted to perform network adjustment. In addition to this strategy, the present invention also proposes a second adjustment strategy. Different from the former, the second adjustment strategy is based on the access node rather than the aggregation node with control function. The access node perceives the networking status and executes a completely different networking adjustment strategy. This process is still related to the aggregation node, that is, the control node, because each access node needs to notify the aggregation node of the specific information of the networking changes.
[0083] In the networking, each node has a perception mechanism for maintaining link status information in a traditional network, which is achieved by periodically sending hello packets on the link through the port. The disconnection of the link will cause the control plane routing to lose the necessary physical bearer. Node 3 knows the invalidity of the control plane routing entry through the link status abnormality information collected by the hello packet, and then deletes the routing information of a certain serial number formed during the last update process in the maintained routing table, and finally takes action to try to establish a new control plane routing.
[0084] In this solution, the remaining unaffected nodes still have routes to the control node. Node 3 constructs a data packet with a uniformly increased sequence number field and broadcasts it. After the broadcast packet is received by the aggregation node, because the sequence number is different and the sequence number is larger at this time, the aggregation node will record the packet receiving port and packet information, and construct a response message to send back to node 3. Since the nodes along the broadcast packet have forward routes to node 3, the response message will be normally transmitted back to node 3, so that node 3 knows what the new control plane routing path is, and knows that the control signaling needs to be sent to the port of node 4.
[0085] Although the preferred embodiments of the present application have been described, those skilled in the art may make additional changes and modifications to these embodiments once they are aware of the basic creative concepts. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present application. Obviously, those skilled in the art may make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.
Claims
1. A networking method based on SDN, characterized in that: The following steps are involved: Set the aggregation node as the control node; Taking the control node as the starting node, a control plane routing establishment method is used to complete one-hop routing planning between the control node and surrounding nodes connected in a wired direct connection mode; The remaining nodes that are operating normally establish control plane communication with the control node in a hop-by-hop manner to build a complete network. The aggregation node is equipped with an ONOS system, and the control node senses and collects routing information between nodes through the LLDP protocol integrated with ONOS; When the control node sends a broadcast data packet, the data packet field includes the destination IP information, source IP information, control node port information, hop count information, sequence number information, and checksum information; The sequence number information is a data packet flag field, and the next operation is performed according to the sequence number information in the data packet; After receiving the broadcast data packet, the node directly connected to the control node constructs and maintains routing table information, wherein the routing table information includes reverse routing information of the node; When there is a node group with the same IP in the network, a virtual IP mapping table is constructed and maintained at the node with the same IP; the virtual IP mapping table includes the node group IP information to which the node with the same IP belongs, the MAC address information corresponding to the node with the same IP, and the virtual IP information corresponding to the node; When the IP same node sends a data packet, the step of converting the IP address of the IP same node into a virtual IP is also included; When the IP same node receives a data packet, if it determines that the destination IP information of the received data packet is the IP address of the IP same node, the source IP information of the data packet is converted into a virtual IP according to the virtual IP mapping table.
2. The networking method according to claim 1, characterized in that: When the node directly connected to the control node receives the broadcast data packet sent by the control node, it performs the following steps: Extract source IP information and sequence number information from the broadcast data packet and load them into the routing table maintained by itself; The hop count information is increased by 1, and the sequence number information remains unchanged, to form a modified broadcast data packet; Forwarding the modified broadcast data packet to other ports except the receiving port; The same modified broadcast data packet is constructed and sent back to the control node according to the reverse routing information of the routing table.
3. The networking method according to claim 1, characterized in that: In the case where a failed node in the middle of the network suddenly disappears: the control node senses the disappearance of the failed node in real time; The control node collects node information adjacent to the failed node; If there is a data packet that needs to be forwarded to the destination node via the failed node, the control node constructs a centralized adjustment data packet, and the sequence number information of the centralized adjustment data packet increases according to a preset centralized adjustment rule; After receiving the centralized adjustment data packet with increased sequence number information, the destination node updates the routing table of the destination node according to the upper-level node information that forwards the data packet, and sends a confirmation packet back to the control node.
4. The networking method according to claim 3, characterized in that: In the step of updating the routing table of the destination node, the routing table selects a path with the shortest delay among the paths, and the method for calculating the path with the shortest delay is specifically as follows: R n =a1*x n,1 +a2*x n,2 +a3*x n,3 R n,min =min{R1,R2,R3} Among them, a1 is the weight ratio of delay, a2 is the weight ratio of the number of nodes in the path, a3 is the weight ratio of the neighboring node system status, Rn is the delay of the current path, which is R n,min The minimum delay among all paths, n represents the nth candidate path, x n,1 represents the delay, x n,2 Represents the number of nodes in the path, x n,3 Represents the neighbor node system status.
5. The networking method according to claim 1, characterized in that: Each node in the network is equipped with a state information perception mechanism. When a failed node in the middle of the network suddenly disappears, the destination node that originally needs to forward the data packet through the failed node perceives the failure of the previous node through the state information perception mechanism. The destination node deletes the original routing information in the routing table maintained by itself; The destination node constructs a distribution adjustment data packet, increases the sequence number information of the distribution adjustment data packet according to a preset distribution adjustment rule, and broadcasts the distribution adjustment data packet; After receiving the distribution adjustment data packet, the control node extracts the port information and constructs an adjustment response message and sends it back to the destination node; The destination node constructs a new routing table according to the adjustment response information.
6. A network system based on SDN, used to execute any one of the networking methods in claims 1-5, the network system comprising a convergence node equipped with an ONOS system, characterized in that: It also includes a networking state perception module for perceiving the current network state; a path optimization module for selecting the optimal path when adjusting the route; and an adjustment strategy module for setting or adjusting the broadcast data packet forwarding strategy and routing strategy when a node is missing in the network system.
