Link information sending method, communication device and system

Abstract

This application provides a link information transmission method, communication device, and system, applicable to the field of communication technology. The method may include: a first node determining first link information, the first link information indicating a link from the first node to a second node. The first node receives a first message from a second node, the first message including second link information and first indication information. The second link information indicates a link from the second node to the first node, and the first indication information indicates that the second link information is link information to be verified. Subsequently, the first node can verify the first link information and the second link information based on the first indication information. Based on this scheme, after discovering link information leading to the second node, the first node will not immediately propagate it to other neighboring nodes, but will perform validity verification after receiving the second link information sent by the second node. Therefore, the propagation of invalid link information and the resulting waste of communication resources can be avoided.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a link information transmission method, communication device and system. Background Technology

[0002] The Border Gateway Protocol (BGP) Shortest Path First (SPF) protocol is used to establish the underlying network. Nodes in the network can discover links to their neighbors based on BGP configuration information and disseminate this information throughout the network. Ultimately, every node in the network is aware of all the links discovered by other nodes. Nodes can then generate routes based on this information, enabling communication between nodes and successfully constructing the underlying network.

[0003] Since the link information discovered by a node is unidirectional, such as a link from the first node to the second node in a pair of neighboring nodes, a pair of neighboring nodes will discover two unidirectional link information entries, including, for example, a link from the first node to the second node and a link from the second node to the first node. In existing technology, after collecting the link information of the entire network, any node can perform a validity check on the two unidirectional link information entries discovered by any pair of neighboring nodes to determine whether the links corresponding to these two unidirectional link information entries are bidirectionally reachable. If they are bidirectionally reachable, then the link between the pair of neighboring nodes is considered valid.

[0004] However, in some cases, the link information discovered by nodes in the network may be invalid. Spreading invalid link information will waste communication resources and increase the processing burden on nodes. Summary of the Invention

[0005] This application provides a link information transmission method, communication device, and system to solve the problem of nodes spreading invalid link information in the network, which leads to a waste of communication resources.

[0006] To achieve the above objectives, this application adopts the following technical solution:

[0007] Firstly, a link information transmission method is provided, which can be applied to a first node. The method may include: determining first link information, which indicates a link from the first node to a second node; and receiving a first message from the second node, the first message including second link information and first indication information, wherein the second link information indicates a link from the second node to the first node, and the first indication information indicates that the second link information is link information to be verified. Subsequently, the first link information and the second link information are verified according to the first indication information.

[0008] Based on the solution provided in this application, after discovering link information leading to the second node, the first node does not immediately propagate it to other neighboring nodes. Instead, it verifies the validity of the link information after receiving it from the second node. This avoids propagating invalid link information and reduces the waste of communication resources.

[0009] In conjunction with the first aspect mentioned above, as one possible implementation, the first message is a BGP update message, and the first indication information is carried in the first TLV field of the first message. Based on this scheme, using TLV to indicate that the second link information is the link information to be verified is compatible with existing communication protocols and is easy to implement.

[0010] In conjunction with the first aspect mentioned above, as a possible implementation, the first TLV includes a non-transitive attribute, which indicates that the first TLV should not be forwarded further. Based on this scheme, if the first node forwards the second link information, there is no need to indicate that the second link information needs to be verified. In other words, the second link information discovered by the second node is only verified at the first node; other nodes can forward it directly without verification. This scheme avoids the waste of processing resources by each node performing validity verification and reduces the complexity of the scheme implementation.

[0011] In conjunction with the first aspect mentioned above, as a possible implementation, the link information transmission method may further include: if the first link information and the second link information meet the validity verification conditions, determining that the first link information and the second link information are used for SPT calculation.

[0012] In conjunction with the first aspect above, as a possible implementation, the link information sending method may further include: if the first link information and the second link information meet the validity verification conditions, sending a second message to neighboring nodes other than the second node, the second message including the first link information.

[0013] In conjunction with the first aspect above, as a possible implementation, the link information sending method may further include: if the first link information and the second link information meet the validity verification conditions, sending a third message to neighboring nodes other than the second node, the third message including the second link information.

[0014] Based on this scheme, the first link information and the second link information will only be disseminated to the entire network when the first link information and the second link information meet the validity verification conditions.

[0015] In conjunction with the first aspect mentioned above, as one possible implementation, the third message does not include the first indication information. In other words, the second link information is only verified at the first node, and after being forwarded by the first node, it does not need to be verified by other nodes.

[0016] In conjunction with the first aspect mentioned above, as one possible implementation, the first link information includes a first source address and a first destination address, and the second link information includes a second source address and a second destination address. The validity verification conditions for the first and second link information may include: the first source address and the second destination address are the same; the second source address and the first destination address are the same; and the first source address, the first destination address, the second source address, and the second destination address are located in the same network segment.

[0017] In conjunction with the first aspect mentioned above, as a possible implementation, the link information transmission method may further include: if the first link information and the second link information do not meet the validity verification conditions, determining that the first link information and the second link information are not used for SPT calculation.

[0018] In conjunction with the first aspect above, as a possible implementation, the link information transmission method may further include: if the first link information and the second link information do not meet the validity verification conditions, determining not to send the first link information and the second link information to neighboring nodes other than the second node.

[0019] In conjunction with the first aspect mentioned above, as a possible implementation, the link information sending method may further include: sending a fourth message to the second node, the fourth message including first link information and second indication information, the second indication information being used to indicate that the first link information is link information to be verified.

[0020] In conjunction with the first aspect mentioned above, as one possible implementation, the fourth message is a BGP update message, and the second indication information is carried in the second TLV field of the fourth message.

[0021] In conjunction with the first aspect mentioned above, as one possible implementation, the second TLV field includes a non-transitive attribute, which is used to indicate that the second TLV should not be forwarded further.

[0022] Secondly, this application provides a communication device for implementing the above-described method. The communication device may include modules, units, or means corresponding to the implementation of the above-described method. These modules, units, or means may be implemented in hardware, software, or by hardware executing corresponding software. The hardware or software may include one or more modules or units corresponding to the above-described functions.

[0023] In one possible implementation, the communication device includes a processing module and a transceiver module. The processing module is used to invoke instructions to execute message processing or control operations performed by the communication device side in the method of the first aspect described above. The transceiver module is used to execute message receiving and sending operations performed by the communication device side in the method of the first aspect described above.

[0024] Thirdly, a communication device is provided, comprising: a processor; the processor being coupled to a memory and, after reading computer instructions stored in the memory, executing the method described in the first aspect above according to the instructions.

[0025] In one possible implementation, the communication device further includes a memory for storing computer instructions.

[0026] In one possible implementation, the communication device further includes a communication interface for communicating with other devices. For example, the communication interface may be a transceiver, an input / output interface, an interface circuit, an output circuit, an input circuit, a pin, or related circuitry.

[0027] In one possible implementation, the communication device can be a chip or a chip system. When the communication device is a chip system, it can be composed of chips or may include chips and other discrete components.

[0028] In one possible implementation, when the communication device is a chip or chip system, the aforementioned communication interface can be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip or chip system. The aforementioned processor can also be embodied as a processing circuit or logic circuit.

[0029] Fourthly, a computer-readable storage medium is provided that stores instructions which, when executed on a computer, enable the computer to perform the method described in the first aspect.

[0030] Fifthly, a computer program product containing instructions is provided, which, when run on a computer, enables the computer to perform the method described in the first aspect.

[0031] The technical effects of any of the possible implementations in aspects two through five can be found in the technical effects of different implementations in aspect one above, and will not be repeated here. Attached Figure Description

[0032] Figure 1 A schematic diagram of a pair of neighboring nodes provided in an embodiment of this application;

[0033] Figure 2 This is a schematic diagram of the structure of a bottom-layer network provided in an embodiment of this application;

[0034] Figure 3 This application provides a schematic diagram of the structure of a communication system according to an embodiment of the present application.

[0035] Figure 4 This application provides a schematic diagram of the structure of a communication system according to an embodiment of the present application.

[0036] Figure 5 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0037] Figure 6 A flowchart illustrating a link information transmission method provided in this application embodiment;

[0038] Figure 7 A schematic diagram illustrating the format of a link NLRI field provided for an embodiment of this application;

[0039] Figure 8 This is a schematic diagram of the structure of a first TLV provided in an embodiment of this application;

[0040] Figure 9 A flowchart illustrating another link information transmission method provided in this application embodiment;

[0041] Figure 10 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Detailed Implementation

[0042] To facilitate understanding, a brief introduction to the technical terms and related technologies involved in this application will be provided first.

[0043] BGP stands for Border Gateway Protocol. In BGP, nodes establish BGP neighbor relationships with other interconnected nodes through their local interfaces. Nodes can be pre-configured with the addresses of neighboring nodes, enabling them to discover and establish BGP neighbor relationships based on these configured addresses. The addresses of neighboring nodes are also called peer addresses. The peer addresses configured on a node can be host addresses or interface addresses; that is, nodes can establish BGP neighbor relationships based on host addresses (such as the address of a virtual loopback interface) or interface addresses.

[0044] In this embodiment, a neighbor node refers to a node that establishes a BGP neighbor relationship, and this will be used to explain it uniformly here.

[0045] It should be noted that a node's interface can have one master address and multiple slave addresses. Either the master address or the slave address can be used as a peer address, which will be explained uniformly here.

[0046] For example, Figure 1 This is a schematic diagram of a pair of neighboring nodes, such as... Figure 1 As shown, node A's host address is 1.1.1.1, and node B's host address is 2.2.2.2. There are two direct links between node A and node B (the link between interfaces A1 and B1, and the link between interfaces A2 and B2). Specifically, the master address of interface A1 is 10.1.1.1, and the master address of interface B1 is 10.1.1.2; the slave address of interface A1 is 10.1.2.1, and the slave address of interface B1 is 10.1.2.2; the master address of interface A2 is 10.2.1.1, and the master address of interface B2 is 10.2.1.2. Taking the configuration of BGP neighbor information for node A as an example, the peer address (i.e., the address of the neighboring node) configured on node A can be node B's host address 2.2.2.2, or node B's interface address 10.1.1.2, 10.1.2.2, or 10.2.1.2. Taking the configuration of BGP neighbor information on node B as an example, the peer address (i.e. the address of the neighbor node) configured on node B can be the host address of node A, 1.1.1.1, or the interface address of node A, 10.1.1.1, 10.1.2.1, or 10.2.1.1.

[0047] It should be noted that, Figure 1 This example uses an Internet Protocol (IP) address. Additionally, an IP address can have a corresponding address mask. Figure 1For simplicity, it is not shown. Performing a bitwise AND operation between an IP address and its address mask yields the network address corresponding to that IP address. If different IP addresses correspond to the same network address, it means that the different IP addresses belong to the same network segment. For example, suppose... Figure 1 The address masks for IP addresses 10.1.1.1 and 10.1.1.2 are both 255.255.255.0, meaning that the network address corresponding to both IP addresses 10.1.1.1 and 10.1.1.2 is 10.1.1.0. This indicates that IP addresses 10.1.1.1 and 10.1.1.2 are located in the same network segment.

[0048] BGP SPF, short for Shortest Path First (SPF), is a protocol used to establish the underlying network. Nodes in the network can discover links to neighboring nodes based on their BGP neighbor configuration information (such as peer addresses). These discovered links are then disseminated throughout the network, ensuring that every node is aware of all the links discovered. Each node can then generate routing information based on this information, enabling communication between nodes and successfully constructing the underlying network.

[0049] Figure 2 This is a schematic diagram of a low-level network structure, such as... Figure 2 As shown, the network can include a carrier backbone network and a metropolitan area network (MAN). The carrier backbone network can include route reflectors (RRs) and backbone routers (BRs), while the MAN can include core routers (CRs). BRs in the carrier backbone network can connect to CRs in the MAN, different BRs can connect to each other, BRs can also connect to RRs, and RRs can connect to the network control engine (NCE). This network can be constructed using BGP and SPF during the networking phase. For example, Figure 1 Nodes A and B in the diagram can be two directly connected BRs.

[0050] Below, with Figure 1 Using nodes A and B as examples, we can illustrate how nodes in a network discover links.

[0051] For example, suppose node A is configured with the peer address of node B, which is host address 2.2.2.2. If the next hop to address 2.2.2.2 in node A's local routing information is 10.1.1.2, node A can use the primary address 10.1.1.1 of interface A1 to establish a neighbor relationship with node B. Therefore, the link discovered by node A can be: 10.1.1.1 (source address) → 10.1.1.2 (destination address). Similarly, suppose node A is configured with the peer address of node B, which is host address 2.2.2.2. If the next hop to address 2.2.2.2 in node A's local routing information is 10.2.1.2, node A can use the primary address 10.2.1.1 of interface A2 to establish a neighbor relationship with node B. Therefore, the link discovered by node A can be: 10.2.1.1 (source address) → 10.2.1.2 (destination address). Assuming the peer address configured on node A is the host address 2.2.2.2 of node B, and the next hop to 2.2.2.2 in the routing information configured on node A includes 10.1.1.2 and 10.2.1.2, node A can establish a neighbor relationship with node B using the main address 10.1.1.1 of interface A1, or it can establish a neighbor relationship with node B using the main address 10.2.1.1 of interface A2. Thus, the link discovered by node A can be 10.1.1.1 (source address) → 10.1.1.2 (destination address) or 10.2.1.1 (source address) → 10.2.1.2 (destination address). Assuming node A is configured with the primary address 10.1.1.2 of interface B1 of node B, node A can establish a neighbor relationship with node B using the primary address 10.1.1.1 of interface A1. Therefore, the link discovered by node A can be: 10.1.1.1 (source address) → 10.1.1.2 (destination address). Similarly, assuming node A is configured with the primary address 10.2.1.2 of interface B2 of node B, node A can establish a neighbor relationship with node B using the primary address 10.2.1.1 of interface A2. Therefore, the link discovered by node A can be: 10.2.1.1 (source address) → 10.2.1.2 (destination address). Assuming that the peer address configured on node A is the slave address 10.1.2.2 of interface B1 of node B, node A can establish a neighbor relationship with node B using the slave address 10.1.2.1 of interface A1. Thus, the link discovered by node A can be: 10.1.2.1 (source address) → 10.1.2.2 (destination address).

[0052] For example, suppose node B is configured with the peer address of node A, which is host address 1.1.1.1. If node B's local routing information shows the next hop to address 1.1.1.1 as 10.1.1.1, node B can use the primary address of interface B1, 10.1.1.2, to establish a neighbor relationship with node A. Therefore, the link discovered by node B could be: 10.1.1.2 (source address) → 10.1.1.1 (destination address). Similarly, suppose node B is configured with the peer address of node A, which is host address 1.1.1.1. If node B's local routing information shows the next hop to address 1.1.1.1 as 10.2.1.1, node B can use the primary address of interface B2, 10.2.1.2, to establish a neighbor relationship with node A. Therefore, the link discovered by node B could be: 10.2.1.2 (source address) → 10.2.1.1 (destination address). Assuming the peer address configured on node B is the host address 1.1.1.1 of node A, and the next hop to 1.1.1.1 in the routing information configured on node B includes 10.1.1.1 and 10.2.1.1, node B can establish a neighbor relationship with node B using the main address 10.1.1.2 of interface B1, or it can establish a neighbor relationship with node B using the main address 10.2.1.2 of interface B2. Thus, the link discovered by node B can be 10.1.1.2 (source address) → 10.1.1.1 (destination address) or 10.2.1.2 (source address) → 10.2.1.1 (destination address). Assuming node B is configured with the primary address 10.1.1.1 of interface A1 of node A, node B can establish a neighbor relationship with node A using the primary address 10.1.1.2 of interface B1. Therefore, the link discovered by node B can be: 10.1.1.2 (source address) → 10.1.1.1 (destination address). Similarly, assuming node B is configured with the primary address 10.2.1.1 of interface A2 of node A, node B can establish a neighbor relationship with node A using the primary address 10.2.1.2 of interface B2. Therefore, the link discovered by node B can be: 10.2.1.2 (source address) → 10.2.1.1 (destination address). Assuming that the peer address configured on node B is the slave address 10.1.2.1 of interface A1 of node A, node B can establish a neighbor relationship with node A using the slave address 10.1.2.2 of interface B1. Thus, the link discovered by node B can be: 10.1.2.2 (source address) → 10.1.2.1 (destination address).

[0053] Since the links discovered by a node are unidirectional (such as the links discovered by node A and node B mentioned above), a pair of neighboring nodes can discover two unidirectional links. In existing technology, after collecting all the links discovered by nodes in the network, any node can perform a validity check on the two unidirectional links discovered by any pair of neighboring nodes to determine whether the two unidirectional links correspond to the same bidirectional reachable link. If the two unidirectional links correspond to a bidirectional reachable link, it means that the pair of neighboring nodes can communicate bidirectionally based on the same link. Therefore, the node can determine that the pair of neighboring nodes are interconnected when calculating the shortest path tree (SPT). In this case, the two unidirectional links can be considered valid link information. For example, let's take the validity check of the links discovered by node A and node B as an example. Assume that the link discovered by node A is: 10.1.1.1 (source address) → 10.1.1.2 (destination address), and the link discovered by node B is: 10.1.1.2 (source address) → 10.1.1.1 (destination address). It can be seen that the source address of the link discovered by node A is the destination address of the link discovered by node B, and the destination address of the link discovered by node A is the source address of the link discovered by node B. These two unidirectional links correspond to the same bidirectional reachable link (i.e., a bidirectional link with addresses 10.1.1.1 and 10.1.1.2 as endpoints). Furthermore, addresses 10.1.1.1 and 10.1.1.2 are located in the same network segment, so nodes A and B can communicate bidirectionally based on addresses 10.1.1.1 and 10.1.1.2. Therefore, these two unidirectional links are valid link information.

[0054] However, in some cases, the links discovered by nodes in the network may be invalid. For example, two unidirectional links discovered by a pair of neighboring nodes may not correspond to the same bidirectional link, or the addresses at both ends of the link may not belong to the same network segment. Propagating invalid link information wastes communication resources and also increases the processing burden on nodes.

[0055] For example, suppose node A is configured with a peer address of 10.1.1.2, and node A establishes a neighbor relationship using its local address 10.1.1.1. The link discovered by node A is: 10.1.1.1 (source address) → 10.1.1.2 (destination address). Node B is configured with a peer address of 10.2.1.1, and node B establishes a neighbor relationship using address 10.2.1.2. The link discovered by node B is: 10.2.1.2 (source address) → 10.2.1.1 (destination address). In this case, the source address of the link discovered by node A is not the destination address of the link discovered by node B, and the destination address of the link discovered by node A is not the source address of the link discovered by node B. These two unidirectional links cannot correspond to the same bidirectional reachable link, therefore these two unidirectional links are invalid link information.

[0056] For example, suppose node A is configured with a peer address of 10.1.1.2. Node A establishes a neighbor relationship using its local address 10.1.1.1. The link discovered by node A is: 10.1.1.1 (source address) → 10.1.1.2 (destination address). Node B is configured with a peer address of 1.1.1.1. Node B can establish a neighbor relationship using either 10.1.1.2 or 10.2.1.2. The link discovered by node B is: 10.2.1.2 (source address) → 10.2.1.1 (destination address) or 10.1.1.2 (source address) → 10.1.1.1 (destination address). When node B discovers a link of 10.2.1.2 (source address) → 10.2.1.1 (destination address), the link discovered by node A and the link discovered by node B cannot correspond to the same bidirectional reachable link.

[0057] For example, suppose node A is configured with a peer address of 10.1.1.2, and node A establishes a neighbor relationship using address 10.1.2.1. The link discovered by node A is: 10.1.2.1 (source address) → 10.1.1.2 (destination address). Node B is configured with a peer address of 10.1.2.1, and node B establishes a neighbor relationship using address 10.1.1.2. The link discovered by node B is: 10.1.1.2 (source address) → 10.1.2.1 (destination address). In this case, the source address of the link discovered by node A is the destination address of the link discovered by node B, and vice versa. However, since 10.1.2.1 is the slave address of interface A and 10.1.1.2 is the master address of interface B1, these two addresses are located in different network segments. For example, taking an address mask of 255.255.255.0, the network address corresponding to 10.1.2.1 is 10.1.2.0, and the network address corresponding to 10.1.1.2 is 10.1.1.0. Their network addresses are different and belong to different network segments. Addresses in different network segments cannot communicate with each other; therefore, addresses 10.1.2.1 and 10.1.1.2 cannot form a bidirectional reachable link.

[0058] To address the problems existing in the prior art, this application provides a link information transmission method that can avoid the waste of communication resources caused by the dissemination of invalid link information.

[0059] The technical solutions of the embodiments of this application will be described below with reference to the accompanying drawings. In the description of this application, unless otherwise stated, " / " indicates that the objects before and after are in an "or" relationship. For example, A / B can represent A or B. "And / or" in this application is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone, where A and B can be singular or plural. Furthermore, in the description of this application, unless otherwise stated, "multiple" refers to two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple. Furthermore, to facilitate a clear description of the technical solutions in the embodiments of this application, the terms "first" and "second" are used in the embodiments of this application to distinguish identical or similar items with substantially the same function and effect. Those skilled in the art will understand that the terms "first" and "second" do not limit the quantity or execution order, and that "first" and "second" are not necessarily different. Meanwhile, in the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is being used as an example, illustration, or description. Any embodiment or design scheme described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of terms such as "exemplary" or "for example" is intended to present related concepts in a concrete manner for ease of understanding.

[0060] Figure 3 A schematic diagram of a communication system provided in an embodiment of this application is shown below. Figure 3 As shown, the communication system may include a first node 301 and a second node 302, which are connected. Optionally, the communication system may also include other nodes, and the first node 301 and the second node 302 may also be connected to other nodes. Figure 3 It is not shown in the text.

[0061] Figure 4 A schematic diagram of another communication system provided in the embodiments of this application, such as Figure 4As shown, the communication system may include a first node 401, a second node 402, a third node 403, and a fourth node 404. The first node 401 and the second node 402 are connected, the first node 401 is also connected to the third node 403, and the second node 402 is also connected to the fourth node 404. Optionally, the communication system may also include other nodes, and the first node 401, the second node 402, the third node 403, and the fourth node 404 may also be connected to other nodes. Figure 4 It is not shown in the text.

[0062] Optionally, in the embodiments of this application, the nodes in the communication system (such as the first node, the second node, the third node, or the fourth node) can be routing devices or forwarding devices, such as routers or switches.

[0063] It should be noted that, Figure 3 and Figure 4 The lines connecting the nodes in the diagram are used to indicate that there is a connection between the nodes. The number of lines in the diagram does not constitute a limit on the number of links or channels between the nodes, which is hereby clarified.

[0064] It should be understood that the communication system described in the embodiments of this application is for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and does not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the development of communication technology and the emergence of new communication systems, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0065] Optionally, the first node and the second node in the embodiments of this application may also be referred to as communication devices, and the first node and the second node may be adopted. Figure 5 The shown composition or includes Figure 5 The components shown. Figure 5 This is a schematic diagram of the structure of a communication device 50 provided in an embodiment of this application, as shown below. Figure 5 As shown, the communication device 50 includes one or more processors 501, a communication line 502, and at least one communication interface. Figure 5 (This is merely an example illustration, using a communication interface 503 and a processor 501 as examples. Optionally, a memory 504 may also be included.)

[0066] The processor 501 may be a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits used to control the execution of the program of the present application.

[0067] Communication line 502 may include a path for communication between different components.

[0068] The communication interface 503 can be a transceiver module used to communicate with other devices or communication networks, such as Ethernet, RAN, wireless local area networks (WLAN), etc. For example, the transceiver module can be a transceiver or a similar device. Optionally, the communication interface 503 can also be a transceiver circuit located within the processor 501, used to implement the processor's signal input and signal output.

[0069] Memory 504 can be a storage device. For example, it can be read-only memory (ROM) or other types of static storage devices capable of storing static information and instructions; random access memory (RAM) or other types of dynamic storage devices capable of storing information and instructions; electrically erasable programmable read-only memory (EEPROM); compact disc read-only memory (CD-ROM) or other optical disc storage; optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.); magnetic disk storage media or other magnetic storage devices; or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but not limited to these. Memory can exist independently and be connected to the processor via communication line 502. Memory can also be integrated with the processor.

[0070] The memory 504 stores computer execution instructions for implementing the scheme of this application, and its execution is controlled by the processor 501. The processor 501 executes the computer execution instructions stored in the memory 504, thereby implementing the link information transmission method provided in the embodiments of this application.

[0071] Alternatively, in this embodiment, the processor 501 may execute the processing-related functions in the link information sending method provided in the following embodiments of this application, and the communication interface 503 may be responsible for communicating with other devices or communication networks. This embodiment does not specifically limit this.

[0072] Optionally, the computer execution instructions in the embodiments of this application may also be referred to as application code, and the embodiments of this application do not specifically limit this.

[0073] In a specific implementation, as one example, the processor 501 may include one or more CPUs, for example... Figure 5 CPU0 and CPU1 in the CPU.

[0074] In a specific implementation, as one example, the communication device 50 may include multiple processors, such as... Figure 5 Processors 501 and 507 are included. Each of these processors can be a single-core processor or a multi-core processor. The processors here can include, but are not limited to, at least one of the following: a central processing unit (CPU), a microprocessor, a digital signal processor (DSP), a microcontroller unit (MCU), or an artificial intelligence processor, etc., and various computing devices that run software. Each computing device may include one or more cores for executing software instructions to perform calculations or processing.

[0075] In a specific implementation, as one embodiment, the communication device 50 may further include an output device 505 and an input device 506. The output device 505 communicates with the processor 501 and can display information in various ways. For example, the output device 505 may be a liquid crystal display (LCD), a light-emitting diode (LED) display device, a cathode ray tube (CRT) display device, or a projector, etc. The input device 506 communicates with the processor 501 and can receive user input in various ways. For example, the input device 506 may be a mouse, keyboard, touchscreen device, or sensing device, etc.

[0076] The aforementioned communication device 50 may sometimes be referred to as a communication apparatus, which can be a general-purpose device or a special-purpose device. For example, communication device 50 may be a network device such as a router, switch, or gateway, or a terminal device, or a controller in a network, or have... Figure 5 Devices with similar structures. This application does not limit the type of communication device 50 to any particular embodiment.

[0077] The following will combine Figures 1 to 5 This application describes the link information transmission method provided in the embodiments. The device in the following embodiments may have… Figure 5 The components are shown. The actions, terminology, etc., involved in the various embodiments of this application can be referenced interchangeably without limitation. The message names or parameter names in the messages in the embodiments of this application are merely examples; other names may be used in specific implementations without limitation.

[0078] Figure 6 A flowchart of a link information transmission method provided in an embodiment of this application is shown below. Figure 6 As shown, the link information transmission method may include the following steps:

[0079] Step 601: The first node determines the first link information, which indicates the link from the first node to the second node.

[0080] The second node is a neighbor node of the first node.

[0081] Optionally, the configuration information of the first node may include information about neighboring nodes, and the information about neighboring nodes may include the address of the second node.

[0082] Optionally, the information of a neighboring node may include the address of the neighboring node and the local interface / address leading to that neighboring node. Furthermore, the information of a neighboring node may also include the number of the autonomous system (AS) to which the neighboring node belongs.

[0083] For example, the neighbor node information in the configuration information of the first node can be as follows:

[0084] bgp 100

[0085] peer 10.1.1.2as-number 200

[0086] peer 10.1.1.2connect-interface interface1

[0087] Here, bgp 100 indicates that the AS number of the first node is 100, peer 10.1.1.2 indicates that the IP address of the first node's neighbor node is 10.1.1.2, peer 10.1.1.2as-number 200 indicates that the AS number of the neighbor node with IP address 10.1.1.2 is 200, and peer 10.1.1.2connect-interface interface1 indicates that the local interface of the first node to access IP address 10.1.1.2 is interface1.

[0088] Optionally, the configuration information of the first node may also include the address information of the first node, which may include the host address (such as the loopback address) and / or the address of the interface of the first node.

[0089] For example, the address information of the first node in the local configuration information of the first node can be as follows:

[0090] interface 1

[0091] IP address 10.1.1.1 255.255.255.0

[0092] interface 2

[0093] IP address 10.2.1.1 255.255.255.0

[0094] Based on this address information, it can be seen that the first node has two interfaces: interface 1 and interface 2. Interface 1 has an IP address of 10.1.1.1 and an address mask of 255.255.255.0. Interface 2 has an IP address of 10.2.1.1 and an address mask of 255.255.255.0.

[0095] Optionally, the configuration information of the first node may also include additional information. As one possible implementation, this additional information may include the link-state routing protocol used by the first node, enabling information, etc.

[0096] For example, additional information in the local configuration information of the first node can be as follows:

[0097] #

[0098] link-state-family spf

[0099] peer 10.1.1.2enable

[0100] Referring to the above additional information, link-state-family spf can be used to indicate that the link-state routing protocol used by the first node is the SPF protocol, and peer 10.1.1.2enable is used to indicate that the peer address 10.1.1.2 is in an enabled state and can establish a neighbor relationship with this address.

[0101] Optionally, the first link information may include a first source address and a first destination address, wherein the first source address is the address of the first node and the first destination address is the address of the second node, so that the first link information can indicate the link from the first node to the second node.

[0102] In this embodiment, the first node can determine the first link information based on the information of its neighboring nodes in its configuration information. For example, the first node can determine the link to the neighboring node based on the peer address, and the information of this link is the first link information.

[0103] Taking the configuration information of the first node as an example, assuming that 10.1.1.2 is the address of the second node, the first node can determine the link to the neighbor node (i.e., the second node) based on the peer address 10.1.1.2 as: 10.1.1.1→10.1.1.2. Thus, the first link information determined by the first node can be: {10.1.1.1, 10.1.1.2}, where 10.1.1.1 is the first source address and 10.1.1.2 is the first destination address.

[0104] Step 602: The first node receives a first message from the second node. The first message includes second link information and first indication information. The second link information indicates the link from the second node to the first node, and the first indication information is used to indicate that the second link information is the link information to be verified.

[0105] Optionally, the configuration information of the second node may include information about its neighboring nodes, which may include the address of the first node. Thus, the second node can determine the second link information based on the information of its neighboring nodes.

[0106] It should be noted that the configuration information for the second node can be found in the description of the configuration information for the first node mentioned above, and will not be repeated here.

[0107] For example, the configuration information for the second node can be as follows:

[0108] interface 1

[0109] IP address 10.1.1.2 255.255.255.0

[0110] interface 2

[0111] IP address 10.2.1.2 255.255.255.0

[0112] bgp 200

[0113] peer 10.2.1.1as-number 100

[0114] peer 10.2.1.1connect-interface interface2

[0115] #

[0116] link-state-family spf

[0117] peer 10.2.1.1 enable

[0118] Based on the configuration information of the second node above, it can be seen that the second node has two interfaces: interface 1 and interface 2. The IP address of interface 1 is 10.1.1.1, and the address mask is 255.255.255.0. The IP address of interface 2 is 10.2.1.1, and the address mask is also 255.255.255.0. `bgp 200` indicates that the AS number of the second node is 200. `peer 10.2.1.1` indicates that the IP address of the second node's neighbor node is 10.2.1.1. `peer 10.2.1.1as-number 100` indicates that the AS number of the neighbor node with IP address 10.1.1.2 is 100. `peer 10.2.1.1connect-interface interface2` indicates that the local interface of the second node connecting to IP address 10.2.1.1 is interface 2. Additionally, `link-state-family spf` can be used to indicate that the link-state routing protocol used by the second node is the SPF protocol, and `peer 10.2.1.1enable` is used to indicate that the peer address 10.2.1.1 is enabled and can establish a neighbor relationship with this address.

[0119] Optionally, the second link information may include a second source address and a second destination address, wherein the second source address is the address of the second node and the second destination address is the address of the first node, so that the second link information can indicate the link from the second node to the first node.

[0120] Taking 10.2.1.1 as the address of the first node as an example, the second node can discover the link to the first node: 10.2.1.2 → 10.2.1.1. The second link information determined by the second node can be: {10.2.1.2, 10.2.1.1}. Among them, 10.2.1.2 is the second source address, and 10.2.1.1 is the second destination address.

[0121] Optionally, the first message can be a BGP message, such as a BGP update message, which can also be called a BGP update message. The second link information can be carried in the BGP update message.

[0122] Optionally, document number 7752 (i.e., RFC 7752) in the request for comments (RFC) document distributed by the Internet Engineering Task Force (IETF) records the format of messages / messages used to transmit BGP link state information. As one possible implementation, the first message in this embodiment can be implemented with reference to the message / message format defined in RFC 7752.

[0123] Optionally, the first message may include a network layer reachability information (NLRI) field, where the NLRI can be node NLRI, link NLRI, or prefix NLRI. For example, the NLRI field in the first message can be referenced to the definition in RFC 7752. As a possible implementation, the second link information can be carried in the link NLRI field.

[0124] Figure 7 The diagram illustrates the format of a link NLRI field, as shown below. Figure 7 As shown, the link NLRI field can include a protocol identity (Protocol-ID) field, an identifier field, a local node descriptors field, a remote node descriptors field, and a link descriptors field. The Protocol-ID field can be 8 bits long, the identifier field can be 64 bits long, and the lengths of the local node descriptors, remote node descriptors, and link descriptors fields can be variable. As one possible implementation, the second link information can be carried in the link descriptors field of the link NLRI field.

[0125] Optionally, the first message may also include an attribute field, which may specifically include a link attribute field to indicate the attribute information associated with the link indicated by the NLRI field. For example, the attribute field and link attribute field in the first message can be found in the definitions in RFC 7752.

[0126] Optionally, the link attribute field in the first message can be encoded using a type-length-value (TLV) format, and the link attribute field may include at least one TLV.

[0127] Optionally, the first indication information can be carried in a first TLV field, which can be located in a link attribute field. It should be noted that this first TLV is a newly defined TLV in this application, and is different from other TLVs in the link attribute field of existing protocols.

[0128] Optionally, the first TLV may include a type field, a length field, and a value field. The type value of the first TLV differs from the type values ​​of other TLVs in the link attribute field of existing protocols; the type value refers to the value of the type field. In this embodiment, the value field of the first TLV can be used to carry first indication information, which indicates that the second link information is link information to be verified. In other words, the value field of the first TLV can be used to indicate that the second link information is link information to be verified.

[0129] As one possible implementation, at least one bit in the value field can be used as an indicator bit. When the indicator bit is a first value, it indicates that the second link information is the link information to be verified. Here, the first value can be understood as the first indication information. For example, assuming the indicator bit is 1 bit, it can be specified that when the indicator bit is 1, it indicates that the second link information is the link information to be verified.

[0130] Figure 8 A schematic diagram of a first TLV structure is shown, as follows: Figure 8 As shown, the first TLV can include a type field, a length field, and a value field. The type field and length field can be 16 bits (2 bytes) long, and the value field is 32 bits (4 bytes) long. (See also...) Figure 8 The length field includes an indicator bit that can be used to carry first indication information.

[0131] Optionally, the first TLV includes a non-transitive attribute, which indicates that the first TLV will not be forwarded further. In other words, the first TLV is passed from the second node to the first node and will not be forwarded to other nodes. Based on this, if the first node needs to forward the first packet, it will discard the first TLV when forwarding the first packet. Therefore, when the second link information is forwarded by the first node to other nodes, it is not necessary to carry the first TLV to indicate that the second link information is link information to be verified. In other words, the second link information discovered by the second node is only verified at the first node, and other nodes can forward it directly without verification. This scheme can avoid each node performing validity verification, which would waste the processing resources of other nodes, and can reduce the complexity of the scheme implementation.

[0132] Step 603: The first node verifies the first link information and the second link information according to the first instruction information.

[0133] Upon receiving the first message, the first node can determine that the second link information is the link information to be verified based on the first indication information in the first message. In this case, the first node can verify both the first and second link information.

[0134] In this embodiment of the application, verifying the first link information and the second link information may include: determining whether the first source address is the same as the second destination address, and whether the first destination address is the same as the second source address. Furthermore, if the first source address and the second destination address are the same, and the first destination address and the second source address are the same, it is determined whether the source address and the destination address are located in the same network segment.

[0135] Optionally, in this embodiment of the application, if the first source address is the same as the second destination address, the second source address is the same as the first destination address, and the first source address, the first destination address, the second source address, and the second destination address are in the same network segment, the first node can consider that the first link information and the second link information meet the conditions for validity period verification.

[0136] Optionally, if the first link information and the second link information meet the validity verification conditions, the first node can determine that the first link information and the second link information are used for the calculation of BGP SPT. If the first link information and the second link information do not meet the validity verification conditions, the first node can determine that the first link information and the second link information are not used for the calculation of BGP SPT.

[0137] It should be noted that if the first source address and the second destination address are the same, the second source address and the first destination address are the same, and the first source address, first destination address, second source address, and second destination address are in the same network segment, then it indicates that the first link information and the second link information correspond to the same bidirectional reachable link, and the first source address and the first destination address are bidirectionally interconnected. Therefore, when calculating the BGP SPT, it can be marked that the first node and the second node are interconnected, and the addresses at both ends of the link are the first source address and the first destination address.

[0138] Optionally, if the first link information and the second link information meet the validity verification conditions, the first node can disseminate the first link information and the second link information to the entire network. As one possible implementation, if the first link information and the second link information meet the validity verification conditions, the first node can send a second message to neighboring nodes other than the second node, the second message including the first link information. As another possible implementation, if the first link information and the second link information meet the validity verification conditions, the first node can send a third message to neighboring nodes other than the second node, the third message including the second link information.

[0139] Optionally, the third message does not include the first indication information. Based on this scheme, in this embodiment, only the first node verifies the second link information upon receiving it; other nodes can directly forward the second link information upon receiving it. This scheme avoids the waste of processing resources by each node performing validity checks, and also reduces the complexity of the scheme implementation.

[0140] Optionally, if the first link information and the second link information do not meet the validity verification conditions, the first node determines not to send the first link information and the second link information to neighboring nodes other than the second node. Based on this scheme, the first node only propagates the first link information and the second link information after they meet the verification conditions. This scheme can avoid the propagation of invalid link information and the resulting waste of communication resources.

[0141] Figure 9 A flowchart of another link information transmission method provided in the embodiments of this application is shown below. Figure 9 As shown, the link information transmission method may include the following steps:

[0142] Step 901: The second node determines the second link information, which indicates the link from the second node to the first node.

[0143] The relevant content of the second link information can be found in the description of the second link information in step 602, and will not be repeated here.

[0144] Step 902: The second node receives a fourth message from the first node. The fourth message may include first link information and second indication information. The first link information indicates the link from the first node to the second node, and the second indication information is used to indicate that the first link information is the link information to be verified.

[0145] The first link information can be referred to in the description of the first link information in step 601 above, and will not be repeated here.

[0146] Optionally, the fourth message can be a BGP update message, with the second indication information carried in the second TLV field of the fourth message. It should be noted that the fourth message is similar to the first message; the fourth message can refer to the relevant description of the first message, the second indication information can refer to the relevant description of the first indication information, and the second TLV can also refer to the relevant description of the first TLV; further details will not be elaborated here.

[0147] Optionally, the second TLV field includes a non-transitive attribute, which indicates that the second TLV will not be forwarded further. In other words, the second TLV is passed from the first node to the second node and will not be forwarded to other nodes. Based on this, if the second node needs to forward the fourth packet, it will discard the second TLV when forwarding the fourth packet. Therefore, when the first link information is forwarded by the second node to other nodes, it is not necessary to carry the second TLV to indicate that the first link information is link information to be verified.

[0148] Step 903: The second node verifies the first link information and the second link information according to the second instruction information.

[0149] It should be noted that the verification process of the first link information and the second link information by the second node is the same as that of the first node, and can be referred to the relevant description in step 603.

[0150] The conditions for the validity verification of the first link information and the second link information are the same as those in step 603.

[0151] Optionally, if the first link information and the second link information meet the validity verification conditions, the second node can determine that the first link information and the second link information are used for the calculation of BGP SPT. If the first link information and the second link information do not meet the validity verification conditions, the second node can determine that the first link information and the second link information are not used for the calculation of BGP SPT.

[0152] Optionally, if the first and second link information meet the validity verification conditions, the second node needs to disseminate the first and second link information to the entire network. As one possible implementation, if the first and second link information meet the validity verification conditions, the second node can also send a fifth message, which includes the second link information, to neighboring nodes other than the first node. As another possible implementation, if the first and second link information meet the validity verification conditions, the second node can also send a sixth message, which includes the first link information, to neighboring nodes other than the first node.

[0153] Optionally, the sixth message does not include the second indication information. Based on this scheme, in this embodiment, only the second node verifies the first link information upon receiving it; other nodes can directly forward the first link information upon receiving it.

[0154] Optionally, if the first link information and the second link information do not meet the validity verification conditions, the second node determines not to send the first link information and the second link information to neighboring nodes other than the first node. Based on this scheme, the second node only propagates the first link information and the second link information after they meet the verification conditions. This scheme can avoid the propagation of invalid link information and the resulting waste of communication resources.

[0155] It should be noted that, as can be seen from the link information transmission method shown in the above embodiments of this application, the link information transmission method provided by this application adds a verification step before the node disseminates the link information it discovers, thereby ensuring that the link information disseminated by the node is valid link information. Based on this, other nodes besides the nodes at both ends of the invalid link are unaware of the invalid link, thus reducing the processing of invalid link information transmission and reception during the process of disseminating link information throughout the network, and greatly improving the overall network transmission and reception performance.

[0156] Optionally, since all link information disseminated across the network in this application is valid, nodes do not need to perform link validity checks after the link information is disseminated. They can directly use the collected link information for route calculation. This significantly reduces the processing burden and power consumption of nodes, improving the overall network performance.

[0157] It should be noted that the link information transmission method provided in this application can be applied to... Figure 3 or Figure 4 In the communication system shown, when the above link information transmission method is applied... Figure 4In the communication system shown, if the first link information and the second link information meet the validity verification conditions, the first node can send the first link information and the second link information to the third node, and the second node can send the first link information and the second link information to the fourth node.

[0158] It should be noted that the lengths of the fields described in the embodiments of this application are merely illustrative. In actual applications, the lengths of the fields can be other values. This application does not impose specific limitations on the field lengths.

[0159] It should be noted that, in the above method embodiments, the action of the first node can be determined by... Figure 5 The processor 501 in the communication device 50 shown calls the application code stored in the memory 504 to instruct the first node to execute, and the action of the second node can be performed by... Figure 5 The processor 501 in the communication device 50 shown calls the application code stored in the memory 504 to instruct the second node to execute.

[0160] It is understood that, in the above embodiments, the methods and / or steps implemented by the first node can also be implemented by components (e.g., chips or circuits) that can be used by the first node, and the methods and / or steps implemented by the second node can also be implemented by components (e.g., chips or circuits) that can be used by the second node.

[0161] Optionally, embodiments of this application also provide a communication device for implementing the various methods described above. This communication device can be a first node in the above method embodiments, a device including the first node, or a component usable in the first node. The communication device can also be a second node in the above method embodiments, a device including the second node, or a component usable in the second node. It is understood that, in order to implement the above functions, the communication device includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0162] This application embodiment can divide the communication device into functional modules according to the above method embodiment. For example, each function can be divided into its own functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. It should be noted that the module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[0163] Figure 10 A schematic diagram of a communication device 100 is shown. The communication device 100 includes a processing module 1001 and a transceiver module 1002. The transceiver module 1002, also known as a transceiver unit, is used to implement transceiver functions, and may be, for example, a transceiver circuit, a transceiver, a transceiver device, or a communication interface.

[0164] In this example, the communication device 100 is taken as the first node in the above method embodiment:

[0165] Processing module 1001 can be used to determine first link information, which indicates the link from the first node to the second node. Transceiver module 1002 can be used to receive a first message from the second node, the first message including second link information and first indication information. The second link information indicates the link from the second node to the first node, and the first indication information indicates that the second link information is link information to be verified. Processing module 1001 can also be used to verify the first link information and the second link information based on the first indication information.

[0166] Optionally, if the first link information and the second link information meet the validity verification conditions, the processing module 1001 can also be used to determine whether the first link information and the second link information are used for the calculation of BGP SPT.

[0167] Optionally, if the first link information and the second link information meet the validity verification conditions, the transceiver module 1002 can also be used to send a second message to neighboring nodes other than the second node, the second message including the first link information.

[0168] Optionally, if the first link information and the second link information meet the validity verification conditions, the transceiver module 1002 can also be used to send a third message to neighboring nodes other than the second node, the third message including the second link information.

[0169] Optionally, if the first link information and the second link information do not meet the validity verification conditions, the processing module 1001 can also be used to determine that the first link information and the second link information are not used for the calculation of BGP SPT.

[0170] Optionally, if the first link information and the second link information do not meet the validity verification conditions, the processing module 1001 may also be used to determine not to send the first link information and the second link information to neighboring nodes other than the second node.

[0171] Optionally, the transceiver module 1002 can also be used to send a fourth message to the second node. The fourth message includes first link information and second indication information. The second indication information is used to indicate that the first link information is link information to be verified.

[0172] Taking the communication device 100 as the second node in the above method embodiment as an example:

[0173] Processing module 1001 can be used to determine second link information, which indicates the link from the second node to the first node. Transceiver module 1002 can be used to receive a fourth message from the first node. The fourth message may include the first link information and second indication information. The first link information indicates the link from the first node to the second node, and the second indication information indicates that the first link information is link information to be verified. Processing module 1001 can also be used to verify the first link information and the second link information based on the second indication information.

[0174] Optionally, if the first link information and the second link information meet the validity verification conditions, the processing module 1001 can also be used to determine whether the first link information and the second link information are used for the calculation of BGP SPT.

[0175] Optionally, if the first link information and the second link information meet the validity verification conditions, the transceiver module 1002 can also be used to send a fifth message to neighboring nodes other than the first node, the fifth message including the second link information.

[0176] Optionally, if the first link information and the second link information meet the validity verification conditions, the transceiver module 1002 can also be used to send a sixth message to neighboring nodes other than the first node, the sixth message including the first link information.

[0177] Optionally, if the first link information and the second link information do not meet the validity verification conditions, the processing module 1001 can also be used to determine that the first link information and the second link information are not used for the calculation of BGP SPT.

[0178] Optionally, if the first link information and the second link information do not meet the validity verification conditions, the processing module 1001 may also be used to determine not to send the first link information and the second link information to neighboring nodes other than the first node.

[0179] Optionally, the transceiver module 1002 can also be used to send a first message to the first node. The first message includes second link information and first indication information. The first indication information is used to indicate that the second link information is link information to be verified.

[0180] It should be noted that all relevant content of each step involved in the above method embodiments can be referenced from the functional description of the corresponding functional module, and will not be repeated here. Since the communication device 100 provided in this embodiment can execute the above link information transmission method, the technical effects it can obtain can be referred to the above method embodiments, and will not be repeated here.

[0181] Optionally, the service access network device, anchor access network device, or terminal device in the embodiments of this application may also be referred to as a communication device. It may be a general-purpose device or a special-purpose device. The embodiments of this application do not make specific limitations on this.

[0182] In this embodiment, the communication device 100 is presented in an integrated manner, divided into various functional modules. Here, "module" can refer to a specific ASIC, circuitry, a processor and memory executing one or more software or firmware programs, integrated logic circuitry, and / or other devices that can provide the aforementioned functions. In a simplified embodiment, those skilled in the art will recognize that the communication device 100 can employ... Figure 5 The communication device 50 shown is in the form of [example device].

[0183] for example, Figure 5 The processor 501 in the communication device 50 shown can execute the link information transmission method in the above method embodiment by calling the computer execution instructions stored in the memory 504.

[0184] Specifically, Figure 10 The functions / implementation processes of the processing module 1001 and the transceiver module 1002 can be understood through... Figure 5 The processor 501 in the communication device 50 shown calls computer execution instructions stored in memory 504 to implement the function. Alternatively, Figure 10 The function / implementation process of the processing module 1001 can be achieved through... Figure 5 The processor 501 in the communication device 50 shown calls computer execution instructions stored in the memory 504 to implement this. Figure 10 The function / implementation process of the transceiver module 1002 can be obtained through Figure 5 This is achieved through the communication interface 503 in the communication device 50 shown.

[0185] Since the communication device 100 provided in this embodiment can execute the above-described link information transmission method, the technical effects it can achieve can be referred to the above-described method embodiments, and will not be repeated here.

[0186] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0187] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0188] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0189] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0190] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0191] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0192] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented using software programs, implementation can be, in whole or in part, in the form of a computer program product. This computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium accessible to a computer or a data storage device containing one or more servers, data centers, etc., that can be integrated with the medium. The available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media (e.g., solid-state drives (SSDs)).

[0193] As used herein, the terms “component,” “module,” “system,” etc., are intended to refer to a computer-related entity, which may be hardware, firmware, a combination of hardware and software, software, or running software. For example, a component may be, but is not limited to, a process running on a processor, a processor, an object, an executable file, a running thread, a program, and / or a computer. As an example, an application running on a computing device and the computing device itself can both be components. One or more components may reside in a running process and / or thread, and components may be located in a single computer and / or distributed among two or more computers. Furthermore, these components are capable of execution from various computer-readable media having various data structures thereon. These components may communicate locally and / or remotely via signals, such as based on one or more data packets (e.g., data from a component that interacts with a local system, another component in a distributed system, and / or signals that interact with other systems via a network such as the Internet).

[0194] This application presents various aspects, embodiments, or features relating to systems that may include multiple devices, components, modules, etc. It should be understood and appreciated that individual systems may include additional devices, components, modules, etc., and / or may not include all the devices, components, modules, etc. discussed in conjunction with the accompanying drawings. Furthermore, combinations of these approaches are also possible.

[0195] Additionally, in the embodiments of this application, the term "exemplary" is used to indicate that it is an example, illustration, or illustration. Any embodiment or design scheme described as "exemplary" in this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Rather, the use of the term "exemplary" is intended to present the concept in a specific manner.

[0196] In the embodiments of this application, the terms "information," "signal," "message," and "channel" may sometimes be used interchangeably. It should be noted that, without emphasizing the distinction, their intended meanings are consistent. Similarly, "of," "corresponding (relevant)," and "corresponding" may sometimes be used interchangeably. It should be noted that, without emphasizing the distinction, their intended meanings are consistent. "System" and "network" may sometimes be used interchangeably. Without emphasizing the distinction, their intended meanings are consistent; for example, "communication network" also refers to "communication system."

[0197] The network architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0198] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for transmitting link information, characterized in that, Applied to the first node, the method includes: Determine the first link information, which indicates the link from the first node to the second node; A first message is received from the second node. The first message includes second link information and first indication information. The second link information indicates the link from the second node to the first node, and the first indication information is used to indicate that the second link information is link information to be verified. The first message is a Border Gateway Protocol (BGP) message, and the first indication information is carried in the first type-length-value (TLV) field of the first message. The first link information and the second link information are verified according to the first instruction information; If the first link information and the second link information do not meet the validity verification conditions, it is determined that the first link information and the second link information will not be sent to neighboring nodes other than the second node.

2. The method according to claim 1, characterized in that, The first TLV has attributes including a non-transitive attribute, which is used to indicate that the first TLV should not be forwarded further.

3. The method according to claim 1 or 2, characterized in that, The method further includes: If the first link information and the second link information meet the validity verification conditions, then the first link information and the second link information are determined to be used for the calculation of the BGP shortest path tree (SPT).

4. The method according to claim 1 or 2, characterized in that, The method further includes: If the first link information and the second link information meet the validity verification conditions, a second message is sent to neighboring nodes other than the second node, and the second message includes the first link information.

5. The method according to claim 1 or 2, characterized in that, The method further includes: If the first link information and the second link information meet the validity verification conditions, a third message is sent to neighboring nodes other than the second node, and the third message includes the second link information.

6. The method according to claim 5, characterized in that, The third message does not include the first indication information.

7. The method according to claim 1 or 2, characterized in that, The first link information includes a first source address and a first destination address, and the second link information includes a second source address and a second destination address; The validity verification conditions for the first link information and the second link information include: The first source address is the same as the second destination address, the second source address is the same as the first destination address, and the first source address, the first destination address, the second source address, and the second destination address are in the same network segment.

8. The method according to claim 1 or 2, characterized in that, The method further includes: If the first link information and the second link information do not meet the validity verification conditions, it is determined that the first link information and the second link information are not used for the calculation of the shortest path tree (SPT).

9. The method according to claim 1 or 2, characterized in that, The method further includes: A fourth message is sent to the second node. The fourth message includes the first link information and the second indication information. The second indication information is used to indicate that the first link information is link information to be verified.

10. The method according to claim 9, characterized in that, The fourth message is a BGP message, and the second indication information is carried in the second TLV field of the fourth message.

11. The method according to claim 10, characterized in that, The second TLV field has an attribute that is not transitive, which indicates that the second TLV should not be forwarded further.

12. A communication system, characterized in that, The communication system includes a first node and a second node; The first node determines the first link information, which indicates the link from the first node to the second node; The second node sends a first message to the first node. The first message includes second link information and first indication information. The second link information indicates the link from the second node to the first node, and the first indication information is used to indicate that the second link information is link information to be verified. The first message is a Border Gateway Protocol (BGP) message, and the first indication information is carried in the first type-length-value (TLV) field of the first message; The first node verifies the first link information and the second link information according to the first indication information; If the first link information and the second link information do not meet the validity verification conditions, the first node determines not to send the first link information and the second link information to neighboring nodes other than the second node.

13. A communication system, characterized in that, The communication system includes a first node, a second node, and a third node; The first node determines the first link information, which indicates the link from the first node to the second node; The second node sends a first message to the first node. The first message includes second link information and first indication information. The second link information indicates the link from the second node to the first node, and the first indication information is used to indicate that the second link information is link information to be verified. The first message is a Border Gateway Protocol (BGP) message, and the first indication information is carried in the first type-length-value (TLV) field of the first message; The first node verifies the first link information and the second link information according to the first indication information; If the first link information and the second link information meet the validity verification conditions, the first node sends the first link information and the second link information to the third node.

14. A communication device, characterized in that, The communication device includes: a processor and a memory; The memory is used to store computer execution instructions, which, when executed by the processor, cause the communication device to perform the method as described in any one of claims 1-11.

15. A computer-readable storage medium, characterized in that, It stores a computer program that, when executed by a computer, causes the computer to perform the method as described in any one of claims 1-11.

16. A computer program product, characterized in that, The computer program product includes instructions that, when executed by a communication device, cause the communication device to perform the method as described in any one of claims 1-11.

Images