IP Library Granted Patent US 9,654,633
Granted Patent B2
US 9,654,633 · App. 15/151,477 · Granted May 16, 2017

Distributed constraint-based optimized routing of interactions

Inventors: Alan McCord (Frisco, TX); Brian R Galvin (Seabeck, WA)
Assignee: NewVoiceMedia, Ltd.
H04M3/5183G06Q30/01H04L41/0823H04L45/44H04L65/1023H04L65/1069H04L65/4084H04L65/80H04M3/5232H04M3/5238
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,654,633
App. No.
15/151,477
Granted
May 16, 2017
Kind
B2
Abstract

A system for optimized routing of interactions, comprising media servers, a statistics server, a routing database, and a routing server. Upon receiving or initiating an interaction, a media server sends a route request message to the routing server, the statistics server receives event notifications from the media servers and computes one or more statistics, and the routing server executes, using statistical data from the statistics server and data from the routing database, a routing script comprising a constraint-based optimization process in response to the route request message.

Claims (29)

1. A system for routing interactions, the system comprising:

a media server operating on a network attached computer and configured to handle interactions of one or more specific media types;

a routing server comprising a routing database and operating on a network-attached computer;

wherein upon receiving or initiating an interaction of a specific media type, the media server sends a route request message comprising at least an interaction identifier and a collection of interaction-specific data to the routing server;

wherein the routing server periodically executes, using data from the routing database, a routing script and sends routing instructions to the media server; and

wherein the routing script comprises at least the execution of a constraint-based optimization process that matches the plurality of interactions requiring routing to one or more of a plurality of resources that may handle interactions.

2. The system of claim 1 , wherein the constraint-based optimization process comprising the steps of:

(a) initializing parameters including global constraints; and

(b) for each time increment:

(i) computing a time to wait for each resource;

(ii) discarding resources whose time to wait exceeds a configured threshold;

(iii) determining a wait time for each interaction n;

(iv) computing an indicia of cost for a plurality of resource-interaction pairs;

(v) constructing a problem matrix; and

(vi) optimizing interaction distribution subject to problem constraints.

3. A method for constraint-based optimization of routing of interactions, the method comprising the steps of:

(a) receiving or initiating a plurality of interactions at a media server stored and operating on a network-attached computer;

(b) sending a plurality of route requests from the media server to a routing server stored and operating on a network-attached computer, the routing server comprising a routing database;

(c) periodically executing, at the routing server and using data from the routing database, a routing script, wherein the routing script comprises at least the setup and execution of a constraint-based optimization process that matches the plurality of interactions requiring routing to one or more of a plurality of resources that may handle interactions; and

(d) sending a plurality of routing instruction messages from the routing server to the media server comprising at least an interaction identifier and a target resource.

4. The method of claim 3 , wherein the constraint-based optimization process comprising the steps of:

(a) initializing parameters including global constraints; and

(b) for each time increment:

(i) computing a time to wait for each resource;

(ii) discarding resources whose time to wait exceeds a configured threshold;

(iii) determining a wait time for each interaction n;

(iv) computing an indicia of cost for a plurality of resource-interaction pairs;

(v) constructing a problem matrix; and

(vi) optimizing interaction distribution subject to problem constraints.

Assignments (4)
CHANGE OF NAME Recorded Feb 3, 2022
From: NEWVOICEMEDIA LIMITED
To: VONAGE BUSINESS LIMITED
Reel/Frame 058879/0481 →
CORRECTIVE ASSIGNMENT TO CORRECT THE RECEIVING PARTY PREVIOUSLY RECORDED AT REEL: 040665 FRAME: 0388. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Jun 12, 2018
From: GALVIN, BRIAN; MCCORD, ALAN
To: NEWVOICEMEDIA LTD.
Reel/Frame 046339/0209 →
SECURITY INTEREST Recorded Dec 21, 2017
From: NEWVOICEMEDIA LIMITED
To: SILICON VALLEY BANK
Reel/Frame 044462/0691 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 19, 2016
From: MCCORD, ALAN; GALVIN, BRIAN
To: NEWVOICEMEDIA, LTD.
Reel/Frame 040665/0388 →
Continuity (10)
Continuation 14754459 · Jun 29, 2015
Continuation 13835933 · Mar 15, 2013
Continuation In Part 13602048 · Aug 31, 2012
Continuation In Part 15151477 · May 10, 2016
Continuation 14754459 · Jun 29, 2015
Continuation 13835933 · Mar 15, 2013
Continuation In Part 13550587 · Jul 16, 2012
Continuation In Part 13357502 · Jan 24, 2012
Provisional Application 61607909 · Mar 7, 2012
Related Publication 20160255199A1 · Sep 1, 2016