Message sending method and device and electronic equipment
By determining the target data transmission tunnel and determining whether to send RSVP demolition messages based on the node type in the combined scenario of node protection and link protection, the problem of error demolition of the main tunnel caused by the node's inability to determine the source of the message is solved, ensuring the continuity of the service.
Patent Information
- Application Number
- CN202410171560.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-02-06
- Publication Date
- 2025-08-08
AI Technical Summary
In the case where node protection and link protection are used together, nodes cannot determine the source of RSVP demolition messages, which may mistakenly dismantle the main tunnel, resulting in the interruption of the bearer service.
When the current node does not receive the RSVP message, it determines the target data sending tunnel, and decides whether to send RSVP demolition message based on whether there are other nodes and node types in the target tunnel to avoid accidentally demolishing the main tunnel.
It effectively prevents the accidental demolition of the main tunnel, ensures the normal handling of the bearer services, and avoids business interruption.
Smart Images

Figure CN120455518A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of communication technology, and in particular to a message sending method, device and electronic device. Background Art
[0002] Fast reroute (FRR) technology is a traffic protection solution in traffic engineering. It aims to provide backup protection for links or nodes in the network when these links or nodes fail, quickly switching traffic to backup paths to reduce traffic loss.
[0003] like Figure 1 As shown in FIG, the basic principle of FRR is to use a pre-established label switched path (English full name: Label Switched Path, referred to as: LSP) to protect one or more LSPs. The pre-established LSP is called the protection LSP, and the protected LSP is called the primary LSP or primary tunnel. In Traffic Engineering (TE) based on Multi-Protocol Label Switching (MPLS), FRR uses a constraint-based routed label switched path (CR-LSP). The establishment of a CR-LSP requires not only routing information but also certain constraints, such as bandwidth and path constraints. Therefore, in MPLS-based TE, a pre-established CR-LSP can be used to protect one or more CR-LSPs. This pre-established CR-LSP is called a bypass CR-LSP, and the protected CR-LSP is called a primary CR-LSP.
[0004] According to the protected objects, FRR protection can be divided into link protection and node protection. 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 here combines link protection and node protection. Bypass CR-LSP1 protects Node A in the Primary CR-LSP, which is the primary tunnel between Node A, Node B, and Node C. Bypass CR-LSP2 protects the link from Node B to Node C.
[0005] In a scenario where both link protection and node protection are used, if node B does not receive a Resource Reservation Protocol (RSVP) message from neighboring node A and node B within a set timeout period, node B will forward an RSVP teardown message to node C via backup node D according to the established protocol.
[0006] After the data transmission tunnel of the RSVP teardown message is switched from Node B-Node C to Node B-Node D-Node C, Node C will receive the RSVP teardown message from Node B from Node D, and will also receive the RSVP teardown message from Node A from Node D. Since the RSVP teardown message sent by Node A or Node B to Node C does not contain the 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 comes from node A, node C must respond to it because node A is currently carrying traffic. However, when the RSVP teardown message comes from node B, node C does not need to respond because node B is currently not carrying traffic. Since node C cannot determine the source of the RSVP teardown message after receiving it, it cannot determine whether to respond to it and may mistakenly tear down the primary CR-LSP, disrupting traffic carried on the primary tunnel. Summary of the Invention
[0008] This invention provides a message sending method, device, and electronic device to prevent the primary tunnel from being accidentally removed in scenarios where both node protection and link protection are used, thereby ensuring that services carried in the primary tunnel are effectively processed. The specific technical solution is as follows:
[0009] In a first aspect, the present application provides a message sending method, comprising:
[0010] When the current node determines that it has not received a Resource Reservation Protocol (RSVP) message sent by a neighboring node of the current node in the primary tunnel, it determines a target data sending tunnel to which an RSVP teardown message may be sent to a target neighboring node among the neighboring nodes, wherein the RSVP teardown message is used to tear down the primary tunnel;
[0011] Determining whether there are other nodes in the target data sending tunnel;
[0012] If yes, determining whether to send the RSVP teardown message to the target neighboring node based on the node type of the other node;
[0013] If not, sending the RSVP teardown message to the target neighboring node.
[0014] Based on the above method, when the current node determines that there are other nodes in the target data transmission tunnel and that the node type of the other node is a protection node, it stops sending RSVP teardown messages to the target adjacent node. After that, the target adjacent node only receives RSVP teardown messages sent by node A. This allows the target adjacent node to determine whether to respond to the RSVP teardown message after receiving it, thus avoiding the accidental teardown of the primary CR-LSP of the primary tunnel and ensuring that the services carried in the primary tunnel are effectively processed.
[0015] In a possible implementation, the adjacent nodes include an upstream node of the current node and a downstream node of the current node; and the target adjacent node is the downstream node.
[0016] Based on the above method, adjacent nodes and target adjacent nodes can be determined.
[0017] In a possible implementation, determining whether to send the RSVP teardown message to the target neighboring node based on the node type of the other node includes:
[0018] Determining whether the other node is a protection node; wherein the protection node is a first protection node that performs node protection for the upstream node and a second protection node that performs link protection for the link between the current node and the downstream node;
[0019] If yes, stop sending the RSVP teardown message to the target neighboring node;
[0020] If not, sending the RSVP teardown message to the target neighboring node.
[0021] Based on the above method, when the current node determines that other nodes exist in the target data transmission tunnel and that these other nodes are protection nodes, it stops sending RSVP teardown messages to the target neighboring node. This allows the target neighboring node to identify the RSVP teardown message and determine whether to respond to it, thus preventing the primary CR-LSP from being mistakenly torn down and ensuring efficient processing of services carried in the primary tunnel.
[0022] In a possible implementation, determining a target data sending tunnel for sending an RSVP teardown message to a target adjacent node among the adjacent nodes includes:
[0023] Determining each candidate data sending tunnel that can send the RSVP teardown message to the target adjacent node, and determining the number of nodes included in each of the candidate data sending tunnels;
[0024] From the candidate data sending tunnels, a candidate data sending tunnel with the least number of nodes is selected as the target data sending tunnel.
[0025] Based on the above method, the target candidate data sending tunnel can be determined from various candidate data sending tunnels.
[0026] In a possible implementation, before determining the target data sending tunnel for sending the RSVP teardown message to the target adjacent node among the adjacent nodes, the method further includes:
[0027] Receiving a historical resource reservation protocol message sent by the upstream node;
[0028] Based on the historical resource reservation protocol message, determining whether the upstream node has the first protection node, and determining the primary tunnel;
[0029] The primary tunnel includes the upstream node, the current node, and the downstream node.
[0030] Based on the above method, it is possible to determine the primary tunnel in the network topology and determine whether the upstream node has a first protection node.
[0031] In a possible implementation, after receiving the historical resource reservation protocol message sent by the upstream node, the method further includes:
[0032] Calculating a resource reservation protocol timeout time of the primary tunnel based on a refresh time carried in the historical resource reservation protocol message;
[0033] determining whether 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 primary tunnel are received within a next resource reservation protocol timeout period;
[0034] If so, executing a first task corresponding to the first resource reservation protocol message and a second task corresponding to the second resource reservation protocol message;
[0035] If not, it is determined that the target data sending tunnel for sending the RSVP teardown message to the target adjacent node can be sent.
[0036] Based on the above method, the RP timeout period of the primary tunnel can be determined, and when no RSVP message is received from the adjacent node within the RP timeout period, a process of sending an RSVP teardown message to the target adjacent node is triggered.
[0037] In a second aspect, the present application provides a message sending device, comprising:
[0038] a response module, configured to, upon determining that no Resource Reservation Protocol (RSVP) message sent by a neighboring node of the current node in the primary tunnel is received, determine a target data sending tunnel to which an RSVP teardown message may be sent to a target neighboring node among the neighboring nodes, wherein the RSVP teardown message is used to tear down the primary tunnel;
[0039] A data sending module, configured to determine whether there are other nodes in the target data sending tunnel;
[0040] If yes, determining whether to send the RSVP teardown message to the target neighboring node based on the node type of the other node;
[0041] If not, sending the RSVP teardown message to the target neighboring node.
[0042] In a possible implementation, the adjacent nodes include an upstream node of the current node and a downstream node of the current node; the target adjacent node is the downstream node; and the data sending module is specifically configured to:
[0043] Determining whether the other node is a protection node; wherein the protection node is a first protection node that performs node protection for the upstream node and a second protection node that performs link protection for the link between the current node and the downstream node;
[0044] If yes, stop sending the RSVP teardown message to the target neighboring node;
[0045] If not, sending the RSVP teardown message to the target neighboring node.
[0046] In a third aspect, the present application provides an electronic device, comprising:
[0047] Memory for storing computer programs;
[0048] The processor is configured to implement the steps of the above-mentioned message sending method when executing the computer program stored in the memory.
[0049] In a fourth aspect, the present application provides a computer-readable storage medium, in which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned message sending method are implemented.
[0050] For each of the above-mentioned aspects from the second to the fourth aspects and the technical effects that may be achieved by each of the aspects, please refer to the above-mentioned description of the technical effects that can be achieved by the first aspect or various possible solutions in the first aspect, and no further details will be given here. BRIEF DESCRIPTION OF THE DRAWINGS
[0051] Figure 1 A schematic diagram of an application scenario of fast reroute provided in an embodiment of the present application in an existing network topology;
[0052] Figure 2 One of the schematic diagrams of a scenario in which node protection and link protection are combined according to an embodiment of the present application;
[0053] Figure 3 A flowchart of a message sending method provided in an embodiment of the present application;
[0054] Figure 4 Schematic diagram of the second scenario of combined node protection and link protection provided in an embodiment of the present application;
[0055] Figure 5 A schematic diagram of the structure of a message sending device provided in an embodiment of the present application;
[0056] Figure 6 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0057] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application will be further described in detail with reference to the accompanying drawings. The specific operating methods in the method embodiments can also be applied to device embodiments or system embodiments. It should be noted that in the description of the present application, "multiple" is understood as "at least two". "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent the following three situations: A exists alone, A and B exist at the same time, and B exists alone. A is connected to B, which can represent the following two situations: A is directly connected to B and A is connected to B through C. In addition, in the description of the present application, words such as "first" and "second" are only used to distinguish the purpose of description, and cannot be understood as indicating or implying relative importance, nor can they be understood as indicating or implying order.
[0058] The embodiments of the present application are described in detail below with reference to the accompanying drawings.
[0059] Fast rerouting technology is a traffic protection solution in traffic engineering. It aims to provide backup protection for links or nodes in the network when these links or nodes fail, and quickly switch traffic to the backup path to reduce traffic loss.
[0060] See also Figure 1 The basic principle of fast reroute is to use a pre-established label-switched path (i.e., protection LSP) to protect one or more LSPs (i.e., primary LSP). In traffic engineering based on MPLS, the LSP used in fast reroute is an LSP established based on certain constraints (i.e., CR-LSP). The establishment of a CR-LSP requires not only routing information but also certain constraints, such as bandwidth constraints and path constraints. Therefore, in traffic engineering based on MPLS, 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 or primary CR-LSP.
[0061] Fast reroute protection can be divided into link protection and node protection according to the object of protection. 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 here combines link protection and node protection. Bypass CR-LSP1 protects Node A in the Primary CR-LSP, which is the primary tunnel between Node A, Node B, and Node C. Bypass CR-LSP2 protects the link from Node B to Node C.
[0062] In a scenario where both link protection and node protection are used, if node B does not receive a Resource Reservation Protocol message from neighboring node A and node B within the set timeout period, node B will forward an RSVP teardown message to node C via backup node D according to the established protocol. Node C will then tear down the primary tunnel after receiving the RSVP teardown message.
[0063] After the data transmission tunnel of the RSVP teardown message is switched from Node B-Node C to Node B-Node D-Node C, Node C will receive RSVP teardown messages from Node B and Node A respectively from Node D. Since the RSVP teardown messages sent by Node A or Node B to Node C do not contain the routing path, Node C cannot determine whether the RSVP teardown message comes 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 currently not carrying services.
[0065] After receiving the RSVP teardown message, node C cannot determine the source of the RSVP teardown message. Therefore, node C cannot determine whether to respond to the RSVP teardown message based on the received RSVP teardown message. As a result, node C may mistakenly tear down the primary tunnel, resulting in interruption of services carried on the primary tunnel.
[0066] In view of this, in order to prevent the main tunnel from being accidentally deleted in the scenario where node protection and link protection are used together, and to ensure the effective processing of the services carried in the main tunnel, the present application provides a message sending method, which specifically includes: when the current node determines that it has not received the Resource Reservation Protocol RSVP message sent by the adjacent node of the current node in the main tunnel, it determines the target data sending tunnel to which the RSVP demolition message can be sent to the target adjacent node in the adjacent nodes, and then determines whether there are other nodes in the target data sending tunnel; if so, based on the node type of the other nodes, it determines whether to send the RSVP demolition message to the target adjacent node; if not, it sends the RSVP demolition message to the target adjacent node.
[0067] Through the method provided by the present application, the current node can first determine the target data transmission tunnel to which the RSVP teardown message can be sent to the target adjacent node when it determines that it has not received the RSVP message sent by the adjacent node. Then, based on whether there are other nodes in the target data transmission tunnel and the node type of the other nodes, it is determined whether to send the RSVP teardown message to the target adjacent node. When the other nodes are protection nodes (i.e., a scenario where both node protection and link protection are used), stopping sending RSVP teardown messages to the target adjacent node can prevent the primary tunnel from being mistakenly torn down and ensure that the services carried in the primary tunnel are effectively processed.
[0068] Reference Figure 3 As shown, it is a flowchart of a message sending method provided in an embodiment of the present application, the method comprising:
[0069] S1. When the current node determines that it has not received Resource Reservation Protocol (RSVP) information sent by its neighboring node in the primary tunnel, it determines a target data sending tunnel for sending an RSVP teardown message to a target neighboring node among the neighboring nodes.
[0070] First of all, the method provided in this application can be applied to Figure 2In the network topology shown, the network topology includes: various nodes (node A, node B, node C and node D) and tunnels connecting each node; each node can be used to represent a corresponding network device. This application does not impose specific restrictions on the number of nodes and 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 attached Figure 2 As shown, assuming that the primary 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 adjacent nodes, where the adjacent nodes can be the upstream node A and downstream node C of node B, and the target adjacent node is the downstream node C; when node B does not receive the RSVP message sent by the adjacent node within the set timeout period, it will trigger the process of sending an RSVP teardown message to the target adjacent node in the primary tunnel.
[0072] In the embodiment of the present application, during the historical time period in which Node B is able to receive RSVP messages sent by adjacent nodes, that is, before Node B determines the target data transmission tunnel for which it can send an RSVP teardown message to the target adjacent node among the adjacent nodes, the current node (Node B) first receives the historical Resource Reservation Protocol message sent by the upstream node A. After the current node receives the historical Resource Reservation Protocol message, on the one hand, the current node can determine whether there is a primary tunnel based on the historical Resource Reservation Protocol message, such as Figure 2 The primary tunnel Primary CR-LSP includes an upstream node A, a current node B, and a downstream node C. This application does not impose any specific restrictions on the number of nodes included in the primary tunnel. In addition, based on historical resource reservation protocol messages, it can also be determined whether the tunnel has been protected, or 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 primary tunnel based on the refresh time carried in the historical resource reservation protocol message, that is, the timeout time mentioned above. 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] Wherein, 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 RP timeout, the current node can determine whether it receives the first RP message sent by the upstream node A and the second RP message sent by the downstream node in the primary tunnel within the next RP timeout.
[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 resource reservation protocol timeout period, it can execute the first task corresponding to the first resource reservation protocol message and the task corresponding to the second resource reservation protocol. The first task and the second task can be tasks for forwarding traffic. This application does not impose specific restrictions on the type of tasks.
[0079] When the current node determines that it has not received the first Resource Reservation Protocol message or the second Resource Reservation Protocol message within the Resource Reservation Protocol timeout period, it triggers the process of sending an RSVP teardown message to the target adjacent node in the primary tunnel. The specific steps are as follows:
[0080] The current node first determines the target data transmission tunnel to which the RSVP teardown message can be sent to the target adjacent node among the adjacent nodes. Specifically, the current node can first determine each candidate data transmission tunnel to which the RSVP teardown message can be sent to the target adjacent node, and determine the number of nodes included in each candidate data transmission tunnel, such as Figure 2 As shown, the selected data transmission tunnel can be node B-node D-node C; in addition, as Figure 4 As shown, if there is still node E in the network topology, the candidate data transmission tunnels include node B-node D-node E-node C, node B-node D-node C; in a possible implementation, when node B determines that there are multiple candidate data transmission tunnels, it can select the candidate data transmission tunnel with the least number of nodes from each candidate data transmission tunnel as the target data transmission tunnel, for example, Figure 4 The selected data sending tunnel Node B-Node D-Node C is used as the target data sending tunnel.
[0081] Through the above method, when the current node determines that it has not received the RSVP message sent by the adjacent node of the current node in the main tunnel, it can determine whether there is a candidate data sending tunnel that can send the RSVP teardown message to the target adjacent node among the adjacent nodes. When there is only one candidate data sending tunnel, the candidate data sending tunnel is used as the target candidate data sending tunnel; when there are multiple candidate data sending tunnels, the candidate data sending tunnel containing the least number of nodes is selected from each candidate data sending tunnel as the target data sending tunnel.
[0082] S2, determine whether there are other nodes in the target data transmission tunnel, if so, execute step S31; if not, execute step S32.
[0083] S31: Determine whether to send an RSVP teardown message to the target adjacent node based on the node type of the other node.
[0084] In the embodiments of this application, Figure 2 As shown, after determining the target data sending tunnel, the current node can first determine whether there are other nodes in the target data sending tunnel. When the current node determines that there are other nodes D in the target data sending 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 there are other nodes in the target data transmission tunnel, it can first determine whether the other nodes are protection nodes. The protection nodes are the first protection node D that performs node protection on the upstream node A of the current node and the second protection node D that performs link protection on the link between the current node and the downstream node C. In specific implementation, the first protection node D can be determined based on the resource reservation protocol information sent by the adjacent node; the second protection node D can be determined based on the configuration information of the current node itself, that is, based on its own configuration information, it determines whether link protection is formed for the link (node B-node C) in the main tunnel, such as Figure 2 Tunnel Bypass CR-LSP2 in the tunnel.
[0086] When the current node determines that the other node is a protection node, it may stop sending RSVP teardown messages to the target adjacent node; when the current node determines that the other node is a non-protection node, it may send RSVP teardown messages to the target adjacent node.
[0087] When the current node determines that there are other nodes in the target data sending tunnel and the node type of the other nodes is a protection node (that is, in a scenario where link protection and node protection are used together), the current node stops sending RSVP teardown messages to the target adjacent node. The target adjacent node will only receive the RSVP teardown message sent by node A. This makes it easier for the target adjacent node to determine whether to respond to the RSVP teardown message after receiving it, thereby avoiding mistaken teardown of the primary tunnel Primary CR-LSP and ensuring effective processing of the services carried in the primary tunnel.
[0088] S32: Send an RSVP teardown message to the target adjacent node.
[0089] In this embodiment of the present application, when the current node determines that no other nodes exist in the target data transmission tunnel (i.e., the target data transmission tunnel is the current node-target adjacent node), it can send an RSVP teardown message to the target adjacent node. Node C directly receives the RSVP teardown message, identifies it as being sent by the current node, and then determines whether to respond to the RSVP teardown message sent by the current node.
[0090] To summarize, in the method provided by the present application, when the current node determines that there are other nodes in the target data sending tunnel and the node type of the other nodes is a protection node, the current node stops sending RSVP demolition messages to the target adjacent node. After that, the target adjacent node will only receive RSVP demolition messages sent by node A. Therefore, the target adjacent node can identify that the RSVP demolition message comes from node A, and can facilitate the target adjacent node to determine whether to respond to the RSVP demolition message after receiving the RSVP demolition message, thereby avoiding mistakenly demolishing the primary tunnel Primary CR-LSP and ensuring effective processing of the services carried in the primary tunnel.
[0091] Based on the method provided in the above embodiment, the embodiment of the present application also provides a message sending device, such as Figure 5 FIG2 is a schematic diagram of a message sending device according to an embodiment of the present application, wherein the device includes:
[0092] A response module 501 is configured to, upon determining that no Resource Reservation Protocol (RSVP) message is received from a neighboring node of the current node in the primary tunnel, determine a target data transmission tunnel to which an RSVP teardown message may be sent to a target neighboring node among the neighboring nodes, wherein the RSVP teardown message is used to tear down the primary tunnel;
[0093] A data sending module 502 is used to determine whether there are other nodes in the target data sending tunnel;
[0094] If yes, determining whether to send the RSVP teardown message to the target neighboring node based on the node type of the other node;
[0095] If not, sending the RSVP teardown message to the target neighboring node.
[0096] In a possible implementation, the adjacent nodes include an upstream node of the current node and a downstream node of the current node; the target adjacent node is the downstream node; and the data sending module 502 is specifically configured to:
[0097] Determining whether the other node is a protection node; wherein the protection node is a first protection node that performs node protection for the upstream node and a second protection node that performs link protection for the link between the current node and the downstream node;
[0098] If yes, stop sending the RSVP teardown message to the target neighboring node;
[0099] If not, sending the RSVP teardown message to the target neighboring node.
[0100] Based on the same inventive concept, an electronic device is also provided in the embodiment of the present application. The electronic device can realize the functions of the aforementioned message sending device, referring to Figure 6 , the electronic device includes:
[0101] At least one processor 601, and a memory 602 connected to the at least one processor 601. The specific connection medium between the processor 601 and the memory 602 is not limited in the embodiment of the present application. Figure 6 In the example, the processor 601 and the memory 602 are connected via a bus 600. Figure 6 The bus 600 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, Figure 6 The diagram is represented by only one thick line, but this does not mean that there is only one bus or one type of bus. Alternatively, the processor 601 may also be referred to as a controller, without limitation to the name.
[0102] In the embodiment of the present application, the memory 602 stores instructions that can be executed by at least one processor 601. The at least one processor 601 can execute the message sending method discussed above by executing the instructions stored in the memory 602. The processor 601 can implement Figure 5 The functions of each module in the device shown.
[0103] Among them, the processor 601 is the control center of the device, which can use various interfaces and lines to connect the various parts of the entire control device, and monitor the device as a whole by running or executing instructions stored in the memory 602 and calling data stored in the memory 602, the various functions of the device and processing data.
[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. The application processor primarily processes the operating system, user interface, and application programs, while the modem processor primarily processes wireless communications. It is understood that the modem processor may 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] The processor 601 can be a general-purpose processor, such as a central processing unit (CPU), a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present 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 the present application can be directly embodied as being executed by a hardware processor, or can be executed by a combination of hardware and software modules in the processor.
[0106] The memory 602 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer executable programs and modules. The memory 602 may include at least one type of storage medium, such as a flash memory, a hard disk, a multimedia card, a card-type memory, a random access memory (Random Access Memory, RAM), a static random access memory (Static Random Access Memory, SRAM), a programmable read-only memory (Programmable Read Only Memory, PROM), a read-only memory (Read Only Memory, ROM), an electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), a magnetic memory, a disk, an optical disk, etc. The memory 502 is any other medium that can be used to carry or store a desired program code in the form of an instruction or data structure and can be accessed by a computer, but is not limited thereto. The memory 602 in the embodiment of the present application can also be a circuit or any other device that can realize a storage function, 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 above embodiment can be fixed into the chip, so that the chip can execute the message sending method when running. Figure 3The steps of the message sending method of the embodiment shown 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 in detail here.
[0108] Based on the same inventive concept, an embodiment of the present application further provides a storage medium, which stores computer instructions. When the computer instructions are executed on a computer, the computer executes the message sending method discussed above.
[0109] In some possible implementations, various aspects of the message sending method provided in the present application can also be implemented in the form of a program product, which includes program code. When the program product is run on the device, the program code is used to enable the control device to execute the steps of the message sending method according to various exemplary embodiments of the present application described above in this specification.
[0110] Those skilled in the art will appreciate that the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.
[0111] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the steps in the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0112] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.
[0113] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.
[0114] Obviously, those skilled in the art may make various changes and modifications to this application without departing from the spirit and scope of this application. Thus, if these modifications and variations of this application fall within the scope of the claims of this application and their equivalents, this application is intended to include these 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 sent by a neighboring node of the current node in the primary tunnel, it determines a target data sending tunnel to which an RSVP teardown message may be sent to a target neighboring node among the neighboring nodes, wherein the RSVP teardown message is used to tear down the primary tunnel; Determining whether there are other nodes in the target data sending tunnel; If yes, determining whether to send the RSVP teardown message to the target neighboring node based on the node type of the other node; If not, sending the RSVP teardown message to the target neighboring node.
2. The method according to claim 1, wherein The adjacent nodes include an upstream node of the current node and a downstream node of the current node; the target adjacent node is the downstream node.
3. The method according to claim 2, wherein The determining, based on the node type of the other node, whether to send the RSVP teardown message to the target adjacent node includes: Determining whether the other node is a protection node; wherein the protection node is a first protection node that performs node protection for the upstream node and a second protection node that performs link protection for the link between the current node and the downstream node; If yes, stop sending the RSVP teardown message to the target neighboring node; If not, sending the RSVP teardown message to the target neighboring node.
4. The method according to claim 1, wherein The determining a target data sending tunnel for sending an RSVP teardown message to a target adjacent node among the adjacent nodes includes: Determining each candidate data sending tunnel that can send the RSVP teardown message to the target adjacent node, and determining the number of nodes included in each of the candidate data sending tunnels; From the candidate data sending tunnels, a candidate data sending tunnel with the least number of nodes is selected as the target data sending tunnel.
5. The method according to claim 3, wherein Before determining the target data sending tunnel for sending the RSVP teardown message to the target adjacent node among the adjacent nodes, the method further includes: Receiving a historical resource reservation protocol message sent by the upstream node; Based on the historical resource reservation protocol message, determining whether the upstream node has the first protection node, and determining the primary tunnel; The primary tunnel includes the upstream node, the current node, and the downstream node.
6. The method according to claim 5, wherein After receiving the historical resource reservation protocol message sent by the upstream node, the method further includes: Calculating a resource reservation protocol timeout time of the primary tunnel based on a refresh time carried in the historical resource reservation protocol message; determining whether 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 primary tunnel are received within a next resource reservation protocol timeout period; If so, executing a first task corresponding to the first resource reservation protocol message and a second task corresponding to the second resource reservation protocol message; If not, it is determined that the target data sending tunnel for sending the RSVP teardown message to the target adjacent node can be sent.
7. A message sending device, characterized in that: include: a response module, configured to, upon determining that no Resource Reservation Protocol (RSVP) message sent by a neighboring node of the current node in the primary tunnel is received, determine a target data sending tunnel to which an RSVP teardown message may be sent to a target neighboring node among the neighboring nodes, wherein the RSVP teardown message is used to tear down the primary tunnel; A data sending module, configured to determine whether there are other nodes in the target data sending tunnel; If yes, determining whether to send the RSVP teardown message to the target neighboring node based on the node type of the other node; If not, sending the RSVP teardown message to the target neighboring node.
8. The device according to claim 7, characterized in that The adjacent nodes include an upstream node of the current node and a downstream node of the current node; the target adjacent node is the downstream node; and the data sending module is specifically configured to: Determining whether the other node is a protection node; wherein the protection node is a first protection node that performs node protection for the upstream node and a second protection node that performs link protection for the link between the current node and the downstream node; If yes, stop sending the RSVP teardown message to the target neighboring node; If not, sending the RSVP teardown message to the target neighboring node.
9. An electronic device, characterized in that: include: Memory for storing computer programs; A processor, configured to implement the steps of the method according to any one of claims 1 to 6 when executing the computer program stored in the memory.
10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.
Citation Information
Patent Citations
Resource reservation protocol node and its interaction method
CN101087221A
Resource reservation protocol tunnel management method based on flow rate engineering and system thereof
CN101640637A
Resource reservation method and device and storage medium
CN115150341A
Method for resource reservation protocol to reduce soft status update
CN1553663A
Merge point determination in refresh interval independent fast reroute facility protection
US20160119392A1