# US 2025/0097192 A1 · System and method for ip address allocation based on binary tree

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

- Number: US 2025/0097192 A1
- Document ID: US20250097192A1
- Status: Published application
- Kind: A1
- Application number: 18/892,091
- Filed: 2024-09-20
- Published: 2025-03-20
- Earliest claimed: 2023-09-20
- Assignees: Alkira, Inc.
- Applicants: Alkira, Inc.
- Inventors: Shaival Rajan Shah
- Web page: https://patentgrep.com/patent/US20250097192A1

## CPC

- H04L 61/5007: Internet protocol [IP] addresses
- H04L 61/5061: Pools of addresses
- H04L 2101/668: Internet protocol [IP] address subnets
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present disclosure provides a system and a method for internet protocol (IP) address allocation. The system is configured to determine a height of a binary tree based on a size of an IP subnet. The binary tree comprises a plurality of levels and a plurality of nodes, each level of the plurality of levels includes at least one node of the plurality of nodes. The system is further configured to select a first set of nodes of the plurality of nodes to allocate the IP address for a first group. Each node of the first set of nodes belongs to a different level of the plurality of levels. The system is further configured to assign a second set of nodes of the plurality of nodes as free nodes in the binary tree. Each node of the second set of nodes belongs to the different level.

## Claims

### Claim 1

A system for internet protocol (IP) address allocation, the system comprising:
at least one non-transitory memory configured to store computer executable instructions; and
at least one processor configured to execute the computer executable instructions to:
determine a height of a binary tree based on a size of an IP subnet, wherein the binary tree comprises a plurality of levels and a plurality of nodes, and each level of the plurality of levels includes at least one node of the plurality of nodes;
select a first set of nodes of the plurality of nodes to allocate the IP address for a first group, wherein each node of the first set of nodes belongs to a different level of the plurality of levels; and
assign a second set of nodes of the plurality of nodes as free nodes in the binary tree, wherein each node of the second set of nodes belongs to the different level of the plurality of levels.

### Claim 2 (depends on 1)

The system of claim 1, wherein each node of the first set of nodes is a left child node of a parent node corresponding to a level of the plurality of levels of the binary tree.

### Claim 3 (depends on 2)

The system of claim 2, wherein each node of the second set of nodes is a right child node of the parent node corresponding to the level of the plurality of levels, and wherein each node of the second set of nodes corresponds to a node of the first set of nodes.

### Claim 4 (depends on 1)

The system of claim 1, wherein the at least one processor is further configured to allocate the IP address for the first group till a level of the plurality of levels at which a node of the plurality of nodes is assigned to the first group.

### Claim 5 (depends on 1)

The system of claim 1, wherein the at least one processor is further configured to utilize a first free node of the second set of nodes to initiate allocation of an IP address of a second group in the binary tree, and wherein a distance between the IP subnet of the first group and an IP subnet of the second group is maximum in the binary tree.

### Claim 6

A method for internet protocol (IP) address allocation, comprising:
determining a height of a binary tree based on a size of an IP subnet, wherein the binary tree comprises a plurality of levels and a plurality of nodes, and each level of the plurality of levels includes at least one node of the plurality of nodes;
selecting a first set of nodes of the plurality of nodes to allocate the IP address for a first group, wherein each node of the first set of nodes belongs to a different level of the plurality of levels; and
assigning a second set of nodes of the plurality of nodes as free nodes in the binary tree, wherein each node of the second set of nodes belongs to the different level of the plurality of levels.

### Claim 7 (depends on 6)

The method of claim 6, wherein determining the height of the binary tree comprises using a specific algorithm based on the size of the IP subnet.

### Claim 8 (depends on 6)

The method of claim 6, wherein selecting the first set of nodes comprises prioritizing nodes based on historical data of IP address usage.

### Claim 9 (depends on 6)

The method of claim 6, wherein assigning the second set of nodes as free nodes comprises implementing a priority system for free nodes based on their level in the binary tree.

### Claim 10 (depends on 6)

The method of claim 6, wherein each node in the second set of nodes is a direct sibling of a node in the first set of nodes.

### Claim 11 (depends on 6)

The method of claim 6, further comprising utilizing a first free node of the second set of nodes to initiate allocation of an IP address for a second group.

### Claim 12 (depends on 11)

The method of claim 11, wherein a distance between the IP subnet of the first group and an IP subnet of the second group is maximum in the binary tree.

### Claim 13 (depends on 6)

The method of claim 6, further comprising using a defragmentation algorithm to periodically reorganize the binary tree to reduce IP address fragmentation.

### Claim 14 (depends on 6)

The method of claim 6, further comprising implementing a forecasting model to predict future IP address requirements and reserving additional nodes in the binary tree for anticipated future needs.

### Claim 15

1A non-transitory computer-readable medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform a method for internet protocol (IP) address allocation, the method comprising:
determining a height of a binary tree based on a size of an IP subnet, wherein the binary tree comprises a plurality of levels and a plurality of nodes, and each level of the plurality of levels includes at least one node of the plurality of nodes;
selecting a first set of nodes of the plurality of nodes to allocate the IP address for a first group, wherein each node of the first set of nodes belongs to a different level of the plurality of levels;
assigning a second set of nodes of the plurality of nodes as free nodes in the binary tree, wherein each node of the second set of nodes belongs to a different level of the plurality of levels;
utilizing a first free node of the second set of nodes to initiate allocation of an IP address for a second group, wherein a distance between an IP subnet of the first group and an IP subnet of the second group is maximum in the binary tree; and
allocating multiple IP subnets for the same group based on availability when the binary tree has limited space, wherein the method is configured to reduce the number of IP address fragmentations.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein determining the height of the binary tree comprises using a specific algorithm based on the size of the IP subnet.

### Claim 17 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein selecting the first set of nodes comprises prioritizing nodes based on historical data of IP address usage.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein assigning the second set of nodes as free nodes comprises implementing a priority system for free nodes based on their level in the binary tree.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein each node in the second set of nodes is a direct sibling of a node in the first set of nodes.

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, further comprising utilizing a first free node of the second set of nodes to initiate allocation of an IP address for a second group.
