# US 2018/0026810 A1 · Detecting and preventing network loops

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0026810 A1
- Document ID: US20180026810A1
- Status: Published application
- Kind: A1
- Application number: 15/232,591
- Filed: 2016-08-09
- Published: 2018-01-25
- Earliest claimed: 2016-07-21
- Assignees: Cisco Technology, Inc.
- Applicants: Cisco Technology, Inc.
- Inventors: Natarajan Manthiramoorthy; Venkatesh Srinivasan; Swaminathan Narayanan; Ambrish Niranjan Mehta; Anand Kumar Singh; Anulekha Chodey
- Web page: https://patentgrep.com/patent/US20180026810A1

## CPC

- H04L 47/20: Traffic policing
- H04L 5/0012: {Hopping in multicarrier systems}
- H04L 12/437: Ring fault isolation or reconfiguration {(for SDH/SONET ring networks H04J3/085)}
- H04L 12/4641: {Virtual LANs, VLANs, e.g. virtual private networks [VPN] (LAN interconnection over a bridge based backbone H04L12/462; encapsulation techniques H04L12/4633; routing of packets H04L45/00; packet switches H04L49/00; virtual private networks for security H04L63/0272)}
- H04L 43/20: the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV
- H04L 45/18: Loop-free operations
- H04L 45/28: using route fault recovery
- H04L 45/32: {Flooding (denial of service attacks H04L63/1458)}
- H04L 45/488: using root node determination
- H04L 49/354: for supporting virtual local area networks [VLAN]
- H04L 69/324: in the data link layer [OSI layer 2], e.g. HDLC
- H04L 2101/622: Layer-2 addresses, e.g. medium access control [MAC] addresses
- Y02D 30/00: Reducing energy consumption in communication networks
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

Systems, methods, and non-transitory computer-readable storage media for detecting network loops. In some embodiments, a system can identify a network path having multiple hops associated with respective nodes which are configured in a forwarding mode. The system can traverse the network path to identify, for each node from the respective nodes, a respective next hop. Based on the respective next hop for each node, the system can determine whether two or more nodes from the respective nodes have a same respective next hop. When the two or more nodes have the same respective next hop, the system can determine that the network path has a network loop.

## Claims

### Claim 1

A method comprising:
identifying a network path having a plurality of hops, the plurality of hops comprising respective nodes, wherein the respective nodes are all configured in a forwarding mode;
traversing at least a portion of the network path to identify, for each node from the respective nodes, a respective next hop;
based on the respective next hop for each node, determining whether two or more nodes from the respective nodes have a same respective next hop; and
when the two or more nodes have the same respective next hop, determining that the network path has a network loop.

### Claim 2 (depends on 1)

The method of claim 1, wherein the respective nodes comprise ports set in forwarding mode, wherein each of the ports is associated with a respective switch.

### Claim 3 (depends on 2)

The method of claim 2, wherein the network comprises a virtual local area network, wherein determining that the network path has the network loop comprises determining that the virtual local area network has the network loop.

### Claim 4 (depends on 3)

The method of claim 3, further comprising:
identifying a respective network path for each of a plurality of virtual local area networks in the network, the respective network path comprising a respective plurality of hops, the respective plurality of hops being comprising a respective plurality of nodes, the respective plurality of nodes being configured in the forwarding mode;
traversing each respective network path to identify, for each respective node in the respective plurality of nodes, a second respective next hop;
based on the second respective next hop for each respective node, determining whether two or more nodes from the respective plurality of nodes have a particular next hop in common; and
when the two or more nodes have the particular next hop in common, determining that the respective virtual local area network has a respective network loop.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
recording, for each node from the respective nodes, the respective next hop in a respective next hop field in a database; and
wherein determining whether two or more nodes from the respective nodes have the same respective next hop comprises:
comparing, for each node from the respective nodes, the respective next hop field in the database to yield a comparison; and
based on the comparison, determining whether the same respective next hop is listed in the respective next hop field associated with the two or more of the respective nodes.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
when the same respective next hop is listed in the respective next hop field:
determining that the two or more respective nodes have the same respective next hop; and
determining that the network loop comprises the two or more of the respective nodes.

### Claim 7 (depends on 1)

The method of claim 1, wherein the network path comprises a plurality of links connecting the plurality of hops, each of the respective nodes being associated with at least one of respective link from the plurality of links, wherein identifying the respective next hop for each node comprises identifying the respective next hop for each respective link of each node.

### Claim 8 (depends on 1)

The method of claim 1, wherein the network path comprises a plurality of links connecting the plurality of hops, wherein a node from the respective nodes is associated with a first link and a second link from the plurality of links, wherein the first link and the second link connect the node to different next hops.

### Claim 9 (depends on 8)

The method of claim 8, wherein one of the different next hops is the same respective next hop, and wherein the node is one of the two or more nodes having the same respective next hop.

### Claim 10 (depends on 9)

The method of claim 9, wherein the same respective next hop is a second node from the respective nodes, the method further comprising determining that the network loop is between the node and the second node.

### Claim 11

A system comprising:
one or more processors; and
a computer-readable medium having stored therein instructions which, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
identifying a network path having a plurality of hops, the plurality of hops comprising respective nodes, wherein the respective nodes are all configured in a forwarding mode;
traversing at least a portion of the network path to identify, for each node from the respective nodes, a respective next hop;
based on the respective next hop for each node, determining whether two or more nodes from the respective nodes have a same respective next hop; and
when the two or more nodes have the same respective next hop,
determining that the network path has a network loop.

### Claim 12 (depends on 11)

The system of claim 11, wherein the respective nodes comprise ports set in forwarding mode, each of the ports being associated with a respective switch, wherein the network comprises a virtual local area network, wherein determining that the network path has the network loop comprises determining that the virtual local area network has the network loop.

### Claim 13 (depends on 11)

The system of claim 11, wherein the computer-readable medium stores additional instructions which, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
identifying a respective network path for each of a plurality of virtual local area networks in the network, the respective network path comprising a respective plurality of hops, the respective plurality of hops being comprising a respective plurality of nodes, the respective plurality of nodes being configured in the forwarding mode;
traversing each respective network path to identify, for each respective node in the respective plurality of nodes, a second respective next hop;
based on the second respective next hop for each respective node, determining whether two or more nodes from the respective plurality of nodes have a particular next hop in common; and
when the two or more nodes have the particular next hop in common, determining that the respective virtual local area network has a respective network loop.

### Claim 14 (depends on 11)

The system of claim 11, wherein the computer-readable medium stores additional instructions which, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
recording, for each node from the respective nodes, the respective next hop in a respective next hop field in a database; and
wherein determining whether two or more nodes from the respective nodes have the same respective next hop comprises:
comparing, for each node from the respective nodes, the respective next hop field in the database to yield a comparison; and
based on the comparison, determining whether the same respective next hop is listed in the respective next hop field.

### Claim 15 (depends on 14)

The system of claim 14, wherein the computer-readable medium stores additional instructions which, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
when the same respective next hop is listed in the respective next hop field:
determining that the two or more nodes have the same respective next hop; and
determining that the network path has the network loop.

### Claim 16 (depends on 11)

The system of claim 11, wherein the network path comprises a plurality of links connecting the plurality of hops, wherein a node from the respective nodes is associated with a first link and a second link from the plurality of links, wherein the first link and the second link connect the node to different next hops, wherein one of the different next hops is the same respective next hop, and wherein the node is one of the two or more nodes having the same respective next hop.

### Claim 17

A non-transitory computer-readable medium having stored therein instructions which, when executed by one or more processors, cause the one or more processors to perform operations comprising:
identifying a network path having a plurality of hops, the plurality of hops comprising respective nodes, wherein the respective nodes are all configured in a forwarding mode;
traversing at least a portion of the network path to identify, for each node from the respective nodes, a respective next hop;
determining that the respective next hop of a first node is a previous hop, in the network path, of the first node, to yield a determination; and
based on the determination, determining that the network path has a network loop.

### Claim 18 (depends on 17)

The non-transitory computer-readable medium of claim 17, storing additional instructions which, when executed by one or more processors, cause the one or more processors to perform operations comprising:
recording, for each node from the respective nodes, the respective next hop in a respective next hop field in a database; and
wherein determining that the respective next hop of the first node is the previous hop comprises:
comparing, for each node from the respective nodes, the respective next hop field in the database to yield a comparison; and
based on the comparison, determining whether the same respective next hop is listed in the respective next hop field associated with two or more of the respective nodes.

### Claim 19 (depends on 18)

The non-transitory computer-readable medium of claim 18, storing additional instructions which, when executed by one or more processors, cause the one or more processors to perform operations comprising:
when the same respective next hop is listed in the respective next hop field associated with two or more of the respective nodes:
determining that the two or more of the respective nodes have the same respective next hop; and
determining that the network loop comprises the two or more of the respective nodes.

### Claim 20 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein determining that the network path has a network loop further comprises:
based on the respective next hop for each node, determining whether two or more nodes from the respective nodes have a same respective next hop;
determining that the two or more nodes have the same respective next hop; and
wherein determining that the network path has the network loop is further based on determining that the two or more nodes have the same respective next hop.
