Network nodes used to support performance evaluation via performance bitmaps

Abstract

The present invention relates to the field of computer networks and performance evaluation in such networks. Performance measurement is performed by a network node using a status field having a performance bitmap. Therefore, the present invention provides a network node for supporting performance evaluation. The network node is configured to obtain a message including a status field comprising a hop count value and a performance bitmap; update bits in the performance bitmap based on performance information obtained in the network node and based on the hop count value; increase the hop count value; and forward the updated message.

Description

Technical Field

[0001] The present invention relates to computer network technology and performance evaluation in such networks. The performance measurement is performed by network nodes through a status field having a performance bitmap. Background Art

[0002] Performance measurement and fault detection are key capabilities of communications networks. They are also key capabilities of autonomous networks, a field that has seen rapid growth over the past few years. Measurement data is typically collected by a central management server, which analyzes the data and makes intelligent decisions (possibly powered by artificial intelligence) that affect the network, including determining network paths, allocating network resources, and determining network security policies.

[0003] In-band network telemetry (INT) and in-band operations, administration and maintenance (IOAM) are two examples of network performance measurement methods. These methods collect per-hop measurement data along the network path, allowing for detailed information about performance and faults, but require significant per-packet overhead.

[0004] That is, traditional measurement solutions have high overhead when performing per-hop measurements. Summary of the Invention

[0005] In view of the above problems, embodiments of the present invention aim to improve traditional performance measurement solutions.

[0006] The objective is to provide a solution that enables error detection and localization based on per-hop information while maintaining a low per-packet overhead. In other words, the solution provided by the present invention allows per-hop status indication to be carried along a network path with a constant and low per-packet overhead using a status bitmap, where each bit in the status bitmap represents the status of one of the devices on the network path.

[0007] This object is achieved by the embodiments of the invention as described in the appended independent claims. Advantageous implementations of the embodiments of the invention are further defined in the dependent claims.

[0008] A first aspect of the present invention provides a network node for supporting performance evaluation. The network node is configured to obtain a message including a status field, the status field including a hop count value and a performance bitmap; update bits in the performance bitmap based on performance information obtained in the network node and based on the hop count value; increase the hop count value; and forward the updated message.

[0009] This is beneficial because per-hop state information can be collected without incurring a lot of unnecessary overhead.

[0010] In particular, a network node used for performance measurement may also be referred to as a transit node or a forwarding node.

[0011] In particular, the network node is a switch, a router, a middlebox, a network interface controller, a NIC, or any device capable of sending, receiving, and / or forwarding messages.

[0012] Particularly, the message is a data message or a probe message.

[0013] In particular, the status field has an arbitrary predefined length. More specifically, the status field has a length of 32 bits. More specifically, 5 bits are allocated to the hop value and 27 bits are allocated to the status bitmap value. This allows, for example, the status / performance of 27 hops to be indicated in the bitmap (which is sufficient for most network technologies). Since the hop value has a length of 5 bits, an integer range of 0-31 can be stored, which also allows counting to a number even greater than 27. Therefore, a 32-bit status field is sufficient for most network technologies.

[0014] Particularly, the hop value is an integer. Particularly, the hop value is incremented by 1.

[0015] Specifically, the performance bitmap is a bit array. For example, a performance bitmap with a length of 27 is a 27-bit array. Each bit is addressable by an index value. For example, the first bit of the array is addressable by an index value of "0," the second bit of the array is addressable by an index value of "1," and so on.

[0016] In an implementation of the first aspect, the performance information includes information indicating whether a queue of the network node where the message is queued is congested or whether a delay experienced by the message in the network node exceeds a predefined threshold.

[0017] This is beneficial because information about the queues of the network nodes or about the delays in the network nodes can be collected very efficiently on a per-hop basis.

[0018] In particular, the performance information may be any type of indicator that can be compared to a threshold or condition. In particular, the network node may be configured according to what type of information (eg, indicators) the performance information comprises.

[0019] In another implementation of the first aspect, updating the bit in the performance bitmap includes setting the bit to "0" or "1" according to the performance information.

[0020] This is beneficial because per-hop information can be stored in the bitmap at the smallest level of the data structure, ie, the per-bit level.

[0021] Specifically, if the queue of the network node where the message is enqueued is not congested, the bit is updated to “0”. Specifically, if the queue of the network node where the message is enqueued is congested, the bit is updated to “1”.

[0022] Specifically, if the delay of the message in the network node is lower than a predefined threshold, the bit is updated to "0". Specifically, if the delay of the message in the network node exceeds a predefined threshold, the bit is updated to "1".

[0023] In another implementation of the first aspect, if the bit in the performance bitmap is updated to "1", the network node is further configured to add a node identifier (ID) of the network node to the status field.

[0024] This is beneficial because it allows for efficient identification of the nodes to which the bits set to "1" in the bitmap correspond.

[0025] In another implementation of the first aspect, updating the bits in the performance bitmap based on the hop value includes using the hop value as an index value of the bits in the performance bitmap after status update.

[0026] This enables efficient addressing of the relevant bits in the bitmap.

[0027] In yet another implementation of the first aspect, the network node is further configured to provide the updated status field to an evaluation device.

[0028] In yet another implementation of the first aspect, the network node is further configured to remove the status field from the message and forward the message without the status field.

[0029] This is why, in particular, the network node may also be referred to as an exit node.

[0030] In particular, the status field is provided to the evaluation device either proactively or upon request.

[0031] A second aspect of the present invention provides a network node for preparing a message for performance evaluation, wherein the network node is configured to add a status field to the message, the status field including a hop count value and a performance bitmap, and forward the message to a network node for performance measurement.

[0032] This is beneficial because it introduces an efficient way of storing information on a per-hop basis within the message.

[0033] In particular, the network node for preparing messages for performance measurement may also be referred to as an ingress node.

[0034] In particular, the ingress node is a switch, a router, a middlebox, a network interface controller, a NIC, or any device capable of sending, receiving, and / or forwarding packets.

[0035] In an implementation manner of the second aspect, the network node is further configured to initialize the hop value to 0 and / or initialize at least one bit in the performance bitmap to 0.

[0036] In another implementation of the second aspect, the status field is incorporated into the tunnel header of the message, or is used as an extension field in the header of the message.

[0037] A third aspect of the present invention provides an evaluation device for performing performance evaluation on a message. The evaluation device is configured to obtain a status field from a network node, the status field including a hop value and a performance bitmap, and evaluate the performance of the message based on the hop value and the performance bitmap.

[0038] This enables efficient evaluation of the performance of a message, specifically based on per-hop information stored in the message, without unnecessary overhead.

[0039] In particular, the evaluation device is a part of a network node performing performance measurements.

[0040] In an implementation manner of the third aspect, the evaluation device is further configured to evaluate the performance of the message based on a node identifier (ID) in the status field.

[0041] In particular, the evaluation device may apply a countermeasure to the network node based on the node ID and the performance evaluation result of the message.

[0042] In yet another implementation of the third aspect, the evaluation device is further configured to obtain the status field by removing the status field from a tunnel header of the message or removing the status field from an extension field in a header of the message.

[0043] A fourth aspect of the present invention provides a method for supporting performance evaluation. The method comprises the following steps: a network node obtains a message including a status field, the status field including a hop value and a performance bitmap; the network node updates bits in the performance bitmap based on the hop value and performance information obtained in the network node; the network node increases the hop value; and the network node forwards the updated message.

[0044] In an implementation of the fourth aspect, the performance information includes information indicating whether a queue of the network node where the message is queued is congested or whether a delay experienced by the message in the network node exceeds a predefined threshold.

[0045] In yet another implementation of the fourth aspect, updating the bit in the performance bitmap includes setting the bit to "0" or "1" according to the performance information.

[0046] In another implementation of the fourth aspect, the method further includes if the bit in the performance bitmap is updated to "1", the network node adding a node identifier (ID) of the network node to the status field.

[0047] In another implementation of the fourth aspect, updating the bits in the performance bitmap based on the hop value includes using the hop value as an index value of the bit in the performance bitmap after status update.

[0048] In yet another implementation of the fourth aspect, the method further includes providing the updated status field to an evaluation device.

[0049] In yet another implementation of the fourth aspect, the method further includes the network node removing the status field from the message and forwarding the message without the status field.

[0050] The fourth aspect and its implementations include the same advantages as the first aspect and its respective implementations.

[0051] A fifth aspect of the present invention provides a method for preparing a message for performance evaluation, comprising the following steps: a network node adding a status field to the message, the status field including a hop count value and a performance bitmap; and the network node forwarding the message to a network node for performance measurement.

[0052] In an implementation manner of the fifth aspect, the method further includes initializing the hop value to 0, and / or initializing at least one bit in the performance bitmap to 0.

[0053] In yet another implementation of the fifth aspect, the status field is incorporated into the tunnel header of the message, or is used as an extension field in the header of the message.

[0054] The fifth aspect and its implementations include the same advantages as the second aspect and its respective implementations.

[0055] A sixth aspect of the present invention provides a method for performing performance evaluation on a message. The method comprises the following steps: an evaluation device obtains a status field from a network node, the status field including a hop value and a performance bitmap; and the evaluation device evaluates the performance of the message based on the hop value and the performance bitmap.

[0056] In an implementation manner of the sixth aspect, the method further includes the evaluation device evaluating the performance of the message based on a node identifier (ID) in the status field.

[0057] In another implementation of the sixth aspect, the method further includes the evaluation device obtaining the status field by removing the status field from a tunnel header of the message or removing the status field from an extension field in a header of the message.

[0058] The sixth aspect and its implementations include the same advantages as the third aspect and its respective implementations.

[0059] A seventh aspect of the present invention provides a computer program product comprising computer-readable code instructions. When executed on a computer, the computer-readable code instructions cause the computer to execute the method according to any one of the fourth, fifth or sixth aspects or their respective implementations.

[0060] The seventh aspect includes the same advantages as the first, second or third aspect and their respective implementations.

[0061] An eighth aspect of the present invention provides a computer-readable storage medium comprising computer-executable computer program code instructions. When executed on a computer, the computer program code instructions will perform the method as described in any one of the fourth, fifth or sixth aspects or their respective implementations.

[0062] The eighth aspect includes the same advantages as the first, second or third aspect and their respective implementations.

[0063] It should be noted that all devices, elements, units and methods described in this application can be implemented in software or hardware elements or any combination thereof. All steps performed by various entities described in this application and the functions described to be performed by various entities are intended to indicate that each entity is suitable for or used to perform the respective steps and functions. Although in the description of the following specific embodiments, the specific functions or steps performed by the external entity are not reflected in the description of the specific elements of the entity that performs the specific steps or functions, it should be clear to those skilled in the art that these methods and functions can be implemented in respective hardware or software elements or any combination thereof. BRIEF DESCRIPTION OF THE DRAWINGS

[0064] The following description of specific embodiments, in conjunction with the accompanying drawings, will illustrate various aspects of the present invention and their implementation forms, wherein:

[0065] Figure 1 A schematic diagram of a network node for supporting performance evaluation provided by an embodiment of the present invention is shown;

[0066] Figure 2 A schematic diagram of a network node for preparing messages for performance evaluation provided by an embodiment of the present invention is shown;

[0067] Figure 3 A schematic diagram of an evaluation device for performance evaluation provided by an embodiment of the present invention is shown;

[0068] Figure 4 An operation example provided by the present invention is shown;

[0069] Figure 5 A schematic diagram of a message provided by the present invention is shown;

[0070] Figure 6 A schematic diagram showing multiple messages provided by the present invention is shown;

[0071] Figure 7 A schematic diagram of a method provided by an embodiment of the present invention is shown;

[0072] Figure 8 A schematic diagram of a method provided by an embodiment of the present invention is shown;

[0073] Figure 9 A schematic diagram of a method provided by an embodiment of the present invention is shown. DETAILED DESCRIPTION

[0074] Figure 1 FIG2 is a schematic diagram of a network node 100 according to an embodiment of the present invention. The network node 100 is configured to support performance evaluation, for example, evaluation performed by a separate evaluation device 300, which will be described below.

[0075] In order to support performance evaluation, the network node 100 obtains a message 101 including a status field 102 . The status field 102 includes a hop count value 103 and a performance bitmap 104 .

[0076] Based on the performance information 106 obtained in the network node 100 and based on the hop count value 103, the network node 100 updates the bit 105 in the performance bitmap 104. Figure 1 Three bits 105 are shown, but there may be any number of bits 105 in the bitmap 104. In other words, the bitmap 104 is an array of bits 105.

[0077] Then, the network node 100 increases the hop count 103 and forwards the updated message 101 .

[0078] Based on the hop value 103 and the bitmap 104 , the evaluation device 300 may evaluate the performance of the message.

[0079] Then, the network node 100, for example, forwards the message 101 to another network node along the intended path of the message 101. The other network node may further process the message 101. Since the network 100 forwards the message 101 from the ingress node to the egress node, the network node 100 may also be referred to as a transit node.

[0080] The message 101 may generally be any type of network message. In particular, the message 101 may be a data message, i.e., a message sent from a source host to a destination host. In particular, the message 101 may be a control message sent between network devices.

[0081] Figure 2 FIG2 is a schematic diagram of a network node 200 provided by an embodiment of the present invention. The network node 200 is used to prepare a message 201 for performance evaluation, for example, to process the message 201 in another network node.

[0082] The network node 200 obtains a regular message and adds a status field 202 to the message. The status field 202 includes a hop count value 203 and a performance bitmap 204. Then, the network node 200 forwards the message 201 to a network node 100 for performance measurement.

[0083] That is, the message 201 forwarded by the network node 200 is the message 101 obtained by the network node 100. In other words, in this document, the message 101 and the message 201, the status field 102 and the status field 202, the hop value 103 and the hop value 203, and the performance bitmap 104 and the performance bitmap 204 generally refer to the same entity.

[0084] The message 201 may generally be any type of network message. In particular, the message 201 may be a data message, i.e., a message sent from a source host to a destination host. In particular, the message 201 may be a control message sent between network devices.

[0085] Figure 3 FIG. 3 is a schematic diagram of an evaluation device 300 provided in an embodiment of the present invention. The evaluation device 300 is used to perform performance evaluation on a message 101 forwarded by a network device 101, for example.

[0086] For performance evaluation, the evaluation device 300 obtains a status field 301 from the network node 100. The status field 301 includes a hop count value 302 and a performance bitmap 303. The status field 301 is the status field 102 of the message 101 provided by the network node 101. However, the network node 100 can forward the message 101 with or without the status field 102. In other words, the network node 102 can also optionally remove the status field 102 from the message 101 before forwarding it to the evaluation device 300. The evaluation device 300 then evaluates the performance 304 of the message 101 based on the hop count value 302 and the performance bitmap 303.

[0087] Figure 4 FIG. 4 shows an operation example provided by the present invention. Figure 4 As shown, data packets are transmitted from a source to a destination. Intermediate network devices may include switches, routers, or network interface cards (NICs). NICs are hardware components that reside in the source or destination device, or both.

[0088] The first network device (i.e. Figure 3 The network node 200 in the example pushes the status field into the header of the message. The first network device in this article can be the source of any network device on the path. The other network devices after the first network device (i.e., the network node 100 in the example) Figure 4 The state field includes two subfields: <number of hops> and <state bitmap>. Figure 1 The status field 102, the hop value 103 and the performance bitmap 104 in.

[0089] Figure 4 Each device on the path may update the status field 102. That is, the devices 100A and 100B may update the corresponding bit in the performance bitmap 104 and may increase the hop count 103. The status field may be analyzed by the destination device, a management server, or any other node (i.e., the evaluation device 300).

[0090] For example, the status field 102 can be 32 bits long, making the performance bitmap 104 27 bits long and the hop count 5 bits long. These lengths allow status indications for up to 27 hops, which is sufficient for reasonable network technologies. Therefore, a constant 32-bit status field 102 is sufficient for most typical network technologies.

[0091] The status bit may indicate whether the queue in which the message is queued is congested. Alternatively, the status bit may be set when the delay through the device exceeds a predetermined threshold.

[0092] In particular, the congestion indication is attached to the current message 101 because it is the most recently updated message. The message may be a special telemetry message. The point in the flow of the network device 100 at which the indication is attached to the message 101 is the time when the message 101 is retrieved from the queue to be transmitted to the network. The latency of the message is calculated according to the following equation: packet_device_latency = (Enqueue_timestamp - Dequeue_timestamp). If packet_device_latency is greater than a threshold, a congestion indication is attached to the message, i.e., bit 105 in the bitmap 104 associated with the network node 100 is set to "1".

[0093] In other words, the present invention defines a solution for state updates in a network. The first node in the network (i.e., the network node 200) incorporates a state field 202 (respectively, state field 102) into the message header. The first node can be the source of the message or a switch / router on the path. The state field can be incorporated into a tunnel header or as an extension field in an existing header. The state field 102 includes a hop value 103, which is initialized to 0 by the first node; and a performance bitmap 104, which is also initialized to 0 by the first node. Optionally, other fields can be part of the state field 102.

[0094] An intermediate node in the network (i.e., network node 100) receives message 101 with status field 102 and determines the current status of node 100 as "0" or "1." Network node 100 then finds its assigned bit 105 in performance bitmap 104 (the index of bit 105 is hop count value 103). Network node 100 then specifies its current status in its assigned bit 105 in performance bitmap 104. Network node 100 then increments hop count value 103 by 1.

[0095] The last node in the network (e.g., the network node 100B, which is an instance of the network node 100) removes the status field 102 from the message (by removing the tunnel header and the status field 102 together, or removing the status field 102 from the extension field).

[0096] The last node 100B may export the status field 102 to an external analyzer (i.e., the evaluation device 300) for further analysis, or the last node may perform analysis internally (i.e., the last node combines the network node 100 with the evaluation device 300). The exported status field 102 may be exported together with the data packet (or exported together with a prefix of the data packet).

[0097] The analyzer node (i.e., the evaluation device 300) analyzes the status field 102 (i.e., the hop count value 103 and the performance bitmap 104) and potentially responds to the status of each node (indicated by bit 105 in the bitmap 104). The analyzer can be the last node ( Figure 4 100B), or a separate node in the network ( Figure 4 300 marked in the figure).

[0098] Optionally, a network node 100 with state "1" may push its node ID into the message 101, thereby allowing the analyzer node to have a list of nodes with non-zero state. If this extension is implemented, the state overhead does not have a constant length.

[0099] The criteria for setting the status to "0" or "1" may be configured by a network management system, which configures the status criteria, which may include indicators and thresholds.

[0100] Figure 5 A message 101 is shown with a status field 102. The status field 102 includes a hop count value 103 and a performance bitmap 104.

[0101] Figure 6A packet is shown including a status field 102 pushed by an ingress node. This data can be pushed along with a tunnel header (e.g., VXLAN-GPE), as shown in the second row, or as an extension to an existing header in the packet, such as an IPv6 extension header, as shown in the third row. The first row shows a regular packet without the status field.

[0102] Figure 7 A method 700 provided by an embodiment of the present invention is shown. The method 700 is used to support performance evaluation. The method 700 includes a step in which a network node 100 obtains 701 a message 101 including a status field 102, wherein the status field 102 includes a hop value 103 and a performance bitmap 104. The method 700 includes the steps of: the network node 100 updating 702 a bit 105 in the performance bitmap 104 based on performance information 106 obtained in the network node 100 and based on the hop value 103. The method 700 includes the step in which the network node 100 increases 703 the hop value 103. The method 700 includes the step in which the network node 100 forwards 704 the updated message 101.

[0103] Figure 8 A method 800 provided by an embodiment of the present invention is shown. The method 800 is used for performance evaluation. The method 800 includes a step in which a network node 200 adds 801 a status field 202 to a message 201. The status field 202 includes a hop count value 203 and a performance bitmap 204. The method 800 also includes a step in which the network node 200 forwards 802 the message 201 to a network node 100 for performance measurement.

[0104] Figure 9 A method 900 provided in an embodiment of the present invention is shown. The method is used by an evaluation device 300 to perform performance evaluation. The method 900 includes a step in which the evaluation device 300 obtains 901 a status field 301 from a network node 100. The status field 301 includes a hop value 302 and a performance bitmap 303. The method 900 also includes a step in which the evaluation device 300 evaluates 902 the performance 304 of a message 101 based on the hop value 302 and the performance bitmap 303.

[0105] The key difference between this invention and traditional solutions is that it provides a compact "bit per hop" status representation, encompassing two key aspects: an in-band status bitmap and data packet usage; and the status bitmap indexed by the hop count. This status bitmap can be used in conjunction with other measurement methods or protocols. Alternatively, it can serve as a trigger for other measurement methods. If a bit in the bitmap is set, the management server can trigger a different measurement method, providing more detailed information about the status.

[0106] The invention has been described in conjunction with various embodiments and implementations as examples. However, other variations will be understood and obtained by those skilled in the art through practice of the claimed invention, study of the drawings, the present disclosure and the independent claims. In the claims and descriptions, the term "comprising" does not exclude other elements or steps, and "a" does not exclude the possibility of a plurality. A single element or other unit may fulfil the functions of several entities or items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not mean that a combination of these measures cannot be used in an advantageous implementation.

Claims

1. A method (700) for supporting performance evaluation, characterized in that The method (700) comprises the following steps: The network node (100) obtains (701) a message (101) including a status field (102), wherein the status field (102) includes a hop value (103) and a performance bitmap (104); The network node (100) updates (702) a bit (105) in the performance bitmap (104) based on performance information (106) obtained in the network node (100) and based on the hop value (103); The network node (100) increases (703) the hop count value (103); and The network node (100) forwards (704) the updated message (101).

2. The method according to claim 1, characterized in that The performance information (106) includes information indicating whether a queue of the network node (100) where the message (101) is queued is congested or whether a delay experienced by the message (101) in the network node (100) exceeds a predefined threshold.

3. The method according to claim 1 or 2, characterized in that The updating (702) of the bit (105) in the performance bitmap (104) includes setting the bit (105) to "0" or "1" according to the performance information (106).

4. The method according to claim 3, characterized in that The method further comprises: If the bit (105) in the performance bitmap (104) is updated to "1", the network node (100) adds the node identification ID of the network node (100) to the status field (102).

5. The method according to claim 1, wherein The updating (702) of the bit (105) in the performance bitmap (104) based on the hop value (103) includes the hop value (103) being used as an index value for the bit (105) in the performance bitmap (104) after the status update.

6. The method according to claim 1, characterized in that The method further comprises: The network node (100) provides the updated status field (102) to the evaluation device (300).

7. The method according to claim 1, characterized in that The method further comprises: The network node (100) removes the status field (102) from the message (101) and forwards the message (101) without the status field (102).

8. A method (800) for preparing a message (201) for performance evaluation, characterized in that The method (800) comprises the following steps: The network node (200) adds (801) a status field (202) to the message (201), the status field (202) including a hop value (203) and a performance bitmap (204), the hop value (203) being used by the network node (100) to update bits in the performance bitmap (204); and The network node (200) forwards (802) the message (201) to a network node (100) for performance measurement.

9. The method according to claim 8, characterized in that The method further comprises: The network node (200) initializes the hop count value (203) to 0 and / or initializes at least one bit in the performance bitmap (204) to 0.

10. The method according to claim 8 or 9, characterized in that The status field (202) is incorporated into the tunnel header of the message (201), or is used as an extension field in the header of the message (201).

11. A method (900) for performing performance evaluation on a message (101), characterized in that: The method (900) comprises the following steps: The evaluation device (300) obtains (901) a status field (301) from the network node (100), the status field (301) including a hop value (302) and a performance bitmap (303), the hop value (302) being used by the network node (100) to update bits in the performance bitmap (303); and The evaluation device (300) evaluates (902) the performance (304) of the message (101) based on the hop value (302) and the performance bitmap (303).

12. The method according to claim 11, characterized in that The method further comprises: The evaluation device (300) evaluates the performance (304) of the message (101) based on the node identification ID in the status field (301).

13. The method according to claim 11 or 12, characterized in that The method further comprises: The evaluation device (300) obtains the status field (301) by removing the status field (301) from the tunnel header of the message (101) or removing the status field (301) from the extension field in the header of the message (101).

14. A computer program product, characterized in that The method comprises computer readable code instructions which, when executed in a computer, will cause the computer to perform the method according to any one of claims 1 to 13.

15. A computer-readable storage medium, characterized in that The method comprises computer-executable computer program code instructions, and is configured to execute the method according to any one of claims 1 to 13 when the computer program code instructions are executed on a computer.

Images