# US 2020/0403926 A1 · Network Flow State Management for Connectionless Protocol(s)

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

- Number: US 2020/0403926 A1
- Document ID: US20200403926A1
- Status: Published application
- Kind: A1
- Application number: 16/447,833
- Filed: 2019-06-20
- Published: 2020-12-24
- Earliest claimed: 2019-06-20
- Assignees: Microsoft Technology Licensing, LLC
- Applicants: Microsoft Technology Licensing, LLC
- Inventors: Harish Kumar CHANDRAPPA; Milan DASGUPTA; Daniel Max FIRESTONE; Adarsh Kirnelli RANGAIAH
- Web page: https://patentgrep.com/patent/US20200403926A1

## CPC

- H04L 45/122: by minimising distances, e.g. by selecting a route with minimum of number of hops
- H04L 47/25: with rate being modified by the source upon detecting a change of network conditions
- G06F 9/45558: {Hypervisor-specific management and integration aspects}
- G06F 16/2255: {Hash tables}
- H04L 45/38: {Flow based routing}
- H04L 47/125: by balancing the load, e.g. traffic engineering
- H04L 47/286: {Time to live}
- H04L 47/29: {using a combination of thresholds}
- G06F 2009/45595: {Network integration; Enabling network access in virtual machine instances}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Described herein is a system and method for managing network flow state for ongoing flows (connectionless protocol flows and connection-based protocol flows) between client device(s) and a virtual machine using a flow collection data structure (e.g. hash table) having a predefined maximum quantity of ongoing flows that can be managed. When it is determined that the flow collection data structure is managing greater than an acceptable threshold of connectionless protocol flows, at a dynamically adjustable frequency, flow state for more connectionless protocol flow(s) having an unexpired time-to-live are expired. The frequency can be adjusted based upon a rate at which new flows are being created and/or a rate at which flows are being deleted. Also described herein is a system and method in which, at a particular frequency, only a portion of the flows in the flow collection data structure are evaluated in order to minimize impact on packet processing.

## Claims

### Claim 1

A system for managing network flow state, comprising:
a processor and a memory having computer-executable instructions stored thereupon which, when executed by the processor, cause the system to:
store, in a flow collection data structure, information regarding the flow states for a plurality of flows between one or more client devices and a virtual machine, wherein the flow collection data structure has a predefined maximum quantity of flows that can be managed, wherein the plurality of ongoing flows comprises connection-based protocol flows and connectionless protocol flows, each connectionless protocol flow having an associated time-to-live;
determine that the flow collection data structure is managing greater than a threshold of connectionless protocol flows; and
in response to the determination, decrease a time-to-live value for one or more connectionless protocol flows having an unexpired time-to-live.

### Claim 2 (depends on 1)

The system of claim 1, wherein the time-to-live value is decreased at a dynamically adjustable frequency that is adjusted based, at least in part, upon a rate at which new flows are being created.

### Claim 3 (depends on 2)

The system of claim 2, wherein the dynamically adjustable frequency is adjusted based, at least in part, upon a rate at which flows are being deleted.

### Claim 4 (depends on 1)

The system of claim 1,
wherein decreasing the time-to-live causes an early expiration of a flow state for the one or more connectionless protocol flows.

### Claim 5 (depends on 1)

The system of claim 1, wherein decreasing the time-to-live is based, at least in part, upon a percentage of utilization of the maximum quantity of ongoing flows of the flow collection data structure.

### Claim 6 (depends on 1)

The system of claim 1, wherein the connectionless protocol comprises UDP.

### Claim 7 (depends on 1)

The system of claim 1, wherein the flow collection data structure comprises a hash table indexed based upon a hash function of a packet header.

### Claim 8 (depends on 1)

The system of claim 1, wherein the information regarding the flow states stored in the flow collection data structure comprises an action to be taken regarding a packet associated with a particular flow of the plurality of flows.

### Claim 9

A method of performing network flow management, comprising:
storing, in a flow collection data structure, information regarding flow states for a plurality of flows between one or more client devices and a virtual machine, wherein the flow collection data structure has a predefined maximum quantity of flows that can be managed, wherein the plurality of ongoing flows comprises connection-based protocol flows and connectionless protocol flows, each connectionless protocol flow having an associated time-to-live;
determining that the flow collection data structure is managing greater than a threshold quantity of connectionless protocol flows;
in response to the determination, at a predetermined frequency:
evaluating only some of the connectionless protocol flows; and
decrease a time-to-live value for one or more connectionless protocol flows having an unexpired time-to-live.

### Claim 10 (depends on 9)

The method of claim 9, wherein a quantity of the evaluated connectionless protocol flows is predefined.

### Claim 11 (depends on 9)

The method of claim 9, wherein a quantity of the evaluated connectionless protocol flows is based upon a predefined period of time to perform the evaluation.

### Claim 12 (depends on 9)

The method of claim 9,
wherein decreasing the time-to-live causes an early expiration of a flow state for the one or more connectionless protocol flows.

### Claim 13 (depends on 9)

The method of claim 9, wherein decreasing the time-to-live is based, at least in part, upon a percentage of utilization of the maximum quantity of ongoing flows of the flow collection data structure.

### Claim 14 (depends on 9)

The method of claim 9, wherein the connectionless protocol comprises UDP.

### Claim 15 (depends on 9)

The method of claim 9, wherein the flow collection data structure comprises a hash table indexed based upon a hash function of a packet header.

### Claim 16

A computer storage media storing computer-readable instructions that when executed cause a computing device to:
store, in a flow collection data structure, information regarding flow states for a plurality of flows between one or more client devices and a virtual machine, wherein the flow collection data structure has a predefined maximum quantity of flows that can be managed, wherein the plurality of ongoing flows comprises connection-based protocol flows and connectionless protocol flows, each connectionless protocol flow having an associated time-to-live;
determine that the flow collection data structure is managing a threshold quantity of connectionless protocol flows:
in response to the determination, at a dynamically adjustable frequency:
evaluate a portion of the connectionless protocol flows; and
decrease a time-to-live value for one or more connectionless protocol flows having an unexpired time-to-live.

### Claim 17 (depends on 16)

The computer storage media of claim 16, wherein
adjusting the time-to-live causes an early expiration of a flow state for the one or more connectionless protocol flows.

### Claim 18 (depends on 16)

The computer storage media of claim 16, wherein the dynamically adjustable frequency is based, at least in part, upon a percentage of utilization of the maximum quantity of ongoing flows of the flow collection data structure.

### Claim 19 (depends on 16)

The computer storage media of claim 16, wherein the dynamically adjustable frequency is adjusted based, at least in part, upon a rate at which new flows are being created.

### Claim 20 (depends on 16)

The computer storage media of claim 16, wherein the dynamically adjustable frequency is adjusted based, at least in part, upon a rate at which flows are being deleted.
