Providing messages associated with performance issues of relay nodes associated with label switched paths

Abstract

Embodiments of the present disclosure relate to providing messages associated with performance issues for relay nodes associated with label switched paths. In some implementations, an relay node associated with a label switched path (LSP) may identify a performance problem of the relay node. The relay node may generate a message associated with the performance issue based on identifying the performance issue. The relay node may send the message to an ingress node associated with the LSP to allow the ingress node to perform one or more actions associated with the LSP. The one or more actions associated with the LSP may include performing an evaluation operation associated with the LSP and / or initiating a termination operation associated with the LSP.

Description

Background Art

[0001] A label switched path (LSP) is a predetermined path or tunnel established in a network, such as a Multiprotocol Label Switching (MPLS) network or a Resource Reservation Protocol (RSVP) MPLS network, to route packets from a source to a destination. Summary of the invention

[0002] In some implementations, a method includes: identifying, by a transit node associated with a label switched path (LSP), a performance problem of the transit node; generating, by the transit node, a message associated with the performance problem based on identifying the performance problem; and sending, by the transit node, the message to an ingress node associated with the LSP to allow the ingress node to perform one or more actions associated with the LSP.

[0003] In some implementations, sending the message allows the ingress node to perform evaluation operations associated with the LSP.

[0004] In some implementations, the method further includes receiving one or more messages associated with an evaluation operation based on sending the message, the evaluation operation being associated with the LSP.

[0005] In some implementations, sending the message allows an ingress node to initiate a termination operation associated with the LSP.

[0006] In some implementations, the method further includes receiving one or more messages associated with a termination operation based on sending the message, the termination operation being associated with the LSP.

[0007] In some implementations, wherein the message sent by the transit node to the ingress node is a first copy of the message, and the transit node is associated with another LSP, and wherein the method further comprises: sending a second copy of the message to another ingress node associated with the other LSP to allow the other ingress node to perform one or more other actions associated with the other LSP.

[0008] In some implementations, sending the second copy of the message allows another ingress node to perform an evaluation operation associated with another LSP.

[0009] In some implementations, the method also includes receiving one or more messages associated with an evaluation operation based on sending the second copy of the message, the evaluation operation being associated with another LSP.

[0010] In some implementations, sending the second copy of the message allows another ingress node to initiate a termination operation associated with another LSP.

[0011] In some implementations, the method also includes receiving one or more messages associated with a termination operation based on sending the second copy of the message, the termination operation being associated with another LSP.

[0012] In some implementations, an ingress node associated with an LSP includes one or more memories; and one or more processors configured to receive a message associated with a performance problem of a transit node from a transit node associated with the LSP; and based on the message, perform one or more actions associated with the LSP.

[0013] In some implementations, in order to perform one or more actions associated with the LSP, one or more processors are configured to: perform an evaluation operation associated with the LSP based on the message.

[0014] In some implementations, one or more processors configured to perform one or more actions associated with an LSP are configured to: based on the message, send one or more messages associated with an evaluation operation associated with the LSP, wherein the one or more messages are configured to be propagated to a transit node via the LSP.

[0015] In some implementations, the one or more processors configured to perform one or more actions associated with the LSP are configured to: initiate a termination operation associated with the LSP based on the message.

[0016] In some implementations, one or more processors configured to perform one or more actions associated with the LSP are configured to send one or more messages associated with a termination operation associated with the LSP, wherein the one or more messages are configured to be propagated to a transit node via the LSP.

[0017] In some implementations, a non-transitory computer-readable medium storing an instruction set includes one or more instructions that, when executed by one or more processors of a transit node associated with an LSP, causes the transit node to: generate a message associated with a performance issue based on identifying the performance issue of the transit node; and send the message to an ingress node associated with the LSP to allow the ingress node to perform one or more actions associated with the LSP.

[0018] In some implementations, the one or more actions associated with the LSP include at least one of: performance of an evaluation operation associated with the LSP, or initiation of a termination operation associated with the LSP.

[0019] In some implementations, the evaluation operation is an LSP self-ping evaluation operation or an LSP ping evaluation operation.

[0020] In some implementations, the one or more instructions, when executed by the one or more processors, further cause the transit node to: based on sending the message, receive one or more messages associated with an evaluation operation, the evaluation operation being associated with the LSP.

[0021] In some implementations, the one or more instructions, when executed by the one or more processors, further cause the transit node to: based on sending the message, receive one or more messages associated with a termination operation, the termination operation being associated with the LSP. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] Figure 1A-Figure 1D is a diagram of an example implementation associated with an offer message indicating a problem with performance of a transit node associated with an LSP.

[0023] Figure 2 is a diagram of an example environment in which the systems and / or methods described herein may be implemented.

[0024] Figure 3 is a diagram of example components of a device described herein.

[0025] Figure 4 is a diagram of example components of a device described herein.

[0026] Figure 5 is a flow diagram of an example process associated with providing a message associated with a performance issue of a transit node associated with an LSP.

[0027] Figure 6 is a flow diagram of an example process associated with providing a message associated with a performance issue of a transit node associated with an LSP. DETAILED DESCRIPTION

[0028] The following detailed description of example implementations refers to the accompanying drawings.The same reference numbers in different drawings may identify the same or similar elements.

[0029] In a typical case, an LSP includes an ingress node, an egress node, and one or more transit nodes, wherein a path from the ingress node to the egress node via one or more transit nodes is defined. In many cases, the transit node of the LSP encounters performance problems (e.g., hardware problems and / or software problems that affect its performance), which affects its ability to forward traffic (e.g., traffic associated with the LSP or other, or traffic received by the transit node). For example, performance problems may cause the transit node to discard traffic, misroute traffic, and / or otherwise incorrectly process traffic. However, the ingress node of the LSP cannot determine that the transit node is affected by performance problems, and therefore will continue to try to send traffic to the egress node via the LSP. Therefore, since the transit node is affected by performance problems, part or all of the traffic will not reach the egress node. This is generally referred to as the traffic black hole phenomenon.

[0030] Some implementations described herein include an inlet node, one or more transit nodes, and an exit node associated with an LSP. A transit node in one or more transit nodes identifies a performance problem of a transit node (e.g., a hardware problem, a software problem, and / or another problem that adversely affects the performance of the transit node). The transit node generates a message associated with the performance problem based on the identification performance problem, and sends the message to the inlet node associated with the LSP. This allows the inlet node to perform one or more actions associated with the LSP. For example, the inlet node can perform an evaluation operation (e.g., an LSP self-ping evaluation operation, an LSP ping evaluation operation, or another evaluation operation), and the evaluation operation is configured to evaluate the state of the LSP. As an additional or alternative example, the inlet node can initiate a termination operation associated with the LSP (e.g., to allow a new LSP to be established from the inlet node to the exit node, excluding the transit node with performance problems).

[0031] In this manner, by providing a message associated with the performance problem, the transit node notifies the ingress node of the performance problem of the transit node (e.g., the performance problem may affect the state of the LSP). This allows the ingress node to perform an evaluation operation associated with the LSP and / or initiate a termination operation associated with the LSP. Therefore, the ingress node can determine that the performance problem of the transit node (e.g., the performance problem causes the transit node to drop traffic, misroute traffic, and / or otherwise incorrectly process traffic) affects the LSP, and the ingress node can thereby cause a new LSP to be established from the ingress node to the egress node. This minimizes or prevents the phenomenon of traffic black holes (e.g., otherwise the phenomenon may be caused by maintaining an LSP that includes a transit node with performance problems) for traffic originating from the ingress node and destined for the egress node.

[0032] Further, because the transit node notifies the ingress node immediately after identifying a performance problem, the ingress node is able to promptly resolve any traffic black hole phenomenon caused by the performance problem of the transit node. Therefore, this minimizes the use of computing resources (e.g., processing resources, memory resources, communication resources, and / or power resources, etc.) of the ingress node and / or other nodes or computing devices, which would otherwise be required to resend traffic to test and check the performance of the transit node associated with the LSP, and / or otherwise resolve problems caused by the traffic black hole phenomenon.

[0033] Figure 1A-Figure 1D 1 is a diagram of an example implementation 100 associated with providing a message indicating a performance problem with a transit node associated with an LSP. Figure 1A-Figure 1D As shown in , the example implementation 100 includes one or more ingress nodes, one or more transit nodes, and one or more egress nodes. Figure 2-Figure 4 These devices are described in more detail.

[0034] The LSP from the ingress node to the egress node may include multiple transit nodes. Figure 1A-Figure 1C As shown in , the LSP from the ingress node to the egress node may include transit node 1, transit node N, and transit node X (e.g., there are one or more additional transit nodes between transit node 1 and transit node N, and / or between transit node N and transit node X). In some implementations, the transit nodes of the LSP may be part of another LSP. For example, Figure 1D As shown in , the transit node N may be included in another LSP, which includes another ingress node and another egress node. For example, each LSP may be an MPLS LSP, an RSVP MPLS LSP, or another type of LSP.

[0035] like Figure 1AAs shown in and by reference numeral 102, a transit node N may identify a performance problem of the transit node N. In some implementations, the transit node N may monitor the performance (e.g., routing performance) of the transit node N, and may identify a performance problem associated with the transit node N based on monitoring the transit node N. For example, the transit node N may monitor data associated with the performance of the transit node N (such as telemetry data), and may identify one or more problem codes (e.g., one or more trap codes, such as associated with a packet forwarding engine (PFE) of the transit node N; one or more exception codes; and / or one or more other problem codes). The transit node N may then analyze the one or more problem codes (e.g., process the one or more problem codes using at least one analysis technique) to determine the performance problem of the transit node N. For example, the performance problem may be a hardware problem, a software problem, and / or another problem that adversely affects the performance of the transit node N. For example, the performance problem may cause the transit node N to drop traffic, misroute traffic, and / or otherwise improperly process traffic (e.g., traffic associated with an LSP, traffic associated with another LSP, or any other traffic).

[0036] As shown at reference numeral 104, transit node N may generate a message associated with the performance problem (e.g., based on identifying the performance problem). For example, the message may be an RSVP path error message as described by Internet Engineering Task Force (IETF) Request for Comments (RFC) 5284. The format of the RSVP path error message may be extended to support an error specification object (e.g., a user-defined error specification code having, for example, error code 33), which may indicate a performance problem and / or may include one or more instructions to perform one or more actions associated with the LSP (e.g., as described herein, perform an evaluation operation associated with the LSP, initiate a termination operation associated with the LSP, and / or perform another action associated with the LSP).

[0037] As shown in the reference numeral 106, the transit node N may send a message to the ingress node of the LSP. For example, the transit node N may send a message to the transit node 1 (or to another transit node between the transit node 1 and the transit node N) so that the message is propagated to the ingress node via the LSP. In this way, the ingress node may receive the message from the transit node N.

[0038] In some implementations, the transit node N may send a message to the ingress node to allow the ingress node to perform one or more actions associated with the LSP. For example, the ingress node may process (e.g., parse, and / or read) the message and may thereby determine (or determine not to) perform the one or more actions. In some implementations, when the message includes one or more instructions to perform the one or more actions, the ingress node may execute the one or more instructions, thereby causing the ingress node to perform the one or more actions. For example, the one or more actions may include performing an evaluation operation associated with the LSP (e.g., as described herein with respect to Figure 1B ), initiating a termination operation associated with the LSP (e.g., as described herein with respect to Figure 1C further described), and / or another operation associated with the LSP.

[0039] Although some implementations described herein include transit node N performing one or more operations (e.g., related to identifying a performance problem, generating a message, and sending a message), additional implementations include any other node included in the LSP (other than the ingress node of the LSP) performing the one or more operations. For example, another transit node (e.g., transit node 1 or transit node X) or an egress node in the LSP can perform the one or more operations.

[0040] like Figure 1B As shown in FIG. 1 and by reference numeral 108, the ingress node may perform evaluation operations associated with the LSP (e.g., as described herein with respect to Figure 1A 1, or one of the one or more actions described in RFC 7746). For example, the evaluation operation can be an LSP self-ping evaluation operation (e.g., as described in RFC 7746), an LSP ping evaluation operation (e.g., as described in RFC 8029), or another evaluation operation configured to evaluate the state of the LSP. Therefore, as shown in the figure numeral 110, the ingress node can send one or more messages associated with the evaluation operation (e.g., one or more LSP self-ping evaluation operation messages, one or more LSP ping evaluation operation messages, and / or one or more other messages). The ingress node can send one or more messages to the transit node 1 so that the one or more messages are propagated to other transit nodes (including transit node N) and / or the egress node via the LSP. In this way, the transmission node N can receive (e.g., associated with the evaluation operation) the one or more messages from the ingress node.

[0041] Based on sending the one or more messages (and, in some implementations, receiving or not receiving the one or more messages in response to the one or more messages), the ingress node can determine the state of the LSP (e.g., a "healthy" state indicating that traffic can be routed via the LSP, or an "unhealthy" state indicating that traffic cannot be routed via the LSP). When the ingress node determines that the LSP has a healthy state, the ingress node can stop performing any other actions, or can perform (e.g., in a manner similar to that described herein), such as on a scheduled basis (e.g., once every ten minutes for the next hour), one or more additional evaluation operations. Alternatively, when the ingress node determines that the LSP has an unhealthy state, the ingress node can initiate a termination operation (e.g., as described herein with respect to Figure 1C Then, or before initiating the termination operation, the ingress node may cause a new LSP to be established between the ingress node and the egress node (eg, excluding the transit node N).

[0042] like Figure 1C As shown in FIG. 1 and by reference numeral 112, an ingress node may initiate a termination operation associated with an LSP (e.g., as described herein with respect to Figure 1B One of the one or more actions described). For example, the termination operation can be an LSP path removal operation (e.g., which will cause the LSP to be terminated). Therefore, as shown in the figure numeral 114, the ingress node can send one or more messages associated with the termination operation (e.g., one or more LSP path removal operation messages). The ingress node can send the one or more messages to the transit node 1 so that the one or more messages are propagated to other transit nodes (including transit node N) and / or the egress node via the LSP. In this way, the transit node N can receive one or more messages (e.g., associated with the termination operation) from the ingress node. In addition, by initiating the termination operation, the ingress node can terminate the LSP, which prevents traffic routed from the ingress node to the ingress node from propagating through the transit node N.

[0043] like Figure 1D As shown in FIG. , the transit node N may be included in one or more LSPs (eg, Figure 1A-Figure 1C As shown in reference numerals 116 and 118, transit node N may identify a performance problem of transit node N and may (for example, in a manner similar to that described herein) Figure 1A A message associated with the performance issue is generated in a manner similar to that described with reference numerals 102 and 104.

[0044] like Figure 1D As further shown in FIG. 1 and referenced by numeral 120, the relay node N may transfer the first copy of the message (eg, in a format similar to that described herein) to the Figure 1A108) to the ingress node of the LSP, which may allow the ingress node (e.g., in the same manner as described herein with respect to Figure 1B-1C The message may be sent to the ingress node to perform one or more actions associated with the LSP in a manner similar to that described above. For example, sending the first copy of the message may allow the ingress node to perform an evaluation operation associated with the LSP (and thereby send one or more messages associated with the evaluation operation to, for example, a transit node N). As another example, sending the first copy of the message may allow the ingress node to initiate a termination operation associated with the LSP (and thereby send one or more messages associated with the termination operation to, for example, a transit node N).

[0045] like Figure 1D As further shown in FIG. 1 and referenced by numeral 122, the relay node N may transmit a second copy of the message (eg, in a format similar to that described herein) to the Figure 1A and 108) to another ingress node of another LSP, which may allow the other ingress node (e.g., in the same manner as described herein with respect to Figure 1B-Figure 1C The second copy of the message may allow the other ingress node to perform one or more actions associated with the other LSP (in a manner similar to that described above). For example, sending a second copy of the message may allow the other ingress node to perform an evaluation operation associated with the other LSP (and thereby send one or more messages associated with the evaluation operation to, for example, transit node N). As another example, sending a second copy of the message may allow the other ingress node to initiate a termination operation associated with the other LSP (and thereby send one or more messages associated with the termination operation to, for example, transit node N).

[0046] As mentioned above, Figure 1A-Figure 1D are provided as examples. Other examples may be related to Figure 1A-Figure 1D The number and arrangement of equipment are different from those described. Figure 1A-Figure 1D is provided as an example. In practice, there may be Figure 1A-Figure 1D More devices, fewer devices, different devices, or differently arranged devices than those shown in . In addition, Figure 1A-Figure 1D Two or more of the devices shown in may also be implemented in a single device, or Figure 1A-Figure 1D The single device shown in can be implemented as multiple distributed devices. Additionally or alternatively, Figure 1A-Figure 1D A set of devices (e.g., one or more devices) shown in FIG. 1 may perform one or more functions described by Figure 1A-Figure 1D Another set of devices shown in .

[0047] Figure 2 2 is a diagram of an example environment 200 in which the systems and / or methods described herein may be implemented. Figure 2As shown in , environment 200 may include an ingress node 210, a transit node group 220 (shown as transit node 220-1 to transit node 220-X), an egress node 230, and a network 240. Environment 200 may be interconnected via a wired connection, a wireless connection, or a combination of wired and wireless connections. Ingress node 210, transit node group 220, and egress node 230 may be included in an LSP in network 240.

[0048] The entry node 210 includes one or more devices capable of receiving, generating, storing, processing, and / or providing information (such as the information described herein). For example, the entry node 210 may include a mobile phone (e.g., a smart phone or a wireless phone), a laptop computer, a tablet computer, a desktop computer, a handheld computer, a gaming device, a wearable communication device (e.g., a smart watch, smart glasses, a heart rate monitor, a fitness tracker, smart clothing, smart jewelry, or a head-mounted display), a network device, or a similar type of device. In some implementations, the entry node 210 may receive network traffic from other entry nodes 210 and / or exit nodes 230 via the network 240 (e.g., by routing packets via an LSP, using a transit node 220 as an intermediary), and / or may provide network traffic to other entry nodes 210 and / or exit nodes 230.

[0049] The transit node 220 includes one or more devices that can receive, process, store, route, and / or provide traffic (e.g., packets or other information or metadata) in a manner described herein. For example, the transit node 220 may include a router, such as a label switching router (LSR), a label edge router (LER), an ingress router, an egress router, a provider router (e.g., a provider edge router or a provider core router), a virtual router, or other types of routers. Additionally or alternatively, the transit node 220 may include a gateway, a switch, a firewall, a hub, a bridge, a reverse proxy, a server (e.g., a proxy server, a cloud server, or a data center server), a load balancer, and / or similar devices. In some implementations, the transit node 220 may be a physical device implemented in a housing such as a chassis. In some implementations, the transit node 220 may be a virtual device implemented by one or more computer devices of a cloud computing environment or a data center. In some implementations, the transit node group 220 may be a group of data center nodes that is used to route traffic flows through the network 240.

[0050] The exit node 230 includes one or more devices that can receive, generate, store, process, and / or provide information (such as the information described herein). For example, the exit node 230 may include a mobile phone (e.g., a smart phone or a wireless phone), a laptop computer, a tablet computer, a desktop computer, a handheld computer, a gaming device, a wearable communication device (e.g., a smart watch, smart glasses, a heart rate monitor, a fitness tracker, smart clothing, smart jewelry, or a head-mounted display), a network device, or a similar type of device. In some implementations, the exit node 230 can receive network traffic from other inlet nodes 210 and / or the exit node 230 via the network 240 (e.g., by routing packets via an LSP, using the transit node 220 as an intermediary), and / or can provide network traffic to other inlet nodes 210 and / or the exit node 230.

[0051] The network 240 includes one or more wired and / or wireless networks. For example, the network 240 may include an MPLS network, an RSVP MPLS network, a packet switching network, a cellular network (e.g., a fifth generation (5G) network, a fourth generation (4G) network (such as a long term evolution (LTE) network), a third generation (3G) network, a code division multiple access (CDMA) network, a public land mobile network (PLMN), a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), a telephone network (e.g., a public switched telephone network (PSTN)), a private network, an ad hoc network, an intranet, the Internet, a fiber-optic-based network, a cloud computing network, etc., and / or a combination of these or other types of networks).

[0052] Figure 2 The number and arrangement of devices and networks shown in are provided as examples. Figure 2 There may be more devices and / or networks, fewer devices and / or networks, different devices and / or networks, or differently arranged devices and / or networks than those shown in FIG. In addition, two or more devices and / or networks are shown. Figure 2 The devices shown in may be implemented in a single device, or Figure 2 The single device shown in can be implemented as multiple distributed devices. Additionally or alternatively, a group of devices (eg, one or more devices) of environment 200 can perform one or more functions that are described as being performed by another group of devices of environment 200.

[0053] Figure 32 is a diagram of example components of a device 300 associated with providing a message associated with a performance issue of a transit node associated with an LSP. Device 300 may correspond to ingress node 210, transit node 220, and / or egress node 230. In some implementations, ingress node 210, transit node 220, and / or egress node 230 may include one or more devices 300 and / or one or more components of device 300. Figure 3 As shown in , device 300 may include a bus 310 , a processor 320 , a memory 330 , an input component 340 , an output component 350 , and / or a communication component 360 .

[0054] The bus 310 may include one or more components that enable wired and / or wireless communications between components of the device 300. ..., such as via an operational coupling, a communicative coupling, an electronic coupling, and / or an electrical coupling. Figure 3 Two or more components of the computer system are coupled together. For example, bus 310 may include electrical connections (e.g., wires, traces, and / or leads) and / or wireless buses. Processor 320 may include a central processing unit, a graphics processing unit, a microprocessor, a controller, a microcontroller, a digital signal processor, a field programmable gate array, an application specific integrated circuit, and / or another type of processing component. Processor 320 may be implemented in hardware, firmware, or a combination of hardware and software. In some implementations, processor 320 may include one or more processors that can be programmed to perform one or more operations or processes described elsewhere herein.

[0055] The memory 330 may include volatile and / or non-volatile memory. For example, the memory 330 may include random access memory (RAM), read-only memory (ROM), a hard drive, and / or other types of memory (e.g., flash memory, magnetic memory, and / or optical memory). The memory 330 may include internal memory (e.g., RAM, ROM, or hard drive) and / or removable memory (e.g., removable via a universal serial bus connection). The memory 330 may be a non-temporary computer-readable medium. The memory 330 may store information, one or more instructions, and / or software (e.g., one or more software applications) related to the operation of the device 300. In some implementations, the memory 330 may include one or more memories coupled (e.g., communicatively coupled) to one or more processors (e.g., processor 320), such as via bus 310. The communicative coupling between the processor 320 and the memory 330 may enable the processor 320 to read and / or process information stored in the memory 330 and / or store information in the memory 330.

[0056] Input assembly 340 can enable device 300 to receive input, such as user input and / or sensor input. For example, input assembly 340 can include touch screen, keyboard, keypad, mouse, button, microphone, switch, sensor, GPS sensor, GNSS sensor, accelerometer, gyroscope, and / or actuator. Output assembly 350 can enable device 300 to provide output such as via display, speaker, and / or light emitting diode. Communication assembly 360 can enable device 300 to communicate with other devices via wired connection and / or wireless connection. For example, communication assembly 360 can include receiver, transmitter, transceiver, modem, network interface card, and / or antenna.

[0057] Device 300 can perform one or more operations or processes described herein. For example, a non-transitory computer-readable medium (e.g., memory 330) can store an instruction set (e.g., one or more instructions or codes) for execution by processor 320. Processor 320 can execute the instruction set to perform one or more operations or processes described herein. In some implementations, the execution of the instruction set by one or more processors 320 causes one or more processors 320 and / or device 300 to perform one or more operations or processes described herein. In some implementations, hard-wired circuits can be used instead of instructions or in combination with instructions to perform one or more operations or processes described herein. Additionally or alternatively, processor 320 can be configured to perform one or more operations or processes described herein. Therefore, the implementation described herein is not limited to any specific combination of hardware circuits and software.

[0058] Figure 3 The number and arrangement of components shown in are provided as examples. Figure 3 Device 300 may include additional components, fewer components, different components, or differently arranged components than those shown in . Additionally or alternatively, a set of components (e.g., one or more components) of device 300 may perform one or more functions that are described as being performed by another set of components of device 300.

[0059] Figure 4 4 is a diagram of example components of a device 400 associated with providing a message associated with a performance issue of a transit node associated with an LSP. Device 400 may correspond to ingress node 210, transit node 220, and / or egress node 230. In some implementations, ingress node 210, transit node 220, and / or egress node 230 may include one or more devices 400 and / or one or more components of device 400. Figure 4As shown in , the device 400 may include one or more input components 410-1 to 410-B (B≥1) (hereinafter collectively referred to as input component 410, and individually referred to as input component 410), a switching component 420, one or more output components 430-1 to 430-C (C≥1) (hereinafter collectively referred to as output component 430, and individually referred to as output component 430), and a controller 440.

[0060] The input component 410 can be one or more attachment points of a physical link and can be one or more entry points for incoming traffic (such as packets). The input component 410 can process the incoming traffic, such as by performing data link layer encapsulation or decapsulation. In some implementations, the input component 410 can transmit and / or receive packets. In some implementations, the input component 410 can include an input line card, which includes one or more packet processing components (e.g., in the form of an integrated circuit), such as one or more interface cards (IFCs), packet forwarding components, line card controller components, input ports, processors, memories, and / or input queues. In some implementations, the device 400 can include one or more input components 410.

[0061] The switch component 420 may interconnect the input component 410 with the output component 430. In some implementations, the switch component 420 may be implemented via one or more crossbar switches, via a bus, and / or with a shared memory. The shared memory may act as a temporary buffer to store packets from the input component 410 before the packets are ultimately scheduled for delivery to the output component 430. In some implementations, the switch component 420 may enable the input component 410, the output component 430, and / or the controller 440 to communicate with each other.

[0062] The output component 430 can store packets and can schedule packets for transmission on an output physical link. The output component 430 can support data link layer encapsulation or decapsulation and / or various higher layer protocols. In some implementations, the output component 430 can transmit packets and / or receive packets. In some implementations, the output component 430 may include an output line card, which includes one or more packet processing components (e.g., in the form of an integrated circuit), such as one or more IFCs, packet forwarding components, line card controller components, output ports, processors, memories, and / or output queues. In some implementations, the device 400 may include one or more output components 430. In some implementations, the input component 410 and the output component 430 can be implemented by the same set of components (e.g., the input / output component can be a combination of the input component 410 and the output component 430).

[0063] The controller 440 includes a processor in the form of, for example, a CPU, a graphics processing unit (GPU), an accelerated processing unit (APU), a microprocessor, a microcontroller, a digital signal processor (DSP), a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), and / or other types. The processor is implemented in hardware, firmware, or a combination of hardware and software. In some implementations, the controller 440 may include one or more processors that can be programmed to perform a function.

[0064] In some implementations, the controller 440 may include RAM, ROM, and / or another type of dynamic or static storage device (e.g., flash memory, magnetic storage, optical storage, etc.) that stores information and / or instructions for use by the controller 440.

[0065] In some implementations, the controller 440 can communicate with other devices, networks, and / or systems connected to the device 400 to exchange information about the network topology. The controller 440 can create a routing table based on the network topology information, can create a forwarding table based on the routing table, and can forward the forwarding table to the input component 410 and / or the output component 430. The input component 410 and / or the output component 430 can use the forwarding table to perform a route lookup for incoming and / or outgoing packets.

[0066] The controller 440 may perform one or more processes described herein. The controller 440 may perform these processes in response to executing software instructions stored by a non-transitory computer readable medium. A computer readable medium is defined herein as a non-transitory memory device. A memory device includes memory space within a single physical memory device or memory space distributed across multiple physical memory devices.

[0067] The software instructions may be read into a memory and / or storage component associated with the controller 440 from another computer-readable medium or from another device via a communication interface. When executed, the software instructions stored in the memory and / or storage component associated with the controller 440 may cause the controller 440 to perform one or more processes described herein. Additionally or alternatively, hardwired circuitry may be used in place of or in combination with software instructions to perform one or more processes described herein. Thus, the implementations described herein are not limited to any specific combination of hardware circuitry and software.

[0068] Figure 4 The number and arrangement of components shown in FIG. 1 are provided as examples. Figure 4Device 400 may include additional components, fewer components, different components, or differently arranged components compared to the components shown in . Additionally or alternatively, a set of components (e.g., one or more components) of device 400 may perform one or more functions that are described as being performed by another set of components of device 400.

[0069] Figure 5 5 is a flow diagram of an example process 500 associated with providing a message associated with a performance issue of a transit node associated with an LSP. Figure 5 One or more processing blocks of are performed by a transit node (e.g., transit node 220) associated with the LSP. In some implementations, Figure 5 One or more processing blocks of the processing module are performed by another device or device group that is separate from or includes the transit node, such as an ingress node (e.g., ingress node 210), another transit node (e.g., another transit node 220), and / or an egress node (e.g., egress node 230). Additionally or alternatively, Figure 5 One or more processing blocks may be performed by one or more components of device 300 (such as processor 320, memory 330, input component 340, output component 350, and / or communication component 360); by one or more components of device 400 (such as input component 410, switching component 420, output component 430, and / or controller 440); and / or by one or more other components.

[0070] like Figure 5 As shown in , process 500 may include identifying a performance problem of a relay node (block 510). For example, as described above, the relay node may identify a performance problem of the relay node.

[0071] like Figure 5 As further shown in FIG. 5 , process 500 may include generating a message associated with the performance problem (block 520). For example, as described above, the transit node may generate a message associated with the performance problem based on identifying the performance problem.

[0072] like Figure 5 As further shown in FIG. 5 , process 500 may include sending a message (block 530). For example, as described above, a transit node may send a message to an ingress node associated with an LSP. Sending a message to an ingress node may allow the ingress node to perform one or more actions associated with the LSP.

[0073] Process 500 may include additional implementations, such as any single implementation or any combination of implementations described below and / or in combination with one or more other processes described elsewhere herein.

[0074] In a first implementation, sending a message allows an ingress node to perform evaluation operations associated with the LSP.

[0075] In a second implementation, alone or in combination with the first implementation, process 500 includes receiving one or more messages associated with an evaluation operation based on sending the message, the evaluation operation being associated with the LSP.

[0076] In a third implementation, alone or in combination with one or more of the first and second implementations, sending a message allows an ingress node to initiate a termination operation associated with the LSP.

[0077] In a fourth implementation, alone or in combination with one or more of the first to third implementations, process 500 includes receiving one or more messages associated with a terminating operation based on sending the message, the terminating operation being associated with the LSP.

[0078] In a fifth implementation, either alone or in combination with one or more of the first to fourth implementations, the message sent by the transit node to the ingress node is a first copy of the message, and the transit node is associated with another LSP, and process 500 includes sending a second copy of the message to another ingress node associated with the other LSP to allow the other ingress node to perform one or more other actions associated with the other LSP.

[0079] In a sixth implementation, alone or in combination with one or more of the first to fifth implementations, sending a second copy of the message allows another ingress node to perform an evaluation operation associated with another LSP.

[0080] In a seventh implementation, alone or in combination with one or more of the first to sixth implementations, process 500 includes receiving one or more messages associated with an evaluation operation based on sending a second copy of the message, the evaluation operation being associated with another LSP.

[0081] In an eighth implementation, alone or in combination with one or more of the first to seventh implementations, sending a second copy of the message allows another ingress node to initiate a termination operation associated with another LSP.

[0082] In a ninth implementation, alone or in combination with one or more of the first to eighth implementations, process 500 includes receiving one or more messages associated with a terminating operation based on sending a second copy of the message, the terminating operation being associated with another LSP.

[0083] Although Figure 5 An example block diagram of process 500 is shown, but in some implementations, Figure 5The process 500 includes additional blocks, fewer blocks, different blocks, or differently arranged blocks compared to those components depicted in FIG. Additionally or alternatively, two or more blocks of the process 500 may be performed in parallel.

[0084] Figure 6 is a flow chart of an example process 600 associated with providing a message associated with a performance issue of a transit node associated with an LSP. Figure 6 One or more processing blocks of are performed by an ingress node (e.g., ingress node 210) associated with the LSP. In some implementations, Figure 6 One or more process blocks of are performed by another device or group of devices separate from or including the ingress node, such as a transit node (e.g., transit node 220) and / or an egress node (e.g., egress node 230). Additionally or alternatively, Figure 6 One or more processing blocks may be performed by one or more components of device 300 (such as processor 320, memory 330, input component 340, output component 350, and / or communication component 360), performed by one or more components of device 400 (such as input component 410, switching component 420, output component 430, and / or controller 440); and / or performed by one or more other components.

[0085] like Figure 6 As shown in , process 600 may include receiving a message associated with a performance problem of a transit node (block 610) that is associated with an LSP. For example, as described above, an ingress node may receive a message associated with a performance problem of a transit node from a transit node associated with an LSP.

[0086] like Figure 6 As further shown in FIG. 6 , process 600 may include performing one or more actions associated with the LSP (block 620). For example, as described above, the ingress node may perform one or more actions associated with the LSP based on the message.

[0087] Process 600 may include additional implementations, such as any single implementation or any combination of implementations described below and / or in combination with one or more other processes described elsewhere herein.

[0088] In a first implementation, performing one or more actions associated with the LSP includes performing an evaluation operation associated with the LSP based on the message.

[0089] In a second implementation, alone or in combination with the first implementation, performing one or more actions associated with the LSP includes sending one or more messages associated with an evaluation operation based on the message, the evaluation operation being associated with the LSP, wherein the one or more messages are to be propagated to the transit node via the LSP.

[0090] In a third implementation, alone or in combination with one or more of the first and second implementations, performing one or more actions associated with the LSP includes initiating a termination operation associated with the LSP based on the message.

[0091] In a fourth implementation, either alone or in combination with one or more of the first to third implementations, performing one or more actions associated with the LSP includes sending one or more messages associated with a termination operation associated with the LSP, wherein the one or more messages are propagated to a transit node via the LSP.

[0092] Although Figure 6 An example block diagram of process 600 is shown, but in some implementations, Figure 6 The process 600 includes additional blocks, fewer blocks, different blocks, or differently arranged blocks compared to those blocks depicted in the process 600. Additionally or alternatively, two or more blocks of the blocks of the process 600 may be executed in parallel.

[0093] The foregoing disclosure provides illustration and description, but is not intended to be exhaustive or to limit implementation to the precise form disclosed. Modifications and variations may be made in light of the foregoing disclosure or may be acquired from practice of implementation.

[0094] As used herein, traffic or content may include a set of packets. A packet may refer to a communication structure for conveying information, such as a protocol data unit (PDU), a service data unit (SDU), a network packet, a datagram, a segment, a message, a block, a frame (e.g., an Ethernet frame), a portion of any of the above, and / or another type of formatted or unformatted data unit capable of being transmitted via a network.

[0095] As used herein, the term "component" is intended to be broadly interpreted as hardware, firmware, or a combination of hardware and software. Obviously, the systems and / or methods described herein can be implemented in different forms of hardware, firmware, and / or a combination of hardware and software. The actual dedicated control hardware or software code used to implement these systems and / or methods does not limit these implementations. Therefore, the operation and behavior of the systems and / or methods are described herein without reference to specific software codes-it should be understood that software and hardware can be used to implement the systems and / or methods described herein.

[0096] Although specific combinations of features are described in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of various implementations. In fact, many of these features can be combined in a manner that is not specifically described in the claims and / or not disclosed in the specification. Although each dependent claim listed below can directly rely on only one claim, the disclosure of various implementations includes the combination of each dependent claim with each other claim in the claim set. As used herein, the phrase "at least one" of the list of items refers to any combination of those items, including single members. As an example, "at least one of a, b or c" is intended to cover any combination of a, b, c, ab, ac, bc and abc, and multiple identical items.

[0097] Any element, action or instruction used herein should not be interpreted as key or necessary, unless clearly described as such. In addition, as used herein, the articles "one" and "an" are intended to include one or more projects, and can be used interchangeably with "one or more". In addition, as used herein, the article "the" is intended to include one or more projects mentioned in connection with the article "the", and can be used interchangeably with "one or more". In addition, as used herein, the term "set" is intended to include one or more projects (for example, a combination of related projects, unrelated projects, or related and unrelated projects), and can be used interchangeably with "one or more". If only intended to be a project, the phrase "only one" or similar language is used. In addition, as used herein, the terms "have", "have" etc. are intended to be open terms. In addition, unless otherwise clearly stated, the phrase "based on" is intended to mean "at least partially based on". In addition, as used herein, the term "or" is intended to be included when used in series, and can be used interchangeably with "and / or", unless otherwise clearly stated (for example, if used in combination with "either" or "only one of").

Claims

1. A method, the method include: The transit node associated with the label switched path LSP identifies a performance problem of the transit node; The transit node generates a message associated with the performance problem based on identifying the performance problem; as well as The message is sent by the transit node to an ingress node associated with the LSP to allow the ingress node to perform one or more actions associated with the LSP.

2. The method of claim 1, wherein sending the message allows: The ingress node performs an evaluation operation associated with the LSP.

3. The method according to claim 1, further comprising: include: Based on sending the message, one or more messages associated with an evaluation operation are received, the evaluation operation being associated with the LSP.

4. The method of claim 1 , wherein sending the message allows: The ingress node initiates a termination operation associated with the LSP.

5. The method according to claim 1, further comprising: include: Based on sending the message, one or more messages associated with a termination operation are received, the termination operation being associated with the LSP.

6. The method of claim 1, wherein the message sent by the transit node to the ingress node is a first copy of the message, and the transit node is associated with another LSP, and The method also include: A second copy of the message is sent to another ingress node associated with the other LSP to allow the other ingress node to perform one or more other actions associated with the other LSP.

7. The method of claim 6, wherein sending the second copy of the message allows: The another ingress node performs an evaluation operation associated with the another LSP.

8. The method according to claim 6, further comprising: include: Based on sending the second copy of the message, one or more messages associated with an evaluation operation are received, the evaluation operation being associated with the other LSP.

9. The method of claim 6, wherein sending the second copy of the message allows: The another ingress node initiates a termination operation associated with the another LSP.

10. The method according to claim 6, further comprising: include: Based on sending the second copy of the message, one or more messages associated with a termination operation are received, the termination operation being associated with the other LSP.

11. An ingress node associated with a label switched path LSP, include: one or more memories; as well as One or more processors to: receiving, from a transit node associated with the LSP, a message associated with a performance problem of the transit node; as well as Based on the message, one or more actions associated with the LSP are performed.

12. The ingress node of claim 11, wherein to perform the one or more actions associated with the LSP, the one or more processors are configured to: Based on the message, an evaluation operation associated with the LSP is performed.

13. The ingress node of claim 11, wherein the one or more processors configured to perform the one or more actions associated with the LSP are configured to: sending, based on the message, one or more messages associated with an evaluation operation associated with the LSP, The one or more messages are used to propagate to the transit node via the LSP.

14. The ingress node of claim 11, wherein the one or more processors configured to perform the one or more actions associated with the LSP are configured to: Based on the message, a termination operation associated with the LSP is initiated.

15. The ingress node of claim 11, wherein the one or more processors to perform the one or more actions associated with the LSP are to: sending one or more messages associated with a termination operation associated with the LSP, The one or more messages are used to propagate to the transit node via the LSP.

16. A non-transitory computer-readable medium storing an instruction set, the instruction set include: One or more instructions that, when executed by one or more processors of a transit node associated with a label switched path (LSP), cause the transit node to: Based on identifying the performance problem of the transit node, generating a message associated with the performance problem; as well as The message is sent to an ingress node associated with the LSP to allow the ingress node to perform one or more actions associated with the LSP.

17. The non-transitory computer-readable medium of claim 16, wherein the one or more actions associated with the LSP include at least one of: the performance of an evaluation operation associated with the LSP, or Initiation of a termination operation associated with the LSP.

18. The non-transitory computer-readable medium of claim 17, wherein the evaluation operation is an LSP self-ping evaluation operation or an LSP ping evaluation operation.

19. The non-transitory computer-readable medium of claim 16, wherein the one or more instructions, when executed by the one or more processors, further cause the transit node to: Based on sending the message, one or more messages associated with an evaluation operation are received, the evaluation operation being associated with the LSP.

20. The non-transitory computer-readable medium of claim 16, wherein the one or more instructions, when executed by the one or more processors, further cause the transit node to: Based on sending the message, one or more messages associated with a termination operation are received, the termination operation being associated with the LSP.

Images