Network Traffic Routing Using Aggregability and Future Bandwidth

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional routing protocols and path computation mechanisms in telecommunications networks are not optimal for handling diverse traffic types and transport protocols, leading to inefficient resource allocation and bandwidth utilization.

Innovation Solution

A method and apparatus for allocating traffic flows in telecommunications networks that considers future bandwidth availability and traffic aggregability, using a gain function to select source and destination nodes and paths based on bandwidth availability for current and future requests, as well as the aggregability of traffic flows.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional routing protocols and path computation mechanisms are used, then network nodes can handle basic traffic forwarding, but resource allocation and bandwidth utilization become inefficient when handling diverse traffic types

Engineering Contradiction:
Improveresource allocation efficiencyVSAvoidhandling diverse traffic types
Core Design Contradiction:
ProductivityVSAdaptability or versatility

Solution Approach 1:

The patent implements dynamic path computation that adapts to different traffic types and conditions. The system computes optimal paths in real-time based on current network state, traffic characteristics, and future bandwidth availability, rather than using static traditional routing protocols. This allows the network to efficiently handle diverse traffic types including CPRI, eCPRI, and other protocols with different requirements.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The invention changes the parameters used for path selection from traditional metrics to include traffic-specific parameters, bandwidth availability forecasts, and aggregability metrics. By adjusting these parameters dynamically based on traffic type characteristics, the system optimizes resource allocation for each traffic type while maintaining overall network efficiency.

Inventive Principle:
Principle #35Parameter changes

2Adaptability or versatility

If network nodes configure ports in different modes to support various traffic types, then adaptability improves, but device complexity increases

Engineering Contradiction:
Improveport configuration flexibilityVSAvoidnode configuration complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent creates a universal path computation mechanism that works across multiple port modes and traffic types (CPRI, eCPRI, packet-switched, circuit-switched). Instead of requiring separate configuration mechanisms for each mode, a single intelligent system handles all traffic types by computing optimal paths based on their specific requirements, reducing overall node complexity while maintaining high adaptability.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The invention introduces an intermediary path computation system that sits between the diverse traffic types and the network infrastructure. This mediator translates different traffic type requirements into unified path selection decisions, simplifying the configuration burden on individual nodes while maintaining support for multiple traffic types and port modes.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Adaptability or versatility

If processing resources are distributed across different network nodes, then network flexibility improves, but selecting optimum locations for traffic flows becomes more difficult

Engineering Contradiction:
Improveprocessing resource distributionVSAvoidoptimal node selection complexity
Core Design Contradiction:
Adaptability or versatilityVSDifficulty of detecting and measuring

Solution Approach 1:

The patent implements a feedback mechanism where the path computation system continuously monitors network state, traffic patterns, and resource utilization across distributed nodes. This feedback loop enables the system to learn from past decisions and optimize future path selections, making it easier to identify optimal node locations for processing resources even as the network topology and resource distribution evolve.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The invention performs preliminary path computation and resource allocation decisions before traffic flows are established. By pre-computing optimal paths and identifying suitable processing node locations in advance based on forecasted bandwidth availability and current network state, the system simplifies the complexity of selecting optimum locations for distributed processing resources.

Inventive Principle:
Principle #10Preliminary action

4Productivity

If traditional path computation is used, then implementation is simple, but bandwidth availability for future requests and traffic aggregability are not optimized

Engineering Contradiction:
Improvebandwidth utilization efficiencyVSAvoidpath computation mechanism complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent performs preliminary path computation that incorporates forecasts of future bandwidth availability and identifies opportunities for traffic aggregation before making routing decisions. By looking ahead and preparing optimal paths in advance, the system maximizes bandwidth utilization efficiency without requiring complex real-time adjustments during traffic flow establishment.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS12519714B2Resource allocation using traffic aggregability and future bandwidth availability in a network
Publication Date: 2026.01.06 TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
  • US12519714B2 patent drawing
  • US12519714B2 patent drawing
  • US12519714B2 patent drawing

AI summary

Embodiments of the invention provides methods, apparatus, and media to allocate resources in a network. In one embodiment, the method comprises identifying a request to route a traffic flow based on a policy, and for the identified request, selecting a source and destination node from a plurality of alternatives, and a path between the source and destination nodes for the traffic flow. The source and destination nodes and the path are selected based on a gain function, where the selection comprises generating values of the gain function, each value being generated based on bandwidth availability for future bandwidth requests as well as aggregability of the traffic flow and other traffic flows determined using candidates from the plurality of node pair alternatives and the plurality of path alternatives. The method also includes routing the traffic flow between the selected source and destination nodes along the selected path in the network.