Telephony control system with intelligent call routing

Patent No. US7269253 (titled "Telephony control system with intelligent call routing") on Mar 23, 2006. The application was issued on Sep 11, 2007.

What is this patent about?

’253 is related to the field of computer-integrated telecommunications and intelligent switching architectures. Specifically, it addresses the technical challenge of efficiently routing real-time communications, such as telephone calls in a call center environment, by moving complex decision-making logic from high-level management systems directly into the low-level switching infrastructure. This shift aims to reduce latency and communication overhead while maintaining high-quality service levels.

The underlying idea behind ’253 is to replace rigid, rule-based routing with a dynamic combinatorial optimization engine that operates at the telephony server level. Instead of simply matching a caller to the first available agent or using basic least-cost routing, the system treats the assignment of multiple incoming communications to multiple potential targets as a global optimization problem. By evaluating the entire pool of available resources and pending requests simultaneously, the system can maximize total utility rather than just solving for the next call in isolation.

The claims of ’253 focus on a system and method that receive a plurality of communications and determine an optimum target for each through a non-trivial combinatorial optimization. This process utilizes data structures representing characteristics of at least three potential targets—such as agent skill sets—and matches them against multiparametric vectors derived from the communication sources. The independent claims specifically protect the mechanism of pairing sources and targets to achieve a maximum utility outcome based on defined optimization criteria.

In practice, the invention functions by gathering caller data through identifiers like ANI/DNIS or interactive menus to build a call characteristic vector. This vector is then compared against a table of agent skill profiles using a cost-benefit algorithm that can account for diverse factors, including agent compensation, predicted call duration, and even the long-term value of using a specific call as a training exercise for a trainee agent. This allows the system to adapt its routing strategy based on current system load, prioritizing immediate efficiency during peak times and personnel development during slower periods.

This approach differs from prior solutions by integrating the “intelligence” of the routing decision—such as Bayesian logic or neural network evaluations—directly into the switching architecture rather than externalizing it to a separate CRM or management platform. By performing these calculations locally on the telephony host, the system eliminates the non-deterministic latencies associated with external database queries. Furthermore, by moving beyond simple FIFO queues to a global pairing model, it avoids the “hot seat” problem and ensures that specialized agents are reserved for the tasks that most require their specific expertise.

How does this patent fit in bigger picture?

Technical Landscape

In the early 2000s when ’253 was filed, real-time communications were typically implemented using dedicated hardware systems to ensure management and control operations did not impose inordinate delays on the communication process. At a time when computer-integrated telephony commonly relied on general-purpose computers to handle high-level control while offloading low-level voice channel switching to specialized peripheral boards, software constraints made the integration of complex, non-deterministic algorithms within the switching architecture non-trivial. Systems of this era typically externalized intelligent functions—such as skill-based routing or real-time optimizations—to separate high-level management servers to avoid impairing the real-time performance of the primary switching hardware.

Prosecution Position

The disclosed invention represents a meaningful technical advancement through the integration of intelligent control algorithms directly into the low-level communications management architecture. By partitioning the control over switching and intelligent functions (such as probabilistic calculations or fuzzy logic) within a consolidated platform, the system enables an architectural shift that allows for the inferential resolution of communication targets in real time. This integration overcomes the technical constraints of latency and bandwidth consumption associated with externalized management systems, enabling the system to resolve targets based on algorithmic definitions rather than static addresses. The resulting capability allows the switching system to perform complex agent-matching and cost-function optimizations locally, ensuring high-speed target resolution while reducing the transactional load on external databases.

Claims

This patent contains 21 claims, with claims 1, 10, and 21 serving as the independent claims. The independent claims focus on a communications control system and related methods that utilize combinatorial optimization to determine the most effective pairing between communication sources and at least three potential targets based on specific characteristics, classification information, and multiparametric vectors. The dependent claims further refine these processes by specifying the use of cost-utility functions, skill weights, discriminatory targeting perturbations, and the simultaneous processing of multiple communications to achieve maximum utility in call routing.

Key Claim Terms New

Definitions of key terms used in the patent claims.

Term (Source)Support for SpecificationInterpretation
Classification information
(Claim 10)
Calls are classified into 'call types' based on the dialed number, calling number, or caller responses to prompts. This information is used to predict the projected agent skill set required for the call. The classification may include preferred language, voice stress analysis, word cadence, accent, sex, and the nature of the call.Data associated with an incoming communication—such as ANI/DNIS, IVR responses, or predicted issues—used to define the requirements and characteristics of the call for routing purposes.
Combinatorial optimization
(Claim 1, Claim 10, Claim 21)
In the case of competing requests for allocation, the system selects an optimal pairing of respective multiple agents with multiple matters. Instead of selecting an optimal agent for a given matter, the system compares all cost functions for the matters in the queue with respect to each permissible pairing. This global optimization recomputes pairings as conditions change, such as when further calls are added to the queue or calls are completed.A mathematical process of finding an optimal pairing or grouping from a finite set of possibilities, specifically used here to match multiple incoming communications with the most suitable available targets (agents) simultaneously rather than in isolation.
Communication targets
(Claim 1, Claim 10, Claim 21)
Targets are accessible by the system with high-level definitions, which are contextually interpreted at the time of communications routing. The target of a communication is defined by an algorithm rather than a predetermined address. Agents are assigned metrics with respect to each skill, and the pool of agents is analyzed to determine the best target for a matter.The available entities, typically call center agents or automated systems, to which a communication can be routed based on their specific skill profiles and availability.
Maximum utility pairing
(Claim 21)
The optimization of agent selection is influenced by factors such as training opportunities, agent costs, and anticipated outcomes. All disparate factors are normalized into a common metric, 'cost' or 'value', which is then subject to numeric analysis to find the optimum. This pairing seeks to maximize the sum of weightings for required skills and agent scores while balancing opportunity costs.The selection of a specific source-target match that yields the highest calculated value based on a consolidated cost function, accounting for economic factors, agent skills, and long-term operational goals.
Multiparametric vectors
(Claim 21)
The profile includes a number of vectors representing different attributes, such as expertise in a skill and performance of the agent. These vectors relate to both the level of ability and the performance of the agent with respect to that skill. The system may update these vectors after each call based on call characteristic vectors, call outcome, duration, and chronological parameters.Data structures containing multiple distinct variables or 'skill vectors' that represent the diverse attributes, expertise levels, and performance metrics of a communication source or target.
Optimization criteria
(Claim 21)
Optimization may look at different parameters, such as call duration, revenues per call, or profit per unit time. It may also include training cost/benefit and caller hold time. These criteria are used to resolve the destination using an algorithm rather than an unambiguous target.The set of rules, weights, and cost functions used to evaluate the effectiveness of a potential match, including factors like call duration, profit, customer satisfaction, and agent training needs.
Potential communication targets
(Claim 1)
The pool of agents are analyzed to determine, based on predefined skills, which is the best agent for a matter. Targets may include in-house agents, freelance agents called upon dynamically during peak periods, or automated resolution systems. Each target is assigned a metric with respect to various skills in a skills inventory table.The pool of available resources, typically human agents or automated systems, that possess specific skill profiles and are eligible to handle a communication.

Litigation Cases New

US Latest litigation cases involving this patent.

Case NumberFiling DateTitle
1:25-cv-00026Jan 8, 2025Patent Armory Inc. V. Corkcicle, Llc

Patent Family

Patent Family

File Wrapper

The dossier documents provide a comprehensive record of the patent's prosecution history - including filings, correspondence, and decisions made by patent offices - and are crucial for understanding the patent's legal journey and any challenges it may have faced during examination.

  • Get instant alerts for new documents

US7269253

Application Number
US11387305A
Filing Date
Mar 23, 2006
Publication Date
Sep 11, 2007
External Links
Slate, USPTO , Google Patents