Distributed Routing Controller with Graph Search and Score Tolerance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication platforms face challenges in dynamically managing communication routing due to varying resource characteristics, failures, and changing operational conditions, which require a system that can prioritize communication properties like media quality and latency while balancing technical, business, and user considerations.
Innovation Solution
A method for prioritized communication routing that generates edge cost scores, assigns distribution values, sets score tolerance, and performs network graph searches to dynamically select optimal routes, considering multiple factors such as media quality, cost, and latency, and distributing traffic across multiple routes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If dynamic routing selection is implemented to improve communication quality and handle failures, then reliability and adaptability improve, but system complexity increases due to multiple routing factors and graph search operations
Solution Approach 1:
The patent introduces an intermediary routing system that mediates between communication endpoints and network resources. This intermediary layer implements graph search algorithms and routing factor calculations to select optimal paths, handling complexity internally while presenting a simplified interface to endpoints. The intermediary routing controller acts as a mediator that translates high-level communication requirements into detailed routing decisions.
Solution Approach 2:
The system implements feedback mechanisms by continuously monitoring routing factors such as media quality, latency, cost, and resource availability. The graph search algorithm uses this feedback information to dynamically adjust route selections, and the system learns from past routing outcomes to improve future decisions. Failed routes provide feedback that triggers alternative path selection.
2Manufacturing precision
If multiple routing factors are considered to improve communication quality, then media quality and latency performance improve, but computational requirements and processing time increase
Solution Approach 1:
The system changes parameters dynamically by adjusting routing factor weights and thresholds based on communication requirements and network conditions. The graph search algorithm modifies search depth and evaluation criteria according to available computational resources and time constraints, allowing flexible trade-offs between routing precision and computational effort.
Solution Approach 2:
The patent applies local quality by considering different routing factors at different stages of the routing decision process. Critical factors like media quality and latency receive higher weighting in the graph search evaluation, while less critical factors are considered with lower priority. This localized focus optimizes computational resources on the most important routing dimensions.
3Productivity
If traffic is distributed across multiple routes to balance resource utilization, then resource efficiency improves, but routing decision complexity increases due to distribution value calculations
Solution Approach 1:
The system implements dynamic routing distribution where traffic allocation across multiple routes is continuously adjusted based on real-time network conditions and routing factor changes. The graph search algorithm dynamically recalculates optimal distribution values when network state changes, allowing flexible resource utilization while adapting to varying loads and conditions.
Solution Approach 2:
The patent applies partial action by distributing traffic across a subset of available routes rather than attempting to optimize all possible paths simultaneously. The graph search algorithm selects a manageable number of candidate routes for distribution, balancing resource utilization efficiency with computational feasibility by focusing on the most promising paths.
4Reliability
If strict routing constraints are enforced to meet business requirements, then contractual obligation compliance improves, but routing flexibility and adaptability worsen
Solution Approach 1:
The system applies preliminary action by pre-configuring routing constraints and business rules before routing decisions are made. Contractual obligations and minimum service level requirements are established as preliminary filters in the graph search algorithm, ensuring compliance is built into the routing logic from the start rather than enforced as post-hoc restrictions.
Solution Approach 2:
The patent implements universality by designing a routing system that simultaneously handles multiple types of constraints and requirements through a unified graph search framework. The same algorithm accommodates diverse business rules, technical constraints, and quality requirements, making the system adaptable to different contractual obligations while maintaining compliance through consistent constraint enforcement.
Data Source
AI summary
A system and method for routing communication in a communication platform that includes generating edge cost scores in the communication network; assigning distribution values within the network; setting a score tolerance; receiving a communication directive; performing network graph search to identify a selected route through a route selection process including considering cost score within the score tolerance and distributing selection of a route associated with the communication directive in accordance to the distribution values; and establishing a media route specified by the selected route.