Avoiding loops by preventing further fast reroute (FRR) after an earlier FRR

Patent metadata

Field	Value
Publication number	US-11876706-B2
Application number	US-202217744335-A
Country	US
Kind code	B2
Filing date	May 13, 2022
Priority date	Dec 31, 2019
Publication date	Jan 16, 2024
Grant date	Jan 16, 2024

Abstract

In some cases, once Fast Reroute (FRR) has taken place (e.g., for MPLS protection), a further FRR is undesirable, and even detrimental. A mechanism to prevent a further FRR, once such a further FRR is determined to be potentially harmful, is described.

First claim

What is claimed is:

1. A computer-implemented method for avoiding loops in a communications network, the computer-implemented method comprising:
a) receiving, by a first data forwarding device, a data packet to be forwarded over a label-switched path (LSP);
b) determining a next hop of the data packet received;
c) determining whether or not the next hop is reachable;
d) responsive to determining that the next hop is not reachable,
1) determining (i) a backup next hop and (ii) a forwarding label associated with the backup next hop, and
2) adding to the data packet, (1) the forwarding label and (2) a further label indicating that a backup detour is being made, to generate an updated data packet, and
3) forwarding, by the data forwarding device, the updated data packet to the backup next hop, and

otherwise, responsive to determining that the next hop is reachable, forwarding the data packet using a forwarding label associated with the next hop;
e) receiving, by a second data forwarding device on the LSP, an instance of the data packet, wherein the instance of the data packet includes an incoming label;
f) determining a further next hop of the instance of the data packet received using the incoming label;
g) determining whether or not the further next hop is reachable;
h) responsive to determining that the further next hop is not reachable,
1) determining whether or not the instance of the data packet received includes the further label indicating that a backup detour was made, and
2) responsive to the determination that the instance of the data packet received includes the further label indicating that a backup detour was made, dropping the instance of the data packet, and

otherwise, responsive to determining that the further next hop is reachable,
1) popping the incoming label of the instance of the data packet,
2) removing the further label indicating that a backup detour was made if the further label indicating that a backup detour was made is at the top a label stack associated with the instance of the data packet,
3) adding an outgoing label if the next hop includes an outgoing label, and
4) forwarding the instance of the data packet using the further next hop.

2. The computer-implemented method of claim 1 , wherein the further label indicating that a backup detour is being made is one of (A) a special purpose label, (B) an extended special purpose label, and (C) an allocated label.

3. The computer-implemented method of claim 1 , wherein the act of adding to the data packet, the forwarding label and the further label indicating that a backup detour is being made, to generate an updated data packet, includes
replacing a forwarding label on the data packet received with the forwarding label associated with the backup next hop, and
pushing the further label used to indicate that a backup detour is being made.

4. The computer-implemented method of claim 3 wherein the further label used to indicate that a backup detour is being made is one of (A) a special purpose label, (B) an extended special purpose label, and (C) an allocated label.

5. The computer-implemented method of claim 1 , wherein the act of adding to the data packet, the forwarding label and the further label indicating that a backup detour is being made, to generate an updated data packet, includes
stacking the forwarding label associated with the backup next hop over a forwarding label on the data packet received, and
pushing the further label used to indicate that a backup detour is being made.

6. The computer-implemented method of claim 5 wherein the further label used to indicate that a backup detour is being made is one of (A) a special purpose label, (B) an extended special purpose label, or (C) an allocated label.

7. The computer-implemented method of claim 1 wherein the backup next hop points to a backup LSP, wherein the backup LSP includes a plurality of data forwarding devices, and wherein each of the data forwarding devices included in the backup LSP have used control signaling to indicate that they are capable of processing the further label indicating that a backup detour is being made.

8. The computer-implemented method of claim 1 wherein the backup next hop is part of one of (A) a detour LSP, (B) a backup tunnel, (C) a bypass tunnel, (D) an NHOP bypass tunnel, (E) an NNHOP bypass tunnel, and (F) a backup LSP.

9. The computer-implemented method of claim 1 , further comprising:
i) receiving, by a third data forwarding device on the LSP, an instance of the data packet;
j) determining another further next hop of the instance of the data packet received;
k) determining whether or not the other further next hop is reachable; and
l) responsive to determining that the other further next hop is not reachable,
1) determining whether or not the instance of the data packet received includes the further label indicating that a backup detour was made, and
2) responsive to the determination that the instance of the data packet received includes the further label indicating that a backup detour was made, dropping the instance of the data packet, and

otherwise, responsive to determining that the other further next hop is available, forwarding the instance of the data packet using a forwarding label associated with the other further next hop.

10. The computer-implemented method of claim 1 , wherein the backup detour is a segment routed (SR) path defined by a stack of labels.

11. The computer implemented method of claim 1 , wherein the backup detour is a loop-free alternative (LFA) path.

12. A system, the system comprising:
a data forwarding device including:
a) at least one communications interface;
b) at least one processor; and
c) at least one storage device storing processor-executable instructions which, when executed by the at least one processor, cause the at least one processor to perform a method comprising:
1) receiving, by the data forwarding device on a label switched path (LSP), a data packet;
2) determining a next hop of the data packet received;
3) determining whether or not the next hop is reachable;
4) responsive to determining that the next hop is not reachable,
A) determining whether or not the data packet received includes a further label identifying that the data packet had made a backup detour, and
B) responsive to the determination that the data packet received includes the further label identifying that the data packet had made a backup detour,
 dropping the data packet, and

otherwise, responsive to a determination that the data packet received does not include a further label identifying that the data packet had made a backup detour,
 determining (i) a backup next hop and (ii) a forwarding label associated with the backup next hop, and
 adding to the data packet, (1) the forwarding label and (2) another label indicating that a backup detour is being made, to generate an updated data packet; and
 forwarding, by the data forwarding device, the updated data packet to the backup next hop, and

otherwise, responsive to determining that the next hop is reachable, forwarding the data packet using a forwarding label associated with the next hop; and

a second data forwarding device including:
a) at least one communications interface;
b) at least one processor; and
c) at least one storage device storing processor-executable instructions which, when executed by the at least one processor of the second data forwarding device, cause the at least one processor of the second data forwarding device to perform a method comprising:
1) receiving, by the second data forwarding device on the LSP, an instance of the data packet, wherein t

Assignees

• Juniper Networks Inc

Inventors

• Kompella Kireeti
• Lin Wen
• Wang Kevin

Classifications

• H04L45/22

  Alternate routing · CPC title

• H04L45/247

  using M:N active or standby paths · CPC title

• H04L45/507 Primary

  Label distribution · CPC title

• H04L45/18 Primary

  Loop-free operations · CPC title

• H04L12/4633

  Interconnection of networks using encapsulation techniques, e.g. tunneling · CPC title