Distributed Constraints-Based Inter-Domain Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current inter-domain routing protocols, such as BGP, lack flexibility and scalability in handling Quality of Service (QoS) constraints, and existing methods often rely on manual configuration or centralized approaches that do not scale well with network changes.
Innovation Solution
A distributed constraints-based inter-domain routing technique where a source domain sends problem-solving requests to multiple network domains, allowing local path solutions to be generated and aggregated to find paths that satisfy QoS constraints like delay and bandwidth, utilizing a hybrid structure of distributed systems for inter-domain and centralized solvers for intra-domain routing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If centralized routing computation is used to satisfy QoS constraints, then routing accuracy is improved, but system scalability deteriorates
Solution Approach 1:
The patent divides the centralized routing computation into distributed constraint solvers deployed across multiple network domains. Each domain independently computes local paths satisfying QoS constraints, eliminating the single-point bottleneck while maintaining constraint satisfaction accuracy through coordinated distributed computation.
Solution Approach 2:
The patent transitions from a single-dimensional centralized computation model to a multi-dimensional distributed architecture where constraint solving occurs across multiple domains simultaneously. This dimensional expansion enables parallel processing of routing requests, improving scalability while preserving routing accuracy through inter-domain coordination.
2Ease of manufacture
If manual configuration is used for traffic engineering, then implementation simplicity is improved, but adaptability to network changes deteriorates
Solution Approach 1:
The patent implements automated constraint-based routing computation that self-adjusts to network changes without manual reconfiguration. The distributed solvers automatically detect and respond to topology changes, resource availability updates, and QoS requirement modifications, eliminating the need for manual intervention while maintaining implementation simplicity through standardized protocols.
Solution Approach 2:
The patent transforms the static manual configuration approach into a dynamic automated system where routing constraints and paths are continuously optimized based on real-time network conditions. The distributed constraint solvers dynamically adapt to network changes, providing both simplicity through automation and high adaptability to evolving network states.
3Area of stationary object
If inter-domain routing protocols like BGP are used, then routing coverage is improved, but QoS constraint handling capability deteriorates
Solution Approach 1:
The patent merges the broad routing coverage of BGP with enhanced QoS constraint handling capabilities by integrating constraint-based computation into the existing inter-domain routing framework. The distributed solvers work alongside BGP to provide both extensive routing coverage and sophisticated QoS constraint satisfaction, combining the strengths of both approaches.
Solution Approach 2:
The patent creates a universal routing system that handles both traditional routing functions and QoS constraint satisfaction through the same distributed constraint solver infrastructure. The system provides multi-functionality by supporting various QoS parameters (bandwidth, delay, jitter) and routing protocols (BGP, OSPF) within a unified framework, enhancing QoS capability without sacrificing routing coverage.
Data Source
AI summary
A distributed inter-domain constraints-based routing technique is provided herein. A problem solving request is sent to nodes in a plurality of network domains that have a potential path between a source node and the destination node. The problem solving request includes one or more constraints associated with a routing function for traffic between the source node and destination node. Local path solutions are generated at nodes in domains that receive the problem solving request, where the local path solutions representing possible paths from a previous neighbor network domain to a next neighbor network domain that satisfy the one or more constraints. Based on the local path solutions, a determination is made as to whether there is at least one path from the source node to the destination node that satisfies the one or more constraints.