Dynamic Local Call Routing Matrix for Cost Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional telecommunications systems lack the ability to dynamically optimize local call routing based on current network and business conditions, often resulting in suboptimal routing costs and a lack of visibility into local call routing statistics, which hampers network management decisions.
Innovation Solution
A system and method that analyze local call routing by retrieving call detail records, associating area codes with attributes like cost and vendor types, and generating an optimal cost routing matrix to prioritize routes, enabling dynamic adjustment of network configurations for optimal routing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If hard coded static routing settings are used, then network configuration is simple and stable, but routing cost optimization and adaptability to current conditions are lost
Solution Approach 1:
The patent transforms static hard-coded routing settings into dynamic routing matrices that are generated and updated based on current network conditions, call statistics, and cost data. The routing matrix is continuously regenerated to reflect real-time changes in network performance and pricing, enabling the system to adapt routing decisions dynamically while maintaining manageable complexity through automated processes.
Solution Approach 2:
The system implements self-service by automatically collecting call detail records, analyzing routing statistics, calculating costs, and generating optimized routing matrices without requiring manual intervention. The network elements and electronic cost routing administrator work autonomously to provide visibility and optimization, reducing the need for manual configuration and monitoring while improving adaptability.
2Productivity
If manual route designation is used, then implementation is simple, but routing optimization and responsiveness to network dynamics are prevented
Solution Approach 1:
The patent implements feedback mechanisms by collecting call detail records from network elements and using this data to generate routing statistics and cost analysis. This feedback loop enables the system to continuously learn from actual routing performance and adjust routing matrices accordingly, significantly improving routing efficiency through data-driven decisions while maintaining reasonable automation levels.
Solution Approach 2:
The system performs preliminary actions by pre-calculating and storing routing matrices based on historical data and predicted cost scenarios. These pre-computed routing matrices are ready for immediate deployment when needed, enabling rapid response to network changes without requiring complex real-time calculations during call setup, thus improving productivity while managing automation complexity.
3Loss of information
If visibility into routing operations is not provided, then system complexity is reduced, but network management decision-making is hampered
Solution Approach 1:
The patent introduces an electronic cost routing administrator as an intermediary component that collects call detail records from multiple network elements, processes this data, and presents routing statistics and cost information in a unified manner. This intermediary layer provides comprehensive visibility into routing operations without requiring direct complex connections between all network elements, thus reducing information loss while managing system complexity.
Data Source
AI summary
A method includes gathering local call attributes from a call detail record capture utility, linking supplemental attributes to the local call attributes; and generating a local call report, which associates local call routes with a plurality of attributes. A system includes an electronic cost administrator operable to gather call detail records identifying a plurality of calls set up throughout a network and associate a cost with each identified call, a trunk group inventory storing a plurality of local trunk groups that calls can be terminated on, and a local call optimal cost routing matrix generator operable to retrieve selected call setup data from the electronic cost administrator, identify local calls using the trunk group inventory and generate an optimal cost routing matrix associating a plurality of local calls with local routes in a prioritized manner.