Method and device for disseminating information between nodes in a network

Abstract

The present invention provides a method and device for disseminating node information between networks, belonging to the field of network security technology. The method for disseminating node information between networks is performed by a first router, the first router and the second router are adjacent to each other on the network, and the method comprises: sending a link state update LSU message to the second router, the link state announcement LSA in the LSU message contains the node information of the first router; receiving a link state confirmation LSAck message replied by the second router, the LSAck message contains the header information of the LSA. The technical solution of the present invention can reduce the data traffic generated in the process of node information dissemination, and is applicable to general IPv6 scenarios.

Description

Technical Field

[0001] The present invention relates to the field of network security technology, and in particular to a method and device for transmitting information between network nodes. Background Art

[0002] With the promotion of IPv6 network deployment and application at the national level, more and more Internet asset devices have been or are using IPv6 networks. Due to the large-scale deployment and application of various intelligent terminal devices, IoT facilities, and various application service platforms, coupled with the accelerated promotion of 5G network commercialization, new scenarios such as autonomous driving and the Internet of Everything are constantly emerging. In the future, asset devices using IPv6 networks may increase exponentially compared to before. In the above situations, how to manage assets in IPv6 network space will face many new challenges.

[0003] Challenge 1. IPv6 has a larger available address space. Because the address length of IPv6 has been increased from the original IPv4 32 bits (can accommodate 2 32 addresses) to 128 bits (can accommodate 2 128 Most of the existing methods and approaches for managing assets in IPv4 networks are not suitable for IPv6 network space.

[0004] Challenge 2. IPv6 address acquisition / generation is highly random. IPv6 network supports devices to obtain IPv6 addresses in a variety of ways. In particular, the stateless address auto configuration (SLAAC) method generates a large number of random IPv6 addresses. Due to privacy and security issues, it is difficult to reverse infer, and this method has been widely used in actual scenarios.

[0005] Challenge 3. The commonly used subnet division method of IPv6 results in a huge subnet space. In actual use, IPv6 networks often divide subnets according to / 64 (2 64 In some real-world scenarios, when a network consists of multiple / 64 (capable of accommodating 2 64 When a larger-scale IPv6 network is formed by subnets of a size of 1000 addresses, the available address space in such a network is extremely large, making it impossible to quickly and easily collect the existing surviving IPv6 assets in the network through conventional means.

[0006] How to use limited time and space to more conveniently manage assets in IPv6 networks has become a very thorny issue. Technically, it is difficult to use a certain method to effectively manage IPv6 assets. At present, the industry has proposed a number of technologies and methods for IPv6 asset discovery / scanning, typically including probe intensive collection method, Domain Name System (DNS) reverse query method, current network traffic analysis method and addressing rule inference method. These four methods can assist in the management of IPv6 assets in certain specific scenarios, but none of them is suitable for more general scenarios. Summary of the invention

[0007] The technical problem to be solved by the present invention is to provide a method and device for disseminating node information between networks, which can reduce the data traffic generated during the node information dissemination process and is applicable to general IPv6 scenarios.

[0008] To solve the above technical problems, the embodiments of the present invention provide the following technical solutions:

[0009] In one aspect, a method for disseminating node information between networks is provided, which is performed by a first router, wherein the first router is adjacent to a second router on a network, and the method comprises:

[0010] Sending a link state update LSU message to the second router, wherein the link state advertisement LSA in the LSU message includes the node information of the first router;

[0011] A link state acknowledgment LSAck message replied by the second router is received, wherein the LSAck message includes header information of the LSA.

[0012] In some embodiments, before sending the LSU message to the second router, the method further includes:

[0013] Using a Hello message to establish a neighbor relationship with the second router, and negotiate an adjacency relationship and a master-slave relationship with the second router;

[0014] Using the database to describe the DD message, exchanging header information of the LSA with the second router, the LSA including the node information;

[0015] A link state request LSR message is received from the second router, wherein the LSR message requests to obtain the LSA.

[0016] In some embodiments, sending the LSU message to the second router includes:

[0017] The LSU message is sent to the designated router DR, and after the DR updates the local link state database LSDB according to the LSU message, the LSU is multicast to all second routers.

[0018] In some embodiments, receiving the LSAck message replied by the second router includes:

[0019] The LSAck message sent by the DR is received, where the LSAck message is sent by the second router to the DR.

[0020] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0021] The embodiment of the present invention further provides a method for disseminating node information between networks, which is performed by a second router, and the second router is adjacent to the first router on the network. The method includes:

[0022] Receiving a link state update LSU message sent by the first router, wherein the link state advertisement LSA in the LSU message includes node information of the first router;

[0023] Sending a link state confirmation LSAck message to the first router, wherein the LSAck message includes header information of the LSA;

[0024] An LSA including node information is calculated according to the LSU message and stored in a local link state database LSDB.

[0025] In some embodiments, before receiving the link state update LSU message sent by the first router, the method further includes:

[0026] receiving a Hello message from the first router, establishing a neighbor relationship with the first router, and negotiating an adjacency relationship and a master-slave relationship with the first router;

[0027] Using a database to describe a DD message, exchanging header information of an LSA with the first router, wherein the LSA includes node information;

[0028] A link state request (LSR) message is sent to the first router, wherein the LSR message requests to obtain the LSA.

[0029] In some embodiments, receiving a link state update LSU message sent by the first router includes:

[0030] The LSU message is received by a designated router DR through multicast, where the LSU message is sent by the first router to the DR.

[0031] In some embodiments, sending a link state acknowledgment LSAck message to the first router includes:

[0032] The LSAck message is sent to the DR, and the DR sends the LSAck message to the first router.

[0033] In some embodiments, calculating an LSA including node information according to the LSU message and storing the LSA in a local link state database LSDB includes:

[0034] Step 1: If there is no LSA containing the node information IN in the local LSDB, store the received LSA containing the node information into the node information link state IN Link States of the local LSDB, otherwise go to step 2;

[0035] Step 2: If there is an LSA containing node information in the local LSDB, compare the LSA Age of the existing LSA with the received LSA containing node information. If the LSA Age of the two is not equal, store the node information in the LSA with the smaller LSA Age as the best node information in the corresponding parameters of the router, and store the LSA with the smaller LSA Age in the IN Link States of the local LSDB, and delete the remaining LSA information in the IN Link States; if the LSA Age of the two is equal, execute step 3;

[0036] Step 3: Select the node information in the LSA from Area 0 as the best node information and store it in the corresponding parameters of the router. Then store the LSA in the IN Link States of the local LSDB and delete the remaining LSA information in the IN Link States. If there is no LSA from Area 0, go to step 4.

[0037] Step 4: Compare the Link StateID, Advertising Router, and LS Sequence Number in the existing LSA and the received LSA containing the node information in turn, store the LSA with the larger value in IN LinkStates of the local LSDB, and delete the remaining LSA information in IN Link States; if the existing LSA is the same as the received LSA containing the node information, discard the LSU message.

[0038] In some embodiments, if the second router is an area border router ABR, the method further includes:

[0039] If the Link State ID of the received LSA containing node information is not in the Area 0 backbone area, it is prohibited to flood or forward the LSA to the interface of the Area 0 backbone area;

[0040] If the Link State ID of the received LSA containing the node information is in the Area 0 backbone area, the Link State ID and Advertising Router in the LSA are changed to the Router ID of the ABR, and the LSA is flooded or forwarded to the interface of the non-Area 0 area.

[0041] In some embodiments, if the second router is an autonomous system boundary router ASBR, the method further includes:

[0042] It is prohibited to transfer the LSA to the interface of the area outside the autonomous system AS domain of the dynamic routing protocol OSPF.

[0043] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0044] The embodiment of the present invention further provides an inter-network node information transmission device, which is applied to a first router, wherein the first router is adjacent to a second router on a network, and comprises a transceiver and a processor.

[0045] The transceiver is used to send a link state update LSU message to the second router, wherein the link state advertisement LSA in the LSU message includes the node information of the first router; and receive a link state confirmation LSAck message replied by the second router, wherein the LSAck message includes the header information of the LSA.

[0046] In some embodiments, the transceiver is also used to establish a neighbor relationship with the second router using a Hello message, and negotiate an adjacency relationship and a master-slave relationship with the second router; use a database description DD message to exchange LSA header information with the second router, the LSA containing node information; receive a link state request LSR message from the second router, the LSR message requesting to obtain the LSA.

[0047] In some embodiments, the transceiver is specifically configured to send the LSU message to a designated router DR, and after the DR updates a local link state database LSDB according to the LSU message, the DR multicasts the LSU to all second routers.

[0048] In some embodiments, the transceiver is specifically used to receive the LSAck message sent by the DR, and the LSAck message is sent by the second router to the DR.

[0049] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0050] The embodiment of the present invention further provides an inter-network node information transmission device, which is applied to a second router, the second router is adjacent to the first router on the network, and includes a transceiver and a processor.

[0051] The transceiver is used to receive a link state update LSU message sent by the first router, wherein the link state advertisement LSA in the LSU message includes the node information of the first router; and send a link state confirmation LSAck message to the first router, wherein the LSAck message includes the header information of the LSA;

[0052] The processor is used for calculating the LSA containing the node information according to the LSU message, and storing it in the local link state database LSDB.

[0053] In some embodiments, the transceiver is also used to receive a Hello message from the first router, establish a neighbor relationship with the first router, and negotiate an adjacency relationship and a master-slave relationship with the first router; use a database description DD message to exchange LSA header information with the first router, the LSA containing node information; send a link state request LSR message to the first router, the LSR message requests to obtain the LSA.

[0054] In some embodiments, the transceiver is specifically used to receive the LSU message sent by multicast by a designated router DR, and the LSU message is sent by the first router to the DR.

[0055] In some embodiments, the transceiver is specifically configured to send the LSAck message to the DR, and the DR sends the LSAck message to the first router.

[0056] In some embodiments, the processor is specifically configured to perform the following steps:

[0057] Step 1: If there is no LSA containing the node information IN in the local LSDB, store the received LSA containing the node information into the node information link state IN Link States of the local LSDB, otherwise go to step 2;

[0058] Step 2: If there is an LSA containing node information in the local LSDB, compare the LSA Age of the existing LSA with the received LSA containing node information. If the LSA Age of the two is not equal, store the node information in the LSA with the smaller LSA Age as the best node information in the corresponding parameters of the router, and store the LSA with the smaller LSA Age in the IN Link States of the local LSDB, and delete the remaining LSA information in the IN Link States; if the LSA Age of the two is equal, execute step 3;

[0059] Step 3: Select the node information in the LSA from Area 0 as the best node information and store it in the corresponding parameters of the router. Then store the LSA in the IN Link States of the local LSDB and delete the remaining LSA information in the IN Link States. If there is no LSA from Area 0, go to step 4.

[0060] Step 4: Compare the Link StateID, Advertising Router, and LS Sequence Number in the existing LSA and the received LSA containing the node information in turn, store the LSA with the larger value in IN LinkStates of the local LSDB, and delete the remaining LSA information in IN Link States; if the existing LSA is the same as the received LSA containing the node information, discard the LSU message.

[0061] In some embodiments, the processor is further used to prohibit flooding or forwarding the LSA to the interface of the Area 0 backbone area if the Link State ID of the received LSA containing node information is not in the Area 0 backbone area; if the Link State ID of the received LSA containing node information is in the Area 0 backbone area, change the LinkState ID and Advertising Router in the LSA to the Router ID of the ABR, and flood or forward the LSA to the interface of the non-Area 0 area.

[0062] In some embodiments, the processor is further configured to prohibit the LSA from being transmitted to an interface in an area outside an autonomous system (AS) domain of a dynamic routing protocol OSPF.

[0063] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0064] An embodiment of the present invention also provides an inter-network node information dissemination device, including a memory, a processor, and a computer program stored in the memory and executable on the processor; when the processor executes the program, the inter-network node information dissemination method described above is implemented.

[0065] In some embodiments, the inter-network node information dissemination device is applied to the first router, and the processor is used to send a link state update LSU message to the second router, and the link state announcement LSA in the LSU message includes the node information of the first router; receive a link state confirmation LSAck message replied by the second router, and the LSAck message includes the header information of the LSA.

[0066] In some embodiments, the processor is also used to establish a neighbor relationship with the second router using a Hello message, and negotiate an adjacency relationship and a master-slave relationship with the second router; use a database description DD message to exchange LSA header information with the second router, the LSA containing node information; receive a link state request LSR message from the second router, the LSR message requesting to obtain the LSA.

[0067] In some embodiments, the processor is specifically configured to send the LSU message to a designated router DR, and after the DR updates a local link state database LSDB according to the LSU message, the DR multicasts the LSU to all second routers.

[0068] In some embodiments, the processor is specifically configured to receive the LSAck message sent by the DR, where the LSAck message is sent by the second router to the DR.

[0069] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0070] In some embodiments, the inter-network node information dissemination device is applied to the second router, and the processor is used to receive a link state update LSU message sent by the first router, and the link state announcement LSA in the LSU message contains the node information of the first router; send a link state confirmation LSAck message to the first router, and the LSAck message contains the header information of the LSA; calculate the LSA containing the node information according to the LSU message, and store it in the local link state database LSDB.

[0071] In some embodiments, the processor is also used to receive a Hello message from the first router, establish a neighbor relationship with the first router, and negotiate an adjacency relationship and a master-slave relationship with the first router; use a database description DD message to exchange LSA header information with the first router, the LSA containing node information; send a link state request LSR message to the first router, the LSR message requests to obtain the LSA.

[0072] In some embodiments, the processor is specifically configured to receive the LSU message sent by multicast by a designated router DR, where the LSU message is sent by the first router to the DR.

[0073] In some embodiments, the processor is specifically configured to send the LSAck message to the DR, and the DR sends the LSAck message to the first router.

[0074] In some embodiments, the processor is specifically configured to perform the following steps:

[0075] Step 1: If there is no LSA containing the node information IN in the local LSDB, store the received LSA containing the node information into the node information link state IN Link States of the local LSDB, otherwise go to step 2;

[0076] Step 2: If there is an LSA containing node information in the local LSDB, compare the LSA Age of the existing LSA with the received LSA containing node information. If the LSA Age of the two is not equal, store the node information in the LSA with the smaller LSA Age as the best node information in the corresponding parameters of the router, and store the LSA with the smaller LSA Age in the IN Link States of the local LSDB, and delete the remaining LSA information in the IN Link States; if the LSA Age of the two is equal, execute step 3;

[0077] Step 3: Select the node information in the LSA from Area 0 as the best node information and store it in the corresponding parameters of the router. Then store the LSA in the IN Link States of the local LSDB and delete the remaining LSA information in the IN Link States. If there is no LSA from Area 0, go to step 4.

[0078] Step 4: Compare the Link StateID, Advertising Router, and LS Sequence Number in the existing LSA and the received LSA containing the node information in turn, store the LSA with the larger value in IN LinkStates of the local LSDB, and delete the remaining LSA information in IN Link States; if the existing LSA is the same as the received LSA containing the node information, discard the LSU message.

[0079] In some embodiments, the processor is further used to prohibit flooding or forwarding the LSA to the interface of the Area 0 backbone area if the Link State ID of the received LSA containing node information is not in the Area 0 backbone area; if the Link State ID of the received LSA containing node information is in the Area 0 backbone area, change the LinkState ID and Advertising Router in the LSA to the Router ID of the ABR, and flood or forward the LSA to the interface of the non-Area 0 area.

[0080] In some embodiments, the processor is further configured to prohibit the LSA from being transmitted to an interface in an area outside an autonomous system (AS) domain of a dynamic routing protocol OSPF.

[0081] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0082] An embodiment of the present invention further provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the steps in the above-mentioned method for propagating information between network nodes are implemented.

[0083] The embodiments of the present invention have the following beneficial effects:

[0084] In the above scheme, by adding node information to various dynamic routing messages, flooding and / or forwarding information containing IPv6 asset management nodes in the dynamic routing area, it is avoided to add a large number of intermediate proxy devices and their complex configuration process, thereby reducing deployment costs while also avoiding tedious operation and maintenance work; by using a new version of the link state announcement LSA message message constructed in the dynamic routing protocol to propagate node information, the problem of how node information is transmitted across multiple dynamic network areas while using less network data traffic or dedicated equipment (such as an intermediate proxy forwarding device) is solved; by sending down node information in a specific area to trigger different propagation range effects, the accuracy and coverage of the propagation are guaranteed without increasing the field information of the propagation message, thereby reducing the data traffic generated during the node information propagation process. BRIEF DESCRIPTION OF THE DRAWINGS

[0085] Figure 1 and Figure 3 A flowchart of an existing routing method is provided;

[0086] Figure 2 and Figure 4 A schematic diagram of a flow chart of a method for transmitting information between network nodes according to an embodiment of the present invention;

[0087] Figure 5 is the network topology diagram;

[0088] Figure 6-Figure 14 A schematic diagram of the structure of a message according to an embodiment of the present invention. DETAILED DESCRIPTION

[0089] In order to make the technical problems, technical solutions and advantages to be solved by the embodiments of the present invention more clear, a detailed description will be given below with reference to the accompanying drawings and specific embodiments.

[0090] Existing methods for IPv6 asset management include probe collection, DNS reverse query, addressing rule, and traffic analysis. Each method can only effectively discover IPv6 assets under certain specific scenarios, but for general scenarios, most of the existing methods are difficult to efficiently discover and manage IPv6 assets.

[0091] The probe intensive collection method uses dense probe devices deployed in each terminal subnet to monitor and detect IPv6 asset information in each subnet. The probes regularly report the collected information to the management center, thereby collecting information on each IPv6 asset device. This method is suitable for small-scale, highly controllable network scenarios. The disadvantage is that a large number of probe devices need to be deployed, the deployment process is complicated, and the implementation cost is too high.

[0092] The DNS reverse query method uses a web crawler to obtain the website address information (URL) in the IPv6 network, and then obtains the corresponding IPv6 address through the DNS reverse query method. It is combined with methods such as Traceroute to further obtain more IPv6 asset information. This method is suitable for IPv6 assets that have opened Web services. The disadvantage is that the discovery ability for IPv6 assets that have not opened Web services is weak, and a large number of crawlers are required in the early stage to obtain IPv6 surviving website information.

[0093] The current network traffic analysis method uses a specific device to collect network traffic data over a period of time, and then parses the source IPv6 address and destination IPv6 address information in each piece of network traffic data, thereby obtaining information about IPv6 assets in the current network. This method is suitable for scenarios where network traffic can be obtained in a short period of time. The disadvantage is that the acquisition time is limited, and due to the location of the network traffic collection point, it is impossible to effectively obtain IPv6 asset information for those flows that do not pass through the device.

[0094] The compilation rule inference method uses the addressing rules or generation rules of existing IPv6 asset addresses to infer possible IPv6 asset information. This method is suitable for scenarios where the IPv6 asset addressing rules are fixed and the variable address bit information is relatively concentrated. The disadvantage is that it cannot effectively manage assets with less fixed IPv6 address addressing rules or less concentrated variable address bits.

[0095] The above four methods are not universal when managing IPv6 assets, and each method has significant shortcomings.

[0096] The embodiment of the present application proposes a method for propagating node information between IPv6 networks based on a dynamic routing protocol (OSPF). This method can ensure that node device information (i.e., IPv6 asset management acquisition node server information) can be conveniently and smoothly transmitted in a network composed of dynamic routing. When there is new node information in the network or the existing node information changes, the router containing the node information will propagate the changed information to the specified dynamic routing network space by using the new message information and operation steps in the dynamic routing protocol. The router that receives the latest node information then propagates the information to the subnet to which it belongs and performs subsequent corresponding operations. Thereby completing a full dynamic routing network propagation process of node information.

[0097] The information of the IPv6 asset management collection node server is abbreviated as node information in this embodiment. Through this embodiment, the IPv6 asset management collection node information can be propagated to the entire dynamic routing network (or routers within a specified range). Each router then uses the IPv6 node information to perform subsequent IPv6 asset collection and reporting management and other specific operations on its attached subnet. In this way, through this mechanism, convenient information collection of IPv6 asset information in the entire dynamic routing network and all its attached subnets can be achieved.

[0098] Through the technical solution of this embodiment, it is possible to implement an effective propagation mechanism method for adding / changing node information in a dynamic routing network using less network data traffic without affecting the normal operation of existing mechanisms such as routing updates and forwarding in the existing dynamic routing protocol (OSPF); it is possible to propagate node information to routers in a specified part of the dynamic routing area using less network data traffic, thereby realizing the practical function of propagating differentiated node information in different areas within the entire dynamic routing network.

[0099] The definitions of the terms involved in the embodiments of this application are as follows:

[0100] Router: A network device with routing and forwarding functions.

[0101] Autonomous system: An autonomous system is a small unit consisting of a group of routers that has the right to independently decide which common routing protocol should be used to exchange routing information in the system, abbreviated as AS.

[0102] Interior Gateway Protocol: Interior Gateway Protocol is a protocol for exchanging routing information between routers within an autonomous system (AS), abbreviated as IGP.

[0103] Adjacency relationship: A neighbor relationship formed between selected adjacent routers for the purpose of exchanging routing information. Not every pair of adjacent routers constitutes an adjacency relationship.

[0104] Flooding: The part of the OSPF protocol that distributes and synchronizes the Link State Database (LSDB) between OSPF routers.

[0105] DR: DR (Designated Router) is a designated router identity in the dynamic routing protocol.

[0106] Validity time: The validity period of a message content.

[0107] Node information device: an asset device that has an IPv6 address and has some functional significance and is network-reachable with other nodes involved in this embodiment.

[0108] The embodiments of the present invention provide a method and device for disseminating node information between networks, which can reduce the data traffic generated during the node information dissemination process and are applicable to general IPv6 scenarios.

[0109] An embodiment of the present invention provides a method for disseminating node information between networks, which is performed by a first router, where the first router is adjacent to a second router on a network, and the method includes:

[0110] Sending a link state update LSU message to the second router, wherein the link state advertisement LSA in the LSU message includes the node information of the first router;

[0111] A link state acknowledgment LSAck message replied by the second router is received, wherein the LSAck message includes header information of the LSA.

[0112] The first router may be a newly added router in the network, or may be any router.

[0113] In some embodiments, before sending the LSU message to the second router, the method further includes:

[0114] Using a Hello message to establish a neighbor relationship with the second router, and negotiate an adjacency relationship and a master-slave relationship with the second router;

[0115] Using the database to describe the DD message, exchanging header information of the LSA with the second router, the LSA including the node information;

[0116] A link state request LSR message is received from the second router, wherein the LSR message requests to obtain the LSA.

[0117] In some embodiments, sending the LSU message to the second router includes:

[0118] The LSU message is sent to the designated router DR, and after the DR updates the local link state database LSDB according to the LSU message, the LSU is multicast to all second routers.

[0119] In some embodiments, receiving the LSAck message replied by the second router includes:

[0120] The LSAck message sent by the DR is received, where the LSAck message is sent by the second router to the DR.

[0121] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0122] The embodiment of the present invention further provides a method for disseminating node information between networks, which is performed by a second router, and the second router is adjacent to the first router on the network. The method includes:

[0123] Receiving a link state update LSU message sent by the first router, wherein the link state advertisement LSA in the LSU message includes node information of the first router;

[0124] Sending a link state confirmation LSAck message to the first router, wherein the LSAck message includes header information of the LSA;

[0125] An LSA including node information is calculated according to the LSU message and stored in a local link state database LSDB.

[0126] In some embodiments, before receiving the link state update LSU message sent by the first router, the method further includes:

[0127] receiving a Hello message from the first router, establishing a neighbor relationship with the first router, and negotiating an adjacency relationship and a master-slave relationship with the first router;

[0128] Using a database to describe a DD message, exchanging header information of an LSA with the first router, wherein the LSA includes node information;

[0129] A link state request (LSR) message is sent to the first router, wherein the LSR message requests to obtain the LSA.

[0130] In some embodiments, receiving a link state update LSU message sent by the first router includes:

[0131] The LSU message is received by a designated router DR through multicast, where the LSU message is sent by the first router to the DR.

[0132] In some embodiments, sending a link state acknowledgment LSAck message to the first router includes:

[0133] The LSAck message is sent to the DR, and the DR sends the LSAck message to the first router.

[0134] In some embodiments, calculating an LSA including node information according to the LSU message and storing the LSA in a local link state database LSDB includes:

[0135] Step 1: If there is no LSA containing the node information IN in the local LSDB, store the received LSA containing the node information into the node information link state IN Link States of the local LSDB, otherwise go to step 2;

[0136] Step 2: If there is an LSA containing node information in the local LSDB, compare the LSA Age of the existing LSA with the received LSA containing node information. If the LSA Age of the two is not equal, store the node information in the LSA with the smaller LSA Age as the best node information in the corresponding parameters of the router, and store the LSA with the smaller LSA Age in the IN Link States of the local LSDB, and delete the remaining LSA information in the IN Link States; if the LSA Age of the two is equal, execute step 3;

[0137] Step 3: Select the node information in the LSA from Area 0 as the best node information and store it in the corresponding parameters of the router. Then store the LSA in the IN Link States of the local LSDB and delete the remaining LSA information in the IN Link States. If there is no LSA from Area 0, go to step 4.

[0138] Step 4: Compare the Link StateID, Advertising Router, and LS Sequence Number in the existing LSA and the received LSA containing the node information in turn, store the LSA with the larger value in IN LinkStates of the local LSDB, and delete the remaining LSA information in IN Link States; if the existing LSA is the same as the received LSA containing the node information, discard the LSU message.

[0139] In some embodiments, if the second router is an area border router ABR, the method further includes:

[0140] If the Link State ID of the received LSA containing node information is not in the Area 0 backbone area, it is prohibited to flood or forward the LSA to the interface of the Area 0 backbone area;

[0141] If the Link State ID of the received LSA containing the node information is in the Area 0 backbone area, the Link State ID and Advertising Router in the LSA are changed to the Router ID of the ABR, and the LSA is flooded or forwarded to the interface of the non-Area 0 area.

[0142] In some embodiments, if the second router is an autonomous system boundary router ASBR, the method further includes:

[0143] It is prohibited to transfer the LSA to the interface of the area outside the autonomous system AS domain of the dynamic routing protocol OSPF.

[0144] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0145] Dynamic routing in an IPv6 network means that the router can automatically establish its own routing table and adjust it in time according to changes in actual conditions. The OSPF dynamic routing protocol is a typical link-state routing protocol, generally used in the same routing AS domain. In this AS, all OSPF routers maintain the same database (LSDB) that describes the AS structure. The database stores the status information of the corresponding links in the AS domain. The OSPF router calculates its OSPF routing table through this database combined with a specified algorithm. As a link-state routing protocol, OSPF transmits link-state multicast data LSA (Link State Advertisement) to all routers in a certain area.

[0146] OSPF dynamic routing protocol is simply that two adjacent routers become neighbors by sending messages. After the neighbors form an adjacency relationship, they send link state information to each other to update their own link state database. Both parties calculate the best route based on their own link state database (LSDB) combined with the shortest path algorithm, and store it in the routing table of the router, ultimately achieving the effect of dynamic generation.

[0147] The following two situations may occur during this process:

[0148] 1. Add or put a router online in the dynamic routing network;

[0149] 2. The link information of online routers in the dynamic routing network changes.

[0150] For the first case, when a router is added or put online in a dynamic network, the original routing method process is as follows: Figure 1 As shown, the following steps are included:

[0151] 1. When a router is added or put online in the OSPF dynamic routing network, the router will use Hello messages to establish neighbor relationships with other adjacent routers on the network;

[0152] 2. When the neighbor relationship is successfully established, the router will establish an adjacency relationship (such as electing DR / BDR, etc.) and a master-slave relationship with the neighbor according to the specific network type;

[0153] 3. After establishing an adjacency with other selected routers, the router will use DD messages to exchange LSAs header information with the adjacent routers;

[0154] 4. Both adjacent routers check the header information of LSAs contained in the DD message. If there are LSAs that need to be added or updated, they use LSR messages to request the newly added or updated LSAs.

[0155] 5. After receiving the LSR message, the adjacent routers use the LSU message to reply to the other party with the specific content information of the LSAs required in the corresponding LSR request;

[0156] 6. After receiving the LSU message, the adjacent routers use LSAck messages to reply to each other to confirm that the specific LSAs information they need have been received, and update the local LSDB for convergence;

[0157] 7. The router then uses a specific algorithm combined with the updated LSDB to calculate the latest optimal routing information and stores it in the routing table.

[0158] Among them, Hello message is the most commonly used message, which is used to establish and maintain adjacency relationship and is periodically sent on the router interface configured with OSPF. The message content includes some timer values, DR, BDR and known neighbors.

[0159] DD message, when two routers initialize the adjacency relationship, they use DD message (Database Description Packet) to describe their own LSDB and synchronize the database. The message content includes the Header of each LSA in the LSDB (the Header of LSA can uniquely identify an LSA). The LSA Header only occupies a small part of the entire data volume of an LSA, which can reduce the protocol message traffic between routers. The opposite router can determine whether this LSA already exists based on the LSA Header. In the process of exchanging DD messages between two routers, one is the Master and the other is the Slave. The starting sequence number is specified by the Master, and the sequence number increases by 1 each time a DD message is sent. The Slave uses the Master's sequence number as confirmation.

[0160] LSR message, after two routers exchange DD messages, they know which LSAs of the other router are missing in the local LSDB and which LSAs are invalid. At this time, they need to send LSR messages (Link State Request Packet) to request the required LSAs from the other party. The content includes the summary information of the required LSA. Including LS type, LinkState ID and Advertising Router, can uniquely identify an LSA. When two LSAs are the same, it is necessary to determine the newness of the required LSA based on the LS sequence number, LS checksum and LS age in the LSA.

[0161] LSU message is used to send the required LSA to the peer router or flood the updated LSA. The content is a collection of multiple LSAs (all contents). LSU message (Link State Update Packet) floods LSA in multicast form on the link that supports multicast and broadcast. In order to achieve reliable transmission of flooding, LSAck message is required to confirm it. LSA that has not received confirmation message is retransmitted, and the retransmitted LSA is sent directly to the neighbor.

[0162] LSAck message is used to confirm the received LSU message. The content is the header of the LSA that needs to be confirmed (one LSAck message can confirm multiple LSAs). LSAck (Link State Acknowledgment Packet) message is sent in unicast or multicast form according to different links.

[0163] LSA, Link-State Advertisement, is mainly used to maintain the LSDB database of each router. When the topology is updated (new devices are added or interfaces are Down / UP, etc.), the changed router will encapsulate the LSU in the LSA and send it to all routers in the network. After receiving the LSA, these routers will compare the serial number in the LSA data packet with the serial number of the corresponding LSA entry in their own LSDB, and then update their own LSDB database.

[0164] LSDB, link state database, contains all LSA information in the router.

[0165] For the second case, existing routing methods such as Figure 3 As shown, the following steps are included:

[0166] 1. When the link information of an existing router in an OSPF dynamic routing network changes, the router will use the LSU message to send an LSU message containing the change information to the router that has established an adjacency relationship with it (in the form of multicast, etc.);

[0167] 2. When the DR that has established an adjacency relationship with this router receives the LSU message, it updates the local LSDB. The DR will actively flood (multicast, etc.) the LSU message to all routers that have established an adjacency relationship with the DR;

[0168] 3. When other routers receive the LSU message sent by the DR, they reply with the LSAck message corresponding to the DR;

[0169] 4. The router extracts the specific LSA information from the LSU and updates the local LSDB for convergence;

[0170] 5. The router calculates the latest optimal routing information through an algorithm combined with the updated LSDB and stores it in the routing table.

[0171] Among them, flooding is the process of notifying the changed LSA to all routers in the area through LSU and LSAck messages.

[0172] The network topology diagram of the embodiment of the present application is as follows Figure 5 As shown, the specific workflow of the embodiment of the present application includes the following two situations:

[0173] In the first case, a router is added or put online in the dynamic routing network;

[0174] The second situation: the link information of online routers in the dynamic routing network changes.

[0175] For the first case, Figure 2 As shown, the embodiment of the present application includes the following steps:

[0176] 1. When a router device is added or put online in the OSPF dynamic routing network, the newly added node-related information can be configured for the router and stored in the corresponding place.

[0177] At the same time, the router will use Hello messages to establish normal neighbor relationships with other adjacent routers on the network.

[0178] 2. When the neighbor relationship is successfully established, the router will establish further adjacency relationships (such as electing DR / BDR, etc.) and master-slave relationships with the neighbor according to the specific network type;

[0179] 3. After the newly added router has established an adjacency with other selected routers, it will use DD messages to exchange LSA header information with the adjacent routers. This information includes the header information of the new version of LSA, including the node information (hereinafter referred to as IN).

[0180] The LSA Function Code in the LS Type field of the newly added LSA header is assigned a value of 12, and the Type field uses the newly added value 0x2012 to describe the node information (Information of Node). The specific fields of the entire LSType are as follows Figure 6 As shown, the shaded part is the newly added field information.

[0181] The specific message information of the LSA(IN) header containing the newly added LS Type is as follows: Figure 7 As shown, the shaded part is the newly added field information.

[0182] The format of the DD message containing the LSA header of the newly added node information is as follows: Figure 8 As shown, the shaded part is the newly added field information.

[0183] 4. Both adjacent routers check the header information of LSAs contained in the DD message. Based on the comparison with the LSA in the local LSDB, if there are LSAs that need to be added or updated, they use the LSR message of the new version of LSA containing node information (IN) to submit a request message for the other party's newly added or updated LSAs.

[0184] The specific format of the LSR message containing the newly added node information LSA (IN) is as follows: Fig. 9 As shown, the shaded part is the newly added field information.

[0185] 5. After receiving the LSR message containing the newly added LSA (IN), the adjacent routers use the LSU message containing the newly added LSA (IN) to reply to the specific content information of the LSAs required in the corresponding LSR request of the other party. The specific content information of the new version of LSA about node information is newly added to the LSU message based on the original process.

[0186] The specific message format of the newly added LSA (IN) is as follows Fig.10 As shown, the shaded part is the newly added field information.

[0187] The details of each newly added field are as follows:

[0188] Node Address information Node Address is an IPv6 global unicast address.

[0189] Valid_Lifetime (abbreviated as V_Life in this article) is a 32-bit unsigned integer. It indicates the valid time length of the node information (in seconds). When all positions are 1 (0xffffffff), it means that the validity period will never expire.

[0190] Reserved field information

[0191] All bits are set to 0. This field is not used. The sender MUST initialize it to zero and the receiver MUST ignore it.

[0192] The specific format of the LSU message containing the newly added LSA (IN) is as follows: Fig.11 As shown, the shaded part is the newly added field information.

[0193] 6. After receiving the LSU message containing the newly added LSA (IN), the adjacent routers reply to each other with an LSAck message containing the newly added LSA (IN) header information, informing them that the specific LSA information they need has been confirmed to have been received, and update the local LSDB for convergence. The header information of the new version of LSA about the node information is newly added to the LSAck message based on the original process.

[0194] The format of the LSAck message containing the newly added LSA(IN) header information is as follows: Fig.12 As shown, the shaded part is the newly added field information.

[0195] 7. Extract the new version of LSA (IN) containing node information from the received LSU. Then, compare it with the information of the existing LSA (IN)s in the local LSDB, use the newly added algorithm to calculate the latest / best node information type LSA information, and synchronize the best node information to the corresponding configuration parameters of the router. And add / update it to the node information status table (IN Link States) of the corresponding Area in its own LSDB. The processing method of other types of LSA messages still complies with the subsequent normal operations stipulated in the RFC (the router calculates the best routing information through a specific algorithm combined with the updated LSDB and stores it in the routing table).

[0196] The specific algorithm is as follows:

[0197] (1) When the local LSDB does not contain IN Link States information, the received LSA (IN) information will be stored in the IN Link States of the local LSDB. Otherwise, subsequent judgment will be performed.

[0198] (2) When the local LSDB already has IN Link States information, compare the LSA Age in the two LSAs (IN), and store the smaller LSA Age in the corresponding parameters of the router as the best node information. Store the LSA information in the node information state table (IN Link States), and delete the remaining LSA information in the table. Otherwise, make a subsequent judgment.

[0199] (3) If the LSA Age values ​​of the two LSAs (IN) are the same, the LSA from Area 0 is selected as the best node and the information is stored in the corresponding parameters of the router. The information of the LSA is stored in the node information state table (IN LinkStates) and the remaining LSA information in the table is deleted. Otherwise, the subsequent judgment is carried out.

[0200] (4) Compare the Link State ID, AdvertisingRouter, and LS Sequence Number in the two LSAs (IN) in turn. The one with the larger value is the best node and stores the information in the corresponding parameters of the router. The information of the LSA is stored in the node information state table (IN Link States) and the remaining LSA information in the table is deleted. Otherwise, make a subsequent judgment.

[0201] (5) If the two LSAs (IN) are identical, no action is taken and the message is discarded.

[0202] In addition, if the router that receives the newly added LSA (IN) message is an ABR / ASBR, the following additional operations are required:

[0203] When the ABR receives a newly added LSA (IN) message:

[0204] (1) If the Link State ID in the received LSA (IN) is not in the Area 0 backbone area, that is, the source router that initiated this LSA is not in the Area 0 area, the ABR identity router will not flood or forward this LSA (IN) to the interface of the Area 0 backbone area.

[0205] (2) If the Link State ID in the received LSA (IN) is found to be in the Area 0 backbone area, the ABR will reorganize the content of the LSA (IN): change the Link State ID and Advertising Router in the LSA to the ABR's Router ID, and keep the rest of the information unchanged. Then, it will flood / forward the LSA to its interfaces outside the Area 0 area.

[0206] This ensures that newly added LSA (IN) in non-Area 0 backbone areas will not be propagated to Area 0 backbone areas and other areas, and also ensures that newly added LSA (IN) in Area 0 backbone area can be propagated to any area in the entire OSPF AS domain. Therefore, the propagation range of the inserted node information can be controlled and distinguished according to the location of the source router of the newly added LSA (IN) (i.e., the router that inserts node-related information into the network), playing a control role in propagating only within the specified area.

[0207] When the ASBR identity router receives a newly added LSA (IN) message: the router should not pass the newly added LSA (IN) message information to the interface outside the OSPF AS domain, that is, it will not propagate the newly added LSA (IN) node information to the AS domain outside this OSPF.

[0208] For the second case, the solution of this application is as follows Figure 4 As shown, the following steps are included:

[0209] 1. When the link information of an existing router in an OSPF dynamic routing network changes, the local LSDB of the router will be automatically updated, and the LSU message will be used to send an LSU message (in the form of multicast, etc.) containing the change information to the routers that have established an adjacency relationship with it. Subsequent new operations are added based on the original process. When the router is configured with new / changed node information parameters, the specific content information of the new version of LSA (IN) about the node information added in the LSU message is used to further spread the node information.

[0210] The message format of the new version of LSU is as follows Fig.13 As shown, the shaded part is the newly added field information.

[0211] 2. When the DR router that has established an adjacency relationship with this router receives the LSU message containing the new version of LSA (IN), it updates the DR local LSDB. The DR router will actively flood (multicast, etc.) the LSU message containing the new version of LSA (IN) to all routers that have established an adjacency relationship with the DR. The message format of the new version of LSU is the same as in the previous step.

[0212] 3. When other routers receive the LSU message containing the new version of LSA (IN) sent by DR through flooding / forwarding, they reply to DR with an LSAck message containing the header information of the newly added new version of LSA (IN) in the corresponding LSU.

[0213] The new LSAck message format is as follows Fig.14 As shown, the shaded part is the newly added field information.

[0214] 4. The router extracts the specific LSA information in the LSU and updates the local LSDB for convergence. The router calculates the latest optimal routing information through the existing algorithm combined with the updated LSDB and stores it in the routing table.

[0215] This embodiment adds subsequent operations on the basis of the original process operation: extract the new version of LSA (IN) content containing node information from the received LSU. Then, based on the information of the existing LSA (IN)s in the local LSDB, the newly added algorithm is used to calculate the latest / best node information type LSA information, and the best node information is synchronized to the corresponding configuration parameters of the router. And add / update it to the node information state table (INLink States) of the corresponding Area in its own LSDB. The processing method of other types of LSA messages still complies with the subsequent normal operations stipulated in the RFC (the router calculates the best routing information through a specific algorithm combined with the updated LSDB, and stores it in the routing table).

[0216] The specific algorithm is as follows:

[0217] (1) When the local LSDB does not contain IN Link States information, the received LSA (IN) information will be stored in the IN Link States of the local LSDB. Otherwise, subsequent judgment will be performed.

[0218] (2) When the local LSDB already has IN Link States information, compare the LSA Age in the two LSAs (IN), and store the smaller LSA Age in the corresponding parameters of the router as the best node information. Store the LSA information in the node information state table (IN Link States), and delete the remaining LSA information in the table. Otherwise, make a subsequent judgment.

[0219] (3) If the LSA Age values ​​of the two LSAs (IN) are the same, the LSA from Area 0 is selected as the best node and the information is stored in the corresponding parameters of the router. The information of the LSA is stored in the node information state table (IN LinkStates) and the remaining LSA information in the table is deleted. Otherwise, the subsequent judgment is carried out.

[0220] (4) Compare the Link State ID, AdvertisingRouter, and LS Sequence Number in the two LSAs (IN) in turn. The one with the larger value is the best node and stores the information in the corresponding parameters of the router. The information of the LSA is stored in the node information state table (IN Link States) and the remaining LSA information in the table is deleted. Otherwise, make a subsequent judgment.

[0221] (5) If the two LSAs (IN) are identical, no action is taken and the message is discarded.

[0222] In addition, if the router that receives the newly added LSA (IN) message is an ABR / ASBR, the following additional operations are required:

[0223] When the ABR receives a newly added LSA (IN) message:

[0224] (1) If the Link State ID in the received LSA (IN) is not in the Area 0 backbone area, that is, the source router that initiated this LSA is not in the Area 0 area, the ABR identity router will not flood or forward this LSA (IN) to the interface of the Area 0 backbone area.

[0225] (2) If the Link State ID in the received LSA (IN) is found to be in the Area 0 backbone area, the ABR will reorganize the content of the LSA (IN): change the Link State ID and Advertising Router in the LSA to the ABR's Router ID, and keep the rest of the information unchanged. Then, it will flood / forward the LSA to its interfaces outside the Area 0 area.

[0226] This ensures that newly added LSA (IN) in non-Area 0 backbone areas will not be propagated to Area 0 backbone areas and other areas, and also ensures that newly added LSA (IN) in Area 0 backbone area can be propagated to any area in the entire OSPF AS domain. Therefore, the propagation range of the inserted node information can be controlled and distinguished according to the location of the source router of the newly added LSA (IN) (i.e., the router that inserts node-related information into the network), playing a control role in propagating only within the specified area.

[0227] When the ASBR identity router receives a newly added LSA (IN) message: the router should not pass the newly added LSA (IN) message information to the interface outside the OSPF AS domain, that is, it will not propagate the newly added LSA (IN) node information to the AS domain outside this OSPF.

[0228] In addition to the parameters specified in the original RFC (Request For Comments), each interface of a router in a dynamic network needs to include the following new parameter information:

[0229] Information of Node Address Node address information, a place to store the best node address information parameters.

[0230] Each Information of Node Address parameter contains the following associated parameter information:

[0231] IN_Lifetime Valid life cycle, a place to store the V_life value parameter in the node information. When all positions are 1, it means that the validity period will never time out. The default value is 2592000 seconds (30 days).

[0232] In the above embodiment, the area ID, Area ID, is a 32-bit number used to identify an area.

[0233] The standard area is a Regular Area, and a standard area can receive link update information and route summarization.

[0234] The backbone area is the central entity that connects all areas. The backbone area is always "Area 0", and all other areas must connect to this area to exchange routing information. The backbone area has all the properties of a standard area.

[0235] Area Border Routers (ABRs) can belong to more than two areas at the same time, but one of them must be a backbone area. ABRs are used to connect backbone areas and non-backbone areas, which can be actual connections or virtual connections.

[0236] Autonomous System Boundary Router, ASBR (AS Boundary Router), a router that exchanges routing information with other AS domains is called ASBR, redistributing routing entries of different external routing protocols (EIGRP, BGP, etc.) into OSPF. As long as an OSPF router introduces external routing information, it is called ASBR. It may be an ABR, an area router, and is not necessarily located at the boundary of an AS domain.

[0237] The method for disseminating IPv6 inter-network node information based on the dynamic routing protocol of this embodiment is used to perform IPv6 asset management and information collection. Compared with the existing IPv6 detection / management methods in the industry, it is more suitable for various general IPv6 scenarios. By constructing a new version of IN node information field in various dynamic routing messages, flooding / forwarding information containing IPv6 asset management nodes in the dynamic routing area, avoiding the addition of a large number of intermediate proxy devices and their complex configuration processes, while reducing deployment costs and avoiding tedious operation and maintenance work; by using a new version of link state announcement LSA (IN) message message to propagate node information in the dynamic routing protocol, the problem of how node information is transmitted across multiple dynamic network areas while using less network data traffic or dedicated equipment (such as an intermediate proxy forwarding device) is solved; by sending node information in a specific area to trigger different propagation range effects, the accuracy and coverage of propagation are guaranteed without increasing the field information of the propagation message, and the data traffic generated during the node information propagation process is reduced.

[0238] The embodiment of the present invention further provides an inter-network node information transmission device, which is applied to a first router, wherein the first router is adjacent to a second router on a network, and comprises a transceiver and a processor.

[0239] The transceiver is used to send a link state update LSU message to the second router, wherein the link state advertisement LSA in the LSU message includes the node information of the first router; and receive a link state confirmation LSAck message replied by the second router, wherein the LSAck message includes the header information of the LSA.

[0240] In some embodiments, the transceiver is also used to establish a neighbor relationship with the second router using a Hello message, and negotiate an adjacency relationship and a master-slave relationship with the second router; use a database description DD message to exchange LSA header information with the second router, the LSA containing node information; receive a link state request LSR message from the second router, the LSR message requesting to obtain the LSA.

[0241] In some embodiments, the transceiver is specifically configured to send the LSU message to a designated router DR, and after the DR updates a local link state database LSDB according to the LSU message, the DR multicasts the LSU to all second routers.

[0242] In some embodiments, the transceiver is specifically used to receive the LSAck message sent by the DR, and the LSAck message is sent by the second router to the DR.

[0243] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0244] The embodiment of the present invention further provides an inter-network node information dissemination device, which is applied to a second router, the second router being adjacent to the first router on the network, and comprising a transceiver and a processor.

[0245] The transceiver is used to receive a link state update LSU message sent by the first router, wherein the link state advertisement LSA in the LSU message includes the node information of the first router; and send a link state confirmation LSAck message to the first router, wherein the LSAck message includes the header information of the LSA;

[0246] The processor is used for calculating the LSA containing the node information according to the LSU message, and storing it in the local link state database LSDB.

[0247] In some embodiments, the transceiver is also used to receive a Hello message from the first router, establish a neighbor relationship with the first router, and negotiate an adjacency relationship and a master-slave relationship with the first router; use a database description DD message to exchange LSA header information with the first router, the LSA containing node information; send a link state request LSR message to the first router, the LSR message requests to obtain the LSA.

[0248] In some embodiments, the transceiver is specifically used to receive the LSU message sent by multicast by a designated router DR, and the LSU message is sent by the first router to the DR.

[0249] In some embodiments, the transceiver is specifically configured to send the LSAck message to the DR, and the DR sends the LSAck message to the first router.

[0250] In some embodiments, the processor is specifically configured to perform the following steps:

[0251] Step 1: If there is no LSA containing the node information IN in the local LSDB, store the received LSA containing the node information into the node information link state IN Link States of the local LSDB, otherwise go to step 2;

[0252] Step 2: If there is an LSA containing node information in the local LSDB, compare the LSA Age of the existing LSA with the received LSA containing node information. If the LSA Age of the two is not equal, store the node information in the LSA with the smaller LSA Age as the best node information in the corresponding parameters of the router, and store the LSA with the smaller LSA Age in the IN Link States of the local LSDB, and delete the remaining LSA information in the IN Link States; if the LSA Age of the two is equal, execute step 3;

[0253] Step 3: Select the node information in the LSA from Area 0 as the best node information and store it in the corresponding parameters of the router. Then store the LSA in the IN Link States of the local LSDB and delete the remaining LSA information in the IN Link States. If there is no LSA from Area 0, go to step 4.

[0254] Step 4: Compare the Link StateID, Advertising Router, and LS Sequence Number in the existing LSA and the received LSA containing the node information in turn, store the LSA with the larger value in IN LinkStates of the local LSDB, and delete the remaining LSA information in IN Link States; if the existing LSA is the same as the received LSA containing the node information, discard the LSU message.

[0255] In some embodiments, the processor is further used to prohibit flooding or forwarding the LSA to the interface of the Area 0 backbone area if the Link State ID of the received LSA containing node information is not in the Area 0 backbone area; if the Link State ID of the received LSA containing node information is in the Area 0 backbone area, change the LinkState ID and Advertising Router in the LSA to the Router ID of the ABR, and flood or forward the LSA to the interface of the non-Area 0 area.

[0256] In some embodiments, the processor is further configured to prohibit the LSA from being transmitted to an interface in an area outside an autonomous system (AS) domain of a dynamic routing protocol OSPF.

[0257] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0258] An embodiment of the present invention also provides an inter-network node information dissemination device, including a memory, a processor, and a computer program stored in the memory and executable on the processor; when the processor executes the program, the inter-network node information dissemination method described above is implemented.

[0259] In some embodiments, the inter-network node information dissemination device is applied to the first router, and the processor is used to send a link state update LSU message to the second router, and the link state announcement LSA in the LSU message includes the node information of the first router; receive a link state confirmation LSAck message replied by the second router, and the LSAck message includes the header information of the LSA.

[0260] In some embodiments, the processor is also used to establish a neighbor relationship with the second router using a Hello message, and negotiate an adjacency relationship and a master-slave relationship with the second router; use a database description DD message to exchange LSA header information with the second router, the LSA containing node information; receive a link state request LSR message from the second router, the LSR message requesting to obtain the LSA.

[0261] In some embodiments, the processor is specifically configured to send the LSU message to a designated router DR, and after the DR updates a local link state database LSDB according to the LSU message, the DR multicasts the LSU to all second routers.

[0262] In some embodiments, the processor is specifically configured to receive the LSAck message sent by the DR, where the LSAck message is sent by the second router to the DR.

[0263] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0264] In some embodiments, the inter-network node information dissemination device is applied to the second router, and the processor is used to receive a link state update LSU message sent by the first router, and the link state announcement LSA in the LSU message contains the node information of the first router; send a link state confirmation LSAck message to the first router, and the LSAck message contains the header information of the LSA; calculate the LSA containing the node information according to the LSU message, and store it in the local link state database LSDB.

[0265] In some embodiments, the processor is also used to receive a Hello message from the first router, establish a neighbor relationship with the first router, and negotiate an adjacency relationship and a master-slave relationship with the first router; use a database description DD message to exchange LSA header information with the first router, the LSA containing node information; send a link state request LSR message to the first router, the LSR message requests to obtain the LSA.

[0266] In some embodiments, the processor is specifically configured to receive the LSU message sent by multicast by a designated router DR, where the LSU message is sent by the first router to the DR.

[0267] In some embodiments, the processor is specifically configured to send the LSAck message to the DR, and the DR sends the LSAck message to the first router.

[0268] In some embodiments, the processor is specifically configured to perform the following steps:

[0269] Step 1: If there is no LSA containing the node information IN in the local LSDB, store the received LSA containing the node information into the node information link state IN Link States of the local LSDB, otherwise go to step 2;

[0270] Step 2: If there is an LSA containing node information in the local LSDB, compare the LSA Age of the existing LSA with the received LSA containing node information. If the LSA Age of the two is not equal, store the node information in the LSA with the smaller LSA Age as the best node information in the corresponding parameters of the router, and store the LSA with the smaller LSA Age in the IN Link States of the local LSDB, and delete the remaining LSA information in the IN Link States; if the LSA Age of the two is equal, execute step 3;

[0271] Step 3: Select the node information in the LSA from Area 0 as the best node information and store it in the corresponding parameters of the router. Then store the LSA in the IN Link States of the local LSDB and delete the remaining LSA information in the IN Link States. If there is no LSA from Area 0, go to step 4.

[0272] Step 4: Compare the Link StateID, Advertising Router, and LS Sequence Number in the existing LSA and the received LSA containing the node information in turn, store the LSA with the larger value in IN LinkStates of the local LSDB, and delete the remaining LSA information in IN Link States; if the existing LSA is the same as the received LSA containing the node information, discard the LSU message.

[0273] In some embodiments, the processor is further used to prohibit flooding or forwarding the LSA to the interface of the Area 0 backbone area if the Link State ID of the received LSA containing node information is not in the Area 0 backbone area; if the Link State ID of the received LSA containing node information is in the Area 0 backbone area, change the LinkState ID and Advertising Router in the LSA to the Router ID of the ABR, and flood or forward the LSA to the interface of the non-Area 0 area.

[0274] In some embodiments, the processor is further configured to prohibit the LSA from being transmitted to an interface in an area outside an autonomous system (AS) domain of a dynamic routing protocol OSPF.

[0275] In some embodiments, the node information includes at least one of the following: node address information, valid time, and reservation information.

[0276] An embodiment of the present invention further provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the steps in the above-mentioned method for propagating information between network nodes are implemented.

[0277] Computer readable media include permanent and non-permanent, removable and non-removable media that can be used to store information by any method or technology. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage terminal devices to be detected or any other non-transmission media that can be used to store information that can be accessed by the computer terminal device to be detected. As defined in this article, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carriers.

[0278] The above is 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 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 disseminating information between nodes in an internetwork, characterized in that: The method is performed by a second router, the second router being adjacent to the first router on a network, and comprising: Receive a link state update LSU message sent by the first router, wherein the link state advertisement LSA in the LSU message includes node information of the first router; the node information includes at least one of the following: node address information, validity time, and reservation information; Sending a link state confirmation LSAck message to the first router, wherein the LSAck message includes header information of the LSA; Calculate an LSA containing node information according to the LSU message and store it in a local link state database LSDB; The step of calculating the LSA containing the node information according to the LSU message and storing it in the local link state database LSDB comprises: Step 1: If there is no LSA containing the node information IN in the local LSDB, store the received LSA containing the node information into the node information link state IN Link States of the local LSDB, otherwise go to step 2; Step 2: If there is an LSA containing node information in the local LSDB, compare the LSA age of the existing LSA with the received LSA containing node information. If the LSA ages of the two are not equal, store the node information in the LSA with the smaller LSA age as the best node information in the corresponding parameters of the router, and store the LSA with the smaller LSA age in the IN Link States of the local LSDB, and delete the remaining LSA information in the IN Link States; if the LSA ages of the two are equal, execute step 3; Step 3: Select the node information in the LSA from Area 0 as the best node information and store it in the corresponding parameters of the router. Then store the LSA in the IN Link States of the local LSDB and delete the remaining LSA information in the IN Link States. If there is no LSA from Area 0, go to step 4. Step 4: Compare the Link State ID, Advertising Router, and LS Sequence Number in the existing LSA and the received LSA containing the node information in turn, store the LSA with the larger value in IN LinkStates of the local LSDB, and delete the remaining LSA information in IN Link States; if the existing LSA is the same as the received LSA containing the node information, discard the LSU message.

2. The method for disseminating information between nodes in an internetwork according to claim 1, characterized in that: Before receiving the link state update LSU message sent by the first router, the method further includes: receiving a Hello message from the first router, establishing a neighbor relationship with the first router, and negotiating an adjacency relationship and a master-slave relationship with the first router; Using a database to describe a DD message, exchanging header information of an LSA with the first router, wherein the LSA includes node information; A link state request (LSR) message is sent to the first router, wherein the LSR message requests to obtain the LSA.

3. The method for disseminating information between nodes in an internetwork according to claim 1, characterized in that: Receiving a link state update LSU message sent by the first router includes: The LSU message is received by a designated router DR through multicast, where the LSU message is sent by the first router to the DR.

4. The method for disseminating information between nodes in an internetwork according to claim 1, characterized in that: Sending a link state acknowledgment LSAck message to the first router includes: The LSAck message is sent to the DR, and the DR sends the LSAck message to the first router.

5. The method for disseminating information between nodes in an internetwork according to claim 1, characterized in that: If the second router is an area border router ABR, the method further includes: If the Link State ID of the received LSA containing node information is not in the Area 0 backbone area, it is prohibited to flood or forward the LSA to the interface of the Area 0 backbone area; If the Link State ID of the received LSA containing the node information is in the Area 0 backbone area, the Link State ID and Advertising Router in the LSA are changed to the Router ID of the ABR, and the LSA is flooded or forwarded to the interface of the non-Area 0 area.

6. The method for disseminating information between nodes in an internetwork according to claim 1, characterized in that: If the second router is an autonomous system border router ASBR, the method further includes: It is prohibited to transfer the LSA to the interface of the area outside the autonomous system AS domain of the dynamic routing protocol OSPF.

7. An inter-network node information dissemination device, characterized in that: Applied to a second router, the second router is adjacent to the first router on a network, the device comprises a transceiver and a processor, The transceiver is used to receive a link state update LSU message sent by the first router, wherein the link state advertisement LSA in the LSU message includes node information of the first router; the node information includes at least one of the following: node address information, validity time, and reservation information; and send a link state confirmation LSAck message to the first router, wherein the LSAck message includes header information of the LSA; The processor is used to calculate the LSA containing node information according to the LSU message, and store it in the local link state database LSDB; The step of calculating the LSA containing the node information according to the LSU message and storing it in the local link state database LSDB comprises: Step 1: If there is no LSA containing the node information IN in the local LSDB, store the received LSA containing the node information into the node information link state IN Link States of the local LSDB, otherwise go to step 2; Step 2: If there is an LSA containing node information in the local LSDB, compare the LSA age of the existing LSA with the received LSA containing node information. If the LSA ages of the two are not equal, store the node information in the LSA with the smaller LSAAge as the best node information in the corresponding parameters of the router, and store the LSA with the smaller LSAAge in the IN Link States of the local LSDB, and delete the remaining LSA information in the IN Link States; if the LSAAge of the two are equal, execute step 3; Step 3: Select the node information in the LSA from Area 0 as the best node information and store it in the corresponding parameters of the router. Then store the LSA in the IN Link States of the local LSDB and delete the remaining LSA information in the IN Link States. If there is no LSA from Area 0, go to step 4. Step 4: Compare the Link State ID, Advertising Router, and LS Sequence Number in the existing LSA and the received LSA containing the node information in turn, store the LSA with the larger value in IN LinkStates of the local LSDB, and delete the remaining LSA information in IN Link States; if the existing LSA is the same as the received LSA containing the node information, discard the LSU message.

8. An inter-network node information dissemination device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor; characterized in that: When the processor executes the program, the method for disseminating information between network nodes according to any one of claims 1 to 6 is implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the steps in the network node information propagation method as described in any one of claims 1 to 6 are implemented.

Images