Routing Table Computation Using Comparison Function
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing approaches for computing routing tables in communications networks are slow and inefficient, making it difficult to dynamically control and manage vast networks due to the scale of the problem, and often require approximations that do not account for optimal paths with respect to various attributes.
Innovation Solution
A node in the communications network computes routing tables using a path finding component and a comparison function derived from a best path definition of a routing protocol, which guides the search for optimal paths based on network topology and configuration data, allowing for efficient computation of routing tables that specify optimal pathways with respect to attributes such as bandwidth and processing capacity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional routing table computation methods are used, then routing tables can be computed, but the computation is slow and inefficient, making it difficult to dynamically control and manage vast networks
Solution Approach 1:
The patent segments the routing table computation problem by introducing a comparison function that evaluates paths based on multiple attributes independently. This allows the computation to be broken down into smaller, manageable comparisons rather than evaluating entire paths simultaneously, thereby improving computation speed and efficiency.
Solution Approach 2:
The patent changes the parameters used in path evaluation by introducing a comparison function that considers multiple attributes (bandwidth, processing capacity, latency, etc.) rather than relying on traditional single-metric routing. This parameter transformation enables more efficient computation by structuring the evaluation in a way that can be processed systematically.
2Measurement precision
If existing routing computation approaches are used, then routing tables can be generated, but they require approximations that do not account for optimal paths with respect to various attributes
Solution Approach 1:
The patent applies local quality by evaluating different path attributes locally at each comparison step rather than requiring global optimization. The comparison function assesses individual attributes (bandwidth, processing capacity, etc.) at each node and link, allowing precise determination of optimal paths without requiring complex global computations.
Solution Approach 2:
The patent performs preliminary action by pre-defining the comparison function with all necessary attribute evaluations before the actual routing computation begins. This preliminary setup includes establishing the criteria for comparing paths based on multiple attributes, which simplifies the subsequent computation and eliminates the need for complex approximations during runtime.
Data Source
AI summary
A communications network node has a memory storing information about the topology of a network, configuration data comprising attributes of the network, and information about a routing protocol of the network. The memory stores a comparison function derived from a best path definition of the routing protocol. A path finding component of the node computes, for an individual one of the nodes, a routing table specifying which neighbors of the individual node incoming data received at the individual node is to be routed to, where computing the routing table comprises searching for optimal paths between the nodes, using the information about the topology of the network and the configuration data, and using the comparison function to guide the search; and wherein optimal paths between the nodes are optimal with respect to one or more of the attributes.