Dynamic Connection Capacity Reassignment in Multi-Tier Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing networked data processing systems face inefficiencies in utilizing transmission capacity due to connection-level prioritization, leading to underutilization when one priority class becomes saturated while others remain idle, and lack network-level prioritization on a per-processor basis.
Innovation Solution
A method for dynamically reassigning connection capacity between priority classes at the network layer in a multi-tier network system, allowing spare capacity from one class to be allocated to another as needed, and replicating this reassignment between second-tier systems to optimize transmission capacity utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If connection-level prioritization is implemented, then service level agreement traffic prioritization is provided, but network transmission capacity is underutilized when one priority class becomes saturated while others remain idle
Solution Approach 1:
The patent implements dynamic capacity reassignment where the capacity allocated to each priority class is not fixed but can be adjusted in real-time based on current traffic conditions. When a high-priority class approaches saturation, spare capacity from lower-priority classes is dynamically reassigned to it, and vice versa when the original high-priority class load decreases. This dynamic adjustment resolves the contradiction by maintaining reliable prioritization while maximizing overall capacity utilization.
Solution Approach 2:
The system changes the parameter of capacity allocation from static to variable. The capacity assigned to each priority class becomes a dynamic parameter that adjusts based on traffic saturation levels. This allows the system to maintain service level agreements while adapting capacity distribution to actual demand, preventing capacity underutilization when priority classes are not saturated.
2Reliability
If fixed capacity allocation to priority classes is used, then service level agreement prioritization is maintained, but overall network capacity is wasted when lower-priority classes have idle capacity while higher-priority classes are saturated
Solution Approach 1:
The patent makes capacity allocation dynamic rather than fixed. The system continuously monitors traffic saturation levels in each priority class and automatically reassures capacity from classes with spare capacity to classes approaching saturation. This dynamic approach ensures that service level agreements are maintained while minimizing wasted capacity, as capacity is reallocated based on actual demand rather than remaining statically assigned.
Solution Approach 2:
The system implements self-service capacity management where the network automatically detects saturation conditions and reallocates capacity without external intervention. When a priority class approaches saturation, the system autonomously transfers capacity from other classes, and when the original class load decreases, capacity is returned to its original allocation. This self-adjusting mechanism eliminates capacity waste while preserving service guarantees.
3Speed
If connection-level prioritization is enforced, then high-priority connections are serviced first, but all connections are treated equally after establishment without discrimination
Solution Approach 1:
The patent extends prioritization from static connection-level to dynamic packet-level discrimination. While connections are established with priority assignments, the system continuously applies prioritization rules to ongoing traffic based on current conditions. This allows the system to maintain speed advantages for high-priority connections while adding adaptability to discriminate and prioritize traffic dynamically throughout the connection lifecycle based on real-time network state.
Data Source
AI summary
A method, computer program product, and a data processing system for data prioritization in a multi-tier network system is provided. A server having a plurality of processors receives data from a client. A priority of the client is then identified. Responsive to identifying the priority, the data is queued in a queue of a first plurality of queues associated with a first processor of the plurality of processors. The queue is one of a plurality of queues associated with the first processor and is associated with the priority. Additionally, mechanisms for reassigning connection capacity from one priority class to another priority class at the network layer in a multi-tier network system is provided. As the capacity of connections of one priority class approaches saturation, spare capacity may be reassigned from another class to the priority class approaching saturation between the first-tier systems. Additionally, mechanisms for replicating or mirroring the connection capacity reassignment between second-tier systems is provided.