IP Subnet Allocation Optimization for Fragmentation Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current IP communications networks face inefficiencies in allocating subnets due to excessive fragmentation and unused addresses, as existing methods rely on ad-hoc heuristic approaches that do not optimize for power-of-two integer sizes, leading to suboptimal resource utilization and increased traffic routing inefficiencies.
Innovation Solution
The development of methods to determine an optimal set of resources for allocating subnets by using a cost function that balances excess addresses and resource fragmentation, employing power-of-two integer sizes, and restricting the maximal number of resources, which involves solving a relaxed problem and assigning demands to resources to achieve minimal combined cost.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If ad-hoc heuristic methods are used for subnet allocation, then implementation simplicity is maintained, but resource utilization efficiency deteriorates
Solution Approach 1:
The patent transforms the subnet allocation problem from a heuristic approach to an optimization-based approach by changing the fundamental parameter selection criteria. Instead of using ad-hoc rules, the system employs mathematical optimization models that consider multiple parameters simultaneously (subnet size, number of subnets, fragmentation levels) to achieve optimal resource utilization while maintaining automated implementation.
Solution Approach 2:
The patent replaces manual or heuristic allocation methods with automated optimization algorithms. The mechanical/manual process of subnet allocation is substituted with computational optimization models that automatically determine optimal allocation strategies, thereby improving resource utilization efficiency while maintaining ease of implementation through automation.
2Stability of the object's composition
If subnet size is increased to reduce fragmentation, then address block continuity improves, but excess unused addresses increase
Solution Approach 1:
The patent employs optimization models that dynamically adjust subnet allocation parameters (size, number, and distribution) to achieve the optimal balance between address block continuity and minimizing excess unused addresses. The mathematical models evaluate trade-offs between these competing parameters and select allocation configurations that optimize both objectives simultaneously.
Solution Approach 2:
The patent applies different allocation strategies to different nodes and demand patterns within the network. Instead of using a uniform subnet size across all nodes, the optimization models determine locally optimal subnet sizes and configurations based on specific node requirements, traffic patterns, and demand characteristics, thereby achieving continuity where needed while minimizing waste elsewhere.
3Productivity
If the number of subnets at a node is limited, then routing efficiency improves, but allocation flexibility deteriorates
Solution Approach 1:
The patent implements dynamic subnet allocation that adapts to changing network conditions and demands. The optimization models continuously evaluate current allocation states and adjust subnet configurations to maintain routing efficiency while responding to new demands. This dynamic approach allows the system to maintain fewer subnets for efficiency while preserving flexibility through real-time adaptation and reconfiguration capabilities.
Data Source
AI summary
Methods for allocating blocks of addresses to nodes in an IP communications network determine an optimal set of serving subnets, referred to as resources, for a single node in an IP communications network with given input demands for blocks of addresses. An optimal set of resources is determined at the node to a relaxed problem that aggregates all the demands to a single large demand and deletes the constraints that each demand must be assigned to a single resource. Each of the original demands is then assigned to a single resource from among those determined by the solution to the relaxed problem. The methods can also be used to allocate new resources to nodes that already have existing resources, and to allocate subnets at all nodes in a tree network by solving repeatedly single-node problems.