Distributed Router Link Costing for Low-Latency Traffic Engineering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional communication network traffic engineering architectures rely on a centralized controller to calculate link costs and distribute them to routers, leading to increased network traffic and latency due to extensive data exchange, which can also raise privacy concerns.
Innovation Solution
Routers in the network calculate link costs independently using local condition information and algorithms, optionally with machine learning models, eliminating the need for a centralized controller and reducing data exchange.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a centralized controller calculates and distributes link costs to routers, then routing control and optimization can be achieved, but network traffic increases and latency worsens due to extensive data exchange
Solution Approach 1:
The patent segments the centralized link cost calculation function into distributed components at each router. Each router independently calculates link costs for its adjacent links using local condition information, eliminating the need for a centralized controller to compute and distribute costs across the entire network. This segmentation reduces network traffic and latency while maintaining routing control.
Solution Approach 2:
Routers perform self-service by independently calculating their own link costs using locally available condition information and algorithms. Each router autonomously determines optimal paths without relying on a centralized controller, thereby reducing network communication overhead and latency while maintaining effective routing control.
2Reliability
If a centralized controller distributes link costs to all routers, then routing optimization can be achieved, but the amount of network traffic generated increases significantly
Solution Approach 1:
The patent segments the link cost calculation process so that each router independently calculates costs for its own adjacent links rather than receiving centralized calculations. This eliminates the need for extensive data distribution across the network, significantly reducing network traffic while maintaining routing optimization through local decision-making.
Solution Approach 2:
Each router performs self-service by autonomously calculating link costs using local condition information stored at the router. This eliminates the need for a centralized controller to generate and distribute cost data across the network, thereby dramatically reducing network traffic while preserving routing optimization capabilities.
3Ease of operation
If routers exchange local condition information for link cost calculation, then distributed routing can be achieved, but privacy concerns arise due to sensitive data exposure
Solution Approach 1:
The patent extracts only the essential algorithm identifiers needed for distributed routing while removing sensitive local condition information from the exchange between routers. Each router retains its local condition data privately and only shares algorithm identifiers, thereby enabling distributed routing functionality without exposing sensitive network state information that would raise privacy concerns.
Data Source
AI summary
A communication network router comprises one or more processors and memory storing one or more programs for execution by the one or more processors, the one or more programs including instructions that cause the communication network router to: receive a first message from a first router of a plurality of routers of a communication network, the first message comprising a first algorithm identifier associated with a first link cost computation algorithm and a first set of local condition data corresponding to the first router; compute, based on the first set of local condition data, a first set of link costs using the first link cost computation algorithm; compute, based on the first set of link costs, a first set of loop-free paths through the communication network; and route at least one communication according to the first set of loop-free paths.