Label Switching Network Routing via Policy-Constrained Path Sequences
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The growing Internet poses challenges due to fully allocated global IP address space, leading to issues such as increased network latency and inefficiencies in routing, as current technologies struggle to effectively manage the distinctions between names, addresses, and routes.
Innovation Solution
The implementation of methods and systems for routing based on a path-based protocol address, which involves identifying sequences of identifiers and policies to constrain data routing through multiple network paths, providing path information to ensure efficient data transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional IP addressing is used, then network infrastructure is simple, but address space is fully allocated and routing efficiency deteriorates
Solution Approach 1:
The patent segments the traditional flat IP address space into hierarchical levels (global routing prefix, subnet prefix, host identifier). This segmentation allows efficient use of address space while maintaining simple routing infrastructure at each level, resolving the contradiction between routing efficiency and addressing complexity.
Solution Approach 2:
The patent introduces a new dimensional structure to addressing by adding scope information and hierarchical levels to traditional IP addresses. This dimensional expansion enables better routing efficiency without proportionally increasing infrastructure complexity.
2Quantity of substance
If network grows larger, then capacity increases, but network latency increases
Solution Approach 1:
The patent applies local quality by making routing decisions based on locally available path information and policies at each network node, rather than relying on centralized control. This enables efficient local routing that reduces latency while supporting network growth.
Solution Approach 2:
The patent introduces dynamic path selection based on policies that can adapt to changing network conditions. The routing paths can be dynamically adjusted based on available resources and latency conditions, allowing the network to maintain performance as it grows.
3Productivity
If multiple routing paths are implemented, then routing efficiency improves, but path management complexity increases
Solution Approach 1:
The patent makes path information and routing policies universal by defining standardized formats and protocols for expressing multiple paths. This allows diverse routing scenarios to be managed using common mechanisms, improving efficiency without proportionally increasing management complexity.
Solution Approach 2:
The patent incorporates feedback mechanisms where network nodes exchange path information and routing policies to automatically optimize data transmission. This feedback-driven approach enables efficient multi-path routing while reducing manual path management complexity through automated decision-making.
Data Source
AI summary
In one embodiment, a non-transitory computer-readable media is provided for storing instructions, that when executed by one or more processors of a topology node, cause the topology node to: identify a first sequence of identifiers for data routing in a label switching network from a first node in the label switching network; identify a second sequence of identifiers for data routing in the label switching network from a second node in the label switching network; identify a policy for use in constraining data routing from the first node to a third node; include the first sequence of identifiers and the second sequence of identifiers in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the third node via a plurality of network paths that each include at least one node in the label switching network; and provide path information that identifies the third sequence of identifiers, for constraining data routing, according to the policy, to the third node via the second node.