Method and apparatus for identifying related contacts

Information

  • Patent Grant
  • 8391463
  • Patent Number
    8,391,463
  • Date Filed
    Friday, September 1, 2006
    18 years ago
  • Date Issued
    Tuesday, March 5, 2013
    11 years ago
Abstract
Systems and methods for identifying related contacts in a contact center are provided. In particular, contacts that are initiated by an agent or other resource after an earlier contact has been placed on hold or while the agent or resource is in an after-contact work state are determined to be associated with the earlier contact. Accordingly, associations within contacts can be identified and recorded. Furthermore, the identification of associations between contacts can be performed without requiring explicit recognition of relationships between the content of different contacts, and without relying on an agent to make accurate reports regarding relationships between contacts.
Description
FIELD OF THE INVENTION

The present invention relates to the association of contacts handled by a resource.


BACKGROUND

Various systems have been developed to allocate work among resources or agents associated with an enterprise. For example, automatic call distribution systems are available that are capable of distributing calls or other contacts to call or contact handling agents according to some predefined criteria. Enterprises would like to know the costs associated with serving and selling to their customers using contact handling agents. They also would like to know not just how their contact center agents spend their time, but what they are working on and who they are serving when they do that work. In addition, in order to meet service level targets, it is important that agents occupy themselves with work-related contacts or aftercontact work as fully as reasonably possible. Accordingly, it is desirable to account for how agents spend their time and for whom.


In this regard, it has been impractical or impossible for contact distribution systems to associate related contacts. Instead, contact distribution systems have been able to collect information about incoming contacts only, as the customer or other person initiating the contact will typically dial a number or sequence of numbers, or otherwise address their contact such that information regarding the nature of and/or reason for the contact can be determined. However, there has been no way to efficiently or accurately determine whether contacts initiated by an agent are associated with work-related contacts, or are not work-related. In particular, systems that have attempted to track contacts initiated by the agent that are available or that have been proposed depend on the agent to accurately enter information, or on complex speech recognition systems. Furthermore, although systems have had at least a limited capability to record agent contacts and allow later analysis of those contacts, interrelations between contacts are not shown by such systems.


SUMMARY

The present invention is directed to solving these and other problems and disadvantages of the prior art. According to embodiments of the present invention, each incoming contact received at a contact center and assigned to a resource for handling can be associated with later contacts initiated by the resource using proximity. In particular, when the next system action performed by a resource after placing a contact on hold or after terminating a contact and entering an after-contact work state comprises a contact initiated by the resource, the resource-initiated contact is associated with the previous incoming contact. This information is recorded to allow for the generation of reports that can indicate to a supervisor, administrator or other reviewing entity that the incoming call and the resource-initiated contact are related to one another. Accordingly, the time spent on a single matter can be more accurately tracked and accounted for.


In accordance with at least some embodiments of the present invention, an adjunct to a contact center is provided for determining whether contacts are related to one another and for recording information concerning determined relations. More particularly, the adjunct, hereinafter referred to herein as a related contact identification server, may execute an application comprising an algorithm for determining whether a set of contacts are related and whether information indicating that the set of contacts are related should be recorded. The application generally assumes that a contact initiated by a resource while a contact earlier received by that resource has been placed in a particular state is related to the earlier contact. Accordingly, the algorithm may be considered heuristic, in that it operates by assuming a relationship between such contacts. In accordance with further embodiments of the present invention, the received contact must be placed on hold or in an after-contact work state (also referred to as wrap-up state) in order for it to be associated with one or more contacts later initiated by the resource.


Accordingly, embodiments of the present invention relate two contacts together in a parent-child relationship by recognizing the parent as the last contact put on hold or the last contact terminated before an agent entered an after-contact work state before a new contact is initiated by the agent or party putting the parent on hold. The second contact is referred to as the child. A parent can have multiple children and a child can have multiple parents in the case where two contacts are merged, such as a meet-me conference. The algorithm is also recursive so that a child of a child has a parent who is the original contact. This information is stored with other information about the contact, such as who the parties are, when it took place, etc. In addition, a customer designation or other identifier can be attached to a party external to the contact center with respect to all contacts related via the parent-child relationship. In accordance with still other embodiments of the present invention, contacts are linked across media. For example, an agent working on an email can suspend the work to make a voice call to another agent. In this case, the email becomes the parent to the related voice call (the child).


These and other advantages and features of the present invention will become more apparent from the following description of illustrative embodiments of the invention, taken together with the drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of a communication arrangement incorporating a contact center in accordance with embodiments of the present invention;



FIG. 2 is a block diagram of a related contact identification server in accordance with embodiments of the present invention; and



FIG. 3 is a flow diagram illustrating a process for associating contacts in accordance with embodiments of the present invention.





DETAILED DESCRIPTION


FIG. 1 is a block diagram of an illustrative contact center 100 such as may be used in accordance with embodiments of the present invention. The contact center 100 generally includes an automatic contact (or call) distribution system (ACD) 104 interconnected to a plurality of agent positions or workstations 108. The ACD system 104 is illustratively the MultiVantage™ Enterprise Communications System based ACD system available from Avaya Inc. Each agent workstation 108 includes a voice and/or data terminal for use by a corresponding agent in handling contacts. In addition to the agent workstations 108, one or more administrator workstations 110 may be included in or associated with the contact center 100. The agent workstations 108 and administrator workstations 110 may be connected to the ACD system 104 by a voice and/or data transmission medium or network 112. Also connected to the ACD system 104 is a related contact identification system or server 116 that serves as an adjunct to the ACD system 104 and that monitors contacts and determines whether a set of contacts are related to one another, as described herein. The related contact identification system 116 also gathers contact records and information concerning determined relations for recording or storage in a contact information database 120.


The ACD system 104 generally functions to connect agent workstations to communication devices or endpoints 124, also referred to herein as external communication endpoints 124, through a communication network 128. Examples of external communication endpoints 124 include voice telephony devices, such as plain old telephone system (POTS) telephones and Internet protocol (IP) telephones. Other examples of external communication endpoints 124 include video phones and devices capable of supporting textual communications, such as email, instant messaging or text messaging communications.


The communication network 128 may comprise one or more networks of one or more types. For example, the communication network 128 may comprise the public switched telephony network (PSTN), and/or an Internet protocol network, such as the Internet.



FIG. 2 is a block diagram depicting a related contact identification system or server 116 in accordance with embodiments of the present invention. The components may include a processor 204 capable of executing program instructions. Accordingly, the processor 204 may include any general purpose programmable processor or controller for executing application programming. Alternatively, the processor may comprise a specially configured application-specific integrated circuit (ASIC). The processor 204 generally functions to run programming code implementing various functions performed by the related contact identification server 116. For example, such functions may include the identification of related contacts and the recording and/or reporting of related contacts associated with a contact center 100.


A related contact identification server 116 may additionally include memory 208 for use in connection with the execution of programming by the processor 204, and for the temporary or long term storage of data or program instructions. For example, the memory 208 may be used in connection with the operation of a related contact identification application. The memory 208 may comprise solid state memory resident, removable or remote in nature, such as DRAM and SDRAM. Where the processor 204 comprises a controller, the memory 208 may be integral to the processor 204.


In addition, various user input devices 212 and user output devices 216 may be provided. Examples of input devices 212 include a microphone, keyboard, numeric keypad, scanner and pointing device combined with a screen or other position encoder. Examples of user output devices 216 include a speaker, alphanumeric display, ringer, printer port, compact flash or other removable memory port, and a printer. In general, user input 212 and user output devices 216 are used by an administrator or manager to configure the related contact identification server 116. Although the user inputs 212 and outputs 216 are shown as being directly connected to the related contact identification server 116, it should be appreciated that an administrator or manager may alternatively or additionally access the related contact identification server 116 remotely, for example through an agent workstation 108 or through an administrator workstation 110.


A related contact identification server 116 may also include data storage 220 for the storage of application programming and/or data. For example, operating system software 224 may be stored in the data storage 220. The related contact identification server 116 also generally includes a related contact identification application 228 stored in the data storage 220. The related contact identification application 228 generally provides the instructions that are executed in order to identify related contacts and to provide information related to those contacts to the contact information database 120, or to otherwise create a record of related contacts. Furthermore, although embodiments of the present invention implement a related contact identification algorithm described herein through execution of programming code provided as part of a related contact identification application 228, other embodiments may execute instructions that are stored as firmware or that is encoded in logic circuits in order to implement the related contact identification algorithm.


A related contact identification server 116 in accordance with embodiments of the present invention may also include one or more communication network interfaces 232. Examples of communication network interfaces 232 include a packet data network interface such as a wired or wireless Ethernet interface, or a Fibre channel interface. For example, the related contact identification server 116 may be interconnected to the ACD system 104 by an Ethernet or other IP connection. As a further example, the related contact identification server 116 may be interconnected to the contact information database 120 by a Fibre channel interface. A related contact identification server 116 may additionally include a communication bus 236 to allow communications between the various components of the device.



FIG. 3 is a flow chart illustrating aspects of the operation of a contact center 100 incorporating a related contact identification system or server 116 or other system, implementing or running a related contact identification algorithm, such as a related contact identification application 228, as described herein. Initially, the related contact identification application is activated to monitor activity on at least one workstation 108 associated with the contact center 100 (step 300). Activation may comprise enabling or running the related contact identification application for all or a selected subset of the agents associated with the contact center by selecting all or some of the agent workstations 108 included in the contact center 100. In order to simplify the description, it will be assumed that a single agent workstation 108 has been selected for monitoring for related contacts. However, it should be appreciated that embodiments of the present invention are not limited to monitoring a single agent workstation 108, and instead may monitor all or a number of workstations 108.


At step 304, a determination is made as to whether an agent is signed into the monitored workstation 108. If an agent is not signed into the workstation 108, the process may idle at step 304. Once it is determined that an agent has signed into a monitored workstation 108, a determination is made as to whether an incoming or outgoing contact has been routed to or is associated with that workstation 108 (step 308). If the workstation 108 has received a contact, the contact is connected to the agent at the workstation 108 (step 312). Connecting a contact to the agent at the workstation 108 can comprise, for example, the agent choosing to accept an incoming telephone call by pressing an appropriate key or button, by lifting a telephone handset, or being automatically connected to a call by the system. Other examples of connecting a contact to an agent include the agent selecting and reading an incoming message comprising text, such as an e-mail or text messaging system message; a web chat session; or an outgoing contact initiated by a predictive dialer. At step 316, information characterizing the contact is collected. Collecting information may include associating information derived from entries made by a party initiating the contact. For example, a typical call center will have different telephone numbers or menu items under a telephone number that are associated with particular categories of inquiry or topics. Accordingly, knowledge of the number or numbers that were dialed in connection with initiating an incoming contact can be used to gain information about the contact. Other information may be captured separately from the number or numbers that were dialed. For instance, caller identification information may be captured. Furthermore, although the dialing of telephone numbers has been used as an example, it should be appreciated that embodiments of the present invention are not be limited to contacts comprising telephone calls. Instead, information characterizing contacts comprising textual communications can be collected. For example, information entered by the party initiating the contact as part of completing a contact request form or derived from an address for the message used by the initiating party can be used to characterize an incoming contact. Information regarding the agent can also be collected and associated with information regarding the contact. As can be appreciated by one of skill in the art, collecting information can include storing information, for example in a contact information database 120.


At step 320, a determination is made as to whether the agent at the workstation 108 has placed the contact on hold or suspended it. In general, a contact may be placed on hold by suspending the immediate entry of communication data (e.g. speech or text) but without terminating the contact. Accordingly, placing a contact on hold can comprise selecting a hold state with respect to the contact, or simply keeping a chat window or session open while not actively reading or responding to a received message. A contact can also be considered on hold or suspended for purposes of identifying related contacts by placing a contact in a “preview” state and then placing another contact.


If it is determined at step 320 that the incoming contact has not been placed on hold, a determination may next be made as to whether the agent at the workstation 108 has selected an after-contact work state (step 324). As can be appreciated by one of skill in the art, an agent in a call center may enter an after-contact work state when performing work related to a previous contact. In a conventional call center, an after-contact work state allows an agent to avoid being assigned to handle new contacts while the agent is performing work related to a previous contact. In accordance with embodiments of the present invention, the after-contact work state is also used to determine whether two contacts are related to one another, as described herein.


After a determination at step 320 that the incoming contact has been placed on hold or after a determination at step 324 that the agent has selected an after-contact work state, a determination is next made as to whether the agent at the monitored workstation 108 has initiated a new contact (step 328). In particular, if the agent initiates a new contact while a previous contact is on hold or while the agent is in an after-contact work state, the agent-initiated contact is considered or determined to be related to the earlier contact that is on hold or to the contact associated with the agent's after-contact work state. More particularly, the contact on hold or that was last handled by an agent in an after-contact work state is considered to be the parent of a child comprising the agent-initiated contact. Accordingly, after making a determination that an agent has initiated a contact while an earlier contact is on hold or while the agent is in an after-contact work state, information characterizing the agent-initiated contact is collected and the agent-initiated contact is shown as being associated with or related to (i.e. a child of) the contact on hold or that was active immediately prior to entering the after-contact work state (step 332). Furthermore, the collected information and the determined associations between contacts are recorded, for example in the contact information database 120. In accordance with embodiments of the present invention, an ‘identifier,’ such as a customer designation, can be assigned to related contacts. As a result, the total time and cost related to particular customers or customer engagements can be computed and reported.


After collecting and recording information at step 332, or after determining that a contact has not been placed on hold or that an after-contact work state has not been entered, a determination may be made as to whether all contacts associated with the network workstation and/or after-contact work states have been terminated (step 336). If any contacts remain active, the process may return to step 320. Accordingly, embodiments of the present invention may determine that more than two contacts are associated with one another. If it is determined at step 336 that all associated contacts or after-contact work states have been terminated, or if it is determined at step 308 that there is no new contact, a determination may next be made as to whether the agent has signed off the monitored workstation 108 (step 340). If the agent has not signed off, the process may return to step 308, to wait for a new contact. If the agent has signed off of the workstation 108, the process may end. Accordingly, it can be appreciated that embodiments of the present invention can continuously or substantially continuously monitor for related contacts and record information concerning contacts that are determined to be related.


Where two contacts are merged, such as in a meet-me conference, a child can have multiple parents. Furthermore, multiple generations of related contacts can be tracked by embodiments of the present invention. Moreover, a child comprising a contact initiated from a first workstation to a second workstation can be the parent of a contact initiated by the second workstation. In addition, a second contact initiated by a first workstation 108 can continue to be tracked as being associated with a first contact that was placed on hold or suspended or associated with an after-contact work state when the second contact was initiated, even if the first workstation 108 drops from the second contact, for example after transferring the second contact to a second workstation or resource or creating a conference scenario with a second workstation or resource. Embodiments of the present invention can also track associations between contacts across different media types. For example, an incoming contact comprising a telephone call can be related to an email message sent by an agent after the initial contact has been placed on hold or after the initial contact has been terminated and the agent has entered an after-contact work state.


Although the foregoing description has used as examples a system comprising a call center staffed by human agents, it should be appreciated that the present invention is not so limited. For example, embodiments of the present invention may be utilized in connection with the relation of contacts or other transactions handled by a resource of any type. Furthermore, in addition to substantially real-time call distribution system applications, the present invention may be applied to systems used to distribute work items comprising textual correspondence to resources for action and possible reply. Embodiments of the present invention are also not limited to operation on an adjunct to an automatic contact distribution system. For example, embodiments of the present invention may be implemented as an application or firmware running on an automatic contact distribution system itself. In accordance with still other embodiments of the present invention, an implementing application or firmware may run on an adjunct to a communication server, such as a private branch exchange.


The foregoing discussion of the invention has been presented for purposes of illustration and description. Further, the description is not intended to limit the invention to the form disclosed herein. Consequently, variations and modifications commensurate with the above teachings, within the skill and knowledge of the relevant art, are within the scope of the present invention. The embodiments described hereinabove are further intended to explain the best mode presently known of practicing the invention and to enable others skilled in the art to utilize the invention in such or in other embodiments and with various modifications required by their particular application or use of the invention. It is intended that the appended claims be construed to include the alternative embodiments to the extent permitted by the prior art.

Claims
  • 1. A method for associating contacts, comprising: one of receiving and initiating a first contact at a first contact center;assigning the first contact to a first resource;recording information related to the first contact;the first resource taking a first action including one of: a) placing the first contact on hold, or b) terminating the first contact and entering an after-contact work state associated with the terminated first contact;after taking the first action, and while the first contact is on hold or while the first resource is in an after-contact work state associated with termination of the first contact, the first resource initiating the establishment of a second contact; andrecording information related to the second contact, wherein, in response to the first resource initiating the establishment of a second contact while the first contact is on hold or while the first resource is in the after-contact work state following termination of the first contact, the first and second contacts are indicated as being related to one another, and wherein an indication that the first and second contacts are related to one another is included in the recorded information related to the first contact and the recorded information related to the second contact.
  • 2. The method of claim 1, wherein the first resource places the first contact on hold, and wherein the first resource then establishes the second contact while the first contact is on hold.
  • 3. The method of claim 2, wherein the first contact comprises a voice telephony call.
  • 4. The method of claim 2, wherein the first contact comprises an exchange of textual information, and wherein placing the first contact on hold includes the first resource temporarily suspending the entry of textual information by at least the first resource in connection with the first contact.
  • 5. The method of claim 1, wherein the first contact is terminated, wherein the first resource enters an after-contact work state, and wherein the first resource establishes the second contact while in the after-contact work state.
  • 6. The method of claim 1, wherein the second contact comprises an internal communication with a second resource.
  • 7. The method of claim 1, wherein the second contact comprises an external communication with a second resource.
  • 8. The method of claim 1, further comprising: the first resource taking a second action including one of a) placing the second contact on hold, or b) terminating the second contact and entering an after-contact work state;after taking the second action, the first resource establishing a third contact; andrecording information related to the third contact, wherein the first, second and third contacts are indicated as being related to one another.
  • 9. The method of claim 1, further comprising assigning a first identifier to said first and second contacts.
  • 10. The method of claim 1, wherein the first resource establishing a second contact includes the first resource communicating with a second resource, the method further comprising: the second resource establishing a third contact; andrecording information related to the third contact, wherein the first, second and third contacts are indicated as being related to one another.
  • 11. The method of claim 1, wherein the first resource comprises an agent, and wherein the agent is not allowed to modify the recorded information.
  • 12. The method of claim 1, further comprising: generating a report, wherein said report indicates said first and second contacts as being related to one another.
  • 13. The method of claim 1, wherein said first contact is received at the contact center from a first network, and wherein the second contact is placed over a second network.
  • 14. A system for recording information related to a call center, comprising: a plurality of workstations, wherein at least some of the workstations are each associated with at least one of the agents, wherein each workstation can initiate and receive contacts, and wherein each workstation can at least one of: a) place a contact on hold, or b) allow an associated agent to select an after-contact work state after a contact has been terminated;a contact distribution system interconnected to the plurality of workstations and to at least a first communication network, wherein the contact distribution system at least one of receives incoming contacts from and places outgoing contacts on the at least a first communication network, wherein the contact distribution system assigns or attempts to assign each incoming or outgoing contact to an agent at a workstation, and wherein the contact distribution system collects information related to each incoming or outgoing contact;data storage; anda related contact identification server interconnected to the contact distribution system, wherein information related to each incoming or outgoing contact collected by the contact distribution system is received by the related contact identification server, wherein the related contact identification server determines that a first workstation included in the plurality of workstations has initiated a second contact while a first contact assigned to the first workstation is one of: a) placed on hold, or b) terminated and associated with an after-contact work state, and wherein, in response to the related contact identification server determining that the first workstation has initiated a second contact while the first contact is one of placed on hold or terminated and associated with an after-contact work state, the related contact identification server stores information including the association of the contact initiated from the first workstation and the incoming or outgoing contact in the data storage.
  • 15. The system of claim 14, wherein the related contact identification server is integral to the call distribution system.
  • 16. The system of claim 14, wherein the contact comprises a voice telephony call, wherein the first communication network comprises the public switched telephony network.
  • 17. The system of claim 16, wherein the workstations include a voice telephone.
  • 18. The system of claim 14, wherein the call distribution system is interconnected to the workstations by a second network.
  • 19. The system of claim 14, wherein the contact comprises an exchange of messages comprising text.
  • 20. A non-transitory computer readable medium having stored thereon computer executable instructions, comprising: instructions for interfacing a plurality of agent work stations with a communication network;instructions for receiving or initiating contacts in connection with communication endpoints;instructions for placing agents the agent workstations in communication with said communication endpoints external to said contact center;instructions for selecting one of the agent workstations to handle a contact received at or initiated from said contact center, wherein in response to a first contact, said instructions for selecting one of the agent workstations operate to assign said first contact to a first of the agent workstation;instructions for collecting information related to said first contact;instructions for associating a second contact initiated from said first agent workstation, wherein said first and second contacts are determined to be associated with one another in response to said initiation of said second contact while said first contact is on hold or when said second contact is initiated as the next action taken at the first agent workstation following the selection of an after-contact work state at said first agent workstation, and wherein said first and second contacts are recorded as being associated with one another by the creation of at least a first record indicating that said first and second contacts are related to one another.
  • 21. The non-transitory computer readable medium of claim 20, wherein said second contact comprises a contact placed to a second agent workstation.
  • 22. The non-transitory computer readable medium of claim 20, wherein said first contact is initiated by a first communication endpoint, and wherein said second contact comprises a contact placed to a second communication endpoint.
  • 23. The non-transitory computer readable medium of claim 20, further comprising: instructions for recording said association between said first and second contacts.
US Referenced Citations (391)
Number Name Date Kind
4163124 Jolissaint Jul 1979 A
4510351 Costello et al. Apr 1985 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 Mar 1992 A
5155761 Hammond Oct 1992 A
5164981 Mitchell et al. Nov 1992 A
5164983 Brown et al. Nov 1992 A
5167010 Elm et al. Nov 1992 A
5185780 Leggett Feb 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
5289368 Jordan et al. Feb 1994 A
5291550 Levy et al. Mar 1994 A
5299260 Shaio Mar 1994 A
5309513 Rose May 1994 A
5311422 Loftin et al. May 1994 A
5325292 Crockett Jun 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
5467391 Donaghue, Jr. et al. Nov 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
5499291 Kepley Mar 1996 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
5555299 Maloney et al. Sep 1996 A
5577169 Prezioso Nov 1996 A
5592378 Cameron et al. Jan 1997 A
5592542 Honda et al. Jan 1997 A
5594726 Thompson et al. Jan 1997 A
5603029 Aman et al. Feb 1997 A
5604892 Nuttall et al. Feb 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
5673205 Brunson Sep 1997 A
5684872 Flockhart et al. Nov 1997 A
5684874 Yagyu 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
5721770 Kohler Feb 1998 A
5724092 Davidsohn et al. Mar 1998 A
5740238 Flockhart et al. Apr 1998 A
5742675 Kilander et al. Apr 1998 A
5742763 Jones 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
5781614 Brunson Jul 1998 A
5784452 Carney Jul 1998 A
5787410 McMahon Jul 1998 A
5790642 Taylor et al. Aug 1998 A
5790650 Dunn 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
5802510 Jones Sep 1998 A
5818907 Maloney et al. Oct 1998 A
5819084 Shapiro et al. Oct 1998 A
5825869 Brooks et al. Oct 1998 A
5826039 Jones Oct 1998 A
5828747 Fisher et al. Oct 1998 A
5836011 Hambrick et al. Nov 1998 A
5838968 Culbert Nov 1998 A
5839117 Cameron et al. Nov 1998 A
5864874 Shapiro Jan 1999 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
5909669 Havens Jun 1999 A
5911134 Castonguay et al. Jun 1999 A
5914951 Bentley et al. Jun 1999 A
5915012 Miloslavsky Jun 1999 A
5923745 Hurd Jul 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
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
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
6014437 Acker et al. Jan 2000 A
6031896 Gardell et al. Feb 2000 A
6038293 Mcnerney et al. Mar 2000 A
6038296 Brunson 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
6049779 Berkson 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 et al. Jul 2000 A
6088441 Flockhart et al. Jul 2000 A
6108670 Weida et al. Aug 2000 A
6115462 Servi et al. Sep 2000 A
6128304 Gardell et al. Oct 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
6185603 Henderson et al. 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 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 et al. Aug 2001 B1
6292550 Burritt Sep 2001 B1
6295353 Flockhart et al. Sep 2001 B1
6298062 Gardell et al. Oct 2001 B1
6307931 Vaudreuil Oct 2001 B1
6324282 McIllwaine et al. Nov 2001 B1
6332081 Do Dec 2001 B1
6339754 Flanagan et al. Jan 2002 B1
6353810 Petrushin Mar 2002 B1
6356632 Foster et al. Mar 2002 B1
6360222 Quinn Mar 2002 B1
6366666 Bengtson et al. Apr 2002 B2
6366668 Borst et al. Apr 2002 B1
6389028 Bondarenko et al. May 2002 B1
6389132 Price et al. May 2002 B1
6389400 Bushey et al. May 2002 B1
6408066 Andruska et al. Jun 2002 B1
6408277 Nelken Jun 2002 B1
6411682 Fuller et al. Jun 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
6446092 Sutter Sep 2002 B1
6449356 Dezonno Sep 2002 B1
6449358 Anisimov 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
6463471 Dreke et al. Oct 2002 B1
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
6553114 Fisher et al. Apr 2003 B1
6556974 D'Alessandro Apr 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
6563921 Williams et al. May 2003 B1
6571285 Groath et al. May 2003 B1
6574599 Lim et al. Jun 2003 B1
6574605 Sanders et al. Jun 2003 B1
6597685 Miloslavsky et al. Jul 2003 B2
6603854 Judkins et al. Aug 2003 B1
6604084 Powers et al. Aug 2003 B1
6614903 Flockhart et al. Sep 2003 B1
6650748 Edwards et al. Nov 2003 B1
6662188 Rasmussen et al. Dec 2003 B1
6668167 McDowell et al. Dec 2003 B2
6675168 Shapiro et al. Jan 2004 B2
6684192 Honarvar et al. Jan 2004 B2
6697457 Petrushin Feb 2004 B2
6700967 Kleinoder et al. Mar 2004 B2
6704409 Dilip et al. Mar 2004 B1
6707903 Burok et al. Mar 2004 B2
6711253 Prabhaker Mar 2004 B1
6724885 Deutsch et al. Apr 2004 B1
6735299 Krimstock et al. May 2004 B2
6735593 Williams May 2004 B1
6738462 Brunson May 2004 B1
6744877 Edwards Jun 2004 B1
6754333 Flockhart et al. Jun 2004 B1
6757362 Cooper et al. Jun 2004 B1
6766013 Flockhart et al. Jul 2004 B2
6766014 Flockhart et al. Jul 2004 B2
6766326 Cena Jul 2004 B1
6775377 McIllwaine et al. Aug 2004 B2
6785666 Nareddy et al. Aug 2004 B1
6822945 Petrovykh Nov 2004 B2
6829348 Schroeder et al. Dec 2004 B1
6839735 Wong et al. Jan 2005 B2
6842503 Wildfeuer Jan 2005 B1
6847973 Griffin et al. Jan 2005 B2
6898190 Shtivelman et al. May 2005 B2
6915305 Subramanian et al. Jul 2005 B2
6947543 Alvarado et al. Sep 2005 B2
6947988 Saleh Sep 2005 B1
6963826 Hanaman et al. Nov 2005 B2
6968052 Wullert, II Nov 2005 B2
6981061 Sakakura Dec 2005 B1
6985901 Sachse et al. Jan 2006 B1
6988126 Wilcock et al. Jan 2006 B2
7010542 Trappen et al. Mar 2006 B2
7020254 Phillips Mar 2006 B2
7035808 Ford Apr 2006 B1
7035927 Flockhart et al. Apr 2006 B2
7039176 Borodow et al. May 2006 B2
7062031 Becerra et al. Jun 2006 B2
7076051 Brown et al. Jul 2006 B2
7100200 Pope et al. Aug 2006 B2
7103562 Kosiba et al. Sep 2006 B2
7110525 Heller et al. Sep 2006 B1
7117193 Basko et al. Oct 2006 B1
7136873 Smith et al. Nov 2006 B2
7149733 Lin et al. Dec 2006 B2
7155612 Licis Dec 2006 B2
7158628 McConnell et al. Jan 2007 B2
7162469 Anonsen et al. Jan 2007 B2
7165075 Harter et al. Jan 2007 B2
7170976 Keagy Jan 2007 B1
7170992 Knott et al. Jan 2007 B2
7177401 Mundra et al. Feb 2007 B2
7200219 Edwards et al. Apr 2007 B1
7203655 Herbert et al. Apr 2007 B2
7212625 McKenna et al. May 2007 B1
7215744 Scherer May 2007 B2
7222075 Petrushin May 2007 B2
7246371 Diacakis et al. Jul 2007 B2
7257513 Lilly Aug 2007 B2
7257597 Pryce et al. Aug 2007 B1
7266508 Owen et al. Sep 2007 B1
7283805 Agrawal Oct 2007 B2
7295669 Denton et al. Nov 2007 B1
7299259 Petrovykh Nov 2007 B2
7324954 Calderaro et al. Jan 2008 B2
7336779 Boyer et al. Feb 2008 B2
7340408 Drew et al. Mar 2008 B1
7373341 Polo-Malouvier May 2008 B2
7376127 Hepworth et al. May 2008 B2
7386100 Michaelis Jun 2008 B2
7392402 Suzuki Jun 2008 B2
7409423 Horvitz et al. Aug 2008 B2
7415417 Boyer et al. Aug 2008 B2
7418093 Knott et al. Aug 2008 B2
7499844 Whitman, Jr. Mar 2009 B2
7500241 Flockhart et al. Mar 2009 B1
7526440 Walker et al. Apr 2009 B2
7545761 Kalbag Jun 2009 B1
7545925 Williams Jun 2009 B2
7567653 Michaelis Jul 2009 B1
7734032 Kiefhaber et al. Jun 2010 B1
7885209 Michaelis et al. Feb 2011 B1
7936867 Hill et al. May 2011 B1
20010011228 Shenkman Aug 2001 A1
20010034628 Eder Oct 2001 A1
20020019829 Shapiro Feb 2002 A1
20020021307 Glenn et al. Feb 2002 A1
20020035605 McDowell et al. Mar 2002 A1
20020038422 Suwamoto et al. Mar 2002 A1
20020065894 Dalal et al. May 2002 A1
20020076010 Sahai Jun 2002 A1
20020085701 Parsons et al. Jul 2002 A1
20020087630 Wu Jul 2002 A1
20020112186 Ford et al. Aug 2002 A1
20020116336 Diacakis et al. Aug 2002 A1
20020116461 Diacakis et al. Aug 2002 A1
20020123923 Manganaris et al. Sep 2002 A1
20020147730 Kohno Oct 2002 A1
20020194096 Falcone et al. Dec 2002 A1
20030004704 Baron Jan 2003 A1
20030028621 Furlong et al. Feb 2003 A1
20030073440 Mukherjee et al. Apr 2003 A1
20030093465 Flockhart et al. May 2003 A1
20030108186 Brown et al. Jun 2003 A1
20030144900 Whitmer Jul 2003 A1
20030144959 Makita Jul 2003 A1
20030185379 O'Connor et al. Oct 2003 A1
20030198336 Rodenbusch et al. Oct 2003 A1
20030231757 Harkreader et al. Dec 2003 A1
20040008828 Coles et al. Jan 2004 A1
20040015496 Anonsen Jan 2004 A1
20040015506 Anonsen et al. Jan 2004 A1
20040054743 McPartlan et al. Mar 2004 A1
20040057569 Busey et al. Mar 2004 A1
20040102940 Lendermann et al. May 2004 A1
20040103324 Band May 2004 A1
20040138944 Whitacre et al. Jul 2004 A1
20040162998 Tuomi et al. Aug 2004 A1
20040193646 Cuckson et al. Sep 2004 A1
20040202308 Baggenstoss et al. Oct 2004 A1
20040202309 Baggenstoss et al. Oct 2004 A1
20040203878 Thomson Oct 2004 A1
20040210475 Starnes et al. Oct 2004 A1
20040240659 Gagle et al. Dec 2004 A1
20040249650 Freedman et al. Dec 2004 A1
20040260706 Anonsen et al. Dec 2004 A1
20050021529 Hodson et al. Jan 2005 A1
20050044375 Paatero et al. Feb 2005 A1
20050049911 Engelking et al. Mar 2005 A1
20050065837 Kosiba et al. Mar 2005 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
20050091071 Lee Apr 2005 A1
20050125432 Lin et al. Jun 2005 A1
20050125458 Sutherland et al. Jun 2005 A1
20050138064 Trappen et al. Jun 2005 A1
20050154708 Sun Jul 2005 A1
20050182784 Trappen et al. Aug 2005 A1
20050228707 Hendrickson Oct 2005 A1
20050261035 Groskreutz et al. Nov 2005 A1
20050283393 White et al. Dec 2005 A1
20050289446 Moncsko et al. Dec 2005 A1
20060004686 Molnar et al. Jan 2006 A1
20060007916 Jones et al. Jan 2006 A1
20060015388 Flockhart et al. Jan 2006 A1
20060026049 Joseph et al. Feb 2006 A1
20060056598 Brandt et al. Mar 2006 A1
20060058049 McLaughlin et al. Mar 2006 A1
20060100973 McMaster et al. May 2006 A1
20060135058 Karabinis Jun 2006 A1
20060167667 Maturana et al. Jul 2006 A1
20060178994 Stolfo et al. Aug 2006 A1
20060242160 Kanchwalla et al. Oct 2006 A1
20060256957 Fain et al. Nov 2006 A1
20060271418 Hackbarth et al. Nov 2006 A1
20060285648 Wahl et al. Dec 2006 A1
20070038632 Engstrom Feb 2007 A1
20070064912 Kagan et al. Mar 2007 A1
20070083572 Bland et al. Apr 2007 A1
20070112953 Barnett May 2007 A1
20070127643 Keagy Jun 2007 A1
20070156375 Meier et al. Jul 2007 A1
20070192414 Chen et al. Aug 2007 A1
20070201311 Olson Aug 2007 A1
20070201674 Annadata et al. Aug 2007 A1
20070230681 Boyer et al. Oct 2007 A1
20080056165 Petrovykh Mar 2008 A1
20090193050 Olson Jul 2009 A1
20090228474 Chiu et al. Sep 2009 A1
Foreign Referenced Citations (33)
Number Date Country
2143198 Jan 1995 CA
2174762 Jun 1995 CA
0501189 Sep 1992 EP
0576205 Dec 1993 EP
0740450 Oct 1996 EP
0770967 May 1997 EP
0772335 May 1997 EP
0829996 Mar 1998 EP
0855826 Jul 1998 EP
0863651 Sep 1998 EP
0866407 Sep 1998 EP
0899673 Mar 1999 EP
0998108 May 2000 EP
1035718 Sep 2000 EP
1091307 Apr 2001 EP
1150236 Oct 2001 EP
1761078 Mar 2007 EP
2273418 Jun 1994 GB
2290192 Dec 1995 GB
07-007573 Jan 1995 JP
2001-053843 Feb 2001 JP
2002-032977 Jan 2002 JP
2002-304313 Oct 2002 JP
2006-054864 Feb 2006 JP
WO 9607141 Mar 1996 WO
WO 9728635 Aug 1997 WO
WO 9856207 Dec 1998 WO
WO 9917522 Apr 1999 WO
0026804 May 2000 WO
0026816 May 2000 WO
WO 0180094 Oct 2001 WO
WO 02099640 Dec 2002 WO
WO 03015425 Feb 2003 WO
Non-Patent Literature Citations (145)
Entry
US 6,537,685, 03/2003, Higuchi (withdrawn)
US 6,537,685, 03/2000, Fisher et al, (withdrawn).
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, Flockhart et al.
U.S. Appl. No. 10/946,638, filed Sep. 20, 2004, Flockhart et al.
U.S. Appl. No. 11/199,828, filed Aug. 8, 2005, Bland et al.
U.S. Appl. No. 11/242,687, filed Oct. 3, 2005, Krimstock et al.
U.S. Appl. No. 11/245,724, filed Oct. 6, 2005, Flockhart et al.
U.S. Appl. No. 11/517,646, filed Sep. 7, 2006, Hackbarth et al.
U.S. Appl. No. 11/536,456, filed Sep. 28, 2006, Hackbarth et al.
U.S. Appl. No. 11/861,857, filed Sep. 26, 2007, Tendrick et al.
U.S. Appl. No. 12/242,916, filed Oct. 1, 2008, Kiefhaber et al.
U.S. Appl. No. 12/789,038, filed May 27, 2010, Bland et al.
“Call Center Recording for Call Center Quality Assurance”, Voice Print International, Inc., available at http://www.voiceprintonline.com/call-center-recording.asp?ad—src=google&srch—trm=call—center—monitoring, date unknown, printed May 10, 2007, 2 pages.
“KANA—Contact Center Support”, available at http://www.kana.com/solutions.php?tid=46, copyright 2006, 3 pages.
“Monitoring: OneSight Call Statistics Monitors”, available at http://www.empirix.com/defaultasp?action=article&ID=301, date unknown, printed May 10, 2007, 2 pages.
“Oracle and Siebel” Oracle, available at http://www.oracle.com/siebel/index.html, date unknown, printed May 10, 2007, 2 pages.
“Services for Computer Supported Telecommunications Applications (CSTA) Phase III”; Standard ECMA-269, 5th Edition—Dec. 2002; ECMA International Standardizing Information and Communication Systems; URL: http://www.ecma.ch; pp. 1-666 (Parts 1-8).
“Still Leaving It To Fate?: Optimizing Workforce Management”, Durr, William Jr., Nov. 2001.
“Access for 9-1-1 and Telephone Emergency Services,” Americans with Disabilities Act, U.S. Department of Justice, Civil Rights Division (Jul. 15, 1998), available at http://www.usdoj.gov/crt/ada/911ta.htm, 11 pages.
“Applications, NPRI's Predictive Dialing Package,” Computer Technology (Fall 1993), p. 86.
“Call Center Software You Can't Outgrow,” Telemarketing® (Jul. 1993), p. 105.
“Domain Name Services,” available at http://www.pism.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, Brock Control Systems, Inc., Activity Managers Series™, Section 5—Company B120, p. 59, 1992.
“Product Features,” Guide to Call Center Automation, CRC Information Systems, Inc., Tel-ATHENA, Section 5—Company C520, p. 95, 1992.
“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.
A.A. Vaisman et al., “A Temporal Query Language for OLAP: Implementation and a Case Study”, LNCS, 2001, vol. 2397, 36 pages.
A.B. Schwarzkopf, “Dimensional Modeling for a Data Warehouse”, date unknown, 18 pages.
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.
An Expert's Guide to Oracle Technology blog, My Personal Dictionary, Lewis R. Cunningham, posted Mar. 31, 2005, http://blogs.ittoolbox.com/oracle'guide/archives003684.asp, 4 pages.
Andy Zmolek; “Simple and Presence: Enterprise Value Propositions,” Avaya presentation, 16 pages, presented Jan. 24, 2002.
Aspect—“Analysis and Reporting,” http://aspect.com/products/analysis/index.cfm, (Copyright 2005) (1page).
Aspect—“Call Center Reports,” http://aspect.com/products/analysis/ccreporting.cfm, (Copyright 2005) (2 pages).
Aspect—“Performance Optimization,” http://aspect.com/products/wfm/performanceopt.cfm?section=performanceopt, (Copyright 2005) (1page).
Atkins et a.l; “Common Presence and Instant Messaging: Message Format,” Network Working Group (Jan. 9, 2003), available at http://www.ietf.org/internet-drafts/draft-ietf-impp-cpim-msgfmt-08.txt, 31 pages.
Avaya—“Avaya and Blue Pumpkin—Providing Workforce Optimization Solutions” (Copyright 2004) (3 pages).
Avaya—“Avaya and Texas Digital Systems—Providing Real-time Access to Call Statistics” (Copyright 2004) (3 pages).
Avaya—“Avaya Basic Call Management System Reporting Desktop” (Copyright 2002) (4 pages).
Avaya—“Avaya Call Management System” (Copyright 2003) (3 pages).
Avaya—“Basic Call Management System Reporting Desktop,” Product Description, http://www.avaya.com/gcm/master-usa/en-us/products/offers/bcmrs—desktop.htm (Copyright 2005) (2 pages).
Avaya—“Basic Call Management System Reporting Desktop,” Product Features, http://www.avaya.com/gcm/master-usa/en-us/products/offers/bcmrs—desktop.htm (Copyright 2005) (2 pages).
Avaya—“Basic Call Management System Reporting Desktop,” Product Overview, http://www.avaya.com/gcm/master-usa/en-us/products/offers/bcmrs—desktop.htm (Copyright 2005) (2 pages).
Avaya—“Basic Call Management System Reporting Desktop,” Product Technical, http://www.avaya.com/gcm/master-usa/en-us/products/offers/bcmrs—desktop.htm (Copyright 2005) (2 pages).
Avaya—“Call Management System,” Product Description, http://www.avaya.com/gcm/master-usa/en-us/products/offers/call—management—system.htm (Copyright 2005) (2 pages).
Avaya—“Call Management System,” Product Features, http://www.avaya.com/gcm/master-usa/en-us/products/offers/call—management—system.htm (Copyright 2005) (3 pages).
Avaya—“Call Management System,” Product Overview, http://www.avaya.com/gcm/master-usa/en-us/products/offers/call—management—system.htm (Copyright 2005) (2 pages).
Avaya—“Call Management System,” Product Technical, http://www.avaya.com/gcm/master-usa/en-us/products/offers/call—management—system.htm (Copyright 2005) (2 pages).
Avaya—“Multi Channel Product Authorization,” (PA) Version 5.0, (Nov. 2003) (6 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. CentreVu Advocate, Release 9, User Guide, Dec. 2000.
Avaya, Inc., “Better Implementation of IP in Large Networks,” Avaya, Inc. 2002, 14 pages.
Avaya, Inc., “The Advantages of Load Balancing in the Multi-Call Center Enterprise,” Avaya, Inc., 2002, 14 pages.
Avaya, Inc., “Voice Over IP Via Virtual Private Networks: An Overview,” Avaya, Inc., Feb. 2001, 9 pages.
Background of the Invention for the above-captioned application (previously provided).
Bellsouth Corp., “Frequently Asked Questions—What is a registrar?,” available at https://registration.bellsouth.net/NASApp/DNSWebUI/FAQ.jsp, downloaded Mar. 31, 2003, 4 pages.
Berners-Lee et al.; “Uniform Resource Identifiers (URI); Generic Syntax,” Network Working Group, Request for Comments 2396 (Aug. 1998), 38 pages.
Bill Michael, “The Politics of Naming” www.cConvergence.com (Jul. 2001) pp. 31-35.
Bischoff et al. “Data Ware House Building Method—practical advices telled by persons having experience and experts”, Kyouritsu Shuppan Corp. May 30, 2000, first edition, pp. 197-216.
Chavez, David, et al., “Avaya MultiVantage Software: Adapting Proven Call Processing for the Transition to Converged IP Networks,” Avaya, Inc., Aug. 2002.
Cherry, “Anger Management,” IEEE Spectrum (Apr. 2005) (1 page).
Coles, Scott, “A Guide for Ensuring Service Quality in IP Voice Networks,” Avaya, Inc., 2002, pp. 1-17.
Songini, “ETL QuickStudy,” ComputerWorld, accessed at http://www.computerworld.com/databasetopics/businessintelligence/datawarehouse/story/..., copyright 2005, 5 pages.
Creating and Using Data Warehouse Dimension Tables (Microsoft) copyright 2005, http://msdn.microsoft.com/library/en-us/createdw/createdw—10kz.asp?frame=true, 3 pages.
Creating and Using Data Warehouse-Using Dimensional Modeling (Microsoft) downloaded May 18, 2005 http://msdn.microsoft.com/library/en-us/createdw/createdw—39z.asp?frame=true 1 page.
Crocker et al.; “Common Presence and Instant Messaging (CPIM),” Network Working Group (Aug. 14, 2002), available at http://www.ietf.org/internet-drafts/draft-ietf-impp-cpim-03.txt, 33 pages.
“CS 345: Topics in Data Warehousing,” Oct. 5, 2004, 36 pages.
Data Warehouse—Surrogate Keys, Keep Control Over Record Identifiers by Generating New Keys for the Data Warehouse, Ralph Kimball, May 1998, 4 pages.
Data Warehouse Designer—Design Constraints and Unavoidable Realities, No design Problem in School was This Hard, Ralph Kimball, Sep. 3, 2002, 3 pages.
Data Warehouse Designer—An Engineer' s View—Its' Worthwhile to Remind Ourselves Why We Build Data Warehouses the Way We Do, Ralph Kimball, Jul. 26, 2002, 3 pages.
Data Warehouse Designer—Divide and Conquer, Build Your Data Warehouse One Piece at a Time, Ralph Kimball, Oct. 30, 2002, 3 pages.
Data Warehouse Designer—TCO Starts with the End User, Ralph Kimball, May 13, 2003, http://www.intelligententerprise.com/030513/608warehouse1—1.jhtml?—requestid=598425, 3 pages.
Data Warehouse Designer—The Soul of the Data Warehouse, Part One: Drilling Down, Ralph Kimball, Mar. 20, 2003, 3 pages.
Data Warehouse Designer—The Soul of the Data Warehouse, Part Three: Handling Time, Ralph Kimball, Apr. 22, 2003, 3 pages.
Data Warehouse Designer—The Soul of the Data Warehouse, Part Two: Drilling Across, Ralph Kimball, Apr. 5, 2003, 3 pages.
Data Warehouse Designer—Two Powerful Ideas, The Foundation for Modern Data Warehousing, Ralph Kimball, Sep. 17, 2002, 3 pages.
Data Warehouse Designer Fact Tables and Dimension, Jan. 1, 2003, http://www.inteeigententerprise.com/030101/602warehouse1—1.jhtml, Ralph Kimball, 3 page.
Dawson et al.; “Vcard MIME Directory Profile,” Network Working Group (Sep. 1998), available at http://www.ietf.org/rfc/rfc2426.txt?number=2426, 40 pages.
Dawson, “NPRI's Powerguide, Software Overview” Call Center Magazine (Jun. 1993), p. 85.
Day et al.; “A Model for Presence and Instant Messaging,” Network Working Group (Feb. 2000), available at http://www.ietf.org/rfc/rfc2778.txt?number=2778, 16 pages.
Day et al.; “Instant Messaging/Presence Protocol Requirements,” Network Working Group (Feb. 2000), available at http://www.ietf.org/rfc/rfc2779.txt?number=2779, 25 pages.
Definity Communications System Generic 3 Call Vectoring/Expert Agent Selection (EAS) Guide, AT&T publication No. 555-230-520 (Issue 3, Nov. 1993).
Dillion, “Renaming fields and tracing dependencies”, available at http://allenbrowne.com/ser-41.html, Nov. 2003, updated May 2006, 1 page.
DMReview—Business Dimensional Modeling: The Logical Next Step: Translating the BDM, Laura Reeves, published May 2004, 4 pages.
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.
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.uni-erlangen.de/literature/psdir/1999/Noeth99:RIF.ps.gz, 1999, 8 pages.
E. Veerman, “Designing A Dimensional Model”, date unknown, 38 pages.
Fielding et al.; “Hypertext Transfer Protocol—HTTP/1.1,” Network Working Group, Request for Comments 2068 (Jan. 1997), 152 pages.
Foster, Robin, et al., “Avaya Business Advocate and its Relationship to Multi-Site Load Balancing Applications,” Avaya, Inc., Mar. 2002, 14 pages.
Fundamentals of Data Warehousing—Unit 3—Dimensional Modeling, Fundamentals of Data Warehousing, copyright 2005—Evolve Computer Solutions, 55 pages.
G. Hellstrom et al., “RFC 2793—RTP Payload for Text Consersation,” Network Working Group Request for Comments 2793 (May 2000), available at http://www.faqs.org/rfcs/rfc2793.html, 8 pages.
G. Klyne; “A Syntax for Describing Media Feature Sets,” Network Working Group (Mar. 1999), available at http://www.ietf.org/rfc/rfc2533.txt?number=2533, 35 pages.
G. Klyne; “Protocol-independent Content Negotiation Framework,” Network Working Group (Sep. 1999), available at http://www.ietf.org/rfc/rfc2703.txt?number=2703, 19 pages.
G. Wiederhold, “Mediation to Deal with Heterogeneous Data Sources”, Stanford University, Jan. 1999, 19 pages.
GEOTEL Communications Corporation Web site printout entitled “Intelligent CallRouter Optimizing the Interaction Between Customers and Answering Resources.”, 1998, 6 pages.
Glossary—Curlingstone Publishing, http://www.curlingstone.com/7002/7002glossary.html, downloaded May 24, 2005, 11 pages.
Gulbrandsen et al.; “A DNS RR for Specifying the Location of Services (DNS SRV),” Network Working Group (Feb. 2000), available at http://www.ietf.org/rfc/rfc2782.txt?number=2782, 12 pages.
H. Schulzrinne et al., “RFC 2833—RTP Payload for DTMF Digits, Telephony Tones and Telephony Signals,” Network Working Group Request for Comments 2833 (May 2000), available at http://www.faqs.org/rfcs/rfc2833.html, 23 pages.
Holtman et al.; “HTTP Remote Variant Selection Algorithm—RVSA/1.0,” Network Working Group (Mar. 1998), available at http://www.ietf.org/rfc/rfc2296.txt?number=2296, 13 pages.
Holtman et al.; “Transparent Content Negotiation in HTTP,” Network Working Group (Mar. 1998), available at http://www.ietf.org/rfc/rfc2295.txt?number=2295, 55 pages.
Intelligent Enterprise Magazine—Data Warehouse Designer: Fact Tables and Dimension, downloaded May 18, 2005, http://www.intelligententerprise.com/030101/602warehouse1—1.jhtml, 7 pages.
J. Cahoon, “Fast Development of a Data Warehouse Using MOF, CWM and Code Generation”, CubeModel, May 22, 2006, 32 pages.
Bentley, “Metadata: Everyone Talks About It, But What Is It?” Proceedings of the Twenty-Sixth Annual SAS Users Group International Conference: SAS Institute Inc., 2001, Paper 125-26, 5 pages.
John H.L. Hansen and Levent M. Arsian, Foreign Accent Classification Using Source Generator Based Prosodic Features, IEEE Proc. ICASSP, vol. 1, pp. 836-839, Detroit USA (May 1995).
Karakasidis A. “Queues for Active Data Warehousing”, Jun. 17, 2005, Baltimore, MA, in Proceedings on Information Quality in Informational Systems (IQIS'2005), S.28-39, ISBN: 1-59593-160-0, DOI: 10.1109/DANTE.1999.844938.
Kimball, et al., “Practical Techniques for Extracting, Cleaning, Conforming, and Delivering Data.” The Data Warehouse ETL Toolkit. 2004. Ch. 5, pp. 170-174.
Kimball, et al., “The Complete Guide to Dimensional Modeling.” The Data Warehouse Toolkit. 2nd Edition, 2002. Ch. 11, pp. 240-241.
Koutarou, “Building a Framework for EC using Hibernate, OSWorkflow”, JAVA Press, Japan, Gujutsu Hyouron Company, vol. 25, 2004, pp. 132-147.
L. Cabibbo et al., “An Architecture for Data Warehousing Supporting Data Independence and Interoperability”, International Journal of Cooperative Information Systems, Nov. 2004, 41 pages.
Lamel et al., “Language Identification Using Phone-Based Acoustic Likelihood,” IEEE International Conference on Acoustics, Speech, and Signal Processing, 1994, vol. 1, pp. 293-296.
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-16.
Levent M. Arsian, Foreign Accent Classification in American English, Department of Electrical Computer Engineering, Duke University, Thesis, pp. 1-200 (1996).
Microsoft Office Animated Help Tool, date unknown, 1 page.
Microsoft R Access 97 for Windows R Application development guide, Ver. 8.0, Microsoft Corp., a first version, pp. 569-599.
MIT Project Oxygen, Pervasive, Human-Centered Computing (MIT Laboratory for Computer Science) (Jun. 2000) pp. 1-15.
Multi-Dimensional Modeling with BW ASAP for BW Accelerator Business Information Warehouse, copyright 2000, 71 pages.
Nice Systems—“Insight from Interactions,” “Overwhelmed by the Amount of Data at your Contact Center?” http://www.nice.com/products/multimedia/analyzer.php, (Printed May 19, 2005) (2 pages).
Nice Systems—“Multimedia Interaction Products,” “Insight from Interactions,” http://www.nice.com/products/multimedia/contact—centers.php (Printed May 19, 2005) (3 pages).
Nortel—“Centrex Internet Enabled Call Centers,” http://www.products.nortel.com/go/product—assoc.jsp?segld=0&parID=0&catID=-9191&rend—id... (Copyright 1999-2005) (1page).
Presentation by Victor Zue, The MIT Oxygen Project, MIT Laboratory for Computer Science (Apr. 25-26, 2000) 9 pages.
Richard Shockey, “ENUM: Phone Numbers Meet the Net” www.cConvergence.com (Jul. 2001) pp. 21-30.
Rose et al..; “The APEX Presence Service,” Network Working Group (Jan. 14, 2002), available at http://www.ietf.org/internet-drafts/draft-ietf-apex-presence-06.txt, 31 pages.
Sarda, “Temporal Issues in Data Warehouse Systems”, 1999, Database Applications in Non-Traditional Environments (DANTE'99), S. 27, DOI: 10.1109/DANTE.1999.844938.
Seo, “akuto/FC shop sale assistant systme etc., compressing into halves the number of days for stock possession by a multi-bender EPR plus POS”, Network Computing, Japan Licktelecom Corp., vol. 12, No. 4, Apr. 1, 2000, pp. 45-49.
Snape, James, “Time Dimension and Time Zones.” 2004. pp. 1-10. http://www.jamessnape.me.uk/blog/CommentView,gui,79e910a1-0150-4452-bda3-e98d.
Stevenson et al.; “Name Resolution in Network and Systems Management Environments”; http://netman.cit.buffalo.edu/Doc/DStevenson/NR-NMSE.html; printed Mar. 31, 2003; 16 pages.
Sugano et al., “Common Presence and Instant Messaging (CPIM) Presence Information Data Format,” Network Working Group (Dec. 2002), available at http://www.ietf.org/internet-drafts/draft-ietf-impp-cpim-pidf-07.txt, 26 pages.
Thayer Watkins, “Cost Benefit Analysis”, 1999, San Jose State University Economics Department, Web Archive http://web.arch ive.org/web/19990225143131/http://www.sjsu.edu/faculty/watkins/cba.htm.
Akitsu, “An Introduction of Run Time Library for C Program, the fourth round,” C Magazine, Jul. 1, 1990, vol. 2(7), pp. 78-83.
Emura, “Windows API Utilization Guide, Points for Knowledges and Technologies,” C Magazine, Oct. 1, 2005, vol. 17(10), pp. 147-150.
Examiner's Office Letter (including translation) for Japanese Patent Application No. 2007-043414, mailed Jul. 7, 2010.
Moss et al., “The Importance of Data Modeling as a Foundation for Business Insight,” copyright 2004, 38 pages.
Hellstrom et al., RFC-4103 Protocol, entitled “RTP Payload for Text Conversation,” Network Working Group, http://www.rfc-editor.org/rfc/rfc4103.txt, Jun. 2005, 18 pages.
Venkatesan et al., “A Customer Lifetime Value Framework for Customer Selection and Resource Allocation Strategy,” Journal of Marketing, Oct. 2004, vol. 68, pp. 106-125.
U.S. Appl. No. 11/956,779, filed Dec. 14, 2007, Burritt et al.
Google Docs “IP Softphone for Windows Mobile 5” printed on Sep. 15, 2009 from http://docs.google.com/gview?a=v&q=cache:92VrteFXqm8J:support.avaya.com/css/P8/documents/100021136+Avaya+telecom..., 1 page.
Overview of Avaya IP Softphone printed on Sep. 15, 2009 from http://support.avaya.com/elmodocs2/ip—softphone/Overview—IP—Softphone—R6.htm, 2 pages.
U.S. Appl. No. 12/569,581, filed Sep. 29, 2009, Michaelis.
Product Brief of “Avaya IP Agent” printed on Sep. 15, 2009 from http://docs.google.com/gview?a=v&q=cache:IRR32Pfzp98J:www.nacr.com/uploadedFiles/Products/Avaya%2520IP%2520Age..., 1 page.
Product Description of “Avaya one-X Agent,” printed on Sep. 15, 2009 from http://www.avaya.com/usa/product/avaya-one-x-agent, 1 page.
Product Overview of “IP Softphone” printed on Sep. 15, 2009 from http://www.nacr.com/Products.aspx?id=236, 3 pages.