Dial Plan Parser State Machine for Fast Call Routing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current methods for manipulating dial plans in telecommunications networks are cumbersome, expensive, and require extensive computing resources, making them inefficient for fast and accurate pattern-matching.

Innovation Solution

A dial plan parser utilizing a state machine based on a dial plan configuration file, which applies call signaling data and includes rules for dial prefixes and suffix lengths, allowing for efficient parsing and routing of calls before the dialing is completed.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If current methods for manipulating dial plans are used, then call routing can be achieved, but computing resource consumption is excessive and processing speed is slow

Engineering Contradiction:
Improvecall routing speedVSAvoidcomputing resource consumption
Core Design Contradiction:
ProductivityVSUse of energy by moving object

Solution Approach 1:

The patent applies preliminary action by pre-processing the dial plan configuration file into a compiled state machine representation before actual call routing operations. The dial plan is transformed into a finite state machine with predefined states, transitions, and patterns during system initialization or configuration loading, so that during runtime, the gateway can efficiently match incoming call patterns against the pre-compiled state machine without performing complex parsing operations, thereby reducing computing resource consumption and improving processing speed

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent replaces the mechanical system of traditional dial plan manipulation methods with a state machine-based computational model. Instead of using conventional pattern-matching algorithms or rule-based systems that require extensive computing resources, the invention substitutes a finite state machine that uses predefined states and transitions to efficiently process dial patterns, achieving faster processing with reduced computational overhead

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Ease of operation

If traditional dial plan manipulation methods are used, then call routing is possible, but the process is cumbersome and expensive to implement

Engineering Contradiction:
Improvedial plan manipulation easeVSAvoidsystem implementation complexity
Core Design Contradiction:
Ease of operationVSDevice complexity

Solution Approach 1:

The patent applies self-service by enabling the system to automatically compile and process dial plan configurations without requiring manual intervention or complex setup procedures. The gateway automatically parses the dial plan configuration file, compiles it into a state machine representation, and maintains it for efficient querying, eliminating the need for manual configuration management and reducing operational complexity

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent changes the fundamental parameters of how dial plans are represented and processed. Instead of using traditional rule-based or table-driven approaches, the invention transforms the dial plan into a state machine model with defined states, transitions, and patterns. This parameter change simplifies the manipulation process by providing a unified framework for handling dial plan operations

Inventive Principle:
Principle #35Parameter changes

3Measurement precision

If extensive computing resources are allocated for dial plan processing, then pattern-matching accuracy can be maintained, but processing time increases and revenue is lost

Engineering Contradiction:
Improvepattern-matching accuracyVSAvoidcall routing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-compiling the dial plan configuration into a state machine structure with predefined patterns, states, and transitions before runtime operations. This pre-processing ensures that pattern-matching accuracy is maintained while enabling fast lookup and decision-making during actual call routing, thereby reducing processing time and minimizing revenue loss without sacrificing matching precision

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent applies dynamics by implementing a state machine that can dynamically transition between states based on incoming dial patterns. The state machine structure allows for efficient runtime adaptation and decision-making, maintaining high pattern-matching accuracy while enabling rapid processing through predefined transition paths and optimized state evaluations

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS8654966B2Method for dial plan parsing and a system incorporating the same
Publication Date: 2014.02.18 AUDIOCODES LTD
  • US8654966B2 patent drawing
  • US8654966B2 patent drawing
  • US8654966B2 patent drawing

AI summary

A method and system for a dial plan parser includes a state machine configured upon a dial plan to which is applied call signaling data, and a call routing module/switch to transfer a call to a next point.