A message sending method, apparatus and electronic device

Abstract

The application provides a message sending method and device and electronic equipment, and relates to the technical field of communication. In the application, first, when a current node determines that a resource reservation protocol (RSVP) message sent by a neighboring node of the current node in a main tunnel is not received, a target data sending tunnel for sending an RSVP teardown message to a target neighboring node in the neighboring nodes is determined, then it is determined whether there is another node in the target data sending tunnel, if yes, whether the RSVP teardown message is sent to the target neighboring node is determined based on a node type of the another node, and if not, the RSVP teardown message is sent to the target neighboring node. In this way, the main tunnel is prevented from being mistakenly removed in a scenario where node protection and link protection are combined, and the service carried in the main tunnel is effectively processed.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a message sending method, apparatus and electronic device. Background Technology

[0002] Fast Reroute (FRR) is a traffic protection scheme in traffic engineering. It aims to provide backup protection for links or nodes in the network when they fail, quickly switching traffic to backup paths to reduce traffic loss.

[0003] like Figure 1 As shown, the basic principle of FRR is to protect one or more LSPs using a pre-established Label Switched Path (LSP). The pre-established LSP is called the protection LSP, and the protected LSP is called the main LSP or main tunnel. In Traffic Engineering (TE) based on Multi-Protocol Label Switching (MPLS), the LSP used by FRR is a Constraint-based Routed Label Switched Path (CR-LSP) established under certain constraints. The establishment of a CR-LSP requires not only routing information but also the fulfillment of certain constraints, such as bandwidth constraints and path constraints. Therefore, in MPLS-based TE, a pre-established CR-LSP can be used to protect one or more CR-LSPs. The pre-established CR-LSP is called the Bypass CR-LSP, and the protected CR-LSP is called the Primary CR-LSP.

[0004] Based on the object being protected, FRR protection can be divided into link protection and node protection. For example... Figure 2 As shown, in Figure 2 The intermediate node protection Bypass CR-LSP1 and the link protection Bypass CR-LSP2 share a common node C, therefore, Figure 2 The scenario shown can be described as a combined link protection and node protection scenario. Bypass CR-LSP1 can protect node A in the Primary CR-LSP, which is the main tunnel formed by node A, node B, and node C. Bypass CR-LSP2 can protect the link from node B to node C.

[0005] In scenarios where link protection and node protection are combined, if node B does not receive Resource Reservation Protocol (RSVP) messages from neighboring node A and node B within the set timeout period, according to the established protocol, node B will forward the RSVP teardown message to node C through backup node D.

[0006] After the data transmission tunnel for RSVP teardown messages is switched from node B-node C to node B-node D-node C, node C will receive RSVP teardown messages from node B from node D, and will also receive RSVP teardown messages from node A from node D. Since the RSVP teardown messages sent by either node A or node B to node C do not contain a routing path, node C cannot determine whether the RSVP teardown message comes from node A or node B.

[0007] Furthermore, when the RSVP teardown message originates from node A, node C must respond to it because node A is currently carrying services. However, when the message originates from node B, node C does not need to respond because node B is not currently carrying services. Since node C cannot determine the source of the received RSVP teardown message, it cannot decide whether to respond to it and may mistakenly tear down the Primary CR-LSP in the main tunnel, causing service interruption on the main tunnel. Summary of the Invention

[0008] This invention provides a message sending method, apparatus, and electronic device to prevent the main tunnel from being mistakenly dismantled in scenarios where node protection and link protection are combined, thereby ensuring effective processing of services carried in the main tunnel. The specific technical solution is as follows:

[0009] Firstly, this application provides a message sending method, including:

[0010] When the current node determines that it has not received a Resource Reservation Protocol (RSVP) message from a neighboring node in the main tunnel, it determines a target data transmission tunnel to which an RSVP teardown message can be sent to a target neighboring node, wherein the RSVP teardown message is used to tear down the main tunnel;

[0011] Determine whether there are other nodes in the target data transmission tunnel;

[0012] If so, then based on the node type of the other nodes, determine whether to send the RSVP teardown message to the target neighboring node;

[0013] If not, the RSVP teardown message is sent to the target's neighboring nodes.

[0014] Based on the above method, when the current node determines that there are other nodes in the target data transmission tunnel, and the node type of the other nodes is a protected node, it stops sending RSVP teardown messages to the target neighboring node. After this, the target neighboring node will only receive RSVP teardown messages sent by node A. This makes it easier for the target neighboring node to determine whether to respond to the RSVP teardown message after receiving it, avoiding the mistaken teardown of the primary CR-LSP of the main tunnel, and ensuring effective processing of services carried in the main tunnel.

[0015] In one possible implementation, the neighboring nodes include the upstream node of the current node and the downstream node of the current node; the target neighboring node is the downstream node.

[0016] Based on the above method, adjacent nodes and target adjacent nodes can be determined.

[0017] In one possible implementation, determining whether to send the RSVP teardown message to the target neighboring node based on the node type of the other nodes includes:

[0018] Determine whether the other nodes are protected nodes; wherein, the protected nodes are the first protected node that protects the upstream node and the second protected node that protects the link between the current node and the downstream node;

[0019] If so, then stop sending the RSVP teardown message to the target's neighboring nodes;

[0020] If not, the RSVP teardown message is sent to the target's neighboring nodes.

[0021] Based on the above method, when the current node determines that other nodes exist in the target data transmission tunnel, and these other nodes are protective nodes, it stops sending RSVP teardown messages to the target's neighboring nodes. This facilitates the target's neighboring nodes in recognizing RSVP teardown messages and determining whether to respond to them, avoiding the accidental teardown of the primary tunnel's PrimaryCR-LSP, and ensuring effective processing of services carried in the primary tunnel.

[0022] In one possible implementation, determining the target data transmission tunnel that can send RSVP teardown messages to the target neighboring node among the neighboring nodes includes:

[0023] Identify each candidate data transmission tunnel that can send the RSVP teardown message to the target neighbor node, and determine the number of nodes contained in each candidate data transmission tunnel;

[0024] From the candidate data transmission tunnels, the candidate data transmission tunnel with the fewest nodes is selected as the target data transmission tunnel.

[0025] Based on the above method, the target candidate data transmission tunnel can be determined from each candidate data transmission tunnel.

[0026] In one possible implementation, prior to determining the target data transmission tunnel to which an RSVP teardown message can be sent to the target neighbor node among the neighbor nodes, the method further includes:

[0027] Receive the historical resource reservation protocol message sent by the upstream node;

[0028] Based on the historical resource reservation protocol message, determine whether the upstream node has the first protected node, and determine the main tunnel;

[0029] The main tunnel includes the upstream node, the current node, and the downstream node.

[0030] Based on the above method, the main tunnel in the network topology can be identified, and it can be determined whether the upstream node has a first protection node.

[0031] In one possible implementation, after receiving the historical resource reservation protocol message sent by the upstream node, the method further includes:

[0032] The resource reservation protocol timeout time of the main tunnel is calculated based on the refresh time carried in the historical resource reservation protocol message.

[0033] Determine whether, within the next timeout period of the resource reservation protocol, a first resource reservation protocol message sent by the upstream node and a second resource reservation protocol message sent by the downstream node in the main tunnel are received;

[0034] If so, then execute the first task corresponding to the first resource reservation protocol message and the second task corresponding to the second resource reservation protocol message;

[0035] If not, then the target data transmission tunnel that can send the RSVP teardown message to the target's neighboring nodes is determined.

[0036] Based on the above method, the timeout period of the resource reservation protocol of the main tunnel can be determined, and if no RSVP message is received from the adjacent node within the timeout period, the process of sending an RSVP teardown message to the target adjacent node can be triggered.

[0037] Secondly, this application provides a message sending device, comprising:

[0038] A response module is configured to determine, when it is determined that no Resource Reservation Protocol (RSVP) message has been received from a neighboring node of the current node in the main tunnel, a target data transmission tunnel to which an RSVP teardown message can be sent to a target neighboring node, wherein the RSVP teardown message is used to tear down the main tunnel;

[0039] The data transmission module is used to determine whether there are other nodes in the target data transmission tunnel;

[0040] If so, then based on the node type of the other nodes, determine whether to send the RSVP teardown message to the target neighboring node;

[0041] If not, the RSVP teardown message is sent to the target's neighboring nodes.

[0042] In one possible implementation, the neighboring nodes include the upstream node of the current node and the downstream node of the current node; the target neighboring node is the downstream node; the data sending module is specifically used for:

[0043] Determine whether the other nodes are protected nodes; wherein, the protected nodes are the first protected node that protects the upstream node and the second protected node that protects the link between the current node and the downstream node;

[0044] If so, then stop sending the RSVP teardown message to the target's neighboring nodes;

[0045] If not, the RSVP teardown message is sent to the target's neighboring nodes.

[0046] Thirdly, this application provides an electronic device, comprising:

[0047] Memory, used to store computer programs;

[0048] When a processor executes a computer program stored in the memory, it implements the steps of the message sending method described above.

[0049] Fourthly, this application provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the message sending method described above.

[0050] For the various aspects of the second to fourth aspects mentioned above, and the technical effects that each aspect may achieve, please refer to the above description of the technical effects that can be achieved for the first aspect or the various possible solutions in the first aspect, which will not be repeated here. Attached Figure Description

[0051] Figure 1 This is a schematic diagram illustrating the application scenario of fast rerouting in an existing network topology, as provided in the embodiments of this application.

[0052] Figure 2 This is one of the schematic diagrams illustrating a scenario where node protection and link protection are combined, as provided in the embodiments of this application.

[0053] Figure 3 A flowchart illustrating a message sending method provided in an embodiment of this application;

[0054] Figure 4 A second schematic diagram illustrating a scenario where node protection and link protection are combined, as provided in the embodiments of this application;

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

[0056] Figure 6 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation

[0057] To make the objectives, technical solutions, and advantages of this application clearer, the application will be further described in detail below with reference to the accompanying drawings. The specific operational methods in the method embodiments can also be applied to the device embodiments or system embodiments. It should be noted that in the description of this application, "multiple" is understood as "at least two". "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. A connected to B can represent: A and B directly connected, and A and B connected through C. Furthermore, in the description of this application, terms such as "first" and "second" are used only for distinguishing the purpose of description and should not be construed as indicating or implying relative importance or order.

[0058] The embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0059] Fast rerouting is a traffic protection scheme in traffic engineering. It aims to provide backup protection for links or nodes in the network when they fail, and quickly switch traffic to backup paths to reduce traffic loss.

[0060] See Figure 1 The basic principle of fast rerouting is to use a pre-established label-switched path (i.e., a protection LSP) to protect one or more LSPs (i.e., primary LSPs). In multiprotocol label switching (MPLS) based traffic engineering, the LSPs used in fast rerouting are LSPs established based on certain constraints (i.e., CR-LSPs). The establishment of a CR-LSP requires not only routing information but also the fulfillment of certain constraints, such as bandwidth constraints and path constraints. Therefore, in MPLS-based traffic engineering, a pre-established CR-LSP can be used to protect one or more CR-LSPs. The pre-established CR-LSP is called a Bypass CR-LSP, and the protected CR-LSP is called the primary CR-LSP.

[0061] Fast rerouting is differentiated based on the protected object. Fast rerouting protection can be divided into link protection and node protection. See [link to relevant documentation]. Figure 2 ,exist Figure 2 The intermediate node protection Bypass CR-LSP1 and the link protection Bypass CR-LSP2 share a common node C, therefore, Figure 2 The scenario shown can be described as a scenario that combines link protection and node protection. Bypass CR-LSP1 can protect node A in the Primary CR-LSP, which is the main tunnel formed by node A, node B, and node C. Bypass CR-LSP2 can protect the link from node B to node C.

[0062] In scenarios where link protection and node protection are combined, if node B does not receive resource reservation protocol messages from neighboring node A and node B within the set timeout period, according to the established protocol, node B will forward an RSVP teardown message to node C through backup node D, so that node C can tear down the main tunnel after receiving the RSVP teardown message.

[0063] After the data transmission tunnel for RSVP teardown messages is switched from node B-node C to node B-node D-node C, node C will receive RSVP teardown messages from both node B and node A from node D. Since the RSVP teardown messages sent by either node A or node B to node C do not contain a routing path, node C cannot determine whether the RSVP teardown message originated from node A or node B.

[0064] In addition, when the RSVP teardown message comes from node A, node C must respond to the RSVP teardown message because node A is currently carrying services; when the RSVP teardown message comes from node B, node C does not need to respond to the RSVP teardown message because node B is not currently carrying services.

[0065] Since node C cannot determine the source of the RSVP teardown message after receiving it, it cannot determine whether to respond to the RSVP teardown message based on the received message. As a result, node C may mistakenly tear down the main tunnel, causing the service carried on the main tunnel to be interrupted.

[0066] In view of this, in order to prevent the accidental deletion of the main tunnel in scenarios where node protection and link protection are combined, and to ensure the effective processing of services carried in the main tunnel, this application provides a message sending method, specifically including: when the current node determines that it has not received a Resource Reservation Protocol (RSVP) message sent by a neighboring node in the main tunnel, it determines a target data transmission tunnel to which an RSVP teardown message can be sent to a target neighboring node, and then determines whether there are other nodes in the target data transmission tunnel; if so, it determines whether to send an RSVP teardown message to the target neighboring node based on the node type of the other nodes; if not, it sends an RSVP teardown message to the target neighboring node.

[0067] The method provided in this application allows the current node to first determine the target data transmission tunnel to which an RSVP teardown message can be sent when it has not received an RSVP message from a neighboring node. Then, based on the existence and type of other nodes within the target data transmission tunnel, it determines whether to send an RSVP teardown message to the target neighboring node. When other nodes are protection-type nodes (i.e., scenarios combining node protection and link protection), stopping the sending of RSVP teardown messages to the target neighboring node prevents accidental teardown of the main tunnel, ensuring effective processing of services carried in the main tunnel.

[0068] Reference Figure 3 The diagram shown is a flowchart of a message sending method provided in an embodiment of this application. The method includes:

[0069] S1, when the current node determines that it has not received the Resource Reservation Protocol (RSVP) information sent by the neighboring node of the current node in the main tunnel, it determines the target data transmission tunnel that can send the RSVP teardown message to the target neighboring node.

[0070] Firstly, the method provided in this application can be applied to Figure 2The network topology shown includes: various nodes (node ​​A, node B, node C and node D) and tunnels connecting the nodes; each node can be used to represent a corresponding network device. This application does not impose specific restrictions on the number of nodes or the connection relationship between nodes, and the method provided in this application can be run in node B.

[0071] In the embodiments of this application, as shown in the appendix Figure 2 As shown, assuming the main tunnel is node A-node B-node C, under normal communication conditions, for node B, node B will periodically receive Resource Reservation Protocol (RSVP) messages sent by neighboring nodes. The neighboring nodes can be node A upstream and node C downstream of node B, and the target neighboring node is the downstream node C. Only when node B does not receive an RSVP message sent by a neighboring node within a set timeout period will it trigger the process of sending an RSVP teardown message to the target neighboring node in the main tunnel.

[0072] In this embodiment, during the historical time period when node B can receive RSVP messages sent by neighboring nodes—that is, before node B determines a target data transmission tunnel to which it can send RSVP teardown messages—the current node (node ​​B) first receives a historical resource reservation protocol message sent by upstream node A. After receiving this message, the current node can determine whether a main tunnel exists based on the historical resource reservation protocol message. Figure 2 The main tunnel, Primary CR-LSP, includes upstream node A, current node B, and downstream node C. This application does not impose a specific limit on the number of nodes included in the main tunnel; and based on the historical resource reservation protocol message, it can also be determined whether the tunnel has been protected, or in other words, whether the upstream node has a first protection node D for node protection.

[0073] On the other hand, after receiving the historical resource reservation protocol message, the current node can also calculate the resource reservation protocol timeout time of the main tunnel based on the refresh time carried in the historical resource reservation protocol message, i.e., the aforementioned timeout time. In specific implementation, if the refresh time is T1, the resource reservation protocol timeout time T2 can be calculated using the following formula:

[0074] T2 = m × n × T1

[0075] Where m and n are both positive real numbers, and T1 can be 1ms, 1s or any other duration.

[0076] Preferably, m can be set to 3 and n can be set to 1.5.

[0077] After determining the resource reservation protocol timeout period, the current node can determine whether it has received the first resource reservation protocol message sent by the upstream node A and the second resource reservation protocol message sent by the downstream node in the main tunnel within the next resource reservation protocol timeout period.

[0078] When the current node determines that it has received the first resource reservation protocol message and the second resource reservation protocol message within the timeout period of the resource reservation protocol, it can execute the first task corresponding to the first resource reservation protocol message and the task corresponding to the second resource reservation protocol message. The first task and the second task can be tasks for forwarding traffic. This application does not impose specific restrictions on the type of task.

[0079] When the current node determines that it has not received either the first or second resource reservation protocol message within the resource reservation protocol timeout period, it will trigger the process of sending an RSVP teardown message to the target neighboring node in the main tunnel. The specific steps are as follows:

[0080] The current node first determines the target data transmission tunnel that can send RSVP teardown messages to the target neighbor node. Specifically, the current node can first determine each candidate data transmission tunnel that can send RSVP teardown messages to the target neighbor node, and determine the number of nodes included in each candidate data transmission tunnel, such as... Figure 2 As shown, the candidate data transmission tunnel can be Node B-Node D-Node C; in addition, such as Figure 4 As shown, if node E also exists in the network topology, the candidate data transmission tunnels include node B-node D-node E-node C and node B-node D-node C. In one possible implementation, when node B determines that there are multiple candidate data transmission tunnels, it can select the candidate data transmission tunnel with the fewest nodes as the target data transmission tunnel. For example, it can select the candidate data transmission tunnel with the fewest nodes as the target data transmission tunnel. Figure 4 The candidate data transmission tunnel nodes B-D-C are used as the target data transmission tunnel.

[0081] In this way, when the current node determines that it has not received an RSVP message from a neighboring node in the main tunnel, it can determine whether there is a candidate data transmission tunnel that can send an RSVP teardown message to the target neighboring node. If there is only one candidate data transmission tunnel, it is selected as the target candidate data transmission tunnel. If there are multiple candidate data transmission tunnels, the candidate data transmission tunnel with the fewest nodes is selected as the target data transmission tunnel.

[0082] S2, determine whether there are other nodes in the target data transmission tunnel. If yes, proceed to step S31; otherwise, proceed to step S32.

[0083] S31: Based on the node types of other nodes, determine whether to send an RSVP teardown message to the target neighboring node.

[0084] In the embodiments of this application, such as Figure 2 As shown, after the current node determines the target data transmission tunnel, it can first determine whether there are other nodes in the target data transmission tunnel. When the current node determines that there are other nodes D in the target data transmission tunnel, it can determine whether to send an RSVP teardown message to the target adjacent node based on the node type of the other nodes.

[0085] Specifically, when the current node determines that other nodes exist in the target data transmission tunnel, it can first determine whether these other nodes are protective nodes. Protective nodes are the first protective node D that protects the upstream node A of the current node, and the second protective node D that protects the link between the current node and the downstream node C. In practice, the first protective node D can be determined based on the resource reservation protocol information sent by adjacent nodes; the second protective node D can be determined based on the current node's own configuration information, that is, whether link protection has been formed for the link (node ​​B - node C) in the main tunnel, such as... Figure 2 The tunnel is Bypass CR-LSP2.

[0086] When the current node determines that other nodes are protected nodes, it can stop sending RSVP teardown messages to the target neighboring nodes; when the current node determines that other nodes are not protected nodes, it can send RSVP teardown messages to the target neighboring nodes.

[0087] When the current node determines that there are other nodes in the target data transmission tunnel, and the node type of the other nodes is a protected node (i.e., in a scenario where link protection and node protection are combined), it stops sending RSVP teardown messages to the target neighboring nodes. The target neighboring nodes will only receive RSVP teardown messages sent by node A. This makes it easier for the target neighboring nodes to determine whether to respond to the RSVP teardown message after receiving it, avoiding the mistaken teardown of the primary tunnel PrimaryCR-LSP, and ensuring effective processing of services carried in the primary tunnel.

[0088] S32: Send an RSVP teardown message to the target's neighboring nodes.

[0089] In this embodiment, when the current node determines that there are no other nodes in the target data transmission tunnel (i.e., the target data transmission tunnel is the current node - the target neighboring node), it can send an RSVP teardown message to the target neighboring node. For node C, node C will directly receive the message, identify it as an RSVP teardown message sent by the current node, and then determine whether to respond to the RSVP teardown message sent by the current node.

[0090] In summary, the method provided in this application allows the current node to stop sending RSVP teardown messages to the target neighboring node when it determines that other nodes exist in the target data transmission tunnel and that these other nodes are of the protected node type. After this, the target neighboring node will only receive RSVP teardown messages sent by node A. Therefore, the target neighboring node can identify that the RSVP teardown message originates from node A, enabling it to determine whether to respond to the RSVP teardown message upon receipt. This avoids mistakenly tearing down the primary CR-LSP of the main tunnel, ensuring effective processing of services carried in the main tunnel.

[0091] Based on the methods provided in the above embodiments, this application also provides a message sending device, such as... Figure 5 The diagram shown is a structural schematic of a message sending device according to an embodiment of this application. The device includes:

[0092] The response module 501 is configured to determine, when it is determined that no Resource Reservation Protocol (RSVP) message has been received from the neighboring node of the current node in the main tunnel, a target data transmission tunnel for which an RSVP teardown message can be sent to the target neighboring node in the neighboring node, wherein the RSVP teardown message is used to tear down the main tunnel;

[0093] Data transmission module 502 is used to determine whether there are other nodes in the target data transmission tunnel;

[0094] If so, then based on the node type of the other nodes, determine whether to send the RSVP teardown message to the target neighboring node;

[0095] If not, the RSVP teardown message is sent to the target's neighboring nodes.

[0096] In one possible implementation, the neighboring nodes include the upstream node of the current node and the downstream node of the current node; the target neighboring node is the downstream node; the data sending module 502 is specifically used for:

[0097] Determine whether the other nodes are protected nodes; wherein, the protected nodes are the first protected node that protects the upstream node and the second protected node that protects the link between the current node and the downstream node;

[0098] If so, then stop sending the RSVP teardown message to the target's neighboring nodes;

[0099] If not, the RSVP teardown message is sent to the target's neighboring nodes.

[0100] Based on the same inventive concept, this application also provides an electronic device that can realize the functions of the aforementioned message sending device, see reference. Figure 6 The electronic device includes:

[0101] At least one processor 601 and a memory 602 connected to at least one processor 601. In this embodiment, the specific connection medium between the processor 601 and the memory 602 is not limited. Figure 6 The example shown is the connection between processor 601 and memory 602 via bus 600. Bus 600 is... Figure 6 The connections between other components are indicated by thick lines and are for illustrative purposes only, not as limiting information. The 600 bus can be divided into address bus, data bus, control bus, etc., for ease of representation. Figure 6 The term is represented by a single thick line, but this does not imply that there is only one bus or one type of bus. Alternatively, the processor 601 can also be called a controller; there is no restriction on the name.

[0102] In this embodiment, memory 602 stores instructions executable by at least one processor 601. By executing the instructions stored in memory 602, at least one processor 601 can perform the message sending method described above. Processor 601 can implement... Figure 5 The functions of each module in the device shown.

[0103] The processor 601 is the control center of the device. It can connect to various parts of the control device through various interfaces and lines. By running or executing instructions stored in memory 602 and calling data stored in memory 602, the processor can perform various functions and process data, thereby monitoring the device as a whole.

[0104] In one possible design, processor 601 may include one or more processing units. Processor 601 may integrate an application processor and a modem processor, wherein the application processor mainly handles the operating system, user interface, and applications, and the modem processor mainly handles wireless communication. It is understood that the modem processor may also not be integrated into processor 601. In some embodiments, processor 601 and memory 602 may be implemented on the same chip; in some embodiments, they may also be implemented on separate chips.

[0105] Processor 601 can be a general-purpose processor, such as a central processing unit (CPU), digital signal processor, application-specific integrated circuit, field-programmable gate array or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component, capable of implementing or executing the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the message sending method disclosed in the embodiments of this application can be directly manifested as execution by a hardware processor, or execution by a combination of hardware and software modules within the processor.

[0106] Memory 602, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. Memory 602 may include at least one type of storage medium, such as flash memory, hard disk, multimedia card, card-type memory, random access memory (RAM), static random access memory (SRAM), programmable read-only memory (PROM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), magnetic storage, magnetic disk, optical disk, etc. Memory 602 can be any other medium capable of carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but is not limited thereto. In the embodiments of this application, memory 602 can also be a circuit or any other device capable of implementing storage functions for storing program instructions and / or data.

[0107] By designing and programming the processor 601, the code corresponding to the message sending method described in the foregoing embodiments can be embedded into the chip, thereby enabling the chip to execute the code during runtime. Figure 3The steps of the message sending method in the illustrated embodiment are as follows. How to design and program the processor 601 is a technique well-known to those skilled in the art and will not be described further here.

[0108] Based on the same inventive concept, embodiments of this application also provide a storage medium storing computer instructions that, when executed on a computer, cause the computer to perform the message sending method described above.

[0109] In some possible implementations, various aspects of the message sending method provided in this application may also be implemented as a program product, which includes program code that, when the program product is run on a device, causes the control device to perform the steps in the message sending method according to the various exemplary embodiments of this application described above.

[0110] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0111] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0112] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0113] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0114] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the spirit and scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. A message sending method, characterized in that, include: When the current node determines that it has not received a Resource Reservation Protocol (RSVP) message from a neighboring node in the main tunnel, it determines a target data transmission tunnel to which an RSVP teardown message can be sent to a target neighboring node, wherein the RSVP teardown message is used to tear down the main tunnel; Determine whether there are other nodes in the target data transmission tunnel; If not, then send the RSVP teardown message to the target's neighboring nodes; If so, then determine whether the other nodes are protected nodes; If so, then stop sending the RSVP teardown message to the target's neighboring nodes; If not, then send the RSVP teardown message to the target's neighboring nodes; The protective node is a first protective node that protects the upstream node and a second protective node that protects the link between the current node and the downstream node.

2. The method as described in claim 1, characterized in that, The adjacent nodes include the upstream node of the current node and the downstream node of the current node; the target adjacent node is the downstream node.

3. The method as described in claim 1, characterized in that, The determination of the target data transmission tunnel that can send RSVP teardown messages to the target neighboring node among the neighboring nodes includes: Identify each candidate data transmission tunnel that can send the RSVP teardown message to the target neighbor node, and determine the number of nodes contained in each candidate data transmission tunnel; From the candidate data transmission tunnels, the candidate data transmission tunnel with the fewest nodes is selected as the target data transmission tunnel.

4. The method as described in claim 1, characterized in that, Before determining the target data transmission tunnel that can send RSVP teardown messages to the target neighboring node among the neighboring nodes, the method further includes: Receive the historical resource reservation protocol message sent by the upstream node; Based on the historical resource reservation protocol message, determine whether the upstream node has the first protected node, and determine the main tunnel; The main tunnel includes the upstream node, the current node, and the downstream node.

5. The method as described in claim 4, characterized in that, After receiving the historical resource reservation protocol message sent by the upstream node, the method further includes: The resource reservation protocol timeout time of the main tunnel is calculated based on the refresh time carried in the historical resource reservation protocol message. Determine whether, within the next timeout period of the resource reservation protocol, a first resource reservation protocol message sent by the upstream node and a second resource reservation protocol message sent by the downstream node in the main tunnel are received; If so, then execute the first task corresponding to the first resource reservation protocol message and the second task corresponding to the second resource reservation protocol message; If not, then the target data transmission tunnel that can send the RSVP teardown message to the target's neighboring nodes is determined.

6. A message sending device, characterized in that, include: The response module is used to determine, when it is determined that no Resource Reservation Protocol (RSVP) message has been received from the neighboring node of the current node in the main tunnel, a target data transmission tunnel to which an RSVP teardown message can be sent to the target neighboring node, wherein the RSVP teardown message is used to tear down the main tunnel; The data transmission module is used to determine whether there are other nodes in the target data transmission tunnel; If not, then send the RSVP teardown message to the target's neighboring nodes; If so, then determine whether the other nodes are protected nodes; If so, then stop sending the RSVP teardown message to the target's neighboring nodes; If not, then send the RSVP teardown message to the target's neighboring nodes; The protective node is a first protective node that protects the upstream node and a second protective node that protects the link between the current node and the downstream node.

7. An electronic device, characterized in that, include: Memory, used to store computer programs; A processor, when executing a computer program stored in the memory, implements the steps of the method according to any one of claims 1-5.

8. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the method described in any one of claims 1-5.

Images