IP Address Allocation Minimizing Fragmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In a dynamic environment where Internet Protocol (IP) addresses are frequently allocated and deallocated, existing systems face challenges in minimizing fragmentation of IP addresses across multiple CIDR blocks, leading to difficulties in managing contiguous IP address allocation and increasing the complexity of firewall rules and denial of service attack protection.
Innovation Solution
The system allocates IP addresses by identifying a target block with the most contiguous unallocated addresses, splitting it into smaller blocks, and assigning these blocks to entities in a way that minimizes fragmentation, ensuring that IP addresses are expressed as contiguous addresses in as few CIDR blocks as possible, thereby simplifying firewall rules and enhancing security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If IP addresses are allocated and deallocated dynamically to entities, then the system adapts to changing computing needs, but IP address fragmentation increases making management complex
Solution Approach 1:
The patent segments the IP address management system into multiple CIDR blocks that can be independently allocated and deallocated. Each CIDR block represents a manageable unit of IP addresses, allowing the system to dynamically adjust allocations without creating unmanageable fragmentation. The segmentation principle is applied by dividing the overall IP address space into hierarchical blocks that can be efficiently tracked and managed.
Solution Approach 2:
The system performs preliminary actions by pre-organizing IP addresses into CIDR blocks before allocation occurs. This preliminary structuring allows for more efficient management during dynamic allocation and deallocation operations, as the system already has a organized framework in place rather than managing individual addresses from scratch.
2Productivity
If IP addresses are frequently allocated and deallocated, then the system responds to dynamic computing needs, but firewall rule complexity increases
Solution Approach 1:
The patent merges multiple individual IP address allocations into consolidated CIDR blocks. Instead of managing numerous individual IP addresses or small subnets, the system combines them into larger hierarchical blocks that can be represented by fewer firewall rules. This merging reduces the complexity of firewall configurations while maintaining the ability to respond dynamically to computing needs.
Solution Approach 2:
The CIDR block structure serves multiple functions simultaneously: it acts as an allocation unit, a management unit, and a firewall rule unit. This multi-functionality reduces the need for separate mechanisms to handle different aspects of IP address management, thereby simplifying firewall rule complexity while maintaining productivity.
3Productivity
If IP addresses are deallocated from entities, then resources are freed for reallocation, but fragmentation increases requiring more CIDR blocks
Solution Approach 1:
The patent implements a nested hierarchical structure where smaller CIDR blocks are contained within larger blocks. When IP addresses are deallocated, the system can efficiently manage the nested structure by identifying which nested blocks are no longer needed and consolidating them into parent blocks. This nesting approach reduces the total number of CIDR blocks required while maintaining efficient resource reallocation capabilities.
Data Source
AI summary
In certain embodiments, a system includes one or more memory units and one or more processing units. The memory units store blocks that each include a number of identifiers. The memory units include executable instructions that upon execution by the processing units cause the system to receive a request to allocate an identifier to an entity. The request includes data identifying the entity. A target block of identifiers is identified. The target block includes more unallocated identifiers than any other block. The target block is split into first and second blocks. The identifiers of the second block are each higher than any identifier of the first block. The second block is assigned to the entity, and a lowest identifier of the second block is allocated to the entity.