# US 2020/0351167 A1 · Runtime monitoring in intent-based networking

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

- Number: US 2020/0351167 A1
- Document ID: US20200351167A1
- Status: Published application
- Kind: A1
- Application number: 16/398,728
- Filed: 2019-04-30
- Published: 2020-11-05
- Earliest claimed: 2019-04-30
- Assignees: Hewlett Packard Enterprise Development LP
- Applicants: Hewlett Packard Enterprise Development LP
- Inventors: Puneet SHARMA; Huazhe WANG
- Web page: https://patentgrep.com/patent/US20200351167A1

## CPC

- H04L 63/1408: {by monitoring network traffic (monitoring network traffic per se H04L43/00)}
- H04L 41/0806: for initial configuration or provisioning, e.g. plug-and-play
- H04L 41/0866: Checking the configuration
- H04L 41/0894: Policy-based network configuration management
- H04L 41/12: Discovery or management of network topologies
- H04L 41/14: Network analysis or design
- H04L 43/026: using flow identification
- H04L 63/101: {Access control lists [ACL]}
- H04L 41/0886: {Fully automatic configuration}
- H04L 41/145: {involving simulating, designing, planning or modelling of a network}
- H04L 63/02: {for separating internal from external traffic, e.g. firewalls}
- H04L 63/20: {for managing network security; network security policies in general (filtering policies H04L63/0227)}
- Y02D 30/50: in wire-line communication networks, e.g. low power modes or reduced link rate
- 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

Example method includes: receiving a network topology and a plurality of network configurations in an intent-based network; determining a number of spots available for runtime monitoring of an intent-based network policy among a plurality of intent-based policy in the intent-based network; determining a plurality of runtime constraints comprising one or more of time, resource capacity, and bandwidth demand based on the network topology and the plurality of network configurations; based on the plurality of runtime constraints, generating a runtime monitoring schedule that comprises at least a flow, a spot assigned for runtime monitoring of the flow, and a runtime monitoring rule to be applied at the assigned spot; and monitoring the flow based on the runtime monitoring schedule at the assigned spot.

## Claims

### Claim 1

A method comprising:
receiving, by a network device, a network topology and a plurality of network configurations in an intent-based network;
determining, by the network device, a number of spots available for runtime monitoring of an intent-based network policy among a plurality of intent-based policy in the intent-based network;
determining, by the network device, a plurality of runtime constraints comprising one or more of time, resource capacity, and bandwidth demand based on the network topology and the plurality of network configurations;
based on the plurality of runtime constraints, generating, by the network device, a runtime monitoring schedule that comprises at least a flow, a spot assigned for runtime monitoring of the flow, and a runtime monitoring rule to be applied at the assigned spot; and
monitoring, by the network device, the flow based on the runtime monitoring schedule at the assigned spot.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
identifying, by the network device, a plurality of equivalence classes by analyzing a plurality of data plane configurations associated with the intent-based network policy.

### Claim 3 (depends on 2)

The method of claim 2, wherein traffic flows belonging to each of the plurality of equivalence classes are associated with a same set of forwarding behaviors in the intent-based network.

### Claim 4 (depends on 2)

The method of claim 2, further comprising:
traversing, by the network device, the identified plurality of equivalence classes; and
obtaining, by the network device, pairwise reachability between endpoint groups in the intent-based network as represented by each equivalence class.

### Claim 5 (depends on 4)

The method of claim 4, further comprising:
aggregating, by the network device, a first subset of the plurality of equivalence classes along a first path into a first aggregated intent, wherein the first subset of the plurality of equivalence classes share at least a first common attribute.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
aggregating, by the network device, a second subset of the plurality of equivalence classes along a second and different path into a second aggregated intent, wherein the second subset of the plurality of equivalence classes share at least a second and different common attribute; and
aggregating, by the network device, the first aggregated intent and the second aggregated intent into a single high level aggregated intent.

### Claim 7 (depends on 5)

The method of claim 5, wherein the first common attribute comprises at least one of a common source address in the intent-based network and a common destination address in the intent-based network.

### Claim 8 (depends on 1)

The method of claim 1, wherein generating the runtime monitoring schedule that comprises at least the flow, the spot assigned for runtime monitoring of the flow, and the runtime monitoring rule to be applied at the assigned spot further comprises:
dividing a time period T into the number of spots available for runtime monitoring of the intent-based network policy; and
assigning a monitoring capacity to each location based on the plurality of runtime constraints by solving a plurality of indicator variables, each indicator variable indicating whether a particular intent is monitored at a particular time slot and whether a particular location is assigned to monitor the particular intent.

### Claim 9 (depends on 8)

The method of claim 8, wherein solving the plurality of indicator variables achieves at least one of (1) a first goal to monitor each intent-based policy frequently and for an equal amount of time period using a bin-packing calculation; and (2) a second goal to assign a weight based on real-time traffic volume and flow priority to each intent-based policy and to determine monitoring frequency based on a respective weight of each intent-based policy using a joint optimization mechanism.

### Claim 10

A network device comprising at least:
a memory;
a processor executing instructions in the memory to:
receive a network topology and a plurality of network configurations in an intent-based network;
determine a number of spots available for runtime monitoring of an intent-based network policy among a plurality of intent-based policy in the intent-based network;
determine a plurality of runtime constraints comprising one or more of time, resource capacity, and bandwidth demand based on the network topology and the plurality of network configurations;
generate a runtime monitoring schedule that comprises at least a flow, a spot assigned for runtime monitoring of the flow, and a runtime monitoring rule to be applied at the assigned spot based on the plurality of runtime constraints; and
monitor the flow based on the runtime monitoring schedule at the assigned spot.

### Claim 11 (depends on 10)

The network device of claim 10, wherein the processor further executes the instructions in the memory to:
identify a plurality of equivalence classes by analyzing a plurality of data plane configurations associated with the intent-based network policy.

### Claim 12 (depends on 10)

The network device of claim 10, wherein traffic flows belonging to each of the plurality of equivalence classes are associated with a same set of forwarding behaviors in the intent-based network.

### Claim 13 (depends on 11)

The network device of claim 11, wherein the processor further executes the instructions in the memory to:
traverse the identified plurality of equivalence classes; and
obtain pairwise reachability between endpoint groups in the intent-based network as represented by each equivalence class.

### Claim 14 (depends on 13)

The network device of claim 13, wherein the processor further executes the instructions in the memory to:
aggregate a first subset of the plurality of equivalence classes along a first path into a first aggregated intent, wherein the first subset of the plurality of equivalence classes share at least a first common attribute.

### Claim 15 (depends on 14)

The network device of claim 14, wherein the processor further executes the instructions in the memory to:
aggregate a second subset of the plurality of equivalence classes along a second and different path into a second aggregated intent, wherein the second subset of the plurality of equivalence classes share at least a second and different common attribute; and
aggregate the first aggregated intent and the second aggregated intent into a single high level aggregated intent.

### Claim 16 (depends on 14)

The network device of claim 14, wherein the first common attribute comprises at least one of a common source address in the intent-based network and a common destination address in the intent-based network.

### Claim 17 (depends on 10)

The network device of claim 10, wherein the processor further executes the instructions in the memory to:
divide a time period T into the number of spots available for runtime monitoring of the intent-based network policy; and
assign a monitoring capacity to each location based on the plurality of runtime constraints by solving a plurality of indicator variables, each indicator variable indicating whether a particular intent is monitored at a particular time slot and whether a particular location is assigned to monitor the particular intent.

### Claim 18 (depends on 17)

The network device of claim 17, wherein solving the plurality of indicator variables achieves at least one of (1) a first goal to monitor each intent-based policy frequently and for an equal amount of time period using a bin-packing calculation; and (2) a second goal to assign a weight based on real-time traffic volume and flow priority to each intent-based policy and to determine monitoring frequency based on a respective weight of each intent-based policy using a joint optimization calculation.

### Claim 19

A non-transitory machine-readable storage medium encoded with instructions executable by a processor of a computing device, the non-transitory machine-readable storage medium comprising instructions to:
receive a network topology and a plurality of network configurations in an intent-based network;
determine a number of spots available for runtime monitoring of an intent-based network policy among a plurality of intent-based policy in the intent-based network;
determine a plurality of runtime constraints comprising one or more of time, resource capacity, and bandwidth demand based on the network topology and the plurality of network configurations;
generate a runtime monitoring schedule that comprises at least a flow, a spot assigned for runtime monitoring of the flow, and a runtime monitoring rule to be applied at the assigned spot based on the plurality of runtime constraints; and
monitor the flow based on the runtime monitoring schedule at the assigned spot.

### Claim 20 (depends on 19)

The non-transitory machine-readable storage medium of claim 19, further comprising instructions to:
aggregate a first subset of the plurality of equivalence classes along a first path into a first aggregated intent, wherein the first subset of the plurality of equivalence classes share at least a first common attribute;
aggregate a second subset of the plurality of equivalence classes along a second and different path into a second aggregated intent, wherein the second subset of the plurality of equivalence classes share at least a second and different common attribute; and
aggregate the first aggregated intent and the second aggregated intent into a single high level aggregated intent.
