Max-Min Fair Bandwidth Allocation Using Tiered Breakpoints

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing bandwidth allocation methods for achieving Max-Min fairness are computationally inefficient and imprecise, particularly when dealing with large numbers of users and limited resources, as they often require numerous iterations and are limited by the precision of the unit allocation size.

Innovation Solution

A procedure that allocates network bandwidth using predetermined breakpoints based on user maximum allocation tiers, where users are grouped by their maximum allocation information, allowing for efficient allocation of maximum allocations to users in lower tiers and fair allocation of remaining bandwidth to users in higher tiers, using breakpoint values calculated as products or sums of user allocations and differences, ensuring Max-Min fairness.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If existing iterative bandwidth allocation methods are used to achieve Max-Min fairness, then fairness objective is achieved, but computational efficiency deteriorates due to large number of iterations required

Engineering Contradiction:
ImproveMax-Min fairness achievementVSAvoidcomputational efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent segments users into different tiers based on their maximum allocation values. By grouping users with similar maximum allocations together, the system can process entire tiers simultaneously rather than iterating through individual users, dramatically reducing the number of computational iterations needed while maintaining Max-Min fairness.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent pre-calculates breakpoint values for each tier before the actual bandwidth allocation process. These breakpoints represent the cumulative bandwidth required to satisfy users in lower tiers up to their maximum allocations. By having these values predetermined, the system avoids repeated calculations during the allocation iterations, improving computational efficiency.

Inventive Principle:
Principle #10Preliminary action

2Measurement precision

If small unit bandwidth allocation is used in iterative methods, then allocation precision is limited, but computational iterations increase

Engineering Contradiction:
Improvebandwidth allocation precisionVSAvoidcomputational iterations
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent changes the fundamental parameter of allocation from small fixed units to tier-based breakpoint values. By using breakpoints that represent the exact bandwidth needed to satisfy users up to their maximum allocations, the system achieves high precision allocation without being constrained by small unit sizes, thereby reducing the number of iterations required.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent introduces breakpoint values as intermediary calculations that bridge the gap between user maximum allocations and actual bandwidth distribution. These breakpoints serve as pre-computed reference points that enable precise allocation decisions without requiring numerous small-step iterations, thus improving both precision and reducing computational time.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Reliability

If users are processed individually in allocation cycles, then Max-Min fairness can be achieved, but computational complexity increases with large number of users

Engineering Contradiction:
ImproveMax-Min fairnessVSAvoidcomputational complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent merges users into tiers based on their maximum allocation characteristics. By combining users with similar allocation profiles into the same tier, the system processes groups of users simultaneously rather than individually, reducing computational complexity while preserving the fairness guarantees through the tiered breakpoint mechanism.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS8089985B2Max-Min fair network bandwidth allocator
Publication Date: 2012.01.03 TELLABS OPERATIONS
  • US8089985B2 patent drawing
  • US8089985B2 patent drawing
  • US8089985B2 patent drawing

AI summary

Allocation of an amount of available bandwidth among a plurality of users of a computer network is provided. Each user has a maximum allocation of bandwidth. Tier information of a plurality of tiers is accessed. In the tier information, users are grouped according to maximum allocation. Tier information includes a breakpoint value of each tier. The available bandwidth is allocated in one example embodiment by (1) allocating the maximum allocations to users in tiers with breakpoint values less than or equal to the amount of available bandwidth, and (2) allocating remaining available bandwidth in a fair manner among remaining users, which are users in tiers with breakpoint values greater than the amount of available bandwidth. The breakpoint value of at least one tier is a minimum amount of bandwidth that must be allocated in a Max-Min fair manner among the plurality of users such that each user in the tier receives its maximum allocation of bandwidth.