Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L43/00—Arrangements for monitoring or testing data switching networks
  • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
  • H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
  • H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L43/00—Arrangements for monitoring or testing data switching networks
  • H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route

Definitions

• the present invention relates to network communication technologies, and in particular, to a method and a node for implementing path detection in a network based on MPLS technology.
• Multi-Protocol Label Switching (MPLS) Label Switching Path (LSP) Ping technology is an effective operation management and maintenance (OAM) technology that enables connectivity detection and hop-by-hop fault location. And can verify the consistency of the control plane and the data plane.
• MPLS Multi-Protocol Label Switching
• LSP Label Switching Path
• the echo request message is sent by the head node along the forwarding path of the service, on the LSP.
• the detecting node performs processing to return an echo reply (Echo Reply) packet to implement LSP connectivity detection or hop-by-hop positioning of the LSP fault.
• Echo Reply an echo reply
• the return mode of the echo reply packet the most common one is that the echo reply packet is forwarded to the head node through the IP route.
• the detection node that responds to the echo reply message is not a reachable route that always has a head node.
• other nodes on the LSP do not reach the forwarding route of the head node.
• nodes of different ASs do not have routes to each other; or in a seamless MPLS scenario, nodes of different routing areas do not have routes to each other.
• the IETF draft draft-ietf-mpls-interas-lspping-00 describes a scenario in which ASBRs control route distribution between different ASs by means of a mechanical recording autonomous system border router (ASBR).
• ASBR mechanical recording autonomous system border router
• the technical problem to be solved by the embodiments of the present invention is to provide a method and a node for implementing path detection, which can complete path detection more flexibly and quickly.
• a method for implementing path detection includes:
• the initiating node sends a response request message carrying the address list information to the detecting node, where the address list information includes the originating node address;
• the detecting node that receives the response request message checks whether the node address in the address list information carried in the response request message is reachable, and uses the found reachable address as the destination address of the response response message; The address information of the node is added to the address list information, and the response response message carrying the address information of the node is sent to the destination address.
• the step of the sending node sending the response request message carrying the address list information to the detecting node includes:
• the initiating node carries the address list information in the first response request message that is sent, and the first address in the address list information carried in the first response request message is the originating node address.
• the step of the sending node sending the response request message carrying the address list information to the detecting node includes:
• the initiating node sends the nth response request message carrying the address list information, and if the initiating node receives the response response message fed back by the destination node of the response request message, the n+1th response request is sent. And transmitting, in the message, the address list information in the response response message; if the originating node does not receive the response response of the destination node fed back the response request message within a predetermined time, the sending response is When n+1 responds to the request message, the nth response request carries the address list information in the message.
• the step of checking whether the node address in the address list information carried in the response request message is reachable includes: searching, starting from the first address, whether the node address in the address list information carried in the response request message is Reachable.
• the step of using the found reachable address as the destination address of the response response message includes:
• the first reachable address found is the destination address of the response reply message.
• the method further includes:
• the detecting node that receives the response response message checks whether the node address in the address list information carried in the response response message is reachable, and updates the destination address of the response response message to the found reachable address, to the destination.
• the address sends the response response message carrying the address list information.
• the step of checking whether the node address in the address list information carried in the response response message is reachable includes: searching, starting from the first address, whether the node address in the address list information carried in the response response message is in order Reachable.
• the step of updating the destination address of the response response message to the found reachable address includes:
• the destination address of the response response message is updated to the first reachable address found.
• the step of the detecting node adding the address information of the local node to the address list information includes:
• the detecting node deletes the address information after the reachable address found in the address list information, and inserts the address of the node after the reachable address.
• all address list information is encapsulated in TLV form.
• the addresses in all the address list information are loopback addresses.
• the initiating node is a head node of the LSP
• the detecting node includes other nodes on the LSP except the head node.
• a path detection node includes a request message sending module, a searching module, and a reply module, wherein:
• the request message sending module is configured to: when the node is the initiating node, send a response request message carrying the address list information to the detecting node, where the address list information includes the starting node address;
• the searching module is configured to: when the node is a detecting node, check whether the node address in the address list information carried in the received response request message is reachable, and find the reachable address as the response response ⁇ The destination address of the text;
• the replying module is configured to: when the node is used as a detecting node, add the local node address information to the address list information, and send a response response message carrying the local node address information to the destination address.
• the request message sending module is configured to send a response request message carrying the address list information to the detecting node in the following manner:
• the first response request message When the first response request message is sent, the first response request message carries the address list information, and the first address in the address list information carried in the first response request message is the originating node address;
• the node When the n+1th response request message is sent, if the node receives the response response message fed back by the destination node of the nth response request message, the node carries the message in the (n+1)th response request message.
• the address list information in the response response message if the node does not receive the response response message fed back by the destination node of the nth response request message within a predetermined time, the n+1th response request message is received.
• the address list information in the nth response request message is carried.
• the searching module is configured to check whether the node address in the address list information carried in the response request message is reachable according to the following manner:
• the address of the node in the address list information carried in the response request message is searchable in order from the first address.
• the searching module is configured to use the following method to determine the reachable address as the response destination address:
• the first reachable address that is found is used as the destination address of the response response message.
• the node further includes a forwarding module, where:
• the forwarding module is configured to: after the node receives the response response message, check whether the node address in the address list information carried in the response response message is reachable, and update the destination address of the response response message to The reachable address is found, and a response response message carrying the address list information is sent to the destination address.
• the forwarding module is configured to check whether the node address in the address list information carried in the response response message is reachable according to the following manner:
• the forwarding module is configured to update the destination address of the response response message to the found reachable address in the following manner:
• the destination address of the response response message is updated to the first reachable address found.
• the reply module is configured to add the node address information to the address list information in the following manner:
• the address information after the reachable address found in the address list information is deleted, and the address of the node is inserted after the reachable address.
• the initiating node is a head node of the LSP
• the detecting node includes other nodes on the LSP except the head node.
• the embodiment of the present invention has the following advantages: When the node responds to the response request packet of the LSP ping, and the reachable route of the head node is not available, the information can be found by responding to the address list information carried in the request packet. The other nodes on the LSP passing through the packet transmit the response response message to the head node in a relay manner, thereby improving the success rate of the tracking route.
• Figure 1 shows one of the flow chart of LSP path detection.
• Figure 2 is the second flow chart of the LSP path detection
• Figure 3 is a schematic diagram of a node structure
• Figure 4 is a scenario diagram of an LSP across a routing area
• FIG. 5 is a flowchart of Embodiment 1 of the present invention.
• FIG. 6 is a flow chart of Embodiment 2 of the present invention. Preferred embodiment of the invention
• the LSP path detection method includes the following steps:
• the initiating node sends a response request message to the detecting node, where the address information is included, where the address list information includes the originating node address;
• the detecting node checks whether the address of the node in the address list information carried in the received response request message is reachable, and uses the found reachable address as the destination address of the response response message;
• the detecting node adds the address information of the node to the address list information and carries it in the response response message of the reply.
• the LSP path detection method further includes: when the detecting node receives the response response message, checking whether the node address in the address list information carried in the response response message is reachable, and updating the destination address of the response response message to the search The reachable address to which the response response message carrying the address list information is sent to the destination address.
• the initiating node is the head node of the LSP
• the detecting node includes other nodes except the head node on the LSP, including the intermediate node and the last node (or the tail node).
• the following technical solution is adopted to implement the detection response message to be forwarded to the head node by means of relay, as shown in FIG. 2:
• Step 101 In an LSP path detection process, the head node carries address list information in the response request message, where the address list information includes a head node address;
• the processing of the head node is divided into the following two cases:
• the first node carries the address list information in the first response request message sent by the first node, and the first address in the address list information carried in the first response request message is the head node address;
• the head node sends the nth response request message carrying the address list information. If the head node receives the response response message fed back by the destination node of the response request message, the n+1th response request message is sent. And carrying the address list information in the response response message; if the head node does not receive the response response message fed back by the destination node of the response request message, sending the n+1th The address list information in the nth response request message is carried in response to the request message. n > 2.
• Step 102 After receiving the response request message, the other node except the head node on the LSP checks whether the node address in the address list information carried in the response request message is reachable, and finds the reachable address as a response response. The destination address of the 3 ⁇ 4 text, the address of the node is added to the address list information, and the address list information is carried when replying the response response message;
• nodes except the head node on the LSP check the node address in the address list information carried in the response request message, they are usually searched in order, especially when the first address in the address list information is the head node address, from the first address. Start looking in order to return a response response message faster.
• the head node will find the first reachable address as the destination address of the response response message.
• the node other than the head node on the LSP may also delete the address information after the reachable address found in the address list information, and then insert the address of the node after the reachable address.
• the address information after the reachable address is deleted, which can make the address list information smaller and save transmission resources.
• the path indicated in the address list information can be better.
• Step 103 After receiving the response response message, the intermediate node on the LSP checks whether the node address in the address list information carried in the response response message is reachable, and updates the destination address of the response response message to the found one. Address, send a response with the address list information response > 3 ⁇ 4 text.
• the intermediate node on the LSP checks whether the node address in the address list information carried in the response response message is reachable, the intermediate node usually uses the sequential search method.
• the intermediate node on the LSP updates the destination address of the response response message to the first reachable address that is found.
• the address list information in the foregoing step is encapsulated by a type/length/value (TLV, Type/Length/Value), and the address in the address list information is a loopback address.
• TLV type/length/value
• Type/Length/Value Type/Length/Value
• the node implementing the above method includes a request message sending module 31, a search mode Block 32 and reply module 33, wherein:
• the request message sending module 31 is configured to: when the node is an initiating node, send a response request message to the detecting node, where the address list information is carried, where the address list information includes an initiating node address;
• the searching module 32 is configured to: when the node is a detecting node, check whether the node address in the address list information carried in the received response request message is reachable, and use the found reachable address as the response response message. Destination address
• the reply module 33 is configured to: when the node is used as a detection node, add the address information of the node to the address list information, and carry it in the response response of the reply>3 ⁇ 4.
• the request message sending module 31 is configured to send a response request message to the detecting node in the following manner, where the address list information is carried, where the address list information includes an originating node address:
• the first response request message When the first response request message is sent, the first response request message carries the address list information, and the first address in the address list information carried in the first response request message is the originating node address;
• the node When the n+1th response request message is sent, if the node receives the response response message fed back by the destination node of the nth response request message, the node carries the message in the (n+1)th response request message.
• the address list information in the response response message if the node does not receive the response response message fed back by the destination node of the nth response request message, the nth response request message carries the nth Respond to the address list information in the request message.
• the searching module 32 is configured to use the following reachable address as the destination address of the response response message in the following manner: the first reachable address that is found is used as the destination address of the response response message. .
• the foregoing node further includes: a forwarding module 34, configured to: after the node receives the response response message, check whether the node address in the address list information carried in the response response message is reachable, The destination address of the response response message is updated to the found reachable address, and a response response message carrying the address list information is sent to the destination address.
• a forwarding module 34 configured to: after the node receives the response response message, check whether the node address in the address list information carried in the response response message is reachable, The destination address of the response response message is updated to the found reachable address, and a response response message carrying the address list information is sent to the destination address.
• the forwarding module 34 is configured to: further change the destination address of the response response message in the following manner Newly found reachable address: Update the destination address of the response response "3 ⁇ 4" to the first reachable address found.
• the reply module 33 is configured to add the local address information to the address list information in the following manner: deleting the address information after the reachable address found in the address list information, and inserting the address after the reachable address Node address.
• the address list information is implemented in an address group manner.
• nodes a, b, c, and d form an LSP across the routing area. Head node a and node c, d are in different routing areas, and node b serves as the area boundary node (ABR) of the two areas. Controls the isolation of routing information between two areas, that is, a and c in different areas, and no reachable routing information between the a and d.
• ABR area boundary node
• all nodes on the LSP in Figure 4 are nodes having the trace routing function described herein.
• the trace routing process is shown in Figure 5 and includes the following steps:
• Step 201 The head node a sends an LSP traceroute request, that is, an echo request message, and the carried address group only includes its own routable address, and the TTL label time to live (TTL, Time To Live) is set to 1;
• TTL Time To Live
• Step 202 The node b processes the echo request packet, and checks whether the address in the address group is reachable, and finds that the address of the first address information, that is, the address of the head node a is reachable, and adds the address information of the node in the address group, and The modified address group information is placed in the echo reply message and sent back to the head node a;
• the data structure of the address group information is as shown in Table 1.
• the address group can be encapsulated by means of TLV, and the address of the node is carried in the data part of the value.
• the address of the node 1 is a routable address of the head node, which is usually the loopback address of the head node, and the subsequent addresses are added or deleted as needed. Table 1
• Step 203 The head node a receives the echo reply packet sent by the node b, and copies the address group to the next echo request; sends an echo request packet, and the TTL of the LSP label is set to 2;
• Step 204 The node c processes the echo request packet, and sequentially checks whether the address in the address group is reachable (in this case, the address group includes the address information of the head node a and the address information of the node b), and the node c finds the route to the head node a. Unreachable, continue to check whether the address of the node b is reachable. When the route to the node b is found to be reachable, the address of the node b is used as the destination address of the echo reply, and the address of the node is added to the node b of the address group information. After the address, the echo reply packet is sent, and the echo reply packet carries the modified address group information.
• the address group includes the address information of the head node a and the address information of the node b
• Step 205 Node b receives the echo reply packet, finds the address in the address group, finds that there is a reachable route to the head node a, and forwards the echo reply to the head node a;
• Step 206 The head node a receives the echo reply packet, copies the address group to the next echo request, and sends an echo request packet, and the LSP label TTL is set to 3;
• the packet does not find the reachable route of the head node a.
• the address in the address group is checked in sequence (the address group includes the address information of the head node a, the node b, and the node c), and the reachability of the node b is found.
• the address of b is used as the destination address of the echo reply, the address of the node c after the address of the node b is deleted, and the address of the node c is added to the address group as the next address after the node b, and an echo reply message is sent. Carrying the newly modified address group information in the echo reply message;
• Step 208 The node b receives the echo reply packet, finds the address in the address group, and finds that there is a reachable route to the head node a, and forwards the echo reply message to the head node a;
• Step 209 The head node a receives the echo reply packet and completes the process of the LSP traceroute.
• the node c in this embodiment does not have the trace routing function described herein.
• the trace routing process is shown in Figure 6, and includes the following steps:
• Step 301 The head node a sends an echo request message, and the carried address group only includes its own routable address, and the TTL of the LSP label is set to 1;
• Step 302 The node b processes the echo request packet, and checks whether the address in the address group is reachable. The reachable route of the end node a is found, and the echo reply is returned to a, and the address is carried in the address group carried by the echo reply. The address of the node;
• Step 303 The head node a receives the echo reply message sent by the node b, and copies the address group to the next echo request; sends an echo request message, and the TTL of the LSP label is set to 2;
• Step 304 The node c processes the echo request message. Since the node c cannot identify the address group information carried in the echo request message and does not have the address information of the head node a, it cannot send the echo reply message to the head node a.
• Step 305 The head node a does not receive the echo reply packet, and after waiting for a certain period of time, copies the address group carried in the echo request ⁇ text of the last LSP tag with the TTL value of 2 to the next sent echo request. Send a new echo request packet, and set the TTL of the LSP label to 3.
• Step 306 The tail node d processes the echo request packet, and checks whether the address in the address group is reachable.
• the reachable route of the head node a is not found.
• the address of the address group is searched backward from the address of the head node, and it is found that The reachable route of the node b; the address of the b is used as the destination address of the echo reply, and the address of the node is added to the address group as the next record, and an echo reply message is sent, and the echo reply message carries the modified Address group information;
• Step 307 The node b receives the echo reply packet, finds the address in the address group, and finds that there is a reachable route to the head node a, and forwards the echo reply message to the head node a;
• Step 308 The head node a receives the echo reply packet and completes the process of the LSP traceroute.
• the above embodiment is advertised to the detecting node by carrying the reachable path information in the echo request, so that the echo reply message replied by the detecting node can be forwarded to other nodes on the LSP, and finally forwarded to the head node by means of relay.
• the subsequent detecting node can obtain the reachable path information by manual configuration.
• the address information of the intermediate node is manually configured in the header node and sent to the subsequent detection node in the response request message, so that the detection node can find the address information of the reachable intermediate node, and then implement the relay response of the response response message.
• the address list information carried in the request packet can be found on the LSP through which the packet passes.
• the other nodes transmit the response response message to the head node in a relay manner, thereby improving the success rate of the tracking route. Therefore, the present invention has strong industrial applicability.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Health & Medical Sciences (AREA)
• Cardiology (AREA)
• General Health & Medical Sciences (AREA)
• Environmental & Geological Engineering (AREA)
• Data Exchanges In Wide-Area Networks (AREA)
• Small-Scale Networks (AREA)
• Mobile Radio Communication Systems (AREA)
• Communication Control (AREA)

Priority Applications (3)

Applications Claiming Priority (2)

Publications (1)

Family

ID=47745918

Family Applications (1)

Country Status (5)

Cited By (1)

Families Citing this family (10)

Citations (4)

Family Cites Families (6)

• 2011
  • 2011-08-24 CN CN201110248166.1A patent/CN102957573B/zh not_active Expired - Fee Related
• 2012
  • 2012-07-17 WO PCT/CN2012/078759 patent/WO2013026336A1/zh active Application Filing
  • 2012-07-17 IN IN1369CHN2014 patent/IN2014CN01369A/en unknown
  • 2012-07-17 BR BR112014004300A patent/BR112014004300A2/pt not_active Application Discontinuation
  • 2012-07-17 RU RU2014111057/08A patent/RU2574812C9/ru not_active IP Right Cessation

Patent Citations (4)

Also Published As

Similar Documents

Legal Events