Query-Based Call Routing in Cooperative Telecommunication Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional cooperative telecommunication networks face issues with call routing due to outdated routing information, cumbersome number portability, and increased error chances from multiple copies of routing data, leading to mis-routed calls when extensions are moved between nodes.
Innovation Solution
A dynamic call routing methodology that determines if the called party is local, and if not, broadcasts a query message to all nodes to locate the called extension, allowing the sourcing node to set up a call to the appropriate node servicing that extension, eliminating the need for each node to have copies of all dialing plans.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If each node maintains a copy of the unified dialing plan, then call routing capability is improved, but routing information becomes outdated and errors increase when extensions are moved
Solution Approach 1:
The patent divides the centralized dialing plan into distributed location information across multiple nodes. Each node maintains only its own extension location information rather than a complete copy of the unified dialing plan, segmenting the routing knowledge base to prevent propagation of outdated information while maintaining individual routing capabilities.
Solution Approach 2:
The patent introduces a location service as an intermediary component that mediates between calling and called parties. When a node cannot locally resolve an extension, it queries the location service which provides real-time location information, acting as a mediator that ensures accurate routing without requiring each node to maintain complete routing tables.
2Reliability
If the unified dialing plan is updated at every node, then routing information remains current, but system complexity and update propagation time increase
Solution Approach 1:
The patent extracts the centralized update propagation function from individual nodes and consolidates it in the location service. When an extension moves, only the location service needs to be updated with the new location information, eliminating the complex multi-node update propagation process while ensuring all nodes can obtain current routing information through queries to the location service.
3Adaptability or versatility
If multiple copies of routing information are maintained, then each node has independent routing capability, but the chance of errors increases
Solution Approach 1:
The patent segments routing information into two types: local extension location information maintained independently by each node, and remote extension location information obtained on-demand from the location service. This segmentation allows nodes to maintain independence for local routing while reducing errors for remote routing by relying on the centralized location service.
Solution Approach 2:
The patent enables nodes to serve their own local routing needs by maintaining local location information for their own extensions, while for remote extensions they service themselves by querying the location service. This self-service approach maintains independent routing capability while minimizing error propagation.
Data Source
AI summary
A query message-based call routing mechanism for a limited access cooperative telecommunication network initially determines whether the called party is commonly located at the same node as the calling party. If not, the calling party node broadcasts a query message to all other nodes in the network to locate the called party. Only the node having local knowledge of the called extension will reply to the query message. Once the node sourcing the query message has received this reply message, it will place a call to the node servicing the called extension.