The present invention is directed generally to distributed contact centers and mechanisms for operating the same.
Contact centers are employed by many enterprises to service customer contacts. A typical contact center includes a switch and/or server to receive and route incoming packet-switched and/or circuit-switched contacts and one or more resources, such as human agents and automated resources (e.g., Interactive Voice Response (IVR) units), to service the incoming contacts. Contact centers distribute contacts, whether inbound or outbound, for servicing to any suitable resource according to predefined criteria. In many existing systems, the criteria for servicing the contact from the moment that the contact center becomes aware of the contact until the contact is connected to an agent are customer-specifiable (i.e., programmable by the operator of the contact center), via a capability called vectoring. Normally in present-day ACDs when the ACD system's controller detects that an agent has become available to handle a contact, the controller identifies all predefined contact-handling queues for the agent (usually in some order of priority) and delivers to the available agent the highest-priority oldest contact that matches the agent's highest-priority queue.
Originally, contact centers were designed as single site operations. In other words, all of the contact center resources such as servers, agents, managers, and the like were located at a single site. A single site contact center was relatively easy to manage because all of the resources were essentially in a common environment. When an agent became available, the server controlling workflow was apprised of the availability almost instantly and could monitor the contact and agent queues in real-time.
As businesses become global and contact center job outsourcing becomes a viable option to many companies, contact centers are beginning to grow into multiple site operations. The resources for a contact center may be redundantly provided at each site such that every site can operate autonomously and communication between sites is not a requirement for operation. However, providing fully redundant contact center sites can become costly when the only additional resource really required is contact center agents. For this reason, many multiple site contact centers share resources. For example, one site may have all of the resources to be a complete contact center, whereas another site only has contact center agents or other resources with specific skills. The complete contact center receives all incoming contacts and routes the contacts to the other site having only agents or specialized resources. Under this scenario, contact center agent status information has to be relayed from the remote site to the ACD at the complete contact center. In fact, it is often the case in multiple site call centers that large amounts of information about the agents, skills (services), queues, and other status information needs to be transmitted between sites. An example of such a geographically distributed call center is described in US Patent Application No. 20060067506 to Flockhart et al., the entire disclosure of which is hereby incorporated herein by reference.
Contact centers have also evolved to accommodate remotely located, telecommuting workers (e.g., remote contact center agents) that can be added to the contact center on a dynamic basis as demand requires.
Mechanisms have been developed to facilitate the efficient transmission of status and control information between geographically disparate call centers using codec tunneling. U.S. patent application Ser. No. 11/619,504 to Davis et al., the entire contents of which
incorporated herein by reference, describes how to utilize Session Initiation Protocol (SIP) and a Real-time Transport Protocol (RTP) to communicate data between separate communication elements. This particular patent application proposed to use the capabilities of SIP to find and connect two endpoints and establish an RTP session between the endpoints.
It has also been proposed to utilize conference call facilities to allow interested parties (e.g., distributed locations or devices) to dial into or connect with a secure conference call and then publish and subscribe to data which is published by other participants of the conference call. These mechanisms were first described in U.S. patent application Ser. No. 12/239,120 to Steiner et al., the entire contents of which are incorporated herein by reference. The use of a conference call structure allowed various locations in a contact center to efficiently disseminate status information with other interested parties without broadcasting to the entire contact center (unless every element in the entire contact center was subscribing to a particular conference).
Grid based-contact centers which leverage the above-discussed solutions have also been proposed in U.S. patent application Ser. No. 12/469,523 to Steiner, the entire contents of which are hereby incorporated herein by reference.
While useful in developing a distributed contact center, these above described solutions have yet to fully exploit the potential of a distributed contact center and particularly the ability to distribute work items in an ad-hoc fashion according to processing needs of the work item as well as processing availabilities and needs of contact center agents and other resources.
In accordance with at least some embodiments of the present invention a conference negotiation and bidding process for use in a distributed contact center architecture is provided. More specifically, each remote location in a distributed contact center is capable of generating bids and transmitting the details of such bids to the work item routing engine hosting a bidding-conference as well as other bidding locations (possibly by using the conference/RTP clearing house described in the '120 application). In accordance with at least some embodiments of the present invention, the bids
transmitted between remote locations or between a remote location and the work item routing engine via the RTP protocol. The bids may be transmitted in response to receiving a request for bids or unsolicited bids may also be generated and transmitted at a remote location. The request for bids may include various bid requirements parameters such as time, estimated wait time, cost per work item, and locality. These requirements may vary depending upon the nature of the work item(s) needing to be distributed among the remote locations. The bids themselves may include responses to the bid requirement parameters as well as other parameters that can be considered when making a work item distribution decision. This allows each bid to be specifically qualified to a particular request for bid.
Once bids are received at the work item routing engine, the routing engine is then capable of determining how to route work items within the distributed contact center based on the parameters defined in each bid. Routing decisions can be made in accordance with any defined business goals such as reduce costs, decrease wait time, increase overall contact center utilization, or increase customer satisfaction (e.g., try to route the work item to the location closest to the originator of the work item). Bids may also have time/value constraints, for instance, when the bidding is closed, when the work item must be finished, the “quality of work expected” etc. The routing engine can then apply policies to decide the best bid, (may not be the cheapest), that meets the contact center's defined goals.
Embodiments of the present invention allow work requests to be received at any location in a distributed contact center at which point the receiving location sends a status indicator to the other locations (e.g., work item received). This indication may be sent in the form of a status message transmitted via RTP. The other locations in the distributed contact center can respond to this with a bid as described above. Since utilization of the RTP protocol provides a way to quickly share status information between locations in a contact center, the amount of time that the work item waits for routing is relatively small. Also, bids may be sent to routing locations before a work item is actually received. In this configuration, bids are sent to the routing location as the desire of that location to receive work items changes, thereby changing its previous bid parameters.
As noted above, the bids may be shared among other bidding locations such that all locations are aware of current bid values. This increases competitively and promotes efficiency gains. There may, however, be instances where it is not desirable to share bid information between bidding locations. Rather, it may be desirable to send bids directly to the work item routing engine. This may also be facilitated by setting up a single communication channel between the bidding location and the routing location (as is described in the '504 application).
In accordance with at least some embodiments of the present invention, a method of operating a contact center is provided that generally comprises: receiving a contact at a work item distribution mechanism in a contact center, the contact center further comprising at least first and second remote sites in communication with the work item distribution mechanism;
receiving a first and second bid from the first and second remote sites, respectively, the first and second bids comprising bid parameters defining each site's ability or desire to process the contact;
analyzing, at the work item distribution mechanism, the bid parameters of the first and second bids;
determining, based on the analysis, that the bid parameters of the first bid satisfies a set of bid requirements associated with the contact more completely than the bid parameters of the second bid; and
routing the contact to the first remote site for processing by the first remote site.
In some embodiments, bidding information may be shared directly between a bidding entity and other bidding entities (e.g., the remote sites), rather than routing the information through a conference mechanism, although one skilled in the art will appreciate that the utilization of the conference mechanism to share bidding information will be the most efficient configuration in most cases. In accordance with at least some embodiments of the present invention, the bidding information may be provided to the work item distribution mechanism and/or other bidding entities via an RTP packet transmitted during an RTP session.
An RTP packet and header structure as well as the Real-time Transport Control Protocol (RTCP) is described more fully in US Patent Publication No. 20030120789 to Hepworth et al., the entire disclosure of which is hereby incorporated by reference. Although embodiments of the invention are described in connection with the use of RTP, it can be appreciated by one of skill in the art that a similar media transport protocol may be employed. Accordingly, as used herein “RTP” is understood to include any standardized or non-standardized packet format for delivering audio and/or video information over a packet switched network. Allowable protocols may include any multicast and/or unicast protocols used in streaming media systems. The protocols may be designed for real-time applications like RTP or they may be designed for non-real-time application. Moreover, RTP as discussed herein can include any past, present, or future version of RTP including Secure RTP (SRTP) and those versions and derivatives of RTP not yet contemplated.
As can be appreciated by one of skill in the art, a contact is understood herein to include voice calls, emails, chat, video calls, fax, Instant Messages (IMs), collaboration software, desktop sharing, conferences, and combinations thereof. Accordingly, a contact center may be equipped to handle any one or a number of the above-noted contact types.
These and other advantages will be apparent from the disclosure of the invention(s) contained herein. The above-described embodiments and configurations are neither complete nor exhaustive. As will be appreciated, other embodiments of the invention are possible utilizing, alone or in combination, one or more of the features set forth above or described in detail below.
As used herein, “at least one”, “one or more”, and “and/or” are open-ended expressions that are both conjunctive and disjunctive in operation. For example, each of the expressions “at least one of A, B and C”, “at least one of A, B, or C”, “one or more of A, B, and C”, “one or more of A, B, or C” and “A, B, and/or C” means A alone, B alone, C alone, A and B together, A and C together, B and C together, or A, B and C together.
The invention will be illustrated below in conjunction with an exemplary communication system. Although well suited for use with, e.g., a system using a server(s) and/or database(s), the invention is not limited to use with any particular type of communication system or configuration of system elements. Those skilled in the art will recognize that the disclosed techniques may be used in any computing application in which it is desirable to distribute contact center processing tasks.
The exemplary systems and methods of this invention will also be described in relation to analysis software, modules, and associated analysis hardware. However, to avoid unnecessarily obscuring the present invention, the following description omits well-known structures, components and devices that may be shown in block diagram form, are well known, are otherwise summarized.
For purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the present invention. It should be appreciated, however, that the present invention may be practiced in a variety of ways beyond the specific details set forth herein.
Once a contact is received at the servicing side 116 of the contact center 100, the contact is processed by one or more components at one or more of the sites 108a-N on the servicing side 116. In accordance with at least some embodiments of the present invention, a single site 108 may be separated from other contact center sites 108 by a substantial distance and may be in communication with such other sites 108 via a WAN-type connection. Alternatively, VPN connections may be established between the separated sites 108. In accordance with some embodiments of the present invention, each site 108 is in communication with at least one other site 108 via a specially created RTP communication tunnel. This results in the creation of a communication network that may have any number of different topologies. Examples of such topologies are described in detail, for example, in U.S. patent application Ser. No. 11/619,504. In some embodiments the sites 108 are separated by a large body of water such as an ocean. Thus, trans-continental communication networks must be employed to carry communications between separated sites 108.
As can be seen in
In addition, one or more of the sites 108, but not necessarily all of the sites, may be equipped with an ACD 204 or similar type of work item distribution mechanism. The ACD 204 may be provided with business logic and rules for determining how work items should be routed throughout the contact center 100. In accordance with at least some embodiments of the present invention, sites 108 may be adapted to transmit bids for work items to the ACDs 204 of other sites 108. Thus, each ACD 204 in the contact center 100 may be adapted to perform work item distribution functions in accordance with embodiments of the present invention. Specifically, one, two, three, or more ACDs 204 in a single contact center 100 may be configured to receive work item bids from other sites 108, compare said bids to each other and to contact processing requirements and business rules, then route work items among the resources 208 of each site 108. Accordingly, the ACD 204 may determine to keep some work items for local resources 208 while determining to send other work items to remote sites 108. In some embodiments, the site 108 may transmit a bid to itself on behalf of the local resources 208 for analysis by the local ACD 204.
In accordance with at least some embodiments of the present invention, the sites 108 may also be equipped with real-time media transportation modules 212. These modules 212 may be configured to enable the sites 108 to communicate bidding information and other state information to other sites 108 using real-time transport protocols. As one example, the real-time media transportation module 212 may comprise a formatter for generating and formatting RTP packets in accordance with RTP standards. Furthermore, the RTP media session between the various sites 108 may be negotiated using SIP control signaling or other known tunneling procedures.
Referring back to
Referring now to
In some embodiments it may be desirable not to share bids among the sites 108 so as to promote more competitive bidding from each of the sites 108.
In some embodiments, the ACD 204 or the site 108 at which bids are received may be responsible for determining if bids from one site 108 should be shared with another site 108. Thus, the site 108 which receives a plurality of bids from many sites 108 may selectively determine that some bids are going to be shared with a certain subset of bidding sites (possibly less than all of the bidding sites) while other bids are not shared with certain sites 108. The extent to which bids are shared with other sites may vary depending upon business goals and other administratively defined objectives.
With reference now to
Upon receiving a contact, the ACD 204 generates a work item corresponding to that contact (step 408). This work item may be automatically assigned to a contact center agent or other type of contact center resource 208 if such a resource is currently available. Otherwise, the work item is enqueued in a work item queue of the ACD 204 (step 416). The work item may comprise a virtual representation of the work to be performed in connection with servicing needs of the customer that escalated the contact and this work item may exist beyond the duration of the contact. For example, a customer may generate a contact which results in a work item being generated and then the customer may disconnect with the contact center until the work item has been picked up by an agent and processed by that agent, at which point the agent may attempt to re-connect with the customer.
The method also comprises a step of receiving or more bids for work items at the ACD 204 from one or more remote sites 108 (step 412). It should be appreciated that this particular step may occur before or after step 404, step 408 and/or step 416. Accordingly, the bids received from the various remote sites 108 may comprise bids for already enqueued work items and well as bids directed toward the desire to process work items generated in the future.
The method continues with the ACD 204 analyzing the bids received from the various remote sites 108 (step 420). In some embodiments the ACD 204 is configured to analyze the bids as they are received and if any of the parameters within a particular bid satisfies business goal parameters defining an acceptable bid, then the ACD 204 may be adapted to automatically route the work item and possibly the corresponding contact to the remote site from which the winning bid was received. In other embodiments, the ACD 204 may be configured to gather a plurality of bids and compare the parameters of each bid against all other collected bids to identify an optimal bid. More specifically, the parameters of each bid may be compared to either each other or to a set of bid requirements. Based on this comparison the ACD 204 may identify the bid which satisfies the set of bid requirements better than all other bids. Alternatively, or in addition, the ACD 204 may consider business logic when making a decision as to which bid is the winning bid. For example, the ACD 204 may attempt to optimize one or more global contact center performance parameters such as minimizing operating cost, maximizing customer satisfaction, minimizing wait time, maximizing agent utilization, and weighted combinations thereof (e.g., 60% effort to maximize customer satisfaction with a 40% effort to minimize operating cost). Accordingly, the ACD 204 may consider a number of different factors when identifying a winning bid or sets of bids (step 424).
After the ACD 204 has identified a winning bid or set of bids, the ACD 204 routes the work item(s) and potentially the contacts associated therewith (e.g., transferring a call, forwarding an email or text message, forwarding a voice message, or providing information for contacting the customer who escalated the contact) to the remote site or sites 108 whom presented the winning bid (step 428). Alternatively, or in addition, the agent can be moved to the work rather than moving the work to the agent. The method then returns to step 404.
Referring now to
After the bid requirement parameters are gathered, the ACD 204 retrieves the relevant business logic and rules that will also be used to govern work item routing decisions (step 512). The business rules and logic may be administratively programmed directly into the ACD 204 or they may be retrieved from a local data storage area. Alternatively, or in addition, the conference mechanism itself can be used to distribute the logic among a plurality of nodes. As noted above, the business rules or logic is an additional rule or set of rules that governs how the work item should be routed based on business goals and objectives of the contact center 100.
The method continues with the ACD 204 comparing the bid requirement parameters with each of the bid parameters received from the various remote sites 108 (step 516). In this step the ACD 204 is comparing bid parameters with common bid requirement parameters to determine if the bid satisfies that particular bid requirement parameter. As the parameters are compared each bid is given a score representing the number of bid requirement parameters that are satisfied. It may also be possible to award additional points to a particular bid if one of its parameters more than satisfies a particular bid requirement parameter (e.g., if a bid requirement parameter is must be processed in less than one minute and a bid parameter from a particular site 108 indicates an ability to process the work item in half of the required time). The rules used to determine whether a bid parameter more than satisfies a particular bid requirement parameter may be administratively provisioned and can vary from contact center to contact center or can vary over time. Alternatively, or in addition, a bid may be deducted points if one of its parameters does not satisfy a particular bid requirement parameter.
The comparison and scoring of the various bids continues until all bid requirement parameters have been compared with all gathered bid parameters. At this point the ACD 204 assigns match rankings to the remote sites 108 based on the satisfaction of bid requirement parameters (step 520). More specifically, the site 108 having the bid which received the most satisfaction points during the comparison step may be assigned the highest match ranking. The site 108 having the bid which received the second most satisfaction points during the comparison step may be assigned the second highest match ranking and so forth. This provides an ordered list of sites 108 that have been prioritized according to each site's 108 ability or desire to process a work item or set of work items.
Thereafter, the ACD 204 may also consider business logic and other optimization rule sets to achieve a final work item routing decision (step 524). In some embodiments the business logic and optimization rules may allow the ACD 204 to route the work item(s) to the site 108 having the highest match ranking. It could be possible, however, that some circumstances may cause the ACD 204 to select a lower ranking site 108 as a winning site 108 based on the fact that it more completely satisfies stated business goals. This particular step may be carried out by assigning a weighting to each sites 108 match score based on that site's 108 ability to satisfy business goals or optimization rules. After the sites have been analyzed in view of the business goals or optimization rules and the appropriate weighting values have been assigned to each site's score, the ordered list of sites may be reordered according to their new score values. At this point the highest ranking remote site 108 is the one that has satisfied both business goals and optimization rules as well as work item needs more fully than any other site (step 528). It may also be possible that multiple sites 108 have the same score, which means that all of the multiple sites 108 can be considered winning sites and candidates for winning at least a portion of the work items bid upon. This winning site or sites are then identified and the work items
routed by the ACD 204 accordingly.
While the above-described flowcharts have been discussed in relation to a particular sequence of events, it should be appreciated that changes to this sequence can occur without materially effecting the operation of the invention. Additionally, the exact sequence of events need not occur as set forth in the exemplary embodiments. The exemplary techniques illustrated herein are not limited to the specifically illustrated embodiments but can also be utilized with the other exemplary embodiments and each described feature is individually and separately claimable.
The systems, methods and protocols of this invention can be implemented on a special purpose computer in addition to or in place of the described communication equipment, a programmed microprocessor or microcontroller and peripheral integrated circuit element(s), an ASIC or other integrated circuit, a digital signal processor, a hard-wired electronic or logic circuit such as discrete element circuit, a programmable logic device such as PLD, PLA, FPGA, PAL, a communications device, such as a server, personal computer, any comparable means, or the like. In general, any device capable of implementing a state machine that is in turn capable of implementing the methodology illustrated herein can be used to implement the various communication methods, protocols and techniques according to this invention.
Furthermore, the disclosed methods may be readily implemented in software using object or object-oriented software development environments that provide portable source code that can be used on a variety of computer or workstation platforms. Alternatively, the disclosed system may be implemented partially or fully in hardware using standard logic circuits or VLSI design. Whether software or hardware is used to implement the systems in accordance with this invention is dependent on the speed and/or efficiency requirements of the system, the particular function, and the particular software or hardware systems or microprocessor or microcomputer systems being utilized. The analysis systems, methods and protocols illustrated herein can be readily implemented in hardware and/or software using any known or later developed systems or structures, devices and/or software by those of ordinary skill in the applicable art from the functional description provided herein and with a general basic knowledge of the communication arts.
Moreover, the disclosed methods may be readily implemented in software that can be stored on a storage medium, executed on a programmed general-purpose computer with the cooperation of a controller and memory, a special purpose computer, a microprocessor, or the like. In these instances, the systems and methods of this invention can be implemented as program embedded on personal computer such as an applet, JAVA®, or a domain specific language, as a resource residing on a server or computer workstation, as a routine embedded in a dedicated communication system or system component, or the like. The system can also be implemented by physically incorporating the system and/or method into a software and/or hardware system, such as the hardware and software systems of a communications device or system.
It is therefore apparent that there has been provided, in accordance with the present invention, systems, apparatuses and methods for administering a distributed contact center. While this invention has been described in conjunction with a number of embodiments, it is evident that many alternatives, modifications and variations would be or are apparent to those of ordinary skill in the applicable arts. Accordingly, it is intended to embrace all such alternatives, modifications, equivalents and variations that are within the spirit and scope of this invention.
Number | Name | Date | Kind |
---|---|---|---|
3689132 | Baker | Sep 1972 | A |
4163124 | Jolissaint | Jul 1979 | A |
4567323 | Lottes et al. | Jan 1986 | A |
4737983 | Frauenthal et al. | Apr 1988 | A |
4797911 | Szlam et al. | Jan 1989 | A |
4894857 | Szlam et al. | Jan 1990 | A |
5001710 | Gawrys et al. | Mar 1991 | A |
5097528 | Gursahaney et al. | Mar 1992 | A |
5101425 | Darland et al. | Mar 1992 | A |
5155761 | Hammond | Oct 1992 | A |
5164983 | Brown et al. | Nov 1992 | A |
5174700 | Sgarbi et al. | Dec 1992 | A |
5178898 | Juchem | Jan 1993 | A |
5206903 | Kohler et al. | Apr 1993 | A |
5210789 | Jeffus et al. | May 1993 | A |
5274700 | Gechter et al. | Dec 1993 | A |
5278898 | Cambray et al. | Jan 1994 | A |
5291550 | Levy et al. | Mar 1994 | A |
5299260 | Shaio | Mar 1994 | A |
5309513 | Rose | May 1994 | A |
5329579 | Brunson | Jul 1994 | A |
5335268 | Kelly, Jr. et al. | Aug 1994 | A |
5335269 | Steinlicht | Aug 1994 | A |
5390243 | Casselman et al. | Feb 1995 | A |
5436965 | Grossman et al. | Jul 1995 | A |
5444774 | Friedes | Aug 1995 | A |
5469503 | Butensky et al. | Nov 1995 | A |
5469504 | Blaha | Nov 1995 | A |
5473773 | Aman et al. | Dec 1995 | A |
5479497 | Kovarik | Dec 1995 | A |
5500795 | Powers et al. | Mar 1996 | A |
5504894 | Ferguson et al. | Apr 1996 | A |
5506898 | Costantini et al. | Apr 1996 | A |
5530744 | Charalambous et al. | Jun 1996 | A |
5537470 | Lee | Jul 1996 | A |
5537542 | Eilert et al. | Jul 1996 | A |
5544232 | Baker et al. | Aug 1996 | A |
5546452 | Andrews et al. | Aug 1996 | A |
5592378 | Cameron et al. | Jan 1997 | A |
5592542 | Honda et al. | Jan 1997 | A |
5594726 | Thompson et al. | Jan 1997 | A |
5606361 | Davidsohn et al. | Feb 1997 | A |
5611076 | Durflinger et al. | Mar 1997 | A |
5627884 | Williams et al. | May 1997 | A |
5642515 | Jones et al. | Jun 1997 | A |
5684872 | Flockhart et al. | Nov 1997 | A |
5684964 | Powers et al. | Nov 1997 | A |
5689698 | Jones et al. | Nov 1997 | A |
5703943 | Otto | Dec 1997 | A |
5713014 | Durflinger et al. | Jan 1998 | A |
5724092 | Davidsohn et al. | Mar 1998 | A |
5740238 | Flockhart et al. | Apr 1998 | A |
5742675 | Kilander et al. | Apr 1998 | A |
5748468 | Notenboom et al. | May 1998 | A |
5749079 | Yong et al. | May 1998 | A |
5751707 | Voit et al. | May 1998 | A |
5752027 | Familiar | May 1998 | A |
5754639 | Flockhart et al. | May 1998 | A |
5754776 | Hales et al. | May 1998 | A |
5754841 | Carino, Jr. | May 1998 | A |
5757904 | Anderson | May 1998 | A |
5790642 | Taylor et al. | Aug 1998 | A |
5790677 | Fox et al. | Aug 1998 | A |
5794250 | Carino, Jr. et al. | Aug 1998 | A |
5796393 | MacNaughton et al. | Aug 1998 | A |
5802282 | Hales et al. | Sep 1998 | A |
5818907 | Maloney et al. | Oct 1998 | A |
5825869 | Brooks et al. | Oct 1998 | A |
5828747 | Fisher et al. | Oct 1998 | A |
5838968 | Culbert | Nov 1998 | A |
5839117 | Cameron et al. | Nov 1998 | A |
5875437 | Atkins | Feb 1999 | A |
5880720 | Iwafune et al. | Mar 1999 | A |
5881238 | Aman et al. | Mar 1999 | A |
5884032 | Bateman et al. | Mar 1999 | A |
5889956 | Hauser et al. | Mar 1999 | A |
5897622 | Blinn et al. | Apr 1999 | A |
5903641 | Tonisson | May 1999 | A |
5903877 | Berkowitz et al. | May 1999 | A |
5905793 | Flockhart et al. | May 1999 | A |
5915012 | Miloslavsky | Jun 1999 | A |
5926538 | Deryugin et al. | Jul 1999 | A |
5930786 | Carino, Jr. et al. | Jul 1999 | A |
5937051 | Hurd et al. | Aug 1999 | A |
5937402 | Pandilt | Aug 1999 | A |
5940496 | Gisby et al. | Aug 1999 | A |
5940498 | Bardl | Aug 1999 | A |
5943416 | Gisby | Aug 1999 | A |
5948065 | Eilert et al. | Sep 1999 | A |
5960073 | Kikinis et al. | Sep 1999 | A |
5963635 | Szlam et al. | Oct 1999 | A |
5963911 | Walker et al. | Oct 1999 | A |
5970132 | Brady | Oct 1999 | A |
5974135 | Breneman et al. | Oct 1999 | A |
5974462 | Aman et al. | Oct 1999 | A |
5979117 | Fuller | Nov 1999 | A |
5982873 | Flockhart et al. | Nov 1999 | A |
5987117 | McNeil et al. | Nov 1999 | A |
5991392 | Miloslavsky | Nov 1999 | A |
5996013 | Delp et al. | Nov 1999 | A |
5999963 | Bruno et al. | Dec 1999 | A |
6000832 | Franklin et al. | Dec 1999 | A |
6011844 | Uppaluru et al. | Jan 2000 | A |
6038293 | Mcnerney et al. | Mar 2000 | A |
6044144 | Becker et al. | Mar 2000 | A |
6044205 | Reed et al. | Mar 2000 | A |
6044355 | Crockett et al. | Mar 2000 | A |
6049547 | Fisher et al. | Apr 2000 | A |
6052723 | Ginn | Apr 2000 | A |
6055308 | Miloslavsky et al. | Apr 2000 | A |
6064730 | Ginsberg | May 2000 | A |
6064731 | Flockhart et al. | May 2000 | A |
6084954 | Harless | Jul 2000 | A |
6088441 | Flockhart et al. | Jul 2000 | A |
6115462 | Servi et al. | Sep 2000 | A |
6151571 | Pertrushin | Nov 2000 | A |
6154769 | Cherkasova et al. | Nov 2000 | A |
6163607 | Bogart et al. | Dec 2000 | A |
6173053 | Bogart et al. | Jan 2001 | B1 |
6175564 | Miloslavsky et al. | Jan 2001 | B1 |
6178441 | Elnozahy | Jan 2001 | B1 |
6185292 | Miloslavsky | Feb 2001 | B1 |
6192122 | Flockhart et al. | Feb 2001 | B1 |
6215865 | McCalmont | Apr 2001 | B1 |
6226377 | Donaghue, Jr. | May 2001 | B1 |
6229819 | Darland et al. | May 2001 | B1 |
6230183 | Yocom et al. | May 2001 | B1 |
6233333 | Dezonmo | May 2001 | B1 |
6240417 | Eastwick et al. | May 2001 | B1 |
6259969 | Tackett et al. | Jul 2001 | B1 |
6263359 | Fong et al. | Jul 2001 | B1 |
6272544 | Mullen | Aug 2001 | B1 |
6275806 | Pertrushin | Aug 2001 | B1 |
6275812 | Haq et al. | Aug 2001 | B1 |
6275991 | Erlin | Aug 2001 | B1 |
6278777 | Morley | Aug 2001 | B1 |
6289969 | Outten et al. | Sep 2001 | B1 |
6292550 | Burritt | Sep 2001 | B1 |
6295353 | Flockhart et al. | Sep 2001 | B1 |
6353810 | Petrushin | Mar 2002 | B1 |
6356632 | Foster et al. | Mar 2002 | B1 |
6366668 | Borst et al. | Apr 2002 | B1 |
6389028 | Bondarenko et al. | May 2002 | B1 |
6389132 | Price | May 2002 | B1 |
6389400 | Bushey et al. | May 2002 | B1 |
6424709 | Doyle et al. | Jul 2002 | B1 |
6426950 | Mistry | Jul 2002 | B1 |
6427137 | Petrushin | Jul 2002 | B2 |
6430282 | Bannister et al. | Aug 2002 | B1 |
6434230 | Gabriel | Aug 2002 | B1 |
6449356 | Dezonno | Sep 2002 | B1 |
6449358 | Anisimov et al. | Sep 2002 | B1 |
6449646 | Sikora et al. | Sep 2002 | B1 |
6453038 | McFarlane et al. | Sep 2002 | B1 |
6463148 | Brady | Oct 2002 | B1 |
6463346 | Flockhart et al. | Oct 2002 | B1 |
6463415 | St. John | Oct 2002 | B2 |
6480826 | Pertrushin | Nov 2002 | B2 |
6490350 | McDuff et al. | Dec 2002 | B2 |
6535600 | Fisher et al. | Mar 2003 | B1 |
6535601 | Flockhart et al. | Mar 2003 | B1 |
6560330 | Gabriel | May 2003 | B2 |
6560649 | Mullen et al. | May 2003 | B1 |
6560707 | Curtis et al. | May 2003 | B2 |
6563920 | Flockhart et al. | May 2003 | B1 |
6597685 | Miloslavsky et al. | Jul 2003 | B2 |
6614903 | Flockhart et al. | Sep 2003 | B1 |
6650748 | Edwards et al. | Nov 2003 | B1 |
6697457 | Petrushin | Feb 2004 | B2 |
6704409 | Dilip et al. | Mar 2004 | B1 |
6707903 | Dilip et al. | Mar 2004 | B2 |
6744877 | Edwards | Jun 2004 | B1 |
6754333 | Flockhart et al. | Jun 2004 | B1 |
6766013 | Flockhart et al. | Jul 2004 | B2 |
6766014 | Flockhart et al. | Jul 2004 | B2 |
6785380 | Ribera | Aug 2004 | B2 |
6947543 | Alvarado et al. | Sep 2005 | B2 |
7035808 | Ford | Apr 2006 | B1 |
7035927 | Flockhart et al. | Apr 2006 | B2 |
7200219 | Edwards et al. | Apr 2007 | B1 |
7295669 | Denton | Nov 2007 | B1 |
7417989 | Doran | Aug 2008 | B1 |
7444139 | Welch et al. | Oct 2008 | B1 |
7500241 | Flockhart et al. | Mar 2009 | B1 |
7574736 | Salapaka et al. | Aug 2009 | B2 |
8116237 | Steiner et al. | Feb 2012 | B2 |
20020072618 | Afzali-Ardakani et al. | Jun 2002 | A1 |
20020178273 | Pardo-Castellote et al. | Nov 2002 | A1 |
20020194002 | Petrushin | Dec 2002 | A1 |
20030093465 | Banerjee et al. | May 2003 | A1 |
20030120789 | Hepworth et al. | Jun 2003 | A1 |
20030174830 | Boyer et al. | Sep 2003 | A1 |
20030177017 | Boyer et al. | Sep 2003 | A1 |
20040003046 | Grabelsky et al. | Jan 2004 | A1 |
20040203878 | Thomson | Oct 2004 | A1 |
20050071211 | Flockhart et al. | Mar 2005 | A1 |
20050071212 | Flockhart et al. | Mar 2005 | A1 |
20050071241 | Flockhart et al. | Mar 2005 | A1 |
20050071844 | Flockhart et al. | Mar 2005 | A1 |
20060015388 | Flockhart et al. | Jan 2006 | A1 |
20060067506 | Flockhart et al. | Mar 2006 | A1 |
20060098625 | King et al. | May 2006 | A1 |
20060173921 | Jalonen | Aug 2006 | A1 |
20070072618 | Freytsis et al. | Mar 2007 | A1 |
20070263787 | Dong et al. | Nov 2007 | A1 |
20070299680 | Fama et al. | Dec 2007 | A1 |
20080065902 | Spohrer et al. | Mar 2008 | A1 |
20080084831 | Sylvain | Apr 2008 | A1 |
20090238359 | Ely et al. | Sep 2009 | A1 |
20090279436 | Chin et al. | Nov 2009 | A1 |
20100080150 | Steiner et al. | Apr 2010 | A1 |
Number | Date | Country |
---|---|---|
2143198 | Jan 1995 | CA |
2174762 | Mar 1996 | CA |
102006031080 | Jan 2008 | DE |
0501189 | Sep 1992 | EP |
0740450 | Oct 1996 | EP |
0772335 | May 1997 | EP |
0829996 | Mar 1998 | EP |
0855826 | Jul 1998 | EP |
0863651 | Sep 1998 | EP |
0866407 | Sep 1998 | EP |
899673 | Mar 1999 | EP |
998108 | May 2000 | EP |
1091307 | Apr 2001 | EP |
1150236 | Oct 2001 | EP |
1643743 | Apr 2006 | EP |
2273418 | Jun 1994 | GB |
2290192 | Dec 1995 | GB |
WO 9607141 | Mar 1996 | WO |
WO 9728635 | Aug 1997 | WO |
WO 9856207 | Dec 1998 | WO |
Entry |
---|
U.S. Appl. No. 10/815,534, filed Mar. 31, 2004, Kiefhaber. |
U.S. Appl. No. 10/815,566, filed Mar. 31, 2004, Kiefhaber. |
U.S. Appl. No. 10/815,584, filed Mar. 31, 2004, Kiefhaber. |
U.S. Appl. No. 10/861,193, filed Jun. 3, 2004, Kiefhaber. |
U.S. Appl. No. 10/946,638, filed Sep. 20, 2004, Flockhart et al. |
U.S. Appl. No. 11/619,504, filed Jan. 3, 2007, Davis et al. |
U.S. Appl. No. 12/239,120, filed Sep. 26, 2008, Steiner et al. |
U.S. Appl. No. 12/469,523, filed May 20, 2009, Steiner. |
U.S. Appl. No. 12/545,386, filed Aug. 21, 2009, Flockhart et al. |
“Applications, NPRI's Predictive Dialing Package,” Computer Technology (Fall 1993), p. 86. |
“Domain Name Services,” available at http://www.psm.com/chapt09/chapt09.html, downloaded Mar. 31, 2003, 21 pages. |
“eGain's Commerce 2000 Platform Sets New Standard for eCommerce Customer Communications,” Business Wire (Nov. 15, 1999)., 3 pages. |
“Internet Protocol Addressing,” available at http://samspade.org/d/ipdns.html, downloaded Mar. 31, 2003, 9 pages. |
“Product Features,” Guide to Call Center Automation, CRC Information Systems, Inc., Tel-ATHENA, Sectional 5—Company C520, p. 95, 1992. |
“The Advantages of Load Balancing in the Multi-Call Center Enterprise,” Avaya Inc. White Paper (Feb. 2002), pp. 1-13. |
“The Dynamic Data Center”, The Burton Group, Jun. 11, 2008, pp. 1-30. |
“VAST™, Voicelink Application Software for Teleservicing®,” System Manager User's Guide, Digital Systems (1994), pp. ii, vii-ix, 1-2, 2-41 through 2-77. |
“When Talk Isn't Cheap,” Sm@rt Reseller, v. 3, n. 13 (Apr. 3, 2000), p. 50. |
“Call Center Software You Can't Outgrow,” Telemarketing® (Jul. 1993), p. 105. |
Ahmed, Sarah, “A Scalable Byzantine Fault Tolerant Secure Domain Name System,” thesis submitted to Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, Jan. 22, 2001, 101 pages. |
Avaya, Inc. Business Advocate Options, at http://www.avaya.com, downloaded on Feb. 15, 2003, Avaya, Inc. 2003. |
Avaya, Inc. Business Advocate Product Summary, at http://www.avaya.com, downloaded on Feb. 15, 2003, Avaya, Inc. 2003, 3 pages. |
Avaya, Inc., “Better Implementation of IP in Large Networks,” Avaya, Inc. 2002, 14 pages. |
Avaya, Inc., “Voice Over IP Via Virtual Private Networks: An Overview,” Avaya, Inc., Feb. 2001, 9 pages. |
Bellsouth Corp., “Frequently Asked Questions—What is a registrar?,” available at https://registration.belisouth.neU NASApp/DNSWebUI/FAQ.jsp, downloaded Mar. 31, 2003,4 pages. |
CentreVu Advocate Release 9 User Guide, Avaya Inc., 585-215-953, Issue 1 (Dec. 2000), pp. 1-210. |
Chavez, David, et al., “Avaya MultiVantage Software: Adapting Proven Call Processing for the Transition to Converged IP Networks,” Avaya, Inc., Aug. 2002, pp. 1-20. |
Coles, Scott, “A Guide for Ensuring Service Quality in IP Voice Networks,” Avaya, Inc., 2002, pp. 1-17. |
Dawson, “NPRI's Powerguide, Software Overview” Call Center Magazine (Jun. 1993), p. 85. |
DEFINITY Communications System Generic 3 Call Vectoring/Expert Agent Selection (EAS) Guide, AT&T publication No. 555-230-520 (Issue 4, Sep. 1995). |
Doo-Hyun Kim et al. “Collaborative Multimedia Middleware Architecture and Advanced Internet Call Center,” Proceedings at the International Conference on Information Networking (Jan. 31, 2001), pp. 246-250. |
Douglas W. Stevenson et al., “Name Resolution in network and Systems Management Environments,” available at http://netman.cit.buffalo.edu/Doc/Dstevenson/NR-NMSE.html, downloaded Mar. 31, 2003, 16 pages. |
E. Noth et al., “Research Issues for the Next Generation Spoken”: University of Erlangen-Nuremberg, Bavarian Research Centre for Knowledge-Based Systems, at http://www5.informatik.unierlangen.de/literature/psdir/1999/Noeth99:RIF.ps.gz 16 pages. |
Foster, Robin, et al., “Avaya Business Advocate and its Relationship to Multi-Site Load Balancing Applications,” Avaya, Inc., Mar. 2002, 14 pages. |
GEOTEL Communications Corporation Web site printout entitled “Intelligent CallRouter” Optimizing the Interaction Between Customers and Answering Resources., 1998, 6 pages. |
Hill, “Contact Center on Demand: An opportunity for telcos to be leaders in the grid-computing revolution,” Telephony Online, Jul. 2, 2003, pp. 1-5. |
John H.L. Hansen and Levent M. Arsian, Foreign Accent Classification Using Source Generator Based Prosodic Features, IEEE Proc. ICASSP, vol. 1, pp. 1-4, Detroit USA (May 1995). |
L.F. Lamel and J.L. Gauvain, Language Identification Using Phone-Based Acoustic Likelihood, ICASSP-94, 4 pages. |
Levent M. Arsian and John H.L. Hansen, Language Accent Classification in American English, Robust Speech Processing Laboratory, Duke University Department of Electrical Engineering, Durham, NC, Technical Report RSPL-96-7, revised Jan. 29, 1996. pp. 1-32. |
Levent M. Arsian, Foreign Accent Classification in American English, Department of Electrical Computer Engineering, Duke University, Thesis, pp. 1-218 (1996). |
MIT Project Oxygen, Pervasis, Human-Centered Computing (MIT Laboratory for Computer Science) (Jun. 2000) pp. 1-15. |
Presentation by Victor Zue, The MIT Ox90ygen Project, MIT Laboratory for Computer Science (Apr. 25-26, 2000) 9 pages. |
Number | Date | Country | |
---|---|---|---|
20110071879 A1 | Mar 2011 | US |