Trunk Group Selection Algorithm for Scalable Call Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional call routing systems face challenges in efficiently managing trunk groups, leading to unpredictable call placement due to high demand and the need for complex static configurations that do not scale well with the number of sites and varying PSTN connections.
Innovation Solution
Implementing a trunk group selection algorithm that dynamically assigns calls to groups based on caller-associated attributes, using trunk group placeholders to provide a dynamic search order and allow for flexible configuration, reducing the complexity of toll bypass relationships and enabling efficient use of centralized gateways.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If traditional static route group configurations are used, then call routing is simple to implement, but configuration complexity increases and scalability deteriorates as the number of sites and PSTN connections varies
Solution Approach 1:
The patent implements dynamic route group selection by triggering a trunk group selection algorithm in response to caller-associated attributes (such as location or extension), allowing the system to adaptively determine the appropriate trunk group at call time rather than using static pre-configured routes. This enables scalability across multiple sites and PSTN connections without proportionally increasing configuration complexity.
Solution Approach 2:
The patent introduces a trunk group placeholder as an intermediary element in the call routing configuration. This placeholder acts as a reference that resolves to an actual trunk group based on caller attributes, decoupling the routing logic from specific trunk group configurations and thereby reducing overall configuration complexity while maintaining adaptability.
2Reliability
If all available trunks are bundled together in a single trunk group, then call placement is simplified, but call reliability deteriorates when all trunks are in use by other callers
Solution Approach 1:
The patent segments the trunk pool into multiple trunk groups, each associated with specific caller attributes or locations. By triggering the selection algorithm based on caller-associated attributes, the system directs calls to appropriate segmented trunk groups, ensuring that callers have guaranteed access to available trunks within their designated group while maintaining overall system simplicity.
3Productivity
If dynamic trunk group selection based on caller attributes is implemented, then call routing efficiency and adaptability improve, but system complexity increases
Solution Approach 1:
The trunk group placeholder serves as a lightweight intermediary that enables dynamic trunk group selection without adding significant system complexity. The placeholder is resolved by the selection algorithm at call time based on simple caller attribute lookups, providing efficient and adaptive call routing while keeping the overall system architecture simple and maintainable.
Data Source
AI summary
In one embodiment, method can include: receiving an address in a call agent, the address being associated with a call; triggering a trunk group selection algorithm in response to at least a portion of the received address, the trunk group selection algorithm providing a selection result from among a trunk group placeholder and a plurality of trunk groups; and forwarding the call to a trunk group determined by a caller-associated attribute when the selection result comprises the trunk group placeholder.