Identifying components for removal in a network configuration

Patent metadata

Field	Value
Publication number	US-11736351-B2
Application number	US-202217670036-A
Country	US
Kind code	B2
Filing date	Feb 11, 2022
Priority date	Jun 19, 2017
Publication date	Aug 22, 2023
Grant date	Aug 22, 2023

Abstract

Systems, methods, and computer-readable media analyzing memory usage in a network node. A network assurance appliance may be configured to determine a hit count for a concrete level rule implemented on a node and identify one or more components of a logical model, wherein each of the one or more components are associated with the concrete level rule. The network assurance appliance may attribute the hit count for the concrete level rule to each of the components of the logical model, determine a number of hardware level entries associated with the each of the one or more components, and generate a report comprising the one or more components of the logical model, the hit count attributed to each of the one or more components of the logical model, and the number of hardware level entries associated with the one or more components of the logical model.

First claim

What is claimed is:

1. A computer-implemented method comprising:
determining, by at least one processor, a hit count for a concrete level rule implemented on a node;
identifying one or more components from a logical model, wherein the one or more components are associated with the concrete level rule;
attributing the hit count for the concrete level rule to each of the one or more components;
determining one or more ternary content-addressable memory (TCAM) entries associated with the one or more components;
calculating a number of stale TCAM entries based at least in part on the hit count; and
generating a report, based at least in part on the number of stale TCAM entries, identifying a removal candidate of the one or more components.

2. The computer-implemented method of claim 1 , further comprising:
identifying the concrete level rule implemented on the node by querying the node for rule identifiers for the concrete level rule.

3. The computer-implemented method of claim 1 , further comprising:
identifying a logical level intent associated with the concrete level rule, the logical level intent associated with the one or more components.

4. The computer-implemented method of claim 1 , further comprising:
determining, by querying the node, a number of hardware level entries associated with one or more logical level components, wherein the number of hardware level entries comprises one or more TCAM entries.

5. The computer-implemented method of claim 1 , wherein the determining of the hit count for the concrete level rule comprises querying the node for the hit count for the concrete level rule.

6. The computer-implemented method of claim 1 , wherein the determining of the hit count for the concrete level rule comprises querying a network controller for the hit count for the concrete level rule.

7. The computer-implemented method of claim 1 , wherein the concrete level rule comprises an access control rule.

8. The computer-implemented method of claim 1 , wherein the one or more components comprise an endpoint and a protocol.

9. The computer-implemented method of claim 1 ,
wherein,
the one or more components include one or more contracts, and
the removal candidate is an identified one of the one or more contracts with no hits and most entries.

10. The computer-implemented method of claim 1 , wherein the node is a leaf node.

11. A system comprising:
one or more processors; and
at least one computer-readable storage medium having stored therein instructions which, when executed by the one or more processors, cause the system to:
determine a hit count for a concrete level rule implemented on a node;
identify one or more components from a logical model, wherein the one or more components are associated with the concrete level rule;
attribute the hit count for the concrete level rule to each of the one or more components;
determine one or more ternary content-addressable memory (TCAM) entries associated with the one or more components;
calculate a number of stale TCAM entries based at least in part on the hit count; and
generate a report, based at least in part on the number of stale TCAM entries, identifying a removal candidate of the one or more components.

12. The system of claim 11 , further comprising instructions, which when executed by the one or more processors, cause the system to:
identify the concrete level rule implemented on the node by querying the node for rule identifiers for the concrete level rule.

13. The system of claim 11 , further comprising instructions, which when executed by the one or more processors, cause the system to:
identify a logical level intent associated with the concrete level rule, the logical level intent associated with the one or more components.

14. The system of claim 11 , wherein the one or more components comprise an endpoint and a protocol.

15. The system of claim 11 ,
wherein,
the one or more components include one or more contracts, and
the removal candidate is an identified one of the one or more contracts with no hits and most entries.

16. At least one non-transitory computer-readable storage medium having stored therein instructions which, when executed by one or more processors, cause the one or more processors to:
determine a hit count for a concrete level rule implemented on a node;
identify one or more components from a logical model, wherein the one or more components are associated with the concrete level rule;
attribute the hit count for the concrete level rule to each of the one or more components;
determine one or more ternary content-addressable memory (TCAM) entries associated with the one or more components;
calculate a number of stale TCAM entries based at least in part on the hit count; and
generate a report, based at least in part on the number of stale TCAM entries, identifying a removal candidate of the one or more components.

17. The at least one non-transitory computer-readable storage medium of claim 16 , further comprising instructions, which when executed by the one or more processors, cause the one or more processors to:
identify the concrete level rule implemented on the node by querying the node for rule identifiers for the concrete level rule.

18. The at least one non-transitory computer-readable storage medium of claim 16 , further comprising instructions, which when executed by the one or more processors, cause the one or more processors to:
identify a logical level intent associated with the concrete level rule, the logical level intent associated with the one or more components.

19. The at least one non-transitory computer-readable storage medium of claim 16 , wherein the one or more components comprise an endpoint and a protocol.

20. The at least one non-transitory computer-readable storage medium of claim 16 ,
wherein,
the one or more components include one or more contracts, and
the removal candidate is an identified one of the one or more contracts with no hits and most entries.

Assignees

• Cisco Tech Inc

Inventors

• Kompella Ramana Rao
• Nagarajan Chandra
• Monk John Thomas
• Ghantasala Purna Mani Kumar

Classifications

• H04L41/0893

  Assignment of logical groups to network elements · CPC title

• H04L45/48

  Routing tree calculation · CPC title

• H04L41/122

  of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV] · CPC title

• H04L41/0894

  Policy-based network configuration management · CPC title

• H04L41/0895

  Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements · CPC title