CN111817965B - Message track tracking method, system and computer readable storage medium - Google Patents
Message track tracking method, system and computer readable storage medium Download PDFInfo
- Publication number
- CN111817965B CN111817965B CN202010944792.3A CN202010944792A CN111817965B CN 111817965 B CN111817965 B CN 111817965B CN 202010944792 A CN202010944792 A CN 202010944792A CN 111817965 B CN111817965 B CN 111817965B
- Authority
- CN
- China
- Prior art keywords
- switch
- message
- code
- aggregation switch
- destination
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a message track tracking method, which comprises the following steps: updating a path mark of a message to be forwarded through a source aggregation switch based on a first switch code corresponding to the source aggregation switch to obtain a first message; updating the path mark of the first message based on the second switch code corresponding to the core switch through the core switch; and updating the path mark of the second message through the destination aggregation switch based on a third switch code corresponding to the destination aggregation switch to obtain a third message, and forwarding the third message to the destination top-of-rack switch. The invention also discloses a message track tracking system and a computer readable storage medium. The invention can track the message according to the switch code in the message by embodying the convergence switch and the switch code of the core switch in the message, and can add the switch code in various messages of the data center to realize the track tracking of all messages of the data center.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and a system for tracking a packet trace, and a computer-readable storage medium.
Background
With the rapid development of information technologies such as cloud computing, big Data, artificial intelligence, and the like, a DC (Data Center) network carrying these applications is also rapidly developing and evolving. In the DC network maintenance, in order to measure a network traffic matrix, detect traffic abnormality caused by congestion, locate a network fault, measure a load balancing effect, check whether a routing protocol is good or bad, discard a packet of an abnormal path to improve accuracy of network delay measurement, or ensure that a forwarding behavior on a data plane matches a policy on a control plane, it is often necessary to measure an actual passing trajectory of the packet.
At present, a common message path tracking tool is trace route, which uses an ICMP message, sets TTL to increase from 1 in the ICMP message, and uses an ICMP message returned by using TTL of 0 to track a specific message path. However, the path tracing is only used for a specific message, and the message tracing of a specific destination cannot be deployed in a data center in a large scale, so that the path tracing cannot be performed on all messages in the data center.
The above is only for the purpose of assisting understanding of the technical aspects of the present invention, and does not represent an admission that the above is prior art.
Disclosure of Invention
The invention mainly aims to provide a message track tracking method, a message track tracking system and a computer readable storage medium, and aims to solve the technical problem that path tracking cannot be performed on various messages of a data center.
In order to achieve the above object, the present invention provides a message trajectory tracking method, which comprises the following steps:
when a source aggregation switch receives a message to be forwarded, updating a path mark of the message to be forwarded through the source aggregation switch based on a first switch code corresponding to the source aggregation switch to obtain a first message, and forwarding the first message to a core switch;
when a core switch receives a first message, updating a path mark of the first message through the core switch based on a second switch code corresponding to the core switch to obtain a second message, and forwarding the second message to a target aggregation switch;
and when the destination aggregation switch receives a second message, updating the path mark of the second message through the destination aggregation switch based on a third switch code corresponding to the destination aggregation switch to obtain a third message, and forwarding the third message to the destination top-of-rack switch.
Further, when the source aggregation switch receives the message to be forwarded, the step of updating, by the source aggregation switch, the path label of the message to be forwarded based on the first switch code corresponding to the source aggregation switch, so as to obtain the first message includes:
when a source aggregation switch receives a message to be forwarded, determining whether a source pod code exists in a path mark of the message to be forwarded or not through the source aggregation switch;
and if the source pod code does not exist, adding a first switch code to the path mark of the message to be forwarded through the source aggregation switch to obtain the first message, wherein the first switch code comprises the source pod code corresponding to the source aggregation switch.
Further, after the step of determining, by the source aggregation switch, whether a source pod code exists in a path label of the message to be forwarded by the source aggregation switch when the source aggregation switch receives the message to be forwarded, the method further includes:
if the source pod code exists, adding a first roundabout code to a path mark of the message to be forwarded through the aggregation switch so as to obtain the first message; or, adding a first switch code to the path label of the message to be forwarded through the source aggregation switch, and adding a first roundabout code to the path label of the message to be forwarded, so as to obtain the first message.
Further, when the core switch receives the first packet, the step of updating, by the core switch, the path label of the first packet based on the second switch code corresponding to the core switch includes:
when a core switch receives a first message, determining whether a core switch code exists in a path mark of the first message through the core switch;
and if the core switch code does not exist, adding the second switch code to the path mark of the first message through the core switch to obtain the second message.
Further, after the step of determining, by the core switch, whether a core switch code exists in a path label of the first packet when the core switch receives the first packet, the method further includes:
if the core switch code exists, adding a second roundabout code to the path mark of the first message through the core switch to obtain a second message; or, the core switch adds the second switch code to the path label of the first packet, and adds a second detour code to the path label of the first packet, so as to obtain the second packet.
Further, when the destination aggregation switch receives the second message, the step of updating, by the destination aggregation switch, the path label of the second message based on a third switch code corresponding to the destination aggregation switch, so as to obtain a third message, includes:
when a destination aggregation switch receives a second message, determining whether a destination pod code exists in a path mark of the second message through the destination aggregation switch;
and if the destination pod code does not exist, adding the third switch code to the path mark of the second message through the destination aggregation switch to obtain a third message, wherein the third switch code comprises the destination pod code corresponding to the destination aggregation switch.
Further, after the step of determining whether the destination pod code exists in the path label of the second packet through the destination aggregation switch, the method further includes:
if the destination pod code exists, determining whether the destination pod code in the second message is the same as the destination pod code corresponding to the destination aggregation switch through the destination aggregation switch;
if the two messages are the same, adding a third roundabout code to the path mark of the second message through the target aggregation switch to obtain a third message; or, the destination aggregation switch adds the third switch code to the path label of the second packet, and adds a third detour code to the path label of the second packet, so as to obtain a third packet.
Further, after the step of determining, by the destination aggregation switch, whether the destination pod code in the second message is the same as the destination pod code corresponding to the destination aggregation switch, the method further includes:
and if not, adding the third switch code to the path mark of the second message through the target aggregation switch, updating the target pod code in the second message based on the target pod code corresponding to the target aggregation switch, and adding a third roundabout code to the path mark of the second message to obtain a third message.
Further, after the step of updating, by the destination aggregation switch, the path label of the second packet based on a third switch code corresponding to the destination aggregation switch to obtain a third packet and forwarding the third packet to the destination top-of-rack switch when the destination aggregation switch receives the second packet, the packet trajectory tracking method further includes:
when a top-rack switch receives a third message, determining whether a first detour code, a second detour code or a third detour code exists in a path mark of the third message through the top-rack switch;
and if the link failure exists, determining the link failure through the top-of-rack switch based on the first detour code, the second detour code or the third detour code, and outputting alarm prompt information of the link failure.
In addition, to achieve the above object, the present invention further provides a packet trace tracking system, including: the message track tracking program is executed by the source aggregation switch, the core switch or the target aggregation switch to realize the steps of the message track tracking method.
In addition, to achieve the above object, the present invention further provides a computer readable storage medium, on which a message trace tracking program is stored, and the message trace tracking program, when executed, implements the steps of the message trace tracking method described above.
When a source aggregation switch receives a message to be forwarded, updating a path mark of the message to be forwarded through the source aggregation switch based on a first switch code corresponding to the source aggregation switch to obtain a first message, and forwarding the first message to a core switch; then when a core switch receives a first message, updating a path mark of the first message through the core switch based on a second switch code corresponding to the core switch so as to obtain a second message, and forwarding the second message to a target aggregation switch; and then when the destination aggregation switch receives a second message, updating the path label of the second message through the destination aggregation switch based on a third switch code corresponding to the destination aggregation switch to obtain a third message, forwarding the third message to the destination top switch, performing track tracking on the message according to the switch codes in the message by reflecting the switch codes of the aggregation switch and the core switch in the message, and adding the switch codes in various messages of the data center to realize track tracking of all messages of the data center.
Drawings
Fig. 1 is a schematic flow chart of a first embodiment of a message trajectory tracking method according to the present invention;
FIG. 2 is a diagram of a fat tree structured data center as a topology structure in the message trace tracking method of the present invention;
FIG. 3 is a schematic diagram of a structure of a packet in an embodiment of the packet trace tracking method of the present invention;
fig. 4 is a schematic structural diagram of a message in another embodiment of the message trajectory tracking method of the present invention;
fig. 5 is a schematic structural diagram of a path marker in an embodiment of the message trajectory tracking method of the present invention;
fig. 6 is a schematic diagram of a forwarding path of a message in an embodiment of the message trajectory tracking method of the present invention;
fig. 7 is a schematic diagram of a forwarding path of a packet in another embodiment of the packet trace tracking method of the present invention;
fig. 8 is a schematic diagram of a forwarding path of a message in another embodiment of the message trajectory tracking method of the present invention;
fig. 9 is a schematic diagram of a forwarding path of a packet in a further embodiment of the packet trace tracking method of the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The invention provides a message track tracking method, and referring to fig. 1, fig. 1 is a flow diagram of a first embodiment of the message track tracking method of the invention.
In this embodiment, the message trajectory tracking method is applied to a data center provided with a core switch and a convergence switch.
It should be noted that the topology within the DC is highly similar and repetitive, and there are some Pod fixed topology connections formed by the switch and host connections within the DC. A Pod can access a fixed number of servers and a DC architecture is a topology that connects a large number of pods together using Core switches.
As shown in fig. 2, fig. 2 is a topological structure diagram of a data center of a fat tree structure in the message trace tracking method of the present invention. In fat-tree topology, a K-ary fat-tree, comprising K core switches (C-switches), K22 Convergence exchanges (A-exchanges), K22 top of rack switches (tswitch). The T switch accesses the server, if the port bandwidth of the access server is the same as the port bandwidth of the up-connected aggregation switch, the access server is called 1: 1 access, usually, the two are not consistent, today's mainstream data center TOR switches, which employ 100G or 40G lines for their upstream aggregation switches, and 10G ports for access servers. When a 100G upstream, 10G server port is used, it is called 1: 10 access. A fat tree of K-ary, as 1: when 10 access servers, the maximum accessible servers number is 2.5K3 And (4) respectively. In fig. 2, there are 4 core switches (C1-C4), 8 aggregation switches (a 1-a 8), and 8 top-of-rack switches (T1-T8).
In this embodiment, a message of the data center is provided with a path tag, where the message includes a message header, the path tag, and a message payload.
Referring to fig. 3, fig. 3 is a schematic diagram of a message structure in an embodiment of the message trajectory tracking method of the present invention; in fig. 3, the path label of the message in the message structure adopts a coding scheme a, and the path label includes a source aggregation switch coding field, a core switch coding field, and a destination aggregation switch coding field. The source aggregation switch coding field, the core switch coding field and the destination aggregation switch coding field can be respectively provided with a detour coding field. It should be noted that, when a message does not pass through the aggregation switch and the core switch in the DC, each field in the path flag of the message is empty. In fig. 3 (c), the source aggregation switch coding field may be a first (d, pod, agg) field or a second (d, pod, agg) field in the path label, in this embodiment, the source aggregation switch coding field is a first (d, pod, agg) field in the path label, and correspondingly, the destination aggregation switch coding field is a second (d, pod, agg) field. In fig. 3 (a), d is a bypass code of the aggregation switch, pod is a pod code corresponding to the aggregation switch, and agg is a switch code of the aggregation switch (a code of the aggregation switch in the pod to which the aggregation switch belongs). Fig. 3 (b) shows the core switch code field, where d is the bypass code of the core switch and core is the core switch code of the core switch. Referring to fig. 3 (c), when the aggregation switch is a source aggregation switch, the aggregation switch code field is an aggregation switch code field before the core switch code field in the path label, that is, a source aggregation switch code field, and when the aggregation switch is a destination aggregation switch, the aggregation switch code field is an aggregation switch code field after the core switch code field in the path label, that is, a destination aggregation switch code field.
Referring to fig. 4 and 5, fig. 4 is a coding scheme B of a path label of a message, fig. 5 is a coding scheme C of a path label of a message, and in fig. 4 and 5, the path label includes a source aggregation switch coding field, a core switch coding field, a destination aggregation switch coding field, and a detour coding field, for example, the (f, f, f) field in fig. 4 and 5; in fig. 4, the source aggregation switch coding field may be a first (pod, agg) field or a second (pod, agg) field in the path label, in this embodiment, the source aggregation switch coding field is the first (pod, agg) field in the path label, and correspondingly, the destination aggregation switch coding field is the second (pod, agg) field; in fig. 5, the source aggregation switch coding field may be a first (pod, agg, agg) field or a second (pod, agg, agg) field in the path label, in this embodiment, the source aggregation switch coding field is a first (pod, agg, agg) field in the path label, and correspondingly, the destination aggregation switch coding field is a second (pod, agg, agg) field. Wherein, the encoding rule of the (f, f, f) field is as follows:
000 paths are not coded, invalid codes;
the 001-source pod coding is valid;
010 source pod coding and Core coding are effective;
011 source pod coding, Core and destination pod coding are valid;
100, encoding by detour, wherein the path has detour;
101, reserving;
110 is reserved;
111 remain.
In this embodiment, the packet trace tracking method includes:
step S101, when a source aggregation switch receives a message to be forwarded, updating a path mark of the message to be forwarded through the source aggregation switch based on a first switch code corresponding to the source aggregation switch to obtain a first message, and forwarding the first message to a core switch;
in this embodiment, when the aggregation switch receives the message to be forwarded, the aggregation switch obtains a path tag of the message to be forwarded, so as to determine whether the aggregation switch is a source aggregation switch or a destination aggregation switch according to the path tag, specifically, the aggregation switch determines whether a core switch code (core) exists in the first path tag, if the core switch code does not exist, the aggregation switch is the source aggregation switch, and if the core switch code exists, the aggregation switch is the destination aggregation switch. In coding scheme a, the field including d and core is a core switch coding field, in coding scheme B, the field including core is a core switch coding field, and in coding scheme C, the field including core and core is a core switch coding field.
In this embodiment, when the source aggregation switch receives a packet to be forwarded, the source aggregation switch updates the path label of the packet to be forwarded based on a first switch code corresponding to the source aggregation switch to obtain a first packet, then determines a core switch corresponding to the packet to be forwarded, and forwards the first packet to the core switch.
Step S102, when a core switch receives a first message, updating a path mark of the first message through the core switch based on a second switch code corresponding to the core switch to obtain a second message, and forwarding the second message to a target aggregation switch;
in this embodiment, when the core switch receives the first packet, the core switch updates the path flag of the first packet based on the second switch code corresponding to the core switch to obtain the second packet, then determines the destination aggregation switch corresponding to the packet to be forwarded, and forwards the second packet to the destination aggregation switch, specifically, the core switch first determines whether the core switch is a detour core switch of the first packet, if not, adds the second switch code to the path flag of the packet to be forwarded, and if so, adds the detour flag (the second detour code).
Step S103, when the destination aggregation switch receives the second message, updating the path label of the second message through the destination aggregation switch based on a third switch code corresponding to the destination aggregation switch to obtain a third message, and forwarding the third message to the destination top-of-rack switch.
In this embodiment, when the destination aggregation switch receives the second packet, the destination aggregation switch updates the path label of the second packet based on a third switch code corresponding to the destination aggregation switch to obtain a third packet, then determines a destination top switch corresponding to the third packet, and forwards the third packet to the destination top switch.
In the packet trace tracking method provided in this embodiment, when a source aggregation switch receives a packet to be forwarded, a path label of the packet to be forwarded is updated by the source aggregation switch based on a first switch code corresponding to the source aggregation switch, so as to obtain a first packet, and the first packet is forwarded to a core switch; then when a core switch receives a first message, updating a path mark of the first message through the core switch based on a second switch code corresponding to the core switch so as to obtain a second message, and forwarding the second message to a target aggregation switch; and then when the destination aggregation switch receives a second message, updating the path label of the second message through the destination aggregation switch based on a third switch code corresponding to the destination aggregation switch to obtain a third message, forwarding the third message to the destination top switch, performing track tracking on the message according to the switch codes in the message by reflecting the switch codes of the aggregation switch and the core switch in the message, and adding the switch codes in various messages of the data center to realize track tracking of all messages of the data center.
Based on the first embodiment, a second embodiment of the packet trace tracking method according to the present invention is provided, in this embodiment, step S101 includes:
step S201, when a source aggregation switch receives a message to be forwarded, determining whether a source pod code exists in a path mark of the message to be forwarded through the source aggregation switch;
step S202, if the source pod code does not exist, adding a first switch code to a path label of the packet to be forwarded through the source aggregation switch to obtain the first packet, where the first switch code includes the source pod code corresponding to the source aggregation switch.
In this embodiment, if the aggregation switch that receives the message to be forwarded is the source aggregation switch, when the source aggregation switch receives the message to be forwarded, the source aggregation switch determines whether a source pod code exists in a path label of the message to be forwarded, so as to determine whether the source aggregation switch is the roundabout source aggregation switch of the message to be forwarded. If the source pod code exists in the path label of the message to be forwarded, the source aggregation switch is determined to be a detour source aggregation switch, and if the source pod code does not exist in the path label of the message to be forwarded, the source aggregation switch is determined to be a non-detour source aggregation switch, that is, the message to be forwarded does not pass through the detour of the source aggregation switch. It can be understood that if the coding scheme a is adopted, it is determined whether a pod code exists in the source aggregation switch coding field (d, pod, agg) of the path marker, if the coding scheme B is adopted, it is determined whether a pod code exists in the source aggregation switch coding field (pod, agg) of the path marker, and if the coding scheme C is adopted, it is determined whether a pod code exists in the source aggregation switch coding field (pod, agg, agg) of the path marker.
And if the source pod code does not exist, adding a first switch code to the path mark of the message to be forwarded through the source aggregation switch to obtain the first message, wherein the first switch code comprises a pod code corresponding to the source aggregation switch, and the pod code is a code of a pod to which the source aggregation switch belongs.
It can be understood that, if the source pod code does not exist, that is, the message to be forwarded does not pass through the detour of the source aggregation switch, the source aggregation switch fills the switch code in the first switch code into the source aggregation switch field in the source aggregation switch code field, and fills the pod code in the first switch code into the pod field in the source aggregation switch code field, so as to obtain the first message. For example, if the encoding scheme a is adopted, the switch code in the first switch code is filled into the agg field in the source aggregation switch code field (d, pod, agg), and the pod code in the first switch code is the pod field in the source aggregation switch code field (d, pod, agg); if the coding scheme B is adopted, filling the switch code in the first switch code into an agg field in a source aggregation switch code field (pod, agg), and filling the pod code in the first switch code into a pod field in the source aggregation switch code field (pod, agg); if the encoding scheme C is adopted, the switch code in the first switch code is filled into the first agg field in the source aggregation switch code field (pod, agg, agg), and the pod code in the first switch code is filled into the pod field in the source aggregation switch code field (pod, agg, agg).
The switch codes of the aggregation switches and the pod codes of the pods can be reasonably set to distinguish different aggregation switches and different pods.
Further, in an embodiment, after step S201, the method further includes:
step S203, if the source pod code exists, adding a first roundabout code to a path mark of the message to be forwarded through the aggregation switch so as to obtain the first message; or, adding a first switch code to the path label of the message to be forwarded through the source aggregation switch, and adding a first roundabout code to the path label of the message to be forwarded, so as to obtain the first message.
In this embodiment, if the source pod code exists, that is, the to-be-forwarded message bypasses the source aggregation switch, at this time, the aggregation switch adds the first bypass code to the path label of the to-be-forwarded message, and specifically, the source aggregation switch fills the first bypass code in the bypass code field in the source aggregation switch code field of the path label to obtain the first message. For example, if encoding scheme a is employed, the first detour code is filled into the d field in the source aggregation switch encoding field (d, pod, agg).
Generally, when a message to be forwarded does not pass through the detour of the source aggregation switch, the detour code field in the source aggregation switch code field is empty, and after the message to be forwarded passes through the detour of the source aggregation switch, the current aggregation switch fills a first detour code into the detour code field in the source aggregation switch code field, where the first detour code may be set reasonably, for example, the first detour code is 1.
Or, adding a first switch code to the path label of the message to be forwarded through the source aggregation switch, and adding a first detour code to the path label of the message to be forwarded to obtain the first message, filling the switch code in the first switch code into the source aggregation switch field in the source aggregation switch code field, filling the pod code in the first switch code into the pod field in the source aggregation switch code field, and filling the first detour code into the detour code field in the source aggregation switch code field. For example, if the encoding scheme B is adopted, the switch code in the first switch code is filled into the agg field in the source aggregation switch code field (pod, agg), the pod code in the first switch code is filled into the pod field in the source aggregation switch code field (pod, agg), and the first bypass code is filled into the bypass code field (f, f, f) in the source aggregation switch code field; if the encoding scheme C is adopted, the switch code in the first switch code is filled into the second agg field in the source aggregation switch code field (pod, agg, agg), the pod code in the first switch code is filled into the pod field in the source aggregation switch code field (pod, agg, agg), and the first bypass code is filled into the bypass code field (f, f, f) in the source aggregation switch code field.
It can be understood that by embodying the first detour code in the first message, when the message detours through the source aggregation switch, the trace of the message can be accurately tracked according to the first detour code, and the first detour code can be added to various messages in the data center to realize trace tracking of all messages in the data center, and the path fault can be accurately positioned through the first detour code.
In the message trajectory tracking method provided by this embodiment, when a source aggregation switch receives a message to be forwarded, the source aggregation switch determines whether a source pod code exists in a path label of the message to be forwarded; and then if the source pod code does not exist, adding a first switch code to a path mark of the message to be forwarded through the source aggregation switch to obtain the first message, wherein the first switch code comprises the source pod code corresponding to the source aggregation switch, and by embodying the switch code and the pod code of the aggregation switch in the first message, the message can be subjected to trajectory tracking according to the switch code and the pod code in the first message, and the switch code can be added in various messages of the data center to realize trajectory tracking of all messages of the data center.
Based on the first embodiment, a third embodiment of the packet trace tracking method of the present invention is provided, in this embodiment, step S102 includes:
step S301, when a core switch receives a first message, determining whether a core switch code exists in a path mark of the first message through the core switch;
step S302, if the core switch code does not exist, adding the second switch code to the path label of the first packet through the core switch to obtain the second packet.
In this embodiment, when the core switch receives the first packet, the core switch determines whether a core switch code exists in the path flag of the first packet, so as to determine whether the core switch is a detour switch for forwarding the packet. If the path flag of the first packet includes a core switch code, it is determined that the core switch is a bypass core switch, and if the path flag of the first packet does not include a core switch code, it is determined that the core switch is a non-bypass core switch, that is, the first packet does not bypass the core switch. It can be understood that if the coding scheme a is adopted, it is determined whether a core switch code exists in the core switch code field (d, core) of the path marker, if the coding scheme B is adopted, it is determined whether a core switch code exists in the core switch code field (core) of the path marker, and if the coding scheme C is adopted, it is determined whether a core switch code exists in the core switch code field (core ) of the path marker.
Then, if the core switch code does not exist, that is, the first message does not pass through the bypass of the core switch, the second switch code is added to the path label of the first message through the core switch to obtain the second message, for example, if the coding scheme a is adopted, the second switch code is added to the core field in the core switch code field (d, core), if the coding scheme B is adopted, the second switch code is added to the core field in the core switch code field (core), and if the coding scheme C is adopted, the second switch code is added to the first core field in the core switch code field (core ).
Further, in an embodiment, after step S301, the method further includes:
step S303, if the core switch code exists, adding a second roundabout code to the path mark of the first message through the core switch to obtain the second message; or, the core switch adds the second switch code to the path label of the first packet, and adds a second detour code to the path label of the first packet, so as to obtain the second packet.
In this embodiment, if there is a core switch code, the first packet has already passed through other core switches, and then a second bypass code is added to the path label of the first packet through the core switch to obtain a second packet; or, the core switch adds the second switch code to the path label of the first message, and adds the second detour code to the path label of the first message to obtain the second message. Wherein the second bypass encoding may be the same as or different from the first bypass encoding.
Specifically, if the encoding scheme a is adopted, the core switch adds the second bypass code to the bypass-code field in the core-switch-code field, that is, the core switch adds the second bypass code to the d field in the core-switch-code field (d, core). If encoding scheme B is used, the core switch adds a second switch code to the core field in the core switch code field (core) and a second bypass code to the bypass code (f, f, f) field, i.e., the updated (f, f, f) field is 100. If encoding scheme C is used, a second switch code is added to a second core field of the core switch code fields (cores, core) and a second bypass code is added to the bypass code (f, f, f) field, i.e., the updated (f, f, f) field is 100.
In the message trajectory tracking method provided by this embodiment, when a core switch receives a first message, the core switch determines whether a core switch code exists in a path label of the first message; and then if the core switch code does not exist, adding the second switch code to the path mark of the first message through the core switch to obtain the second message, accurately tracking the message according to the core switch code by representing the core switch code in the first message, and adding the core switch code to various messages of the data center to realize the track tracking of all messages of the data center.
Based on the foregoing embodiments, a fourth embodiment of the message trajectory tracking method according to the present invention is provided, in this embodiment, step S103 includes:
step S401, when a destination aggregation switch receives a second message, determining whether a destination pod code exists in a path label of the second message through the destination aggregation switch;
step S402, if the destination pod code does not exist, the destination aggregation switch adds the third switch code to the path label of the second message to obtain a third message, wherein the third switch code comprises the destination pod code corresponding to the destination aggregation switch.
In this embodiment, if the aggregation switch that receives the second message is the destination aggregation switch, when the destination aggregation switch receives the second message, the destination aggregation switch determines whether a destination pod code exists in the path tag of the second message, so as to determine whether the destination aggregation switch is a detour destination aggregation switch of the second message. It can be understood that if the coding scheme a is adopted, it is determined whether a pod code exists in the destination aggregation switch coding field (d, pod, agg) of the path marker, if the coding scheme B is adopted, it is determined whether a pod code exists in the destination aggregation switch coding field (pod, agg) of the path marker, and if the coding scheme C is adopted, it is determined whether a pod code exists in the destination aggregation switch coding field (pod, agg, agg) of the path marker.
And then, if the destination pod code does not exist, adding the third switch code to the path mark of the second message through the destination aggregation switch to obtain a third message, wherein the third switch code comprises a pod code corresponding to the destination aggregation switch, and the pod code is a code of a pod to which the destination aggregation switch belongs.
It can be understood that, if the destination pod code does not exist, that is, the second message does not bypass the destination aggregation switch, the destination aggregation switch fills the switch code in the third switch code into the destination aggregation switch field in the destination aggregation switch code field, and fills the pod code in the third switch code into the pod field in the destination aggregation switch code field, so as to obtain the third message. For example, if the encoding scheme a is adopted, the switch code in the third switch code is filled into the agg field in the destination aggregation switch code field (d, pod, agg), and the pod code in the third switch code is filled into the pod field in the destination aggregation switch code field (d, pod, agg); if the coding scheme B is adopted, filling the switch codes in the third switch codes into agg fields in the destination aggregation switch code fields (pod, agg), and filling the pod codes in the third switch codes into pod fields in the destination aggregation switch code fields (pod, agg); if the coding scheme C is adopted, the switch code in the third switch code is filled into the first agg field in the destination aggregation switch code field (pod, agg, agg), and the pod code in the third switch code is filled into the pod field in the destination aggregation switch code field (pod, agg, agg).
Further, in an embodiment, after step S401, the method further includes:
step S403, if the destination pod code exists, determining, by the destination aggregation switch, whether the destination pod code in the second message is the same as the destination pod code corresponding to the destination aggregation switch;
step S404, if the two are the same, adding a third roundabout code to the path mark of the second message through the destination aggregation switch to obtain a third message; or, the destination aggregation switch adds the third switch code to the path label of the second packet, and adds a third detour code to the path label of the second packet, so as to obtain a third packet.
In this embodiment, if the destination pod code exists, the destination aggregation switch determines whether the destination pod code in the second message is the same as the destination pod code corresponding to the destination aggregation switch.
If the path labels are the same, adding a third roundabout code to the path label of the second message through the target aggregation switch to obtain a third message; or, the destination aggregation switch adds the third switch code to the path label of the second message, and adds the third detour code to the path label of the second message, so as to obtain the third message. For example, if the encoding scheme a is adopted, the third detour code is filled into the d field in the encoding field (d, pod, agg) of the destination aggregation switch; if the coding scheme B is adopted, filling the switch code in the third switch code into the agg field in the destination aggregation switch code field (pod, agg), namely updating the agg field in the (pod, agg) field, and filling the third detour code into the detour code field (f, f, f) in the source aggregation switch code field; if the encoding scheme C is adopted, the switch code in the third switch code is filled into the second agg field in the destination aggregation switch code field (pod, agg, agg), i.e. the pod field in the update (pod, agg, agg), and the third detour code is filled into the detour code field (f, f, f) in the source aggregation switch code field.
Further, in an embodiment, after step S401, the method further includes:
step S405, if the difference is not the same, the destination aggregation switch adds the third switch code to the path label of the second message, updates the destination pod code in the second message based on the destination pod code corresponding to the destination aggregation switch, and adds a third detour code to the path label of the second message to obtain a third message.
In this embodiment, if the destination pod code in the second message is different from the destination pod code corresponding to the destination aggregation switch, the destination aggregation switch adds the third switch code to the path label of the second message, and updates the destination pod code in the second message based on the destination pod code corresponding to the destination aggregation switch, so as to obtain the third message.
For example, if the encoding scheme a is adopted, the switch code in the third switch code is filled into the agg field in the destination aggregation switch code field (d, pod, agg), the pod code in the third switch code is filled into the pod field in the destination aggregation switch code field (d, pod, agg), that is, the agg field and pod field in the (d, pod, agg) field are updated, and the third detour code is filled into the d field in the destination aggregation switch code field (d, pod, agg); if the coding scheme B is adopted, filling the switch code in the third switch code into the agg field in the destination aggregation switch code field (pod, agg), filling the pod code in the third switch code into the pod field in the destination aggregation switch code field (pod, agg), namely updating the agg field and the pod field in the (pod, agg) field, and filling the third detour code into the detour code field (f, f, f) in the source aggregation switch code field; if the encoding scheme C is adopted, the switch code in the third switch code is filled into the second agg field in the destination aggregation switch code field (pod, agg, agg), the pod code in the third switch code is filled into the pod field in the destination aggregation switch code field (pod, agg, agg), i.e. the pod field in (pod, agg, agg) is updated, and the third bypass code is filled into the bypass code field (f, f, f) in the source aggregation switch code field.
In the message trajectory tracking method provided by this embodiment, when a destination aggregation switch receives a second message, the destination aggregation switch determines whether a destination pod code exists in a path tag of the second message; and then if the target pod code does not exist, adding the third switch code to the path mark of the second message through the target aggregation switch to obtain a third message, accurately tracking the message according to the target aggregation switch code by representing the target aggregation switch code in the third message, and adding a core switch code in various messages of the data center to realize the track tracking of all messages of the data center.
Based on the foregoing embodiments, a fifth embodiment of the message trajectory tracking method according to the present invention is provided, in this embodiment, the message trajectory tracking method further includes:
step S201, when a top rack switch receives a third message, determining whether a first detour code, a second detour code or a third detour code exists in a path mark of the third message through the top rack switch;
step S202, if the link failure exists, determining the link failure through the top-of-rack switch based on the first detour code, the second detour code or the third detour code, and outputting alarm prompt information of the link failure.
In this embodiment, when the top rack switch receives the third message, the top rack switch obtains the path label in the third message, and determines whether the first bypass code, the second bypass code, or the third bypass code exists in the path label in the third message.
And if the first detour code, the second detour code or the third detour code exists, determining the link fault through the top-of-rack switch based on the first detour code, the second detour code or the third detour code, and outputting alarm prompt information of the link fault. For example, when the coding scheme a is adopted, if there is a first detour code, the third message detours through the source aggregation switch, and there is a path fault between the source aggregation switch and a core switch; if the second roundabout code exists, the third message passes through the roundabout of the core switch, and a path fault exists between the core switch and a certain target aggregation switch; if the third roundabout code exists, the third message bypasses the destination aggregation switch, and a path fault exists between the destination aggregation switch and the top rack switch; meanwhile, the switch on the top of the rack can also analyze the path mark to obtain the path of the message in the DC, so as to realize the path tracking of the whole path, and the alarm prompt information can comprise the switch code corresponding to the fault path.
In the message trace tracking method provided in this embodiment, the top-of-rack switch determines whether a first bypass code, a second bypass code, or a third bypass code exists in a path flag of the third message; and if the link failure exists, determining the link failure based on the first detour code, the second detour code or the third detour code through the top-of-rack switch, outputting alarm prompt information of the link failure, and realizing the link failure detection of the message transmission path through the path mark.
In order to facilitate understanding of the above embodiments, the above embodiments are explained in detail below using the encoding scheme a.
Referring to fig. 2 and 3, it is assumed that codes of fixed topology connection pod1 to fixed topology connection pod4 are 0 to 3, codes of aggregation switches a1 and a2 in pod1 are 0 to 1, codes of aggregation switches A3 and a4 in pod2 are 0 to 1, codes of aggregation switches a5 and a6 in pod3 are 0 to 1, codes of aggregation switches A8 and A8 in pod4 are 0 to 1, and codes of core switches C1 to C4 are 0 to 3.
Referring to fig. 6, taking a forwarding path T2-a2-C3-a 6-T6 of the packet as an example, where a dotted line with an arrow in fig. 6 is the forwarding path, the packet reaches aggregation switch a2, and aggregation switch a2 updates a source aggregation switch encoding field (d, pod, agg) in the path label to (0,0, 1); the message continues to reach the core switch C3, and the core switch C3 updates the core switch code (d, core) in the path label to (0, 2); the message arrives at aggregation switch a6, aggregation switch a6 updates the destination aggregation switch encoding field (d, pod, agg) in the path label to (0,2, 1). The top-of-rack switch T6 receives a message in which the path is labeled [ (0,0,1) (0,2) (0,2,1) ]; based on the path label, the top rack switch T6 can parse the message through a2 of pod0, C3, and a6 of pod 2. Based on the source IP address of the message, the message sending end under the T2 switch of the pod0 can be found, and the destination end of the message under the T6 switch of the pod2 can be found according to the destination IP address of the message, so that the message path of the message is analyzed to be T2-A2-C3-A6-T6.
Referring to fig. 7, taking a forwarding path T2-a2-T1-a1-C2-a5-T6 of the packet as an example, a dotted line with an arrow in fig. 7 is a forwarding path, the packet arrives at the aggregation switch a2, the aggregation switch a2, and the aggregation switch a2 updates a source aggregation switch encoding field (d, pod, agg) in the path label to (0,0, 1). Due to the path failure, the message cannot be transferred from a2 to C3, a2 routes the message to T1, and T1 routes the message to a 1; at this time, the source aggregation switch coding field has a fixed topology connection code, which indicates that the message has passed through a convergence switch in the same pod before, aggregation switch a1 sets the fixed topology connection field to 1, and updates the source aggregation switch coding field (d, pod, agg) in the path label to (1,0, 1); the message continues to reach the core switch C2, and the core switch C2 updates the core switch code (d, core) in the path label to (0, 1); the message arrives at aggregation switch a5, aggregation switch a5 updates the destination aggregation switch encoding field (d, pod, agg) in the path label to (0,2, 0). The top-of-rack switch T6 receives a message in which the path is labeled [ (1,0,1) (0,1) (0,2,0) ]; according to the path label, the top-of-rack switch T6 can analyze that the message passes through a2, C2 of pod0 and a5 of pod2, based on the source IP address of the message, it can find that the message sending end is under a T2 switch of pod0, and according to the destination IP address of the message, it can find that the message destination end is under a T6 switch of pod2, because the source aggregation switch coding field has detour coding, it is further determined that detour exists in the pod0 corresponding to a2, and the message path of the message is T2-a2-T1-a1-C2-a5-T6 according to the position of C2 in the fat tree topology.
Referring to fig. 8, taking a forwarding path T2-a2-C3-A8-C4-a6-T6 of the packet as an example, a dotted line with an arrow in fig. 8 is a forwarding path, the packet arrives at the aggregation switch a2, the aggregation switch a2, and the aggregation switch a2 updates a source aggregation switch encoding field (d, pod, agg) in the path label to (0,0, 1). The message continues to reach the core switch C3, and the core switch C3 updates the core switch code (d, core) in the path label to (0, 2); due to the path failure, the message cannot be transferred from C3 to a6, and C3 routes the message to a 8; a8 updates the destination aggregation switch coding field (d, pod, agg) in the path mark to (0, 3, 1), the message continues to reach the core switch C4, the path mark in the message received by C4 is [ (0,0,1), (0,2), (0, 3, 1) ], the message is judged to have a core switch detour, and the core switch C3 updates the core switch coding (d, core) in the path mark to (1, 2); the message arrives at aggregation switch a6, aggregation switch a6 updates the destination aggregation switch encoding field (0, 3, 1) in the path label to (0,2, 1). The top rack switch T6 receives the message, where the path in the message is marked as [ (0,0,1) (1,2) (0,2,1), the top rack switch T6 can resolve that the message path of the message is T2-a2-C3-a8-C4-a6-T6, and determine that the C3-a6 path fails.
Referring to fig. 9, taking a forwarding path T2-a2-C3-a6-T5-a5-T6 of the packet as an example, a dotted line with an arrow in fig. 9 is a forwarding path, the packet reaches aggregation switch a2 and aggregation switch a2, and aggregation switch a2 updates a source aggregation switch encoding field (d, pod, agg) in the path label to (0,0, 1); the message continues to reach the core switch C3, and the core switch C3 updates the core switch code (d, core) in the path label to (0, 2); the message arrives at aggregation switch a6, aggregation switch a6 updates the destination aggregation switch encoding field (d, pod, agg) in the path label to (0,2, 1). Due to the failure of the A6-T6 path, the message is routed to T5 and to A5 via T5. After the aggregation switch a5 receives the message, the path flag is (0,0,1) (0,2) (0,2,1), the destination fixed topology connection code exists in the path flag, and is the same as the fixed topology connection code of a5, and a5 updates the destination aggregation switch code field (d, pod, agg) in the path flag to (1,2, 1). The top-of-rack switch T6 receives a message in which the path is labeled [ (0,0,1) (0,2) (1,2,1) ]; according to the path label, the top-of-rack switch T6 can resolve that the packet path of the packet is T2-a2-C3-a6-T5-a 5-T6. And can judge that the detour occurs at the A6-T6 downlink of pod2, and is likely to be a6-T6 link failure.
Through fig. 6 to 9, the message track tracking method of the present application can accurately track the track of the message according to the path marker in the message, so as to improve the track tracking accuracy.
In addition, the embodiment of the invention also provides a message track tracking system as a data center. The data center comprises a convergence switch, a core switch and steps for realizing the message track tracking method in each embodiment when the top switch is executed.
In addition, an embodiment of the present invention further provides a computer-readable storage medium, where a message trace tracking program is stored on the computer-readable storage medium, and when the message trace tracking program is executed, the steps of the message trace tracking method described above are implemented.
The method implemented when the message trajectory tracking program is executed may refer to each embodiment of the message trajectory tracking method of the present invention, and will not be described herein again.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) as described above and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (12)
1. A message track tracking method is characterized by comprising the following steps:
when a source aggregation switch receives a message to be forwarded, updating a path mark of the message to be forwarded through the source aggregation switch based on a first switch code corresponding to the source aggregation switch to obtain a first message, and forwarding the first message to a core switch;
when a core switch receives a first message, updating a path mark of the first message through the core switch based on a second switch code corresponding to the core switch to obtain a second message, and forwarding the second message to a target aggregation switch;
when a target aggregation switch receives a second message, updating a path mark of the second message through the target aggregation switch based on a third switch code corresponding to the target aggregation switch to obtain a third message, and forwarding the third message to a target top switch;
when the source aggregation switch receives the message to be forwarded, the step of updating the path label of the message to be forwarded through the source aggregation switch based on the first switch code corresponding to the source aggregation switch so as to obtain the first message comprises the following steps:
when a source aggregation switch receives a message to be forwarded, determining whether a source aggregation switch code exists in a path mark of the message to be forwarded or not through the source aggregation switch;
if the source aggregation switch code exists, adding a first roundabout code to a roundabout code field in a source aggregation switch code field in a path mark of the message to be forwarded through the aggregation switch so as to obtain the first message; or, adding, by the source aggregation switch, the first switch code to the source aggregation switch code field of the source aggregation switch code field in the path label of the packet to be forwarded, and adding the first detour code to the detour code field in the source aggregation switch code field in the path label of the packet to be forwarded, to obtain the first packet.
2. The message trace-tracking method according to claim 1, wherein after the step of determining, by the source aggregation switch, whether the source aggregation switch code exists in the path label of the message to be forwarded when the source aggregation switch receives the message to be forwarded, the method further comprises:
and if the source aggregation switch code does not exist, adding a first switch code to the path mark of the message to be forwarded through the source aggregation switch to obtain the first message.
3. The message trace-tracking method according to claim 2, wherein the first switch code includes a source pod code corresponding to the source aggregation switch, and the source aggregation switch code includes a source pod code corresponding to another source aggregation switch except the source aggregation switch.
4. The message trace method according to claim 1, wherein the step of updating, by the core switch, the path label of the first message based on the second switch code corresponding to the core switch when the core switch receives the first message comprises:
when a core switch receives a first message, determining whether a core switch code exists in a path mark of the first message through the core switch;
and if the core switch code does not exist, adding the second switch code to the path mark of the first message through the core switch to obtain the second message.
5. The message trace-tracking method according to claim 4, wherein after the step of determining, by the core switch, whether a core switch code exists in the path label of the first message when the core switch receives the first message, the method further comprises:
if the core switch code exists, adding a second roundabout code to the path mark of the first message through the core switch to obtain a second message; or, the core switch adds the second switch code to the path label of the first packet, and adds a second detour code to the path label of the first packet, so as to obtain the second packet.
6. The message trace-tracking method according to claim 1, wherein the step of updating, by the destination aggregation switch, the path label of the second message based on a third switch code corresponding to the destination aggregation switch, when the destination aggregation switch receives the second message, so as to obtain a third message, comprises:
when a target aggregation switch receives a second message, determining whether a target aggregation switch code exists in a path mark of the second message through the target aggregation switch;
and if the destination aggregation switch code does not exist, adding the third switch code to the path mark of the second message through the destination aggregation switch to obtain a third message.
7. The message trace-tracking method according to claim 6, wherein after the step of determining, by the destination aggregation switch, whether the destination aggregation switch code exists in the path label of the second message, the method further comprises:
if the destination aggregation switch code exists, determining whether the destination aggregation switch code in the second message is the same as the destination aggregation switch code corresponding to the destination aggregation switch through the destination aggregation switch;
if the two messages are the same, adding a third roundabout code to the path mark of the second message through the target aggregation switch to obtain a third message; or, the destination aggregation switch adds the third switch code to the path label of the second packet, and adds a third detour code to the path label of the second packet, so as to obtain a third packet.
8. The message trace-tracking method according to claim 7, wherein after the step of determining, by the destination aggregation switch, whether the destination aggregation switch code in the second message is the same as the destination aggregation switch code corresponding to the destination aggregation switch, the method further comprises:
and if not, adding the third switch code to the path mark of the second message through the target aggregation switch, updating the target aggregation switch code in the second message based on the target aggregation switch code corresponding to the target aggregation switch, and adding a third roundabout code to the path mark of the second message to obtain a third message.
9. The message trace-tracking method according to claim 6, wherein the third switch code includes a destination pod code corresponding to the destination aggregation switch, and the destination aggregation switch code includes a destination pod code corresponding to a destination aggregation switch other than the destination aggregation switch.
10. The message trace tracking method according to any one of claims 1 to 9, wherein after the step of updating, by the destination aggregation switch, the path label of the second message based on a third switch code corresponding to the destination aggregation switch to obtain a third message and forwarding the third message to the destination top-of-rack switch when the destination aggregation switch receives the second message, the message trace tracking method further comprises:
when a top-rack switch receives a third message, determining whether a first detour code, a second detour code or a third detour code exists in a path mark of the third message through the top-rack switch;
and if the link failure exists, determining the link failure through the top-of-rack switch based on the first detour code, the second detour code or the third detour code, and outputting alarm prompt information of the link failure.
11. A message trace tracking system, the message trace tracking system comprising: a source aggregation switch, a core switch, and a destination aggregation switch, the message trace tracking program, when executed by the source aggregation switch, the core switch, or the destination aggregation switch, implementing the steps of the message trace tracking method according to any one of claims 1 to 10.
12. A computer-readable storage medium, having stored thereon a message trace-tracking program, which when executed by a processor, performs the steps of the message trace-tracking method according to any one of claims 1 to 10.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010944792.3A CN111817965B (en) | 2020-09-10 | 2020-09-10 | Message track tracking method, system and computer readable storage medium |
| PCT/CN2021/098982 WO2022052532A1 (en) | 2020-09-10 | 2021-06-08 | Message track tracing method, system, and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010944792.3A CN111817965B (en) | 2020-09-10 | 2020-09-10 | Message track tracking method, system and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111817965A CN111817965A (en) | 2020-10-23 |
| CN111817965B true CN111817965B (en) | 2020-12-22 |
Family
ID=72860054
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010944792.3A Active CN111817965B (en) | 2020-09-10 | 2020-09-10 | Message track tracking method, system and computer readable storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111817965B (en) |
| WO (1) | WO2022052532A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111817965B (en) * | 2020-09-10 | 2020-12-22 | 鹏城实验室 | Message track tracking method, system and computer readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101047618A (en) * | 2006-03-29 | 2007-10-03 | 华为技术有限公司 | Method and system for acquiring network route information |
| CN103384223A (en) * | 2013-07-23 | 2013-11-06 | 迈普通信技术股份有限公司 | Flow entry updating method and device |
| CN106375105A (en) * | 2015-07-24 | 2017-02-01 | 华为技术有限公司 | Method of determining path fault, controller, switches and system |
| CN108011826A (en) * | 2017-12-01 | 2018-05-08 | 锐捷网络股份有限公司 | Method for routing, routing device, communication system and storage medium |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8695089B2 (en) * | 2007-03-30 | 2014-04-08 | International Business Machines Corporation | Method and system for resilient packet traceback in wireless mesh and sensor networks |
| CN101257490B (en) * | 2008-02-03 | 2012-08-08 | 杭州华三通信技术有限公司 | Method and device for processing packet under fireproof wall side road mode |
| CN101494584A (en) * | 2009-02-25 | 2009-07-29 | 中国联合网络通信集团有限公司 | Data transfer system |
| CN107231321B (en) * | 2016-03-25 | 2020-06-16 | 华为技术有限公司 | Method, equipment and network system for detecting forwarding path |
| US10200279B1 (en) * | 2017-10-03 | 2019-02-05 | Amer Omar Aljaedi | Tracer of traffic trajectories in data center networks |
| CN111817965B (en) * | 2020-09-10 | 2020-12-22 | 鹏城实验室 | Message track tracking method, system and computer readable storage medium |
-
2020
- 2020-09-10 CN CN202010944792.3A patent/CN111817965B/en active Active
-
2021
- 2021-06-08 WO PCT/CN2021/098982 patent/WO2022052532A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101047618A (en) * | 2006-03-29 | 2007-10-03 | 华为技术有限公司 | Method and system for acquiring network route information |
| CN103384223A (en) * | 2013-07-23 | 2013-11-06 | 迈普通信技术股份有限公司 | Flow entry updating method and device |
| CN106375105A (en) * | 2015-07-24 | 2017-02-01 | 华为技术有限公司 | Method of determining path fault, controller, switches and system |
| CN108011826A (en) * | 2017-12-01 | 2018-05-08 | 锐捷网络股份有限公司 | Method for routing, routing device, communication system and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111817965A (en) | 2020-10-23 |
| WO2022052532A1 (en) | 2022-03-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11792100B2 (en) | Network performance parameter sending method, network performance calculation method, and network node | |
| ES2735006T3 (en) | Driver placement for quick failure in split architecture | |
| CN105337785B (en) | A kind of path connectivity detection method and device | |
| US20190020574A1 (en) | Failure protection for traffic-engineered bit indexed explicit replication | |
| US11924099B2 (en) | Method for forwarding packet in hybrid network, device, and system | |
| US9729433B2 (en) | Enhanced route tracing | |
| CN109861913B (en) | Method and device for advertising prefix identification of cross-interior gateway protocol | |
| WO2021238777A1 (en) | Method and device for processing binding segment identification | |
| CN109639557A (en) | Methods, devices and systems for network communication | |
| CN114365464A (en) | Method, equipment and system for forwarding message in SR network | |
| US20240129223A1 (en) | Systems and methods for data plane validation of multiple paths in a network | |
| CN111817965B (en) | Message track tracking method, system and computer readable storage medium | |
| US11888727B2 (en) | Extending BGP protection for SR path ingress protection | |
| EP3355520B1 (en) | System and method for traffic steering and analysis | |
| US11431632B1 (en) | ID/location hybrid forwarding method based on source routing | |
| CN117176546A (en) | Fault processing method, related equipment and system | |
| CN112866115B (en) | Method, device, electronic equipment and storage medium for realizing transparent serial connection | |
| US20170012869A1 (en) | Forwarding table management in computer networks | |
| CN106656786B (en) | Flow protection method and device | |
| JP2015525984A (en) | COMMUNICATION SYSTEM, CONTROL DEVICE, COMMUNICATION METHOD, AND PROGRAM | |
| CN115865802B (en) | Flow mirroring method and device of virtual instance, virtual machine platform and storage medium | |
| CN115225452A (en) | Fault sensing method, device and system for forwarding path | |
| CN117792877A (en) | Message transmission method and device | |
| CN114205244A (en) | Message processing method and related device | |
| CN113141307A (en) | Information updating method, device, network equipment and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |