Method for implementing and executing communication center routing strategies represented in extensible markup language

Information

  • Patent Grant
  • 9553755
  • Patent Number
    9,553,755
  • Date Filed
    Thursday, March 10, 2011
    13 years ago
  • Date Issued
    Tuesday, January 24, 2017
    7 years ago
Abstract
A method is provided for supplementing existing interaction routines in a contact center with added capability including acts for (a) creating at least one rule having at least one rule attribute; (b) creating one or more processes, the processes integral to the rule; (c) defining the at least one rule and integral processes as a strategy; and (d) linking the strategy to the interaction routine, the link serving to cause execution of the strategy during an interaction between an entity and the routine, execution thereof promoting further interaction defined in the strategy.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The present invention is in the area of computer-telephony-integrated (CTI) telephone systems including Internet Protocol Network Telephony (IPNT) systems, and pertains more particularly to methods for expressing and implementing intelligent interaction routing across disparate telephony networks and systems using a simple XML-based markup language.


2. Discussion of the State of the Art


In the field of telephony communication, there have been many technological advances in technology over the years that have contributed to more efficient use of telephone communication within hosted call-center environments. Most of these improvements involve integrating the telephones and switching systems in such call centers with computer hardware and software adapted for, among other things, better routing of telephone calls, faster delivery of telephone calls and associated information, and improved service with regards to client satisfaction. Such computer-enhanced telephony is known in the art as computer-telephony integration (CTI).


In a computer-telephony-integrated (CTI) enhanced call center, telephones at agent stations are connected to a central telephony switching apparatus, such as an automatic call distributor (ACD) switch or a private branch exchange (PBX). The agent stations may also be equipped with computer terminals such as personal computer/video display units (PC/VDUs) so that agents manning such stations may have access to stored data as well as being linked to incoming callers by telephone equipment. Such stations may be interconnected through the PC/VDUs by a local area network (LAN). One or more data or transaction servers may also be connected to the LAN that interconnects agent stations. The LAN is, in turn, connected to the CTI processor, which is connected to the call switching apparatus of the call center.


A typical data network telephony (DNT) system uses shared bandwidth instead of a dedicated connection. Recent improvements to available technologies associated with the transmission and reception of data packets during real-time DNT communication have made it possible to successfully add DNT principally Internet Protocol Network Telephony (IPNT) capabilities to existing CTI call centers.


Companies have, for some time, experimented with various forms of integration between the older connection oriented switched telephony (COST) systems and newer Internet Protocol Network Telephony (IPNT) systems. For example, by enhancing data servers, interactive voice response units (IVR), agent-connecting networks, and so on, with the capability of understanding Internet protocol, data arriving from either network may be integrated requiring less equipment and lines to facilitate processing, storage, and transfer of data.


In a network system known to the inventors and described with reference to Ser. No. 09/024,923, listed in the Cross-Reference section, a computerized telephony bridge unit maintained in the network has a Data Network Telephony (DNT) Port and a Connection Oriented/Switched Telephony (COST) trunk port. Each port is associated with circuitry for receiving and placing calls in the data format required by the connected networks. The bridge unit further comprises conversion circuitry for converting data dynamically between network protocols compatible with each connected network.


In this system, control routines are provided and are executable on the computerized bridge unit. The control routines are adapted to receive a first call from one of the COST or DNT networks, to place a call associated with the received call on the network other than the network on which the call is received, and to dynamically convert data between a call connected at one port and a call connected at the other port. The data network can be the Internet, and the COST network can be any publicly or privately switched dedicated-connection-oriented telephone network.


One with skill in the art will recognize that there are several Internet protocols, CTI protocols, and Device protocols, which have been proposed and adopted as standard or semi-standard protocols for streamlining integrated telephony between disparate networks. For example, an Internet protocol known in the art as H.323 is a standard approved by the International Telecommunication Union (ITU) that defines how audiovisual conferencing data is transmitted across networks. In theory, H.323 should enable users to participate in a same telephony conference even though they are using different videoconferencing applications. Although most videoconferencing vendors maintain that their products conform to H.323, such adherence may not actually produce seamless inter-operability.


Telcordia™ developed another known protocol termed Media Gateway Control Protocol (MGCP) in cooperation with Level 3 Communications™. This protocol is an internal protocol, which was developed to work with existing signaling protocols such as H.323, SIP or SS7. One reason new standards are being developed is because of the growing popularity of what is termed Voice over IP (VoIP).


The inventors know a protocol representing a basic telephony call model as Computer-Supported Telephony Applications (CSTA). ECMA is the international standards organization that defined the CSTA resource model and protocol. To connect a telephone system to Computer Telephony (CT) Connect, a telephone system vendor must provide a CSTA-compliant, ASN.1 encoded message flow. This can be provided across a number of different transports, but TCP/IP is becoming the most popular.


Although the developed protocols do much to facilitate seamless communication between networks adding some third party call control, it becomes apparent that third party control over telephony practiced in VoIP applications is severely limited. Arguably, a significant challenge is providing consistent call model representation both at the call control entity (CCE) and the switching entity (SWE). Any discrepancy between an actual call model implemented by a switch vendor and its reverse-engineered replica in CTI control software causes loss of coherency between the actual switching state and its image in the control software.


The inventor is aware of a system, referenced above as U.S. patent application Ser. No. 09/827,608, for providing third-party call control in a telecommunications environment. The system comprises a call-control mechanism for providing service logic and routing intelligence, a control application for providing service-logic description and command instruction for implementing third-party controlled call connections, a call-switching mechanism for providing an abstract state of switching matrix and for commutation of external and internal call legs, and a commutation application for making and breaking call connections according to commands sent from the control application. The call-control mechanism, using the control application, sends primitive text commands, which may be in the form of an Extensible Markup Language (XML) to the call-switching mechanism, which utilizing the commutation application, receives, reads and implements the text commands containing all of the service logic and instructions required to successfully construct call external and internal connection legs and wherein the call-switching mechanism by virtue of the commutation application sends notification of success or failure regarding implementation of received commands back to the control application.


While the above system provides a solution to the so-far-mentioned problems of representing accurate call models for integrated telephony platforms, it only addresses using XML-based language to achieve system communication of the more simple CTI call-control functions and call states as are currently handled using call control XML (CCXML) and VoiceXML (VXML), both of which are recommended by the World Wide Web Consortium.


In actual practice, communication center (CC) telephony applications are much more complex in scope and represent much more than simple call control commands and Interactive Voice Response (IVR) system scripting. A typical CC application today may include interactive voice response (IVR) scripts, intelligent routing strategies, various call control scenarios, agent scripting, statistical reporting, interaction workflow processing, agent level routing, customer profile-related routing, outbound call support, and multimedia interactions.


In current art, the above-mentioned components may be distributed over different servers and may be built with the aid of different tools and in different languages. Therefore, a CC application designer must work with many different tools to create one CC application. Such a multi-tool effort requires a very high level of expertise and effort.


In current art, achieving uniformity, platform independence, vendor neutrality, and simplification in creation of business applications is facilitated through implementation of Extensible Markup Language (XML) and related technologies. XML is increasingly used as a basis for building applications in different vertical businesses. Good examples of using XML in voice processing are the World Wide Web Consortium-recommended VXML and CCXML. However, VXML and CCXML allow only limited call control in CC applications, capturing only IVR scripting and simple call control routines. VXML and CCXML do not address other important aspects of CC applications such interaction workflow, interaction routing, agent involvement such as agent scripting and agent selection, reporting, customer profiling, outbound calling, and multimedia interaction.


The most complicated part of the design process may be writing a routing strategy. A writing strategy defines a target of an interaction based on business data related to interaction, time and data, application-specific data, agent skills, and so on. Moreover, a routing strategy may perform workflow functionality such as sending an interaction to an IVR system for collecting additional data.


What is clearly needed in the art is a method and system for an enhanced and expanded VXML and CCXML that can express routing strategies in terms of XML-based notation thereby simplifying and streamlining the job of application design and enabling creation of reusable modules.


SUMMARY OF THE INVENTION

According to one aspect of the present invention, a method is provided for supplementing existing interaction routines in a multimedia-capable contact center with added capability including acts for (a) creating at least one rule having at least one rule attribute; (b) creating one or more processes, the processes integral to the rule; (c) defining the at least one rule and integral processes as a strategy; and (d) linking the strategy to the interaction routine, the link serving to cause execution of the strategy during an interaction between an entity and the routine, execution thereof promoting further interaction defined in the strategy.


In one aspect in act (a), the rule is an interaction routing rule including the attributes of condition, timeout, and forced routing. In one aspect, the rule may further include one or more sub rules, each having at least one attribute. In a preferred aspect in act (b), the one or more processes are defined by XML tag and may be executed by machine interaction with the associated tag. Also in a preferred aspect in act (c), the strategy is a complete executable routine specifying the one or more rules, attributes and processes.


In one aspect in act (d), the method of linking is by a machine-readable strategy start tag embedded in the enhanced routing routine. In one aspect in act (b), the processes may include variable, variable assign, priority set, data attach, treatment, target set, or target. In one preferred aspect, in act (d), the interaction routine is one of a call control extensible markup language routine or a voice extensible markup language routine.


According to another aspect of the present invention, a software module is provided for generating an interaction strategy from constructs according to rule including at least one script enabling the strategy, the at least one script transformed by the module into at least one script of an alternate language readable by one or more machines cooperating to serve an interaction leveraging the strategy. The software module includes a first interface to a first server containing constructs of a first language used to build the strategy, a generator to script the strategy from the constructs, a transformation module to transform the generated script into the alternate language, a second interface to a second server containing constructs used in the alternate language, and a second generator to script the strategy in a form representing the alternate language.


In one embodiment, the first language is strategy extensible markup language and the alternate language is one of interaction routing language, interaction routing designer extensible markup language, call control extensible markup language, or voice extensible markup language. In a preferred embodiment, the language transformation module is an extensible style sheet language transformation module.


In one embodiment, the act of creating the strategy and transforming the strategy is executed according to a request received from a transaction server, the transformed routine made available to the requesting system via notification in a response to the requesting transaction server. In another embodiment, the act of creating and transforming the strategy is executed according to a request received from a transaction server, the transformed routine or a link thereto embedded into a transaction server response, the response serving as the instruction for the requesting machine to execute the strategy or to invoke the link to execute the strategy.


In one embodiment, the requesting machine is one of a computer integrated telephony private branch exchange switch, a soft private branch exchange switch, or an Internet protocol router. Also in one embodiment, the alternate language is one of web services description language or web flow description language. In another embodiment, the alternate language is Business Process Execution Language for Web Services.





BRIEF DESCRIPTION OF THE DRAWING FIGURES


FIG. 1 is a system diagram of a prior art call center and network connections, wherein the call center is capable of both COST and DNT call handling.



FIG. 2 is a system diagram of a prior art call center having a dedicated bridge connection for both DNT and COST calls



FIG. 3 is a system diagram of another call center with a dedicated bridge connection as in FIG. 2, comprising an IP telephony switch in the call center.



FIG. 4 is a system diagram of a DNT call center and connections to network level, including a unique bridge unit, in an embodiment of the present invention.



FIG. 5 is a system diagram of the unique call center system and connections of FIG. 4, further showing CTI enhancement.



FIG. 6 is an architectural overview of a communication network practicing unique call-model management according to an embodiment of the present invention.



FIG. 7 is a block diagram illustrating CTI-PSTN call-model management approach according to an embodiment of the present invention



FIG. 8 is a block diagram illustrating a CTI-IP call-model management approach according to another embodiment of the present invention



FIG. 9 is a block diagram illustrating an XML based call-model management approach according to yet another embodiment of the present invention.



FIG. 10 is a block diagram illustrating SMCP control over interior and exterior call leg construction in a CTI scenario according to an embodiment of the present invention.



FIG. 11 is a block diagram illustrating SMCP control over interior and exterior call leg construction in a VoIP scenario according to an embodiment of the present invention.



FIG. 12 is flow diagram illustrating basic steps for establishing an outbound call connection using XML-based SCMP.



FIG. 13 is a flow diagram illustrating basic steps for establishing an incoming call connection using XML-based SCMP.



FIG. 14 is an architectural overview of a multimedia communication center enhanced for intelligent routing and workflow management according to an embodiment of the present invention.



FIG. 15 is a block diagram illustrating components of SW of FIG. 14 according to an embodiment of the present invention.



FIG. 16 is a block diagram illustrating at least four basic communication center environments that may be enhanced with XStrategy.



FIG. 17 is a process flow chart illustrating a CCXML telephony script adapted to invoke VXML and SXML according to an embodiment of the present invention.



FIG. 18 is a block diagram illustrating keyword options for use in an SXML XStrategy routine.



FIG. 19 is a block diagram illustrating optional tags that may be found within XStrategy script according to an embodiment of the present invention.



FIG. 20 is an entity relational diagram illustrating tag interrelationships and hierarchy in an XStrategy script 2000 according to an embodiment of the present invention.



FIG. 21 is a block diagram of a relationship between XStrategy (SXML) and other genetic languages according to one embodiment of the invention.





DETAILED DESCRIPTION


FIG. 1 is a system diagram of a prior art call center and network connections, wherein the call center is capable of both COST and IPNT call handling. In FIG. 1 telecommunications network 11 comprises a publicly switched telephone network (PSTN) 13, the Internet network 15, and a call center 17. PSTN network 13 may be a private network rather than a public network, and Internet 15 may be another public or a private data network as are known in the art.


In this basic prior art example, call center 17 is equipped to handle both COST calls and IPNT calls. Both COST calls and IPNT calls are delivered to call-center 17 by separate network connections. For example, a telephony switch 19 in the PSTN may receive incoming telephone calls and rout them over a COST network connection 23 to a central switching apparatus 27 located within call center 17. IPNT calls via Internet 15 are routed via a data router 21 over a data-network connection 25 to an IPNT router 29 within call center 17. In this example, network switch 19 is meant to represent a wide variety of processing and switching equipment in a PSTN, and router 21 is exemplary of many routers and IP switches in the Internet, as known in the art.


Call center 17 further comprises four agent stations 31, 33, 35, and 37. Each of these agent stations, such as agent station 31, for example, comprises an agent's telephone 47 for COST telephone communication and an agent's PC/VDU 39 for IPNT communication and additional data processing and viewing. Agent's telephones 49, 51, and 53 along with agent's PC/VDU 41, 43, and 45 are in similar arrangement in agent stations 33, 35, and 37 respectively. Agent's telephones, such as agent's telephone 49, are connected to COST switching apparatus 27 via telephone wiring 56.


A LAN 55 connects agent's PC/VDU's to one another and to a CPE IPNT router 29. A customer-information-service (CIS) server 57 is connected to LAN 55 and provides additional stored information about callers to each LAN-connected agent. Router 29 routes incoming IPNT calls to agent's PC/VDU's that are also LAN connected as previously described. A data network connection 25 connects data router 29 to data router 21 located in Internet 15. Specific Internet access and connectivity is not shown, as such is well known in the art, and may be accomplished in any one of several ways. The salient feature to be emphasized in this prior art example is that separate connections and equipment are necessary and implemented to be able to handle both COST and IPNT calls at the call center.


Each agent's PC/VDU, such as PC/VDU 45 has a connection via LAN 55 and data network connection 25 to Internet 15 while the assigned agent is logged on to the system, however, this is not specifically required but rather preferred, so that incoming IPNT calls may be routed efficiently. Dial-up connecting rather than a continuous connection to Internet 15 may sometimes be employed.


An agent operating at an agent station such as agent station 33 may have COST calls arriving on agent's telephone 49 while IPNT calls are arriving on agent's PC/VDU 41. In this particular example lack of a connection between router 29 and switching apparatus 27 creates a cumbersome situation, requiring agents to distribute there time as best they can between the two types of calls. Thus, agent time is not utilized to maximum efficiency with respect to the total incoming calls possible from both networks.



FIG. 2 is a system diagram of a prior art call center having a dedicated bridge connection for both IPNT and COST calls. Telecommunications network 59 comprises PSTN 13, Internet 15, and a call center 67. This prior art example is similar in architecture to the prior art example of FIG. 1 with an exception in how IPNT and COST calls are delivered to call center 67. Therefore, many of the same elements present in FIG. 1 are shown again in this example, such as telephony switching apparatus 27, agent stations 31-37, LAN connectivity, and so on.


Referring again to FIG. 2, a known network data bridging technique and apparatus is provided, most typically by a local phone company, wherein COST calls and IPNT calls may be routed side by side over one trunk to call center 67. This bridge comprises a first telephone-data modem 61, a suitable trunk connection such as a T1 or E1 trunk 65 as is known in the art, and a second telephone-data modem 63. Telephone-data modem 61 resides at the public-network level, typically with a local telephone company's equipment, but could also be in the PSTN cloud or even the Internet cloud. Telephone-data modem 61 is connected to the PSTN by exemplary COST telephony switch 19 via COST connection 23 and to exemplary data router 21 in Internet 15 via data network connection 25. Calls for call center 67 originating from the PSTN and from Internet 15 are transmitted to telephone-data modem 61. Arriving calls are then routed over dedicated channels within trunk 65 to telephony-data modem 63 at call center 67. For example, a certain number of channels within trunk 65 are dedicated to carrying COST calls while the remaining channels are dedicated to carrying IPNT calls and other data. This is not a dynamic, but a fixed allocation, wherein the portion dedicated to COST transmission remains constant.


Calls that are received at telephone-data modem 63 from trunk 65 are routed appropriately depending on type of call. For example, COST calls are routed to switching apparatus 27, and IPNT calls are routed to data router 29. In both cases, further routing to agents is the same as described with reference to the prior art example of FIG. 1.


Although the network-data bridging technique, as described above with reference to FIG. 2, requires only one connection (65) to provide both COST and IPNT service to call center 67, trunk 65 is partitioned and requires expensive hardware on both ends to provide and maintain service. Further, agents face the same issues regarding handling separate types of calls as was previously described with reference to the prior art example of FIG. 1. The dedicated bandwidth issue is still a problem because the allocation of bandwidth in trunk 65 is fixed, while call loading by type will vary.



FIG. 3 is a system diagram of another system an art known to the inventors with a dedicated bridge connection as in FIG. 2, comprising an IP telephony switch in the call center. Telecommunications network 73 comprises PSTN 13, Internet 15, and call center 75. The architecture of telecommunications network 75 is similar to the architecture of the prior art example of FIG. 2 with at least two important differences. Firstly, call center 75 is enhanced with an Internet protocol (IP) central-telephony switch 28 that has the ability to convert PSTN call data to IP format, and to distribute the calls as IPNT calls on LAN 7. This enables incoming PSTN calls to essentially be converted into IPNT calls so far as receiving agents are concerned. Secondly, instead of regular ACD type telephones such as agent's telephone 49 of FIG. 2, each agent station 31, 33, 35, and 37 is equipped with an IP-telephone, such as telephones 77, 79, 81, and 83 respectively. Each IP-telephone such as IP-telephone 81, for example, is connected to LAN 77. LAN 77 is enabled for IP data as well as other data that may be transmitted from time to time.


In this prior art example, the requirement for COST telephone wiring such as wiring 56 of FIGS. 1 and 2 is eliminated. Incoming COST calls arriving at telephone-data modem 63 are sent over connection 71 to IP-telephony switch 28. IP-telephony switch 28 converts COST calls to IPNT format before routing the calls to individual IP-telephones over LAN 77. IPNT calls arriving from Internet 15 at telephone-data modem 63 are routed over connection 69 to data router 29 and on to agent's PC/VDU's or agent's IP telephones in the same procedure as described with reference to the prior art example of FIG. 2.


An advantage of this embodiment is that agents may handle both COST-IPNT calls (COST calls converted to IPNT format in IP-telephony switch 28) and regular IPNT calls with either a LAN connected IP-telephone or a LAN connected PC/VDU. Agent time is better utilized. However, the hardware used to facilitate the network-data bridging technique as described with reference to the prior art example of FIG. 2 is not eliminated. Therefore, cost savings is still relatively limited.



FIG. 4 is a system diagram of an IPNT call center and connections to network level, including a unique bridge unit, in an embodiment of the present invention. It is emphasized that the system shown and the description below of the system is exemplary only, and not limiting in the breadth of the present invention. The IPNT aspects of the call center could be implemented in a different, but still data network type protocol. Also the fact of a call center in the example is exemplary. The call center may be any DNT local or customer-premises type system, such as a telephone system at any company.


In this embodiment of the invention COST calls, represented in PSTN network 13 by arrow 90, are converted to IPNT format at the network level before being routed to a call center, and IPNT calls may also be converted to COST calls. This unique and innovative capability would, in a preferred embodiment, be provided by a local telephone company as a service to companies hosting IPNT call centers. The conversion, however, is not limited to the equipment of a local phone company. The conversion bridge may also be in the PSTN or other network, or in the Internet space. Conversion also is not limited to two networks, although examples to follow show two networks for simplicity in description. Bridge units according to the invention may connect to, and operate between three, four, or more networks.


Telecommunications network 85 comprises PSTN 13, Internet 15, and an IPNT-enhanced call-center 89. According to a preferred embodiment of the present invention, a COST-IPNT computerized bridge 87 is provided as a universal bi-directional connection between PSTN 13 and Internet 15. For example, bridge 87 has the ability to convert COST calls to IPNT and IPNT calls to COST format, and also to receive and place calls of both types.


In an example, COST calls received on trunk 23 may be associated with an IP address and routed through Internet 15 to a call center 89, or to any other IP address. In a preferred embodiment IP addresses are associated in a database either resident in the computerized bridge unit or accessible to the bridge. Companies having IP-only call centers may now advertise an 800 (or other no-charge-to-calling-party) COST number, that can be matched via the database to an IP address of a first data-router such as data router 29 within call center 89. Such a database may be relatively limited, such as to clientele of a local telephone company providing the service, or, in the opposite extreme, every COST number assigned in the world may be associated in such a database with an IP address.


Now, a call center such as call center 87 may be implemented as an IPNT-only call center, eliminating much hardware, software, and connectivity associated with prior art call centers. For example, because all incoming calls to call center 87 are now IPNT calls, expensive COST telephony switching apparatus normally found within call centers are no longer required. IP switching apparatus as shown in FIG. 3 is no longer required. COST telephony wiring such as wiring 56 of FIG. 2 is similarly eliminated. A range of other equipment and software associated with COST call centers is also eliminated. Call center functions are substituted with less expensive and easier managed IPNT counterparts running appropriate software applications. Expensive network cabling and hardware used in prior art bridging techniques as described with reference to FIGS. 2 and 3 above is eliminated as well. As a result, companies offering the service as well as companies hosting call centers realize substantial cost reductions related to previously required architecture and infrastructure.


Referring again to FIG. 4, PSTN callers may dial an 800 number, as previously mentioned, that connects them to bridge 87. A matching IP address is retrieved, typically from a database, and the COST call is then converted to IPNT format and routed via the best route available through Internet 15. All quality assurance techniques such as reserving bandwidth, compression techniques, special servers, firewall applications, encryption, and so on, as known to the inventors may be applied.


All incoming calls to call center 89 are now IPNT calls and are received and routed via data router 29 to agents working at agent stations 31, 33, 35, and 37. IPNT calls originating from a caller at a COST number are handled in the same way as IPNT calls originating from Internet 15. Thus, a seamless integration is achieved.


This innovative system and apparatus also works in reverse as follows: An IPNT call may be initiated by an agent within call center 89, perhaps as a call back to a COST caller, and connection may be achieved in a variety of ways. In one embodiment, bridge 87 has voice response or software code capability whereby an agent may offer a COST caller's phone number via spoken voice, software code, key stroke (if using PC/VDU), or touch tone (if using IP telephone) enabling a lookup and subsequent dialing of a COST caller's number. When the called party answers, conversation may ensue between the agent at call center 89 and the called party on a COST telephone connected anywhere to the PSTN network. Also, calls coming from the Internet cloud, represented by arrow 91, may be redirected over the bridge to a COST call center.


In an alternative embodiment, a COST telephone number may be encoded by an agent in call center 89 into an IP address of the bridge, and the bridge is adapted to extract that COST number from the IP address or other header in an incoming IP call from the call center. The coded portion of the IP address may also have just a key instead of the entire COST number, and the key may allow look-up in a stored table at the bridge to certain the COST number to which the call may be connected and translated.


In yet another alternative embodiment, customers may be given IP addresses if they do not already have one so that a general table listing PSTN numbers to IP address numbers may be created and kept both at call center 89 and at COST-IPNT bridge 87. In this instance, customers who do not own a computer would still have a registered IP address for matching purposes. An agent could supply the IP address via voice or other methods as previously described. A database of COST numbers and IP address matches could be far reaching and could conceivably include anyone weather they have patronized a call center or not, or weather they own a computer or not.


In some embodiments of the present invention, data router 29 would not be required. This would be a case wherein the method and apparatus of the present invention is used with a very small call-in location, perhaps operating only a few agent stations or, perhaps, only one agent station. COST-IPNT bridge 87 would route calls directly to the IP address of the agent's computer or IP. Further, routing may be accomplished via an agent's PC/VDU if there is more than one, but a relatively few operating agents.


In still another embodiment, back-up IP addresses may be programmed into COST-IPNT bridge 87 so that when a COST caller dials a free-to-calling-party number, after conversion to IPNT format a first IP address may be replaced by a second or back-up IP address if there is a long wait or if the first IP address is busy. In this case the converted call would be routed to the second choice IP address, and so on. This could be particularly useful for small business wherein only a few contacts are available and expense for a data router would be prohibitive.



FIG. 5 is a system diagram of the unique call center system and connections of FIG. 4, further showing CTI enhancement. In this embodiment sophisticated routing rules known to the inventors may be initiated and executed via transaction-server control over certain hardware (i.e. switches and routers) established in both PSTN 13 and Internet 15. This particular embodiment would most likely be utilized by large organizations hosting many call-centers, which may be spread over a large geographical region.


Referring again to FIG. 5, telecommunications center 91 comprises PSTN 13, Internet 15, COST-IPNT bridge 87 and an IPNT call-center 93. A service control point (SCP) 92 processes incoming COST calls represented by vector 90. A CTI processor 95 executing one or more CTI applications, and known as a T-Server (TS) is connected to router 29. T-Server 95 is connected in the call center to router 29, and monitors activity at router 29 and also exercises control at various levels over operation of router 29. That is, T-Server 95 may be informed of all incoming calls, exercise sophisticated routing rules, and control router 29 in following the routing rules. T-Server 95 is not limited to routing rules and algorithms, but may provide a considerable range of CTI functions. Router 91 can act as SCP for IPNT-originated calls, and may route them to the IPNT call center, or via the bridge to the COST network.


In this embodiment a second T-Server 95 is integrated with equipment at the network level, such as with the SCP in PSTN 13. The T-Server at call center 93 and the T-Server at the network level are connected by a digital link 94. Thus certain T-S routing and control routines (known to the inventors) can be executed at SCP 92. CTI hardware such as additional processors, stat-servers, intelligent peripherals, and the like that may be present in PSTN 13 are not shown but may be assumed to be present in this particular embodiment.


When a COST call arrives at SCP 92, information is typically obtained from the caller via IVR or other methods known in the art. This information may include call destination, purpose of the call, caller identity, etc. This information in some embodiments may be transmitted to call center 93 via link 94 before delivery of the actual call. Based on the information obtained at SCP 92 and, perhaps additional data supplied by T-S 95, the call is routed to a predetermined destination, in this case, COST-IPNT bridge 87 over telephone network connection 23. In another embodiment, T-S 95 may cause an incoming COST call to be routed to another COST-IPNT bridge, or some other destination.


As described with reference to FIG. 4, COST calls arriving at bridge 87 are routed through Internet 15 on data-network connection 25 as IPNT calls. The bridge serves as a dynamically translating interface. A data router 21 is shown connected to line 25 within Internet 15 and is used as a first destination of COST-IPNT bridge 87.


In some embodiments T-S 95 at the call center may also interact with router 21, exemplary of routers and IP switches in the Internet, via connection 26. There may also be instances of T-Servers 95 as shown associated with Internet routers and switches, which may communicate with T-Server 95 at call center 93, to provide CTI functions in the network initiated at call center level.


If it is determined by a T-Server 95 that a call has been miss-routed due to error, for example, it can reroute the call to another location in Internet 15, such as another routing point, or it can rout the call back to PSTN 13 through PSTN/IPNT bridge 87 where the call would be converted back to a PSTN call and sent back to SCP 92, or perhaps another location within PSTN 13. In this and other ways T-S 95 may exercise control over calls at the network level before a call arrives at call-center 93.


In the absence of rerouting, calls arriving at data router 29 are further routed to individual agents as they become available to handle calls. Either IP telephones such as IP telephone 83 or PC/VDU's such as agent's PC/VDU 45 may be used to answer calls. Also, conventional telephones may also be connected individually to PC/VDU's as is shown with reference to agent station 37. In this case, IP telephone 85 is not connected to LAN 77 but rather to PC/VDU 45 via a cable 99. Cable 99 would, in embodiments known to the inventors, acts as an interfacing cable connecting the telephones speaker and microphone functions to a sound card on PC/VDU 45 allowing an IPNT transaction to handled by a conventional telephone. There are several ways such an interface may be made.


The embodiment described with reference to FIG. 5 is useful where sophisticated routing rules are to be implemented. Load balancing between call centers, statistical routing, predictive routing, take-back-and transfer, and other functionality known to the inventors can be applied through T-Server control.


It will be apparent to one with skill in the art that the method and apparatus of the present invention may be used in very large call-center embodiments or in very small call-in centers without departing from the spirit and scope of the present invention. COST-IPNT bridge 87 can be set up to facilitate many companies of various sizes. For example, in one embodiment, a two man company or even an isolated salesman operating from a computer-enhanced sales-order desk may subscribe to a service providing advantages according to the present invention and have their IP address or addresses programmed directly into COST-IPNT bridge 87 so as obviate use of expensive telephone call center equipment.


In another embodiment, a large call center host organization may utilize the present invention with T-server control to distribute calls over a wide geographic region with many call centers and routing points. It will also be apparent to one with skill in the art that there may be many more than one COST-IPNT bridge such as bridge 87 distributed over different geographic locations, and that a single company may reserve access to more than one COST-IPNT bridge at those different locations.


Further, it will be apparent to the skilled artisan that the method and apparatus of the present invention may be applied to many varying network and call center architectures and infrastructures without departing from the spirit and scope of the present invention. For example, instead of applying the method and apparatus of the present invention to PSTN 13 and Internet 15, a private telephone network and a separate and private wide area data network may utilized, and so on. Also, call centers subscribing to services according to embodiments of the present invention may be pure IPNT call centers, or a combination of COST and IPNT. Such a case would be a large call center offering many different areas of service via IPNT whereas bill collection or credit analysis is still handled via COST telephony, and so on.


In yet another aspect of the invention, bridges similar to bridge 87 may be provided between any two protocol-incompatible networks. The interface and functionality described is not necessarily limited to connection-oriented networks interfacing with non-connection-oriented networks. Two DNT networks of dissimilar data protocol could be similarly linked, and two connection-oriented networks having incompatible call protocol could also be similarly linked, for example.


Simple Media Control Protocol (SMCP)



FIG. 6 is an architectural overview of a communication network 600 practicing call-model management according to an embodiment of the present invention. Communication network 600 represents a state-of-the-art network that enables dual communication center capabilities. Network 600 comprises a public-switched-telephony-network (PSTN) 617, a data packet network, which in this example is the well-known Internet network 616, and a dually capable communication center 605.


PSTN network 617 may instead be a private telephone network instead of a public one. Internet network 616 may instead be a corporate wide-area-network (WAN), an Intranet network, or any other type of data packet network (DPN) that supports Internet protocol (IP) telephony. The inventors choose the PSTN network and the Internet network in this example because of high public-access characteristics and because of the existence of already developed and standardized protocols, which enable and enhance integrated telephony.


A customer telephone 619 is illustrated as connected to PSTN network 617 by way of a COST telephone line 618. It may be assumed in this example that within PSTN 617 there are a variety of telephone switches, servers control points, and gateways for enabling cross-network data conversion.


Internet network 616 has illustrated therein a Web server 615 shown connected to an Internet backbone 614. Internet backbone 614 represents all of the lines equipment and connection points that make up the Internet network as a whole. Web server 615 is configured as a customer-interfacing file server through which customers may initiate contact with communication center 605. It will be appreciated by those with skill in the art that a variety of other types of Web servers as well as IP data routers and other network equipment may be assumed to be present in network 616 having connection with Internet backbone 614.


A personal computer 621 labeled herein as a customer PC is illustrated as connected to Internet backbone 614 by an Internet-connection line 622. PC 621 may be any other type of Internet-capable device that supports IP telephony. Internet-connection line 622 may be assumed in this example to include an Internet service provider (ISP) and standard PSTN connection equipment, although none of these are illustrated. Any known Internet connection scheme may be employed with respect to enabling Internet access for PC 621 or equivalent appliance. One well-known common method is a typical dial-up modem connection through the well-known PSTN network using an ISP. Other well-known schemes include digital service line (DSL), integrated services digital network (ISDN), cable-modem connection, wireless Internet connection via a wireless modem, fiber optics, lasers and others. The inventors logically illustrate connection line 622, which is meant to include all possible Internet connection mechanisms and equipment.


Communication center 605 has a central telephony switch 611 illustrated therein, which in this example is a private branch exchange switch. Switch 611 is illustrated as connected to PSTN 617 by telephony trunk(s) 623. Customer phone 619 is meant to represent all possible callers accessing communication center 605 through PSTN 617. Customer PC 621 is meant to represent all correspondents accessing communication center 605 through, in this example, Internet network 616.


As was described in the background section of this specification, communication center 605, as a dually-capable communication center, supports a local area network (LAN), illustrated in this example as LAN 604. LAN 604 is connected to Internet backbone 614 by a network access line 624. Access line 624 logically represents Internet capability of communication center 605 for sending and receiving IP transactions including IP telephony. Actual Internet connection capability of communication center 605 may comprise a 24×7 connection or a dial-up connection. LAN 604 is enhanced to support Internet-based telephony and other Internet-based media transport technologies. In effect, LAN 604 may be considered a sub-network of Internet network 616.


Communication center 605 is capable of sending and receiving COST telephone calls as well as IP telephone calls. For example, incoming COST calls arrive at PBX switch 611 while incoming IP calls arrive on LAN 604 and interface with an IP router 607 illustrated within communication center 605 and connected to LAN 604. It is important to note herein that communication center 605 is not limited to the illustrated configuration represented in this example. For example, considering the network-level bridging capabilities illustrated with respect to FIGS. 3-5 of priority application Ser. No. 09/024,923, center 605 may be adapted and configured to operate according to any one of the illustrated architectures.


The exemplary configuration of communication center 605 shown in this example is used for the purpose of adequately describing various aspects of the present invention. Network-level bridging as described with reference to priority document Ser. No. 09/024,923 may be assumed to be present in this example. Moreover, CTI enhancement representing third-party call control, as illustrated with respect to FIG. 5 above is further enhanced in various aspects of the present invention.


Referring again to FIG. 6, a CTI server 606 is provided and illustrated as connected to LAN 604 via a LAN connection. CTI server 606 is adapted to provide third-party call control over illustrated switching entities (SWE) PBX 611 and IP router 607, to which this server is coupled. CTI server 606 has call control software installed thereon and illustrated in this example as transaction server (TS) 608. For the purpose of simple illustration, TS 608 is shown separately but logically connected to CTI server 606. TS 608 is analogous in many respects to T-S 95 illustrated in FIG. 5 above. For example, TS 608 contains routing and service logic required to successfully route calls from either PSTN 617 or Internet 616 within and in some cases without communication center 605. CTI server 606 is connected to PBX 611 by a CTI link 620. CTI server 606 establishes connection with router 607 by way of LAN 604. It is well known in the art that SW instances such as servers may sit on a variety of different computers in the network, and deliver the same functionality. It is therefore only as an illustration, what specific computers have been assigned which functions.


IP router 607 is adapted to communicate using protocol H.323 (609) as defined in the background section of the specification. Router 607 comprises a virtual switch matrix that defines all of the endpoint routing possibilities within communication center 605. Also connected to LAN 604 is an exemplary Agent's Workstation 601, further detailed by presence of an agent computer 602 and an agent telephone 603. Agent computer 602 is connected to LAN 604 by way of a LAN connection. Telephone 603 is connected to PBX switch 611 by an internal telephony wiring 625. It is noted herein that telephone 603 is also coupled to agent computer 602. This may be, for example, by way of a cable connected to any sound card installed within computer 602. This configuration, known to the s, allows telephone 603 to be used both as a COST telephone and an IP telephone. However, for purposes of the specification it will be assumed that telephone 603 is employed to handle COST calls from PSTN 617 while computer 602 is employed to handle IP calls arriving from Internet 616. Other architecture is possible, such as separate IP and COST telephones. A database facility (DB) 610 is provided and connected to LAN 604. DB 610 is adapted in this example as a customer information database and server (CIS) and is provided as a resource to communication center agents.


As was described with reference to the background section, one of the main challenges to enabling successful telephony with third-party control is maintaining consensus concerning a call model, attributes of which enable all third-party control functions. For example, PBX switch 611 is a vendor-provided switch conforming to a particular call model. TS 608 must have knowledge of that call model in order to be used to build third-party controls. IP router 607 also conforms to a particular call model for, in this example, VoIP conforming to protocol H.323. In order to provide third-party control over router 607, TS 608 must have knowledge of that model. Although it is not shown in this example, it may be assumed that there is also third-party control over network-level switches and IP routers. In this case, TS 608 must also have knowledge of the call models of those switches and routers that are to be controlled.


While telephony, Internet, and device protocols enable some third-party control, more so regarding PSTN control than DPN control, as described in the background section, requiring that all call models be reverse-engineered and emulated by TS 608 adds considerable complexity to a coherent and continually reliable telephone service capability as provided by communication center 605. For example, if communication center 605 replaces switch 611 with a switch from another vendor conforming to a different call model, TS 608 would have to be retooled (reprogrammed) in order to enable third-party control over the new switch. The same would be true regarding router 607. Even with the availability of such tools (e.g. Genesys T-Server™), there is a complexity involved, and that leaves room for mistakes, due to revision levels, SW errors etc.


In an embodiment of the present invention TS 608 is enhanced with an instance of a protocol software termed Simple Media Control Protocol (SMCP) by the inventors. An instance of SMCP 626a is illustrated as integrated with TS 608. An instance of SMCP 626b is illustrated as provided to PBX 611, and an instance of SMCP 626c is illustrated as provided to IP router 607. Instances of SMCP communicate with each other using a low-level software protocol that allows for only one call model to be emulated by TS 608 and provides access to switching entities 611 (PBX) and 607 (IP router).


It is reminded herein that a call model emulates a switch state of a switch or router manufactured by a vendor. It will be appreciated by one with skill in the art that not all switch states are universal and vendors are prone to adding modifications to their switch states, which must then be emulated by CTI software to continue reliable third-party control over such switches and routers. It will also be appreciated that there is a great richness and a variety of state-of-art controls and functions that enable many varying call behaviors. Therefore, the typical call model is very complex indeed. The challenge of providing reliable third-party control is especially difficult when dealing with distributive DPN environments such as VoIP wherein end devices and distributed gateways, if any, share switching intelligence.


SMCP 626 provides that only one call model need be established by the call controlling entity (CCE), namely CTI server 606. SMCP instances 626a, 626b and 626c need only provide definitive access to switching function without necessitating a complex call model. In this way, greater flexibility and reliability is realized in third-party or CTI server control over PBX 611. Moreover, the exact same call model for control over PBX 611 may also be used to control router 607 and provide all of the same PBX-based services to IP callers from Internet 616.



FIG. 7 is a block diagram illustrating a CTI-PSTN call-model management approach according to an embodiment of the present invention. In this example, there are 2 illustrated third-party control states, one at left, and one at right within FIG. 7. In a classic prior-art approach within a PSTN environment a CTI server 608 is illustrated and has a Call Model supported therein, the call model illustrated as an abstraction comprising a plurality of circles and directional arrows. The call model represents the actual switch state of a PBX or other telephony switch. The CTI server 608 may be analogous to CTI server 606 of FIG. 6 in a prior-art sense with no SMCP enhancement. The CTI server 608 communicates with a switch illustrated herein as switch 611a by way of a CTI protocol link 700 analogous to CTI link 620 of FIG. 6.


Software running on switch 611a is illustrated herein as software 621 which contains a Call Model, hopefully identically emulated in server 608. Switch 611 may also have a switching matrix 702, which is the actual physical switch capability of switch 611a. In prior-art then, switch 608 provides a third party control over switching matrix 702 only by being able to identically emulate call model objects common in both call models. Control routines including call service and routing routines utilize the call model objects within their commands. Both machines must recognize and understand, by virtue of software, all included call model objects. If the call model of PBX software 621 is updated or changes in any way, the call model within CTI server 608 must be identically updated or retooled to reflect the update to avoid difficulty or failure.


Referring now to a preferred embodiment illustrated at right, a CTI server 704 is illustrated having a Call Model represented identically as the call model of CTI server 608. In addition to the described Call Model, CTI server 704 also has a thin SMCP stack or layer 705 installed therein and integrated with the CTI server Call Model. This combination is referred to as a Call Control Entity (CCE) in this specification. A Switching Entity (SWE) labeled 611b is assumed analogous to PBX 611 enhanced with SMCP 626b as described in a preferred embodiment with reference to FIG. 6. SWE 611b has identical (to Switch 611a) switching matrix 702 installed therein and also has a thin SMCP stack, which obviates the need for a call model. In actual practice of the present invention, call model objects contained within control routines in commands are described in low-level parameters using SMCP 705, which communicates to SMCP of SWE 611b over a communication link 703. Because SMCP is expressed in a low-level descriptor language, call model objects generic to the call model in server 704 can simply be described along with the commands for controlling switching matrix 702.


In this example, the actual switch state is represented by SWE 611b simply as a descriptor language with no high-level call model objects. In this example, all of the available switching embodiments may be accessed and controlled using SMCP in accordance to only one established call model maintained by the CCE, in this case, server 704.



FIG. 8 is a block diagram illustrating a CTI-IP call-model management approach according to a preferred embodiment of the present invention. This example represents 2 different CTI control states, and a CTI server representing a CCE controls an IP router analogous to router 607 of FIG. 6. A classic prior-art state is represented at the left of FIG. 8 while a preferred embodiment utilizing SMCP is illustrated at right.


Referring now to the classic prior-art representation, CTI server 608 communicates with an IP router 607a utilizing CTI protocol over a link 700. Link 700 may be analogous to LAN 604 of FIG. 6. As represented in FIG. 7, CTI server 608 contains a Call Model that emulates a Call Model provided with an IP router 607a and enabled by a software 621. The Call Model facilitated by software 21 includes a virtual switching matrix 702 defining the actual switch state and capability of IP router 607a. Call Model objects defined within software 621 must be identically emulated at CTI server 608 with respect to its Call Model.


Virtual switching matrix 702 defines all of the edge computers and end points within a communication center that may accept IP calls. In this classic approach, CTI server 608 communicates through CTI protocol to IP router 607a in order to execute third-party control over virtual switching matrix 702, which defines the functional capabilities of IP router 607a. As was described above in the PBX embodiment with reference to FIG. 7, the mirrored Call Model within CTI server 608 must be retooled to reflect every update or change occurring within software 621 and the affected Call Model of IP router 607a. It will be appreciated by one with skill in the art that the Call Model representing the IP switching environment will add considerable complexity to an emulated Call Model in CTI server 608, assuming that a single call model will be constructed to handle both PBX and IP telephony within a given communication center. Moreover, because IP networks are disparate with respect to protocols, in call-routing and connection methods from a standard PSTN network more complexity is required to integrate CTI and IP communication, which must be accomplished to enable third-party control.


Referring now to a preferred embodiment of the present invention illustrated at right in FIG. 8, CTI server 704 is enhanced with SMCP stack 705 as was illustrated with respect to FIG. 7 above. However, in this example CTI server 704 communicates with a modified IP router 607b. The modification to IP router 607b involves eliminating the need to maintain a Call Model as is illustrated with IP router 607 a by virtue of providing a thin SMCP stack integrated with router software. CTI server 704 is termed a CCE and IP call router 607b is termed a SWE. Communication between the illustrated SMCP stacks is accomplished over link 703, which in the example of FIG. 6 is analogous to LAN 604.


Virtual switching matrix 702 is identical in both router a and router 607b. The advantage of using SMCP is that high-level objects do not have to be represented in two separate Call Models. Again, a low-level descriptor language represents the Call Model of CTI server 704 to router software, which in turn by virtue of SMCP, enables CTI access to virtual switching matrix 702. In this example, the Call Model emulated in CTI server 704 maybe identical to the PBX Call Model for providing third party control over a PBX switch. SMCP enables manipulation of virtual switching matrix 702 according to the service logic and intelligence available in the PBX model.



FIG. 9 is a block diagram illustrating an XML-based call-model management approach according to yet another embodiment of the present invention. In this example, a CTI server 800 is enhanced with a capability of providing third-party call control in a classic sense in a PBX embodiment and simultaneously using SMCP to provide control in an IP embodiment.


A CTI server 800 is illustrated with a Call Model 801 and a call-model manager (CMM), which is XML-based meaning that the low-level SMCP descriptor language is in fact XML. Switch 611a, which is analogous to switch 611 of FIG. 6 is a classic vendor-provided switch containing a Call Model and a switching matrix 702. CTI server 800 exerts third-party control over switch 611a by way of CTI protocol link 700 as was described with reference to FIG. 7 at left. A Call Model 801 enabled by CTI software emulates PBX software model 621 and normal CTI protocols are used in communication over link 700. XML-CMM 802 is a virtual Call Model expressed in XML language. XML-CMM 802 contains all of the XML attributes of Call Model 801.


CTI server 800 is the CCE while PBX switch 611a and SMCP-enhanced IP router 611b are SWEs. Note that the switching matrix 702 of IP call router 611b is a virtual matrix and is not identical to switching matrix 702 of PBX switch 611a. In this enhanced embodiment, only a single Call Model (801) is required to control PBX switch 611a in a classic CTI sense and for controlling IP router 611b using the novel SMCP protocol. It is noted herein that in embodiments illustrated and described with reference to FIGS. 7, 8 and 9, SMCP-enhanced SWEs contain no service logic or other intelligent routine logic.


It will be apparent to one with skill in the art that SMCP enhancement as described with reference to FIGS. 7-9 enables use of a single Call Model maintained only by a CCE (third-party controller) and that vendors of telephony switches and data-packet routers then need not maintain elaborate Call Models. All that is required to practice the present invention is to enable low-level access (command control) of a CCE to physical and virtual switching elements maintained in telephone switches and IP routers. As a result, much additional complexity and integration of protocols and provision of updated or revised Call Model objects is eliminated. More detail regarding SMCP capability is described below.



FIG. 10 is a block diagram illustrating SMCP control over interior and exterior call leg construction using a voice-switch commutator according to an embodiment of the present invention. As is known in the art, all telephony including IP telephony communications involve constructed connection states that make up call legs in the art. A call leg is essentially one-half of a connected call. Call legs in a PSTN environment are physical legs that are dedicated-connection oriented. Call legs in a VoIP environment are virtual call legs. A Call Control Entity (CCE) 1005, assumed to be a CTI server analogous to server 606 of FIG. 6, is illustrated herein and adapted to provide third-party control over an illustrated Switching Entity (SWE) 1000, which is assumed to be analogous in this example to IP router 607 of FIG. 6. In this example, CCE 1005 communicates with SWE 1000 via a LAN network 1004. Both CCE 1005 and SWE 1000 are enhanced with an SMCP stack. It is assumed herein that CCE 1005 maintains a Call Model providing all of the service logic and routing intelligence available within an applicable communication center environment.


A plurality of incoming IP telephony trunks 1003 are illustrated as ported to SWE 1000. A virtual switching matrix 1001 serves as a switching interface (software) between IP trunks 1003 and a like number of illustrated connection ports 1008. Call legs 1010, illustrated within switching matrix 1001 identified as interior call legs. For example, the upper-most connection port 1003 on SWE 1000 is illustrated as connected to the lowermost connection port 1008 using two interior call legs 1010. The point represented as the junction of the two interior call legs is a call connection point. That is, an incoming call to any of ports 1003 may be maintained with one interior call leg and any connection point. A second interior call leg must be constructed to complete the connection through switching matrix 1001 to any of ports 1008. Moreover, calls arriving at SWE 1000 wherein the final destination is on the same side of switching matrix 1001 have interior call legs connected to ports on a same side of SWE 1000.


Exterior legs are defined as legs exterior to SWE 1000. Exterior legs are represented in this example by element number 1009. It is important to note herein that legs 1009 do not represent separate physical data lines, but rather open data channels, which are logically illustrated.


In this example there is a grouping 1006 of IP telephony devices (End-User Devices) represented herein by an element number 1007. In this logical representation, it may be assumed that exterior legs 1009 are data channels established over LAN 1004 wherein IP devices 1006 are connected directly to LAN 1004 or indirectly to LAN 1004 through individual workstation computers. It is also noted herein that that CCE 1005 and SWE 1000 are represented as abstract modules in the sense that their physical embodiments depend on the exact architecture of a VoIP network. For example, if SMCP is used in an H.323 network, SWE 1000 may be implemented as a Gatekeeper. In an MGCP-based network, the role of SWE can be played by a Media Gateway Controller (MGC) and so on.


In this example, SMCP software assumes that SWE 1000 implements an abstraction of a commutating device allowing separate control of call legs both interior and exterior. That is, SWE 1000 must be able to ensure that externally invisible calls are kept established even when the commutating device tears down and then re-establishes internal connections (call legs). The SMCP stack of SWE 1000 represents the switching state and accepts commands from CCE 1005, which may be XML based or based on other low-level descriptive languages, the commands containing XML description of the various service objects and options generic to the call model of CCE 105.



FIG. 11 is a block diagram illustrating the voice-switch commutator of FIG. 10 implemented in an enterprise VoIP scenario according to an embodiment of the present invention. This example illustrates how SMCP is utilized in an actual VoIP scenario. A communication center LAN 1106 is used to connect a plurality of IP telephony devices represented herein as devices 1117. Each device 1117 has a virtual port 1116 associated therewith. A CCE 1103 (CTI Server) is running an SMCP stack 1105 and a SWE 1102 is running an SMCP stack. CCE 1103 is directly connected to LAN 1106 while SWE 1102 is illustrated as directly connected to LAN 1106 and to an IP gateway 1101


In this example, calls are routed to the communication center or enterprise center from Internet 1108 via an IP router 1110 onto LAN 1106. IP connections are established by commutating call legs within gateway 1101 by SWE 1102 running SMCP 1104. An IP interface port 1114 is provided as an input to gateway 1101. Gateway 1101 has a virtual switching-matrix modeled therein. Call legs are represented in this example by external legs 1113, and internal legs 1115. External legs are logically illustrated from Internet 1108 through router 1110, onto LAN 1106 and into IP port 1114. Internal call legs are represented from a connection point within gateway 1101 (switching matrix) to virtual device ports 1116, and in one instance, between two virtual device ports 1116. The latter illustration is exemplary of versatility of virtual connection.


Call legs are terminated at endpoints and are associated with physical or virtual ports. However, there are some situations that may arise wherein endpoints do not have associated virtual ports. Some ports can be used for support of multiple simultaneous connections. The parts of call legs outside of a switch or a gateway (1101) are called exterior; connections between them inside switches are interior. In this example, more than two call legs can be connected together to form a multi-party conversation.


Typically, endpoints can terminate only one call leg at a time. However, in some cases (for example, call treatment sources, such as music-on-hold) a single endpoint can be connected to multiple call legs. All endpoints have unique endpoint addresses represented, in preferred embodiments, as ASCII character strings. Depending on an exact application, such strings can be telephone numbers, URLs, E-mails, and so on. The exact naming scheme is application-specific.


Similar to other Internet protocols, SMCP messaging is text based. All messages exchanged between SMCP stacks contain only ASCII printable characters, spaces and tabs. Each message line is terminated with a CR-LF sequence (OD OA hex.). Following is an example of actual message structure.

  • Message-verb reference-number CR LF
  • attribute-name: attribute-value CR LF
  • attribute-value-continuation CR LF
  • attribute-name: attribute-value CR LF
  • CR LF


Message verbs and attribute names are strings composed of letters, digits and dashes. Attribute values are arbitrary strings of printable characters, spaces and tabs. An attribute value string can span several lines, with continuation lines starting from space or tab. An empty line (line containing only the CR LF sequence) terminates an entire message. All messages sent by a CCE will be referred to as requests, and all messages sent by SWE will be called events or notifications. Both sides must also send replies in response to received messages in a request response IP environment. Message reference numbers are generated by a CCE during communication. Reference numbers are unique decimal integer numbers used to match replies to requests. All requests and notifications must have reference numbers. SMCP protocol enables end devices to be implemented as less complex (intelligent) devices.



FIG. 12 is flow diagram illustrating basic steps for establishing an outbound call connection using XML-based SCMP. The following process steps illustrate a simplest successful outbound connection but do not illustrate optional treatment. At step 1200 there is no connection established as known for a pre-call state. At step 1201, a call request is sent. This step is initiated when a CCE sends a command to SWE to initiate a call request. It is noted herein that if a request is not valid, SWE responds with an error reply. If a chosen port is busy, SWE responds with a busy reply. Assuming herein that the request is valid, SWE allocates a call-leg identifier and returns it to CCE with a calling reply in step 1202. Step 1202 amounts to an outbound call request acknowledgement.


At step 1203, SWE initiates a transport connection to the endpoint selected in step 1201, and sends a Call Setup message to the endpoint, which replies with a Call Proceeding (CP Received) message indicating that the end point will assume further responsibility for completing the connection. SWE also sends a Call Alert message, which is received in step 1204. The CA message indicates that the call has been delivered to the end-user device, and the end user device has begun alerting the user via a ringing event or other alert.


If a called end user answers the event, the endpoint device called replies with a Setup message, thus initiating the process of establishing a transport connection to complete the connection. SWE informs CCE about this event with a Call Answered notification in step 1205. When a transport set-up is completed, the endpoint device replies with a call-connected or established notification in step 1206.


At any time during the sequence after a Calling notification in step 1202, SWE may inform CCE that the requested connection cannot be completed with a Dropped notification (not illustrated). If CCE did not send a Hang-up request for this call already, a Hang-up request must be sent to release the connection after receipt of a Dropped notification. XML primitives communicated through SMCP provide a reliable mechanism for manipulating or commutating the end-point sides of call legs in this example of out-bound calling. Other procedures not illustrated herein include configuration management, encryption, and fault tolerance.


It will be apparent to one with skill in the art that the process steps illustrated herein may be supplemented with many optional side routines integrated therewith out departing from the spirit and scope of the present invention. For example, intelligent routing routines and multiple party connections may also be implemented and integrated with the basic scheme of this example.



FIG. 13 is a flow diagram illustrating basic steps for establishing an incoming call connection using XML-based SMCP. For managing inbound calls arriving within an enterprise communication center SMCP utilizes four basic protocol data units Ring, Send CP, Send CA, and Answered.


In step 1300, there is no connection as the system is in the state of pre-arrival of an incoming call. At step 1301 SWE detects an Arriving call or attempt to set-up a transport (port to port) connection accepts the request and reads the set-up message. SWE alerts CCE about the incoming event with a ring notification. At step 1302, CCE commands SWE to send a Call Proceeding message to the calling party with a Sending CP request in step 1302. At step 1303, a notification from SWE is received at CCE indicating that the Call proceeding message was sent and arrived at the calling party.


In step 1304, CCE instructs SWE to send a Call Alert (CA) notification to the requested calling party and wait for an OK reply. At step 1305, the Call Alert has arrived and the calling party is notified by a ringing event or other notification. At step 1306, CCE answers the call and requests that SWE perform the transport protocol negotiation with an Answer request, and wait for an OK reply.


In step 1306, SWE sends notification to CCE about success or failure of the requested negotiation. If the transport connection was successful the requested connection is considered established or answered in step 1307 and SWE sends an Answered notification to the CCE. It is important to note herein that at any time after an original Ring notification in step 1305, SWE may notify CCE that the requested connection was abandoned with a Dropped notification. If CCE did not send a Hang-up request for this call, this request must be sent to release the connection after receipt of a Dropped notification. After receiving any reply or notification pertaining to the current call leg, CCE may command SWE to drop the connection with a Hang-up request. After issuing a Hang-up request CCE waits for a Dropped notification from SWE before assuming that the port is available for a next call attempt.


SMCP media-stream commutation allows interconnecting existing exterior call legs in an arbitrary manner. The connections are established with a Make request and are torn down with Break or Hang-up requests. It is important to note that interior connections for different media streams related to a same call leg are different connections, and can be independently established or torn down. It is also noted herein that interior call legs may be established before exterior legs are completed.


It will be apparent to one with skill in the art that the process steps illustrated herein may be supplemented with many optional and or additional side routines integrated therewith out departing from the spirit and scope of the present invention as was described above with reference to FIG. 12. For example, advanced intelligent routing routines and multiple party connections may also be implemented and integrated with the basic scheme of this example. The inventors intend that the simplified process of this example represent just one basic implementation of connecting or establishing an inbound call using SMCP in a VoIP scenario.


Using XML-based primitives as a low level language for SMCP protocol enables one to control exterior and interior call legs. The control procedures allow one to develop different and varied third-party services whose logic is placed into the CTI Server as was described with reference to FIG. 6 above. Created services may include, but are not limited to any standard PBX-based service as well as complementary services like call transfer, call forwarding, conferencing, call hold, etc. These services and more may be provided in a VoIP environment without duplicating a call model in the SWE. Moreover, a wide variety of specific services can be provided that are not supported by standard PBXs.


Referring now back to FIGS. 12 and 13, XML messaging as used in SMCP provides a reliable mechanism for CCE, SWE communication and call leg commutation. Following is an actual example of an XML message Ring notification.
















<?xml version=“1.0”?>



<SMCP version=“1.0”>



<RING



 leg_ID =“12345”



 port=“1392”



 protocol=“h323v2”



 user_information=“SMCP_Callcenter_representative_007”



 DNIS=“9131346”



 Caller=“9131104”



 ANI=“4371100”



 Ring_tone=“urgent”



 peer_type =“conference”>



  <codec



   media-type =“audio”



   codec-type =“g711”/>



</RING>



</SMCP>









The first line is a line common for all XML documents. It says that the following is a XML document and XML is of version 1.0. The second line contains a root tag <SMCP> telling that the XML document is a document related to SMCP vocabulary. In other words it says that the present XML application is SMCP protocol.


The third line opens a tag <RING> that corresponds to SMCP message RING. This tag has 9 attributes corresponding to parameters of the message. These are leg identification (ID), port, protocol, user information, destination number identification service (DNIS), caller, automatic number identification (ANI), ring tone, and peer type. The tag contains tag <codec> as a constant. The tag <codec> in its turn has two attributes media-type and codec-type corresponding to parameters of a Ring message. This fact enables use of multiple codec tags. The last two tags of the XML message terminate the message.


It will be apparent to one with skill in the art that the method and apparatus of the present invention may be utilized in any telephony environment including PBX, standard DNT and in VoIP type environments without departing from the spirit and scope of the present invention. In one embodiment, both classic PBX and VoIP architectures may be supported by a single server and call model. There are many possibilities.


XML-Based Routing and Workflow Strategies


In one embodiment of the present invention the inventors provide an XML vocabulary and method for enhancing existing routing strategies for multimedia interactions in a way that is universally applicable between different routing systems and multimedia types. The methods and apparatus of the invention in this aspect are detailed below.



FIG. 14 is an architectural overview of a multimedia communication center 1403 enhanced for intelligent routing and workflow management according to an embodiment of the present invention. Multimedia communication center (MMCC) 1403 represents any type of contact or call center capable of processing and routing incoming and outgoing multimedia communications both in a digital environment and in a connection oriented switched telephony (COST) environment. There may be many variant architectures and equipment groupings represented within MMCC 1403 without departing from the spirit and scope of the present invention. The inventors intend that MMCC 1403 represent just one example of a dual capable communications center that may field interactions such as but not limited to COST voice interaction, Voice over Internet Protocol (VoIP) interaction, Internet messaging, and Web service interaction.


MMCC 1403 has access to a public switched telephony network (PSTN) 1401 and has access to the well-known Internet network 1402. One with skill in the art of network bridging technologies will recognize that interactions may be routed between Internet network 1402 and PSTN 1401 in seamless fashion over communications line 1406 using a suitable communications gateway such as a signal seven (SS7) (not illustrated) or other known gateway.


MMCC 1403 has a computer telephony integration (CTI) enhanced private branch exchange (PBX) telephony switch 1407 provided therein and adapted as a central office telephony switch for routing incoming and outgoing telephone interactions incoming from PSTN 1401 and outgoing from MMCC 1403. PSTN may be a private or public telephone system without departing from the spirit and scope of the present invention. PSTN 1401 includes a service control point (SCP) 1404 adapted to route any incoming calls from anywhere in PSTN 1401, as illustrated by directional arrow, to MMCC 1403, or more specifically, to PBX 1407 over a connecting communications trunk. PBX 1407 is CTI enhanced in this embodiment, as previously described. PBX 1407 is also enhanced with transaction server (TS) software 1408a, known to the inventor. TS 1408a is adapted to provide intelligent agent level routing within MMCC 1403 including system treatment by automated subsystems. In this example, PBX 1407 has interactive voice response (IVR) 1426 provided thereto as part of CTI enhancement. IVR 1426 is adapted to solicit information from callers through voice interaction to aid in internal routing performed by PBX 1407. It will be understood by the skilled artisan that many other intelligent routing routines may be in place.


Internet network, hereinafter referred to as Internet 1402 in this specification has a contact server (CS) 1405 provided therein and adapted as a digital portal or other communications catalyst between customers and potential customers of MMCC 1403 and MMCC services. Server 1405 may be a Web server containing electronic information pages detailing services including interactive contact forms, contact options, and live communications options. These may include Web service transactions, email contact options, VoIP options, telephone contact options, instant messaging options, and live chat options. Video conferencing may also be provided through interaction with server 1405.


Interaction occurring within server 1405 is monitored and serviced by MMCC 1403. Live interactions and requests may be routed from server 1405 to MMCC, or more particularly, to an Internet protocol router (IPR) 1413 provided within the center. In this example, IPR 1413 has a firewall application (FW) 1414 installed thereon and executable there from. FW 1414 is adapted to provide network security and to prevent unauthorized data from entering MMCC 1403. IPR 1413 also has a soft private branch exchange (SPBX) telephony switching software 1415 installed thereon. SPBX 1415 is adapted to route incoming IP voice interactions internally to live agents, systems, or to PBX 1407 for further routing. SPBX 1415 is enhance with a version of TS software 1408d for providing intelligent SPBX routing in much the same fashion as was described with reference to TS 1408a on PBX 1407.


MMCC 1403 is enable via a local area network (LAN) 1423, which may also be a series of connected LANs, a WAN, or some other digital network capable of transfer control protocol/Internet protocol (TCP/IP) and other necessary protocols for communication and data transfer. LAN 1423, also referred to herein as a backbone 1423, supports CTI PBX 1407, IPR 1413 and other systems and equipment groups described further below.


Backbone 1423 supports an email (EM) router or server 1427, which is adapted to receive incoming email messages internally sourced and those sourced from Internet 1402. In this case, all email identified at IPR 1413 might be forwarded directly to EM 1427 for distribution to agents and/or automated systems. EM server 1427 is enhanced with a version of TS 1408b. TS 1408b is adapted to intelligently route emails according to any strategy created for the purpose. Backbone 1423 also supports an instant messaging (IM) router or server 1428. IM server 1428 receives and routes all incoming instant messages either sourced from within MMCC 1403 or incoming from Internet 1402 and forwarded to server 1428 via IPR 1413. IM server 1428 also has a version of TS 1408c provided thereto to add some intelligence to IM routing.


It is noted herein that EM sever 1427 and IM server 1428 may be directly ported to Internet 1402 and may function independently from IPR 1413 without departing from the spirit and scope of the present invention.


Backbone 1423 supports a data repository system (DRS) 1410 for managing customer relations, customer information, product and service records, purchase records, and other important data required by MMCC to operate. DRS 1410 includes a data server (DS) 1411 adapted to serve any requested data to live entities within MMCC 1403 or to requesting system including routing strategies and workflow management strategies. DS 1411 has access to data stores 1412. There may be fewer or many more data stores provided to server 1411 without departing from the spirit and scope of the present invention. Data stores 1412 may be optical storage disks, RAID disks, magnetic disks, hard disks, or any other storage space adapted to store digital data.


An agent-scripting server (ASS) 1409 is provided within MMCC 1403 and is adapted to retain and server agent scripts upon request. ASS server 1409 may contain scripts, for example, that are used to prompt an agent as to how to handle a specific class of interaction. Part of the routing routine in such cases might be to call ASS 1409 during the course of interaction routing and to have the appropriate scripts delivered to the target agent desktop so that they are available at the time of the interaction. Still other systems supported by backbone 1423 include a statistics server (STS) 1416 and an XStrategy server (XST) 1417.


STS 1416 may compile and report statistics collected from ongoing interactions in the center. Another possible use for STS 1416 is to provide statistics values for requesting routing routines. For example, a specific target agent may at the time of a call, be statistically more likely to be available than another agent which may be part of a target group of agents handling the class of incoming calls. In this case the routing routine responsible for selecting which agent queue to deliver the call into consults STS 1416 for an up-to-date value that identifies the agent that is statistically most likely to become free to handle the incoming call.


XST server 1417 is provided and adapted to contain all of the required XML constructs to represent routing strategies used by MMCC 1403 and the generic constructs used by various routing machines such as IM server 1428, EM server 1427, IPR 1413, and CTIPBX 1407. XST 1417 may also contain representative constructs equating to TS variables and constructs. XST server 1417 has a software instance SW 1418 installed thereon in permanent or removable fashion and which is executable there from. SW 1418 is an application that enables existing routing routines to default to server 1417 for certain intelligent routing routines and routing routine extensions that would otherwise not be available to the routing routines working in one or more existing languages such as VXML, CCXML, or interaction routing languages (IRLs) known to the inventor. It is noted herein that XStrategy documents have a file name of .sxml, hence the acronym SXML is used to define an XML document containing XStrategy constructs and attributes. An SXML document (.sxml) and may include existing markup features and attributes as well as new and novel features and attributes without departing from the spirit and scope of the present invention. More detail about XStrategy markup language will be provided throughout this specification.


Backbone 1423 supports a plurality of agent workstations 1419, 1420, and 1421. Agent workstations 1419-1421 represent target agents who would be charged with handling various incoming interactions. Each station 1419-1421 includes, at minimum, an agent desktop computer and a telephone as illustrated by the enclosed icons at each station. Each agent desktop has LAN connection to backbone 1423. Each agent telephone, in this example, is connected to PBX 1407 via internal telephone wiring 1422. In other embodiments, the telephones may be Internet Protocol (IP) telephones connected as peripherals to their host desktops, or connected directly to LAN backbone 1423.


In practice of the present invention, server 1417 aided by software 1418 may be consulted during routing of any routable form of communication incoming or outbound from MMCC 1403. In one embodiment, SW 1418 is an automated language conversion application that provides intelligent routing strategies that may be “invoked” by any existing routine and that may execute within or along side existing routing scripts on the fly. In this way, extra intelligent handling of communication events may be implemented when such handling may be required by or order from any executed routine.


In one embodiment of the present invention, a programmer operating at any one of agent stations 1419-1421 or perhaps, a similar dedicated programming station may use SW 1418 to create intelligent routing routines in XSML and may launch those routines such that the target routing system that will call the routine may use the routine as written without requiring any other language conversion. In this case, all of the routing function and capabilities or task routines generic to the machine are provided in the new language. In still another embodiment, SW plug-ins (not illustrated) may be provided to each targeted routing system including any illustrated herein. The plug-in capability may provide interjection of the new routing routines into existing routines by tagging to provide on-site intelligence to those routing systems.


To understand the method of the present invention, assume that a communication event (CTI telephone) call is incoming and queued at CTIPBX 1407. IVR interaction with the call may determine that the caller requires routing to a specific agent operating at 1419. CCXML may simply report a busy state at station 1419. An XST rule may be in place for such an event and TS 1408a may call server 1417 in the event of a busy determination to call a routine according to an XST start tag, for example, embedded in CCXML. The intelligent routine executes in place of or in conjunction with the current routing routine and may run in parallel with the routine until a particular goal of the strategy is satisfied. If there is a rule that requires a second look-up of all qualified agents and then routing to one of those agents that is “best qualified” of the target pool after the “busy agent”, the XST module may run in the server to activate the strategy and to communicate one or more routing commands to a TS application monitoring the queued event. The TS server may then correctly route the call based on the extra routine, which may also involve a value served from STS 1416. The value served by STS 1416 may be served to XST 1417 when executing the alternate routing treatment. The TS instance understands the new routine and can communicate that routing command to the switch.


SW 1418 may be distributed in the form of “language transformation modules” to any machine responsible for any routing of communication events. XML-based constructs may be developed for routing based on date and time, parameters of the call, agent skills, customer data, CC statistics, and so on. Moreover, constructs for specifying call treatments, priorities, waiting time, timeouts and the like are possible. In one embodiment, XST may be implemented as an extension of simple media control protocol (SMCP) known to the inventors for communicating call models represented in XML primitives or other low level descriptor languages.


XST may be used in various embodiments in different environments. For example, XST may be used with a simple object application protocol (SOAP) or Xpath transport mechanisms in conjunction with back end data services as well as with Web service defined by Web Service Description Language (WSDL) or Web Service Flow Language (WSFL). It can be integrated into workflow management languages like Business Process Execution Language for Web Services (BPEL4WS) and XML Process Definition Language (XPDL). By tagging the existing scripts with an XST start tag, a predefined routine may be executed. More detail about XST will be presented below.



FIG. 15 is a block diagram illustrating components of SW 1418 according to an embodiment of the present invention. SW 1418 may reside in a server analogous to XST server 1417 described with reference to FIG. 14 above. In this embodiment, XStrategy is used to compliment current interaction routing languages (IRLs) that may be used in current routing systems to route communications events. TS software may be in place, as illustrated here, to monitor the states of events in queue or otherwise registered at any routing point and to communicate with like instances to receive and pass on intelligent routing instructions and routines. A routing point may be a PBX switch, a SPBX switch, a message router or any digital terminal capable of performing some treatment related to or that may effect routing of an event.


SW 1418 includes an XStrategy Language Generator (XSLG) 1501, which is adapted to assemble XST script from primitive XML constructs according to any prevailing rule that might be relevant to an incoming TS request from a routing point. XML constructs are stored in a data storage media and are server by an XML server accessible through an XML server interface 1502.


A TS request will provide details related to the event to be routed and may be generated based on a tag inserted into the existing routing script used at the routing point. In this embodiment, a tag inserted in the script has triggered a TS call to XSLG 1501. The TS request will also identify the correct rule or rule set that may be relevant to the event and/or to any parameters associated with the event. An interface to a rules base (not illustrated in this simple block diagram) may be assumed present in this example.


When SW 1418 processes a request, XSLG may assemble a complete XML script that represents a routing routine or process that may contain one or more target values and, perhaps, one or more treatment assignments. In one embodiment, the XML routines may already be in place for static assignment. In another embodiment, the routines may be dynamically assembled, as is the case here. A routing routine is generated and then transformed into the generic routing language used. In this case the XML strategy is transformed into IRL using extensible Style sheet Language Transformation (XSLT) module 1504. Module 1504 has access to an IRL construct server through an IRL server interface 1503. In this case, the XML constructs and IRL constructs may be matched one for one to aid in generation of a usable IRL script, which contains the XST routine. An IRL generator 1500 provides the corresponding IRL script.


The IRL script, enhanced with the new intelligent routine may be embedded as text into a TS response back to the router. The TS response will contain the complete IRL script and any added routing command or treatment command provided by the XST now expressed as IRL for execution by the router. SW 1418 may have several different language transformation interfaces between it and various routing points depending on the mix of multimedia routing points in use and enhanced, in this case, with an instance of TS.


In one embodiment, the routing may be very simple such as the following example:
















  <strategy version=“0.1” name=“Example 1”>



 <rule cond=“Date=07/04/96 & (Time > 9:00 & Time < 18:00)”>



   <targets vq=“”>



    <target name=“1234@SF.A” type=“agent”/>



   </targets>



 </rule>



</strategy>









The XST script above defines a strategy that routes the event to target if the interaction arrives on Jul. 4, 1996, between 9:00 am and 6:00 pm. The strategy defines only one target (tag <target>). The target type is “agent” and the target address is 1234@SF.A. Note that this strategy is expressed with one rule (tag <rule>).


The same strategy in IRL may appear as follows:


Date=Jul. 4, 1996 & (Time >9:00 & Time <18:00)″->Targets[1234@SF.A]


In this embodiment, a routing exception may be based on data and time rules recorded at the time of the incoming event.


A slightly more complex XST routine using only one rule may appear as follows:
















<strategy version=“0.1” name=“Example 2”>



 <rule cond=“(Day>=Monday & Day<=Friday) & (Time > 9:00 &



Time < 18:00)”



   timeout=“30s” >



  <priority value=“10” />



  <treatment type=“Mandatory” name=“Music” time=“15s”



  port=“20” />



  <targets vq=“”>



   <target name=“2503” type=“agent” />



   <target name=“2504” type=“agent” />



   <target name=“2506” type=“agent” />



  </targets>



 </rule>



</strategy>









The above strategy consists of one rule that has the same condition of routing using time and date as the first strategy. However, this strategy defines an attribute “timeout” specifying a time 30 seconds for waiting for a target to become available. If no target becomes available within 30 seconds, the interaction is routed to a default target that is not specified in this strategy. The interaction in the strategy has a priority 10 tag and it will be routed before any interactions in queue having lower priorities. Music from a device defined as source port “20” may be played for 15 seconds while the interaction is queued and waiting for an available target. Three targets of “agent” type are defined in this strategy.


Converted to IRL, the script may appear as follows:


(Day>=Monday & Day<=Friday) & (Time >9:00 & Time <18:00)″->{Music[20]:15} Timeout[30] Priority[10] Targets[′″″, 2503, 2504, 2506].


More detail regarding the flexibility of XStrategy scripts will be presented later in this specification.


One with skill in the art will recognize that SW 1418 may be distributed in whole or in parts to a variety of nodes including server nodes, routers, CTI processors, message routers, or even on desktop routers without departing from the spirit and scope of the present invention.



FIG. 16 is a block diagram illustrating at least four basic communication center environments that may be enhanced with XStrategy. An XStrategy or XST script 1600 may be adapted for use in different ways in differing environments within a MMCC without departing from the spirit or scope of the present invention. An XSLT server 1601 may be provided and adapted to reside in-between the XST script and one of several targeted service environments. XSLT server 1601 may provide language transformation services so that a router or switch 1602 enhanced for IRL, CCXML and/or VXML may understand and execute XST transformed scripts.


XST scripts may be transformed into script that integrates with WSDL used to create functional Web services 1603. Likewise, XST may be created and used to represent Genesys Interface Server (GIS) routines (known to the inventor), statistics based routing routines, and predictive routing routines represented by a block 1604.


In one embodiment, XStrategy may be used to enhance workflow management that is internal or Web-based and defined by BPEL4WS, in the case of a Web-based service, or in some other markup. In one embodiment, tagging can be used in a routing script to spawn multiple XST processes to run in parallel with the script wherein those processes involve separate resources including routing resources, statistics servers, script servers, and workflow management servers. Many processors support multiple threads running in parallel. Therefore, a linear routing approach may be enhanced to include other processes in order to perform a same amount of work in a shorter period of time.


One with skill in the art will recognize that in creating strategies using XStrategy constructs, tags may be created and embedded in existing markup scripts such as CCXML and VXML whereby those embedded tags may invoke the completed scripts. In one embodiment, a single tag may force a lookup of more than one strategy whereby a specific strategy is selected to start based on criteria used for selecting that available strategy. In still another embodiment, XStrategies are dynamically assembled from the available constructs based on the data related to the actual interaction and one or more rules governing the interaction.



FIG. 17 is a process flow chart illustrating a CCXML telephony script adapted to invoke VXML and SXML according to an embodiment of the present invention. At act 1700, an incoming connection request is received in queue or otherwise registered at a routing point. The event may be an incoming voice event requesting routing to an available target such as a live agent for example.


At act 1702, the routing system initiates an alert that a connection request requires processing. The alert may be generated to a transaction server or other responding system. The alert may be received through state monitoring of a queue or switch or it may be in the form of a notification to a processing entity.


At act 1703, the connection request and any associated data is received by the processing entity. At act 1704, a determination is made to accept or to deny the connection request. If at act 1704, the request is not accepted, the process flow may end at act 1705 and the event may be ignored, dropped, or redirected by default to an automated system for example. If the connection request is accepted then the queuing system is notified and the switching entity establishes a connection at act 1706. In this example the connection may be established via CCXML call control script and the connection is to an automated voice dialog system running VXML.


At the beginning of the script a dialog start tag is executed at act 1707. At this point in the flow a VXML dialog executes at act 1708. The VXML may contain one or more dialogs and may further involve the caller in interaction. The VXML dialog state runs in parallel with the CCXML script and at act 1709, the state of the script is reported as active dialog state or VXML interaction is active.


At act 1710 the VXML dialog has finished and, perhaps as a result of the VXML interaction, an XStrategy script will be called. At act 1711 an XStrategy script is called and like the VXML script may execute in parallel with the running CCXML script. At step 1712, the XSML strategy ensues. At act 1713, the running script state is active for the SXML strategy. In this example, the SXML routine may be an intelligent routing routine that is actually selected or invoked from the VXML routine preceding it in the CCXML script. However, that is not required in order to practice the present invention. The SXML routine may be started from any place in the routing script. Moreover, multiple SXML scripts may be associated to a CCXML or other generic routing script and may be started wherever their tags appear in the script. In one embodiment, SXML routines may be launched from other SXML routines that are started from a generic script like a CCXML script or a VXML script. There are many possibilities.


In one embodiment, the SXML routine may be directed toward finding available resources and causing redirection to those resources from an existing routing point, perhaps a queue. In another embodiment, a SXML routine associated with a routing script may perform some other function like making an adjustment to a workflow process or schedule. Integration of SXML between disparate MMCC processes enables multiple tasks to be started at the time of a transaction resulting from an interaction in process.


At act 1714, the SXML routine has completed and results in a redirect tag that executes at act 1715. The routing entity then redirects the event at act 1716 and at act 1717 the process may terminate if there are no other routing requirements existing, or that may be created as a result of the redirect action.


The strategy start tags represented in the CCXML flow has at least three attributes in its format. For example, the attribute src denotes the character string that identifies the universal resource locator (URL) of the XStrategy (*.sxml) document that is the subject of the start tag. The attribute name is the name of the variable that will receive a session name associated with the launched routine. The attribute target is the name of a variable that will receive the address of a target determined by the launched routine. The strategy start tag only has one attribute “sessionid” that is the session identification generated at the start tag and which is stored by a variable identified in the name attribute of the start tag. The strategy stop tag is actually sent to the running CCXML script by the SXML when it is no longer needed.


In one embodiment if a planned XStrategy document cannot be started, a tag “strategy.notstarted” may be sent to the CCXML script indicating some error in processing. The CCXML flow represented in this example reflects only a very simple architecture. However, much more complex architectures are feasible and practical.



FIG. 18 is a block diagram illustrating keyword options for use in an SXML XStrategy routine. An XStrategy routine 1800 is illustrated and includes at least one *.sxml document 1801. The documentation contains all of the necessary elements to successfully represent and communicate a strategy for routing or workflow. It may be assumed that a condition set for a routing rule may include any one of a number of keywords, which are widely used in other markup like CCXML and VXML for example.


It may be assumed herein that strategy 1800 is a routing strategy by the selection of keyword options that may be used as rule condition attributes. The script or *.sxml document contains a rule having a condition, which may represent any of the following keywords illustrated herein and labeled from top moving in a clockwise direction. The options include automated number identification (ANI); dialed number identification system (DNIS); caller identification (CallID); connection identification (Connection ID); origination identification (Origination ID); and destination identification (Destination ID). It is noted herein that CallID is the identification of a call assigned by a switch and connection ID is the identification for an event assigned by a transaction server like TS, which is known the inventor.


The remaining keyword options are date, time, and day, which may be used single or in combination as a single attribute. Used in this way, widely recognized and standard keywords may be used as conditions in routing rules executed within the strategy.



FIG. 19 is a block diagram illustrating optional tags that may be found within XStrategy script according to an embodiment of the present invention. XStrategy tags 1901 may optionally include from top right and moving in a clockwise direction, a variable (var) tag; a treatment tag; a targets tag; a target tag; a strategy tag; a rule tag; a priority tag; an attach tag; and an assign tag.


A var tag enable the script creator to implicitly declare a variable for consideration by the strategy. A treatment tag enables the script creator to specify some treatment such as interactive voice response (IVR), playing of music, or playing an advertisement. The tag targets enables the script creator to specify a set of routing targets or resources. The target tag enables the script creator to specify a single target or resource. The strategy tag enables the script creator to define and package the entire set of tags and elements as an executable document that includes all of the scripted sub-routines and elements thereof.


The rule tag enables the script creator to specify one or more rules used by a strategy. The priority tag enables the script creator to set a priority for an interaction waiting for a target or resource. The attach tag enables the script creator to specify what types of data may be attached to the routine and/or any sub-routines. The assign tag enables the script creator to assign specific values to variables.


One with skill in the art of XML extensions will appreciate that XStrategy, in addition to incorporating new constructs, may also incorporate constructs that are used in other similar languages like CCXML or VXML. Variable, for instance, is a commonly used tag. In typical use some tags are always required while some other tags are optional.



FIG. 20 is an entity relational diagram illustrating tag interrelationships and hierarchy in an XStrategy script 2000 according to an embodiment of the present invention. XStrategy script 2000 includes a strategy tag 2001, which is the parent tag in the routine. Tag 2001 has a name and a version that uniquely identifies it and separates it from other routines. Strategy tag 2001 may be launched from a generic routing script through invocation of a strategystart tag 2011. Strategystart tag 2011 has attributes src, name, and target. Src is a character that identifies the URL of the strategy document to be called. The attribute name, in this case, is the name of the variable that will receive the session name identifying the strategy. The attribute target, in this case, is the name of the target or resource that will be determined by the strategy. It is important to note herein that strategy 2001 may be invoked from a generic script by execution of the strategystart tag. Therefore, strategystart tag 2011 starts strategy 2001 from some generic script in this example.


Strategy 2001 invokes at least one rule, in this case, a rule 2002. Rule 2002 has an attribute condition (cond.), and attribute timeout, and an attribute force. The attribute condition may include one or more keywords as described above. The condition attribute is part of the condition under which the rule applies so it may include any of the previously described keywords related to routing, or it may include other keyword types related to other process types like workflow, or data management operations.


The attribute timeout provides a time limit for an interaction to wait in queue before forced routing or treatment. The attribute force provides a yes or no option in the rule for forcing routing to a specific target based on any condition. If force is set to no there is no forced routing to a specific target, rather the target is selected by other factors in the rule. If set to yes, there may be immediate forced routing to a specific target based on true or false condition.


One rule may contain other rules, which may execute serially or in parallel if there are sub-routines involved. Rule 2002 has child elements, which are the tags described further above. Each tag has its own attributes and some tags also have child elements. A tag labeled assign 2003 has the attributes name, expression (expr) and scope. Assign 2003 works hand in hand with a var tag 2004. That is to say the assign tag assigns a value to a variable tag such as tag 2004.


Name is the variable name, expression indicates the new value of the variable and may be represented as a valid IRL markup, and scope defines the scope of the variable. A single rule may have more than one assign tag. Likewise, one rule may carry more than one variable 2004. Var 2004, like assign 2003 includes the attributes name, expr, and scope defined identically to those same attributes in assign 2003.


Rule 2002 may optionally include a tag labeled herein as a priority tag 2005. Tag 2005 can be used to set a priority in queue for the interaction being routed by the strategy. Priority may be based on any number of static or dynamically discovered criteria including identification, payment history, interaction history, and so on. The priority setting value is generally a number such as from 1-10, for example. Another attribute in the priority tag is increment, which allows for a timed increase in priority. For example, every 60 seconds, a priority value may be incremented by 1. In that case a priority of value=1 will be a priority of value=10 in the span of 9 minutes.


Rule 2002 may optionally include one or more tags attach 2006. Attach tag 2006 is used to attach some data to the interaction routing notification or to the event itself if supported by the media type and platform environment. Tag 2006 has attributes key and value, which cooperate as a key/value (KV) pair for retrieving and attaching data to the interaction.


The SXML sample below illustrates the process of data attach to an interaction.
















<strategy version=“0.1” name=“Example 14



<!-- Attaching Data to the Interaction -->”>



 <rule cond=“DNIS=5108632549”>



  <targets vq=“”>



   <attach key=“customer_age”



    value=“XData[dbserver1,Procedure,Retrieve_Age,



    param=account]”/>



   <target name=“2283@SF.A” type=“agent”” />



  </targets>



 </rule>



</strategy>









Rule 2003 may optionally include a tag 2007 labeled Targets. Targets tag 2007 defines a set of more than one target such as several agents sharing a queue. Tag 2007 includes the attributes virtual queue (vq), wait, and even. Vq identifies the name and address of the queue the agents are working from. The attribute wait defines a time for waiting in queue, and the attribute even contains one or more statistical values that enable interactions to be evenly distributed among the several targets within the target set. A sample of SXML using a target set may appear as follows:
















<strategy version=“0.1” name=“Example 2”>



 <rule cond=“(Day>=Monday & Day<=Friday) & (Time > 9:00 &



 Time < 18:00)”



   timeout=“30s” >



  <priority value=“10” />



  <treatment type=“Mandatory” name=“Music” time=“15s”



  port=“20” />



  <targets vq=“”>



   <target name=“2503” type=“agent” />



   <target name=“2504” type=“agent” />



   <target name=“2506” type=“agent” />



  </targets>



 </rule>



</strategy>









Targets tag 2007 may have child elements assign, var, priority, attach, and targets. A set of targets 2007 defines more than one target, labeled herein as target tag 2008. Target set 2007 may optionally include one or more than one treatment, illustrated herein as treatment tag 2009. A treatment may include playing music, playing a voice advertisement, or some other type of automated treatment applied during an interaction while the interaction is waiting for a target and so on. There may be two different types of treatments, mandatory treatments and busy treatments. Mandatory treatments are always delivered before an interaction is routed to a final target. A busy treatment occurs during a wait time such as waiting in queue.


Treatment tag 2009 includes attributes type, name, time, and optionally, port. Type identifies the treatment as mandatory or busy. Name specifies the method of treatment such as ring back, silence, or busy treatment. The following sample SXML illustrates application of more than one sequential treatment specifying type, method and time of each treatment.
















<strategy version=“0.1” name=“Example 15”>



<!-- Using Treatments -->



 <rule cond=“date=10/15/96”>



  <targets vq=“”>



   <targets vq=“”>



    <treatment type=“Busy” name=“RingBack” time=“10s”/>



    <treatment type=“Busy” name=“Silence” time=“10s”/>



    <treatment type=“Busy” name=“Busy” time=“5s”/>



    <target name=“2311” type=“agent” />



    <target name=“2309” type=“agent” />



   </targets>



  </targets>



 </rule>









A treatment may optionally include a method of playing music or some other audible presentation such as an advertisement. In this case the attribute port may be included to specify the port or source location of the audible presentation to be played, for example, while the interaction is waiting in queue for availability of a target agent. The following SXML fragment illustrates use of a music treatment.
















<strategy version=“0.1” name=“Example 16”>



<!-- Using Treatment Music -->



 <rule cond=“date=10/15/96”>



  <targets vq=“”>



   <targets vq=“” >



    <treatment type=“Mandatory” name=“Music” time=“10”



    port=“1200”/>



    <target name=“2309” type=“agent” />



   </targets>



  </targets>



 </rule>



</strategy>









Rule 2002 may have a single target tag rather than a declared set. A target tag 2008 has the attributes name, type, expression, and weight. Tag 2008 specifies a single target. The name attribute specifies the name of the target. The attribute type specifies the type or class of the target. The target type may include, but is not limited to agent (A), agent place (AP), queue (Q), group of agents (GA), group of places (GP), routing point (RP), and skill. The attribute server in target tag 2008 specifies the name of a statistics server. This attribute is used for targets having a skill type associated with them wherein that skill indication may be used in routing consideration (skill-based routing). The attribute expression in tag 2008 specifies the “skill” expression used for skill-based routing. The attribute weight sets a percentage value for routing among several targets.


One with skill in the art of object modeling will recognize that rule 2002 including associated tags and attributes may be constructed in other configurations with relation to child elements and attribute mix and definition without departing from the spirit and scope of the present invention. For example, some attributes are mandatory while other attributes are optionally included. Likewise, new tags and attributes may be provided without departing from the spirit and scope of the present invention. Moreover, the strategy routines of the present invention may be provided with fewer tags and attributes than illustrated herein without departing from the spirit and scope of the present invention.


XStrategy (SXML) enables a programmer to represent routing routines and treatments uniformly across multiple routing systems and platforms by expressing those routines in primitive constructs that may be easily associated to the analogous constructs understood by those routing systems. In this way, one routine may be applied to more than one routing program and may even apply to more than one media type. In an embodiment wherein generic routing protocols are enhanced by creating and implementing SXML routines, the tags, which invoke the new routines are embedded and are understood by the routing scripts already in use. Many different routing platforms may be abstracted to perform routing of events according to a single or similar set of abstract routing rules.


The concept of the present invention is to provide on base language markup that may be used to create or enhance event routing scripts, web service scripts, and workflow management scripts whereby the capabilities of lookup and retrieval of resources and data are transferred to the system performing the actual work.



FIG. 21 is a block diagram 2100 illustrating a relationship between XStrategy (SXML) and other generic languages according to another embodiment of the present invention. Interaction Routing Designer 2103 is a design tool known to the inventor for representing routing information including graphics. An IRD strategy is expressed in the form of IRD XML 2102. That is to say that IRD 2103 may be used to create IRD XML representing an IRD Strategy, or an IRD strategy may be imported into the interface, typically a graphics user interface (GUI) from separately created IRD XML. This is indicated in the example by a double arrow labeled (1).


IRD XML 2102 then is an interchangeable format language for representing all of IRD functionality including workflow control including graphics representation. It should be noted herein that the goals of IRD XML and XStrategy are quite different. XStrategy provides among other things, a natural extension of CCXML and VXML for the purpose of enabling those regimens to capture rich contact center functionality. It provides target and resource lookup procedure capabilities base on interpretation of external data such as data and time, and interaction attributes according to rule. This extra added value enhancement is absent from generic IRD strategies.


In typical practice, an IRD strategy whether created by the designer or incorporated therein from external IRD XML, is transferred into a more abstract interaction routing language (IRL) 2104, which is also known to the inventor. A directional arrow labeled (2) illustrates this action. The IRD XML notation is oriented towards an exchangeable format rather than towards a routing language. For this reason it reflects a graphics structure of an IRD strategy including embedded tags for representing graphical data on a computer screen.


IRL 2104 is then transferred into an internal binary format and subsequently is recorded into a configuration server 2105 as illustrated by a directional arrow labeled (3). At this point router 2106 may access server 2105, read the strategy, and enact the strategy during interaction routing. In one embodiment, IRD XML may simply be transferred directly into IRL but the graphics components are lost tin the transformation. This action is represented in this example by a directional arrow (5)


Use of XSLT script or another language transformation tool enables XStrategy to be transferred directly into IRL, generally with a one-to-one construct equivalence. This option is illustrated in this example by arrow (6). XStrategy 2101 may likewise be transformed directly into a valid subset of IRD XML as is illustrated by the arrow labeled (7).


It may be apparent to a skilled artisan that SXML may be used as a base extension to IRL and has an intelligent enhancement to CCXML/VXML regimens without departing from the spirit and scope of the present invention. SXML routines for intelligent routing may be tagged onto existing less intelligent CCXML routines, for example, by embedding a start tag into the CCXML routine. It may be created as an abstract base language or as an extension to an existing XML-based language without departing from the spirit and scope of the present invention.


In one embodiment, XStrategies are standalone strategies. In another embodiment, they are integrated into existing strategies to enhance those strategies. In still another embodiment, XStrategies may server as abstract base strategies for creating Web services and workflow management routines. In one embodiment, SXML server as added routines to existing CCXML and VXML that would otherwise not be available. One embodiment includes use of transaction server communication to carry XStrategies between systems such that the actual notation in integrated with TS script.


The method and apparatus of the present invention should be afforded the broadest of scope under examination. The spirit and scope of the present invention is limited only by the claims that follow.

Claims
  • 1. A method for supplementing an interaction processing routine comprising: identifying, by a processor, an attribute associated with an interaction;executing, by the processor, the interaction processing routine for routing the interaction, the interaction processing routine including an embedded tag;executing, by the processor, the embedded tag in the interaction processing routine;invoking, by the processor, a rule in response to executing the embedded tag, wherein the rule is selected based on the identified attribute;assembling, by the processor, a routing script based on the invoked rule; andexecuting, by the processor, the routing script for controlling the routing of the interaction during the interaction processing routine, wherein the routing script is executed concurrently with the interaction processing routine.
  • 2. The method of claim 1, wherein the interaction processing routine and the routing script are executed concurrently in run-time.
  • 3. The method of claim 2, wherein the interaction processing routine adheres to a first programming language that is different from a second programming language of the routing script.
  • 4. The method of claim 1, wherein the assembling operation comprises selecting an existing routing script according to the rule and the identified attribute.
  • 5. The method of claim 1, wherein the assembling operation comprises dynamically assembling the routing script from primitive constructs according to the rule and an attribute associated with the interaction.
  • 6. The method of claim 1, wherein the rule comprises a plurality of sub-rules.
  • 7. The method of claim 1, wherein the attribute comprises a condition, timeout data, and forced routing data.
  • 8. The method of claim 1, wherein the executing of the routing script includes executing the routing script as assembled without routing language conversion.
  • 9. The method of claim 1 further comprising: transforming, by the processor, the routing script from a first programming language to a second programming language to generate a transformed routing script; andoutputting, by the processor, the transformed routing script for execution.
  • 10. A system comprising: a processor; anda non-transitory memory, wherein the memory has stored thereon instructions that, when executed by the processor, causes the processor to: receive information corresponding to an interaction;execute a first routing script for routing the interaction, the first routing script including an embedded tag;execute the embedded tag in the first routing script;invoke a rule in response to executing the embedded tag, wherein the rule is selected based on the information corresponding to the interaction;assemble a second routing script based on the invoked rule; andexecute the second routing script for controlling the routing of the interaction, wherein the second routing script is executed concurrently with the first routing script.
  • 11. The system of claim 10, wherein the first routing script adheres to a first programming language and the second routing script adheres to a second programming language different from the first programming language.
  • 12. The system of claim 11, wherein the second programming language comprises an extensible markup language (XML), andwherein the first programming language comprises at least one of voice extensible markup language (VXML), call control extensible markup language (CCXML), or interaction routing language (IRL).
  • 13. The system of claim 12, wherein the second programming language comprises XStrategy extensible markup language constructs.
  • 14. The system of claim 11, wherein the second routing script enables routing routines that are unavailable in the first programming language.
  • 15. The system of claim 10, wherein the instructions further cause the processor to: transform the second routing script from the second programming language to the first programming language; andoutput the transformed routing script for execution.
  • 16. The system of claim 10, wherein the instructions further cause the processor to: receive an output in response to executing the second routing script; andinvoke a third routing script in response to the output, wherein the third routing script is executed concurrently with the executing of the interaction processing routine.
  • 17. The method of claim 1 further comprising: receiving, by the processor, an output in response to executing the routing script; andinvoking, by the processor, a second routing script in response to the output, wherein the second routing script is executed concurrently with the executing of the interaction processing routine.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent application entitled “Method for Implementing and Executing Communication Center Routing Strategies Represented in Extensible Markup Language” bearing Ser. No. 11/317,105, filed on Dec. 22, 2005, now U.S. Pat. No. 7,907,598. Application Ser. No. 11/317,105 is a continuation-in-part (CIP) to a U.S. patent application entitled “Using XML Expressed Primitives for Platform and System- Independent Call Modeling” bearing Ser. No. 09/827,608, filed on Apr. 6, 2001, now U.S. Pat. No. 6,985,478, which claims priority to a U.S. provisional patent application Ser. No. 60/267,294 of the same title filed on Feb. 7, 2001. Application Ser. No. 09/827,608 is also a CIP of U.S. patent application Ser. No. 09/024,923 entitled “Telephone Network Interface Bridge Between Data Telephony Networks and Dedicated Connection Telephony Networks” filed on Feb. 17, 1998, now U.S. Pat. 8,130,749. Complete disclosure of the priority documents is included herein in entirety at least by reference.

US Referenced Citations (1238)
Number Name Date Kind
3914559 Knollman Oct 1975 A
4048452 Oehring et al. Sep 1977 A
4056683 Suehiro Nov 1977 A
4290141 Anderson et al. Sep 1981 A
4320256 Freeman Mar 1982 A
4345315 Cadotte et al. Aug 1982 A
4355207 Curtin Oct 1982 A
4355372 Johnson et al. Oct 1982 A
4400587 Taylor et al. Aug 1983 A
4439636 Newkirk et al. Mar 1984 A
4451700 Kempner et al. May 1984 A
4489438 Hughes Dec 1984 A
4512011 Turner Apr 1985 A
4517410 Williams et al. May 1985 A
4521643 Dupuis et al. Jun 1985 A
4523055 Hohl et al. Jun 1985 A
4528643 Freeny, Jr. Jul 1985 A
4539435 Eckmann Sep 1985 A
4555903 Heaton Dec 1985 A
4558180 Scordo Dec 1985 A
4559415 Bernard et al. Dec 1985 A
4566030 Nickerson et al. Jan 1986 A
4567323 Lottes et al. Jan 1986 A
4577062 Hilleary et al. Mar 1986 A
4577067 Levy et al. Mar 1986 A
4578700 Roberts et al. Mar 1986 A
4580012 Matthews et al. Apr 1986 A
4584602 Nakagawa Apr 1986 A
4587379 Masuda May 1986 A
4598367 DeFrancesco et al. Jul 1986 A
4603232 Kurland et al. Jul 1986 A
4611094 Asmuth et al. Sep 1986 A
4625276 Benton et al. Nov 1986 A
4630200 Ohmae et al. Dec 1986 A
4630201 White Dec 1986 A
4634809 Paulsson et al. Jan 1987 A
4649563 Riskin Mar 1987 A
4654482 DeAngelis Mar 1987 A
4667287 Allen et al. May 1987 A
4674044 Kalmus et al. Jun 1987 A
4679189 Olson et al. Jul 1987 A
4696029 Cohen Sep 1987 A
4697282 Winter et al. Sep 1987 A
4737983 Frauenthal et al. Apr 1988 A
4756020 Fodale Jul 1988 A
4757267 Riskin Jul 1988 A
4763191 Gordon et al. Aug 1988 A
4763317 Lehman et al. Aug 1988 A
4763353 Canale et al. Aug 1988 A
4771425 Baran et al. Sep 1988 A
4785408 Britton et al. Nov 1988 A
4788715 Lee Nov 1988 A
4811382 Sleevi Mar 1989 A
4812843 Champion, III et al. Mar 1989 A
4829563 Crockett et al. May 1989 A
4831518 Yu et al. May 1989 A
4852001 Tsushima et al. Jul 1989 A
4866756 Crane et al. Sep 1989 A
4881261 Oliphant et al. Nov 1989 A
4893328 Peacock Jan 1990 A
4896345 Thorne Jan 1990 A
4897866 Majmudar et al. Jan 1990 A
4908850 Masson et al. Mar 1990 A
4924488 Kosich May 1990 A
4943995 Daudelin et al. Jul 1990 A
4953204 Cuschleg, Jr. et al. Aug 1990 A
4972461 Brown et al. Nov 1990 A
4994985 Cree et al. Feb 1991 A
5001710 Gawrys et al. Mar 1991 A
5008930 Gawrys et al. Apr 1991 A
5017917 Fisher et al. May 1991 A
5020095 Morganstein et al. May 1991 A
5036535 Gechter et al. Jul 1991 A
5058152 Solomon et al. Oct 1991 A
5062103 Davidson et al. Oct 1991 A
5073890 Danielsen Dec 1991 A
5095504 Nishikawa et al. Mar 1992 A
5117225 Wang May 1992 A
5136633 Tejada et al. Aug 1992 A
5155761 Hammond Oct 1992 A
5164983 Brown et al. Nov 1992 A
5168515 Gechter et al. Dec 1992 A
5175800 Galis et al. Dec 1992 A
5179589 Syu Jan 1993 A
5181236 LaVallee et al. Jan 1993 A
5181239 Jolissaint Jan 1993 A
5185782 Srinivasan Feb 1993 A
5202828 Vertelney et al. Apr 1993 A
5206903 Kohler et al. Apr 1993 A
5208745 Quentin et al. May 1993 A
5212727 Ramkumar May 1993 A
5214688 Szlam et al. May 1993 A
5231670 Goldhor et al. Jul 1993 A
5247569 Cave Sep 1993 A
5249223 Vanacore Sep 1993 A
5253288 Frey et al. Oct 1993 A
5256863 Ferguson et al. Oct 1993 A
5261096 Howarth Nov 1993 A
5271058 Andrews et al. Dec 1993 A
5274635 Rahman et al. Dec 1993 A
5274700 Gechter et al. Dec 1993 A
5274782 Chalasani et al. Dec 1993 A
5278898 Cambray et al. Jan 1994 A
5278977 Spencer et al. Jan 1994 A
5280625 Howarter et al. Jan 1994 A
5283638 Engberg et al. Feb 1994 A
5283856 Gross et al. Feb 1994 A
5285494 Sprecher et al. Feb 1994 A
5288147 Schaefer et al. Feb 1994 A
5291550 Levy et al. Mar 1994 A
5291551 Conn et al. Mar 1994 A
5291552 Kerrigan et al. Mar 1994 A
5299259 Otto Mar 1994 A
5299260 Shaio Mar 1994 A
5301320 McAtee et al. Apr 1994 A
5309505 Szlam et al. May 1994 A
5311574 Livanos May 1994 A
5311583 Friedes et al. May 1994 A
5315709 Alston, Jr. et al. May 1994 A
5327486 Wolff et al. Jul 1994 A
5329583 Jurgensen et al. Jul 1994 A
5333266 Boaz et al. Jul 1994 A
5335268 Kelly, Jr. et al. Aug 1994 A
5335269 Steinlicht Aug 1994 A
5343477 Yamada Aug 1994 A
5343518 Kneipp Aug 1994 A
5355474 Thuraisngham et al. Oct 1994 A
5359649 Rosu et al. Oct 1994 A
5363507 Nakayama et al. Nov 1994 A
5367329 Nakagaki et al. Nov 1994 A
5369695 Chakravarti et al. Nov 1994 A
5384766 Yamato et al. Jan 1995 A
5384771 Isidoro et al. Jan 1995 A
5384829 Heileman, Jr. et al. Jan 1995 A
5384841 Adams et al. Jan 1995 A
5392277 Bernstein Feb 1995 A
5392328 Schmidt et al. Feb 1995 A
5392345 Otto Feb 1995 A
5392400 Berkowitz et al. Feb 1995 A
5402474 Miller et al. Mar 1995 A
5414762 Flisik et al. May 1995 A
5422813 Schuchman et al. Jun 1995 A
5425091 Josephs Jun 1995 A
5425093 Trefzger Jun 1995 A
5426594 Wright et al. Jun 1995 A
5428608 Freeman et al. Jun 1995 A
5436965 Grossman et al. Jul 1995 A
5436967 Hanson Jul 1995 A
5440719 Hanes et al. Aug 1995 A
5444767 Goetcheus et al. Aug 1995 A
5444774 Friedes Aug 1995 A
5444823 Nguyen Aug 1995 A
5450482 Chen et al. Sep 1995 A
5450483 Williams Sep 1995 A
5452350 Reynolds et al. Sep 1995 A
5455903 Jolissaint et al. Oct 1995 A
5459780 Sand Oct 1995 A
5463685 Gaechter et al. Oct 1995 A
5465286 Clare et al. Nov 1995 A
5467391 Donaghue, Jr. et al. Nov 1995 A
5469504 Blaha Nov 1995 A
5473680 Porter Dec 1995 A
5475813 Cieslak et al. Dec 1995 A
5479487 Hammond Dec 1995 A
5481616 Freadman Jan 1996 A
5488648 Womble Jan 1996 A
5491783 Douglas et al. Feb 1996 A
5493564 Mullan Feb 1996 A
5495522 Allen et al. Feb 1996 A
5495523 Stent et al. Feb 1996 A
5496392 Sims et al. Mar 1996 A
5497317 Hawkins et al. Mar 1996 A
5497371 Ellis et al. Mar 1996 A
5497373 Hulen et al. Mar 1996 A
5500891 Harrington et al. Mar 1996 A
5506898 Costantini et al. Apr 1996 A
5509062 Carlsen Apr 1996 A
5510829 Sugiyama et al. Apr 1996 A
5511117 Zazzera Apr 1996 A
5517620 Hashimoto et al. May 1996 A
5519773 Dumas et al. May 1996 A
5524047 Brown et al. Jun 1996 A
5524147 Bean Jun 1996 A
5526353 Henley et al. Jun 1996 A
5528678 Kaplan Jun 1996 A
5530740 Irribarren et al. Jun 1996 A
5530744 Charalambous et al. Jun 1996 A
5533103 Peavey et al. Jul 1996 A
5533107 Irwin et al. Jul 1996 A
5533108 Harris et al. Jul 1996 A
5533110 Pinard et al. Jul 1996 A
5533115 Hollenbach et al. Jul 1996 A
5535211 Yano Jul 1996 A
5535256 Maloney et al. Jul 1996 A
5535323 Miller et al. Jul 1996 A
5537470 Lee Jul 1996 A
5537630 Berry et al. Jul 1996 A
5539811 Nakamura et al. Jul 1996 A
5544220 Trefzger Aug 1996 A
5546452 Andrews et al. Aug 1996 A
5550816 Hardwick et al. Aug 1996 A
5553133 Perkins Sep 1996 A
5555299 Maloney et al. Sep 1996 A
5555426 Johnson et al. Sep 1996 A
5557667 Bruno et al. Sep 1996 A
5559868 Blonder Sep 1996 A
5559877 Ash et al. Sep 1996 A
5559878 Keys et al. Sep 1996 A
5561711 Muller Oct 1996 A
5561841 Markus Oct 1996 A
5563805 Arbuckle et al. Oct 1996 A
5563937 Bruno et al. Oct 1996 A
5566294 Kojima et al. Oct 1996 A
5570419 Cave et al. Oct 1996 A
5570420 Bress et al. Oct 1996 A
5572579 Orriss et al. Nov 1996 A
5572643 Judson Nov 1996 A
5577100 McGregor et al. Nov 1996 A
5577105 Baum et al. Nov 1996 A
5583862 Callon Dec 1996 A
5583922 Davis et al. Dec 1996 A
5590188 Crockett Dec 1996 A
5592542 Honda et al. Jan 1997 A
5592543 Smith et al. Jan 1997 A
5594791 Szlam et al. Jan 1997 A
5598532 Liron Jan 1997 A
5604737 Iwami et al. Feb 1997 A
5606602 Johnson et al. Feb 1997 A
5608778 Partridge, III Mar 1997 A
5608786 Gordon Mar 1997 A
5610910 Focsaneanu et al. Mar 1997 A
5617570 Russell et al. Apr 1997 A
5619183 Ziegra et al. Apr 1997 A
5619557 Van Berkum Apr 1997 A
5619648 Canale et al. Apr 1997 A
5621789 McCalmont et al. Apr 1997 A
5621790 Grossman et al. Apr 1997 A
5623600 Ji et al. Apr 1997 A
5624265 Redford et al. Apr 1997 A
5625404 Grady et al. Apr 1997 A
5625676 Greco et al. Apr 1997 A
5625682 Gray et al. Apr 1997 A
5627764 Schutzman et al. May 1997 A
5627884 Williams et al. May 1997 A
5630127 Moore et al. May 1997 A
5632011 Landfield et al. May 1997 A
5633920 Kikinis et al. May 1997 A
5633924 Kaish et al. May 1997 A
5635918 Tett Jun 1997 A
5640445 David Jun 1997 A
5642411 Theis Jun 1997 A
5642477 de Carmo et al. Jun 1997 A
5642511 Chow et al. Jun 1997 A
5644720 Boll et al. Jul 1997 A
5646981 Klein Jul 1997 A
5649105 Aldred et al. Jul 1997 A
5652785 Richardson, Jr. et al. Jul 1997 A
5652789 Miner et al. Jul 1997 A
5652791 Sunderman et al. Jul 1997 A
5654961 Araujo et al. Aug 1997 A
5655015 Walsh et al. Aug 1997 A
5657383 Gerber et al. Aug 1997 A
5659542 Bell et al. Aug 1997 A
5659604 Beckmann Aug 1997 A
5659746 Bankert et al. Aug 1997 A
5673304 Connor et al. Sep 1997 A
5673311 Andruska et al. Sep 1997 A
5673322 Pepe et al. Sep 1997 A
5675637 Szlam et al. Oct 1997 A
5684870 Maloney et al. Nov 1997 A
5689229 Chaco et al. Nov 1997 A
5692033 Farris Nov 1997 A
5696809 Voit Dec 1997 A
5696811 Maloney et al. Dec 1997 A
5701400 Amado Dec 1997 A
5703943 Otto Dec 1997 A
5706453 Cheng et al. Jan 1998 A
5708702 De Paul et al. Jan 1998 A
5712901 Meermans Jan 1998 A
5715306 Sunderman et al. Feb 1998 A
5715307 Zazzera Feb 1998 A
5715432 Xu et al. Feb 1998 A
5717747 Boyle, III et al. Feb 1998 A
5721770 Kohler Feb 1998 A
5724412 Srinivasan Mar 1998 A
5724418 Brady Mar 1998 A
5726984 Kubler et al. Mar 1998 A
5727159 Kikinis Mar 1998 A
5729594 Klingman Mar 1998 A
5732078 Arango Mar 1998 A
5734981 Kennedy, III et al. Mar 1998 A
5737495 Adams et al. Apr 1998 A
5737595 Cohen et al. Apr 1998 A
5737726 Cameron et al. Apr 1998 A
5737727 Lehmann et al. Apr 1998 A
5740238 Flockhart et al. Apr 1998 A
5740240 Jolissaint Apr 1998 A
5742668 Pepe et al. Apr 1998 A
5742670 Bennett Apr 1998 A
5742675 Kilander et al. Apr 1998 A
5742905 Pepe et al. Apr 1998 A
5745687 Randell Apr 1998 A
5745878 Hashimoto et al. Apr 1998 A
5748884 Royce et al. May 1998 A
5748907 Crane May 1998 A
5751706 Land et al. May 1998 A
5751707 Voit et al. May 1998 A
5751795 Hassler et al. May 1998 A
5752059 Holleran et al. May 1998 A
5752244 Rose et al. May 1998 A
5752246 Rogers et al. May 1998 A
5754111 Garcia May 1998 A
5754636 Bayless et al. May 1998 A
5754639 Flockhart et al. May 1998 A
5754655 Hughes et al. May 1998 A
5757904 Anderson May 1998 A
5760823 Brunson et al. Jun 1998 A
5761289 Keshav Jun 1998 A
5764736 Shachar et al. Jun 1998 A
5764898 Tsuji et al. Jun 1998 A
5765033 Miloslavsky Jun 1998 A
5768360 Reynolds et al. Jun 1998 A
5768527 Zhu et al. Jun 1998 A
5774583 Sasaki et al. Jun 1998 A
5778060 Otto Jul 1998 A
5778178 Arunachalam Jul 1998 A
5778377 Marlin et al. Jul 1998 A
5784438 Martinez Jul 1998 A
5784451 Smith, Jr. Jul 1998 A
5784452 Carney Jul 1998 A
5787160 Chaney et al. Jul 1998 A
5787163 Taylor et al. Jul 1998 A
5790635 Dezonno Aug 1998 A
5790650 Dunn et al. Aug 1998 A
5790789 Suarez Aug 1998 A
5790798 Beckett, II et al. Aug 1998 A
5793857 Barnes et al. Aug 1998 A
5793861 Haigh Aug 1998 A
5794039 Guck Aug 1998 A
5796398 Zimmer Aug 1998 A
5796729 Greaney et al. Aug 1998 A
5796791 Polcyn Aug 1998 A
5796813 Sonnenberg Aug 1998 A
5799067 Kikinis et al. Aug 1998 A
5799297 Goodridge et al. Aug 1998 A
5802163 Miloslavsky Sep 1998 A
5802253 Gross et al. Sep 1998 A
5802283 Grady et al. Sep 1998 A
5802314 Tullis et al. Sep 1998 A
5802316 Ito et al. Sep 1998 A
5802493 Sheflott et al. Sep 1998 A
5802526 Fawcett et al. Sep 1998 A
5805587 Norris et al. Sep 1998 A
5806061 Chaudhuri et al. Sep 1998 A
5809128 McMullin Sep 1998 A
5809282 Cooper et al. Sep 1998 A
5809512 Kato Sep 1998 A
5812795 Horovitz et al. Sep 1998 A
5813014 Gustman Sep 1998 A
5815566 Ramot et al. Sep 1998 A
5818935 Maa Oct 1998 A
5822306 Catchpole Oct 1998 A
5822400 Smith Oct 1998 A
5822404 Cave Oct 1998 A
5822526 Waskiewicz Oct 1998 A
5825775 Chin et al. Oct 1998 A
5825862 Voit et al. Oct 1998 A
5825869 Brooks et al. Oct 1998 A
5825870 Miloslavsky Oct 1998 A
5826040 Fargher et al. Oct 1998 A
5826269 Hussey Oct 1998 A
5828747 Fisher et al. Oct 1998 A
5828839 Moncreiff Oct 1998 A
5831611 Kennedy et al. Nov 1998 A
5832196 Croslin et al. Nov 1998 A
5835090 Clark et al. Nov 1998 A
5835583 Hetz et al. Nov 1998 A
5838682 Dekelbaum et al. Nov 1998 A
5838768 Sumar et al. Nov 1998 A
5838773 Eisner et al. Nov 1998 A
5838774 Weisser, Jr. Nov 1998 A
5841854 Schumacher et al. Nov 1998 A
5842131 Yamane Nov 1998 A
5844980 Patel et al. Dec 1998 A
5844982 Knitl Dec 1998 A
5847484 Kuyama et al. Dec 1998 A
5848131 Shaffer et al. Dec 1998 A
5848143 Andrews et al. Dec 1998 A
5850433 Rondeau Dec 1998 A
5852814 Allen Dec 1998 A
5857184 Lynch Jan 1999 A
5862134 Deng Jan 1999 A
5862211 Roush Jan 1999 A
5862223 Walker et al. Jan 1999 A
5864616 Hartmeier Jan 1999 A
5864848 Horvitz et al. Jan 1999 A
5867484 Shaunfield Feb 1999 A
5867494 Krishnaswamy et al. Feb 1999 A
5867495 Elliott et al. Feb 1999 A
5867559 Jorgensen et al. Feb 1999 A
5867562 Scherer Feb 1999 A
5867822 Sankar Feb 1999 A
5870464 Brewster et al. Feb 1999 A
5870549 Bobo, II Feb 1999 A
5872841 King et al. Feb 1999 A
5872926 Levac et al. Feb 1999 A
5873032 Cox et al. Feb 1999 A
5873040 Dunn et al. Feb 1999 A
5873076 Barr et al. Feb 1999 A
5878126 Velamuri et al. Mar 1999 A
5878130 Andrews et al. Mar 1999 A
5878230 Weber et al. Mar 1999 A
5881146 Hamilton Mar 1999 A
5883891 Williams et al. Mar 1999 A
5884032 Bateman et al. Mar 1999 A
5884262 Wise et al. Mar 1999 A
5887173 Ogawa et al. Mar 1999 A
5889474 LaDue Mar 1999 A
5889774 Mirashrafi et al. Mar 1999 A
5889799 Grossman et al. Mar 1999 A
5889863 Weber Mar 1999 A
5892764 Riemann et al. Apr 1999 A
5892822 Gottlieb et al. Apr 1999 A
5893912 Freund et al. Apr 1999 A
5894512 Zenner Apr 1999 A
5896444 Perlman et al. Apr 1999 A
5897635 Torres et al. Apr 1999 A
5901138 Bader et al. May 1999 A
5901203 Morganstein et al. May 1999 A
5901209 Tannenbaum et al. May 1999 A
5903631 Smith et al. May 1999 A
5903877 Berkowitz et al. May 1999 A
5905495 Tanaka et al. May 1999 A
5905792 Miloslavsky May 1999 A
5905793 Flockhart et al. May 1999 A
5905863 Knowles et al. May 1999 A
5907547 Foladare et al. May 1999 A
5911134 Castonguay et al. Jun 1999 A
5911776 Guck Jun 1999 A
5914941 Janky Jun 1999 A
5915001 Uppaluru Jun 1999 A
5915008 Dulman Jun 1999 A
5915011 Miloslavsky Jun 1999 A
5915012 Miloslavsky Jun 1999 A
5916302 Dunn et al. Jun 1999 A
5917817 Dunn et al. Jun 1999 A
5917898 Bassa et al. Jun 1999 A
5918213 Bernard et al. Jun 1999 A
5920621 Gottlieb Jul 1999 A
5920719 Sutton et al. Jul 1999 A
5920865 Ariga Jul 1999 A
5923745 Hurd Jul 1999 A
5923879 Sasmazel et al. Jul 1999 A
5926535 Reynolds Jul 1999 A
5926538 Deryugin et al. Jul 1999 A
5926539 Shtivelman Jul 1999 A
5933492 Turovski Aug 1999 A
5937051 Hurd et al. Aug 1999 A
5937057 Bell et al. Aug 1999 A
5937162 Funk et al. Aug 1999 A
5937388 Davis et al. Aug 1999 A
5938725 Hara Aug 1999 A
5940075 Mutschler, III et al. Aug 1999 A
5940478 Vaudreuil et al. Aug 1999 A
5940479 Guy et al. Aug 1999 A
5940488 DeGrazia et al. Aug 1999 A
5940495 Bondarenko et al. Aug 1999 A
5940496 Gisby et al. Aug 1999 A
5940497 Miloslavsky Aug 1999 A
5940598 Strauss et al. Aug 1999 A
5940823 Schreiber et al. Aug 1999 A
5943416 Gisby Aug 1999 A
5946375 Pattison et al. Aug 1999 A
5946386 Rogers et al. Aug 1999 A
5946387 Miloslavsky Aug 1999 A
5948054 Nielsen Sep 1999 A
5949988 Feisullin et al. Sep 1999 A
5953332 Miloslavsky Sep 1999 A
5953405 Miloslavsky Sep 1999 A
5953406 LaRue et al. Sep 1999 A
5956482 Agraharam et al. Sep 1999 A
5956729 Goetz et al. Sep 1999 A
5958014 Cave Sep 1999 A
5958016 Chang et al. Sep 1999 A
5958064 Judd et al. Sep 1999 A
5959982 Federkins et al. Sep 1999 A
5960073 Kikinis et al. Sep 1999 A
5960411 Hartman et al. Sep 1999 A
5963632 Miloslavsky Oct 1999 A
5963635 Szlam et al. Oct 1999 A
5966427 Shaffer et al. Oct 1999 A
5966695 Melchione et al. Oct 1999 A
5970065 Miloslavsky Oct 1999 A
5970134 Highland et al. Oct 1999 A
5974135 Breneman et al. Oct 1999 A
5974414 Stanczak et al. Oct 1999 A
5974444 Konrad Oct 1999 A
5974448 Yamauchi et al. Oct 1999 A
RE36416 Szlam et al. Nov 1999 E
5978465 Corduroy et al. Nov 1999 A
5978467 Walker et al. Nov 1999 A
5978672 Hartmaier et al. Nov 1999 A
5978836 Ouchi Nov 1999 A
5982774 Foladare et al. Nov 1999 A
5982870 Pershan et al. Nov 1999 A
5982873 Flockhart et al. Nov 1999 A
5983218 Syeda-Mahmood Nov 1999 A
5987102 Elliott et al. Nov 1999 A
5987117 McNeil et al. Nov 1999 A
5987118 Dickerman et al. Nov 1999 A
5987423 Arnold et al. Nov 1999 A
5987446 Corey et al. Nov 1999 A
5991365 Pizano et al. Nov 1999 A
5991390 Booton Nov 1999 A
5991391 Miloslavsky Nov 1999 A
5991392 Miloslavsky Nov 1999 A
5991393 Kamen Nov 1999 A
5991394 Dezonno et al. Nov 1999 A
5991395 Miloslavsky Nov 1999 A
5995606 Civanlar et al. Nov 1999 A
5995610 Smidt et al. Nov 1999 A
5995614 Miloslavsky Nov 1999 A
5995615 Miloslavsky Nov 1999 A
5996000 Shuster Nov 1999 A
5999525 Krishnaswamy et al. Dec 1999 A
5999609 Nishimura Dec 1999 A
5999965 Kelly Dec 1999 A
6002396 Davies Dec 1999 A
6002760 Gisby Dec 1999 A
6003034 Tuli Dec 1999 A
6005845 Svennesson et al. Dec 1999 A
6005920 Fuller et al. Dec 1999 A
6005931 Neyman et al. Dec 1999 A
6009163 Nabkel et al. Dec 1999 A
6011792 Miloslavsky Jan 2000 A
6011844 Uppaluru et al. Jan 2000 A
6011974 Cedervall et al. Jan 2000 A
6012152 Douik et al. Jan 2000 A
6014137 Burns Jan 2000 A
6014138 Cain et al. Jan 2000 A
6014379 White et al. Jan 2000 A
6014437 Acker et al. Jan 2000 A
6014647 Nizzari et al. Jan 2000 A
6018578 Bondarenko et al. Jan 2000 A
6018579 Petrunka Jan 2000 A
6018761 Uomini Jan 2000 A
6021262 Cote et al. Feb 2000 A
6021411 Brophy et al. Feb 2000 A
6021428 Miloslavsky Feb 2000 A
6023684 Pearson Feb 2000 A
6023723 McCormick et al. Feb 2000 A
6026087 Mirashrafi et al. Feb 2000 A
6026375 Hall et al. Feb 2000 A
6028917 Creamer et al. Feb 2000 A
6029195 Herz Feb 2000 A
6038293 McNerney et al. Mar 2000 A
6038537 Matsuoka Mar 2000 A
6041116 Meyers Mar 2000 A
6044142 Hammarstrom et al. Mar 2000 A
6044144 Becker et al. Mar 2000 A
6044146 Gisby et al. Mar 2000 A
6044368 Powers Mar 2000 A
6046762 Sonesh et al. Apr 2000 A
6047060 Fedorov et al. Apr 2000 A
6049272 Lee et al. Apr 2000 A
6049547 Fisher et al. Apr 2000 A
6049779 Berkson Apr 2000 A
6052514 Gill et al. Apr 2000 A
6055307 Behnke et al. Apr 2000 A
6055308 Miloslavsky et al. Apr 2000 A
6055513 Katz et al. Apr 2000 A
6058163 Pattison et al. May 2000 A
6058389 Chandra et al. May 2000 A
6058435 Sassin et al. May 2000 A
6061054 Jolly May 2000 A
6064667 Gisby et al. May 2000 A
6064722 Clise et al. May 2000 A
6064723 Cohn et al. May 2000 A
6064730 Ginsberg May 2000 A
6064973 Smith et al. May 2000 A
6067357 Kishinsky et al. May 2000 A
6069890 White et al. May 2000 A
6070142 McDonough et al. May 2000 A
6070144 Ginsberg et al. May 2000 A
6072864 Shtivelman et al. Jun 2000 A
6073013 Agre et al. Jun 2000 A
6073105 Sutcliffe et al. Jun 2000 A
6073109 Flores et al. Jun 2000 A
6073124 Krishnan et al. Jun 2000 A
6075783 Voit Jun 2000 A
6075843 Cave Jun 2000 A
6076101 Kamakura et al. Jun 2000 A
6076105 Wolff et al. Jun 2000 A
6076109 Kikinis Jun 2000 A
6078581 Shtivelman et al. Jun 2000 A
6078583 Takahara et al. Jun 2000 A
6081591 Skoog Jun 2000 A
6081592 Battle Jun 2000 A
6085097 Savery et al. Jul 2000 A
6085201 Tso Jul 2000 A
6088340 Buchholz et al. Jul 2000 A
6088696 Moon et al. Jul 2000 A
6088717 Reed et al. Jul 2000 A
6094479 Lindeberg et al. Jul 2000 A
6094673 Dilip et al. Jul 2000 A
6097792 Thornton Aug 2000 A
6097804 Gilbert et al. Aug 2000 A
6097938 Paxson Aug 2000 A
6098065 Skillen et al. Aug 2000 A
6104711 Voit Aug 2000 A
6104800 Benson Aug 2000 A
6104801 Miloslavsky Aug 2000 A
6104802 Perlmutter Aug 2000 A
6108688 Nielsen Aug 2000 A
6108704 Hutton et al. Aug 2000 A
6108711 Beck et al. Aug 2000 A
6112085 Garner et al. Aug 2000 A
6115596 Raith et al. Sep 2000 A
6115742 Franklin et al. Sep 2000 A
6118865 Gisby Sep 2000 A
6119155 Rossmann et al. Sep 2000 A
6119167 Boyle et al. Sep 2000 A
6122360 Neyman et al. Sep 2000 A
6122364 Petrunka et al. Sep 2000 A
6122365 Yegoshin Sep 2000 A
6122632 Botts et al. Sep 2000 A
6125113 Farris et al. Sep 2000 A
6125126 Hallenst.ang.l Sep 2000 A
6128379 Smyk Oct 2000 A
6128482 Nixon et al. Oct 2000 A
6128603 Dent et al. Oct 2000 A
6128646 Miloslavsky Oct 2000 A
6130933 Miloslavsky Oct 2000 A
6134217 Stiliadis et al. Oct 2000 A
6134235 Goldman et al. Oct 2000 A
6134315 Galvin Oct 2000 A
6134318 O'Neil Oct 2000 A
6134530 Bunting et al. Oct 2000 A
6137870 Scherer Oct 2000 A
6138139 Beck et al. Oct 2000 A
6141345 Goeddel et al. Oct 2000 A
6148074 Miloslavsky et al. Nov 2000 A
6157653 Kline et al. Dec 2000 A
6157655 Shtivelman Dec 2000 A
6157924 Austin Dec 2000 A
6166735 Dom et al. Dec 2000 A
6167255 Kennedy, III et al. Dec 2000 A
6167395 Beck et al. Dec 2000 A
6167404 Morcos et al. Dec 2000 A
6170011 Macleod Beck et al. Jan 2001 B1
6173052 Brady Jan 2001 B1
6173316 De Boor et al. Jan 2001 B1
6175562 Cave Jan 2001 B1
6175563 Miloslavsky Jan 2001 B1
6175564 Miloslavsky et al. Jan 2001 B1
6175620 Rouge et al. Jan 2001 B1
6175842 Kirk et al. Jan 2001 B1
6178239 Kishinsky et al. Jan 2001 B1
6181336 Chiu et al. Jan 2001 B1
6181736 McLaughlin et al. Jan 2001 B1
6181788 Miloslavsky Jan 2001 B1
6182059 Angotti et al. Jan 2001 B1
6182249 Wookey et al. Jan 2001 B1
6185287 Miloslavsky Feb 2001 B1
6185291 Miloslavsky Feb 2001 B1
6185292 Miloslavsky Feb 2001 B1
6185427 Krasner et al. Feb 2001 B1
6185535 Hedin et al. Feb 2001 B1
6188688 Buskirk, Jr. Feb 2001 B1
6192250 Buskens et al. Feb 2001 B1
6195357 Polcyn Feb 2001 B1
6198738 Chang et al. Mar 2001 B1
6198739 Neyman et al. Mar 2001 B1
6201804 Kikinis Mar 2001 B1
6201863 Miloslavsky Mar 2001 B1
6205135 Chinni et al. Mar 2001 B1
6205412 Barskiy et al. Mar 2001 B1
6212178 Beck et al. Apr 2001 B1
6215783 Neyman Apr 2001 B1
6219045 Leahy et al. Apr 2001 B1
6219413 Burg Apr 2001 B1
6222919 Hollatz et al. Apr 2001 B1
6226285 Kozdon et al. May 2001 B1
6229524 Chernock et al. May 2001 B1
6229888 Miloslavsky May 2001 B1
6230197 Beck et al. May 2001 B1
6233234 Curry et al. May 2001 B1
6233616 Reid May 2001 B1
6236857 Calabrese et al. May 2001 B1
6240285 Blum et al. May 2001 B1
6243092 Okita et al. Jun 2001 B1
6243373 Turock Jun 2001 B1
6243375 Speicher Jun 2001 B1
6243379 Veerina et al. Jun 2001 B1
6243713 Nelson et al. Jun 2001 B1
6249807 Shaw et al. Jun 2001 B1
6253129 Jenkins et al. Jun 2001 B1
6256489 Lichter et al. Jul 2001 B1
6256503 Stephens Jul 2001 B1
6259692 Shtivelman et al. Jul 2001 B1
6259774 Miloslavsky Jul 2001 B1
6259786 Gisby Jul 2001 B1
6263049 Kuhn Jul 2001 B1
6263065 Durinovic-Johri et al. Jul 2001 B1
6263066 Shtivelman et al. Jul 2001 B1
6263359 Fong et al. Jul 2001 B1
6275693 Lin et al. Aug 2001 B1
6278976 Kochian Aug 2001 B1
6278996 Richardson et al. Aug 2001 B1
6282429 Baiyor et al. Aug 2001 B1
6282565 Shaw et al. Aug 2001 B1
6285316 Nir et al. Sep 2001 B1
6285364 Giordano, III et al. Sep 2001 B1
6286033 Kishinsky et al. Sep 2001 B1
6286084 Wexler et al. Sep 2001 B1
6286129 Agarwal et al. Sep 2001 B1
6289094 Miloslavsky Sep 2001 B1
6292181 Banerjee et al. Sep 2001 B1
6292553 Fellingham et al. Sep 2001 B1
6295353 Flockhart et al. Sep 2001 B1
6295530 Ritchie et al. Sep 2001 B1
6298041 Packer Oct 2001 B1
6301480 Kennedy, III et al. Oct 2001 B1
6304898 Shiigi Oct 2001 B1
6314089 Szlam et al. Nov 2001 B1
6314430 Chang Nov 2001 B1
6320857 Tonnby et al. Nov 2001 B1
6320951 Shtivelman et al. Nov 2001 B1
6324276 Uppaluru et al. Nov 2001 B1
6330323 Gottlieb et al. Dec 2001 B1
6330426 Brown et al. Dec 2001 B2
6332022 Martinez Dec 2001 B1
6332154 Beck et al. Dec 2001 B2
6332163 Bowman-Amuah Dec 2001 B1
6333980 Hollatz et al. Dec 2001 B1
6335927 Elliott et al. Jan 2002 B1
6337904 Gisby Jan 2002 B1
6339593 Kikinis Jan 2002 B1
6343281 Kato Jan 2002 B1
6345290 Okada et al. Feb 2002 B2
6345300 Bakshi et al. Feb 2002 B1
6345305 Beck et al. Feb 2002 B1
6346952 Shtivelman Feb 2002 B1
6347085 Kelly Feb 2002 B2
6353608 Cullers et al. Mar 2002 B1
6353667 Foster et al. Mar 2002 B1
6359981 Neyman et al. Mar 2002 B1
6362838 Szlam et al. Mar 2002 B1
6363411 Dugan et al. Mar 2002 B1
6366575 Barkan et al. Apr 2002 B1
6366586 Christie Apr 2002 B1
6366651 Griffith et al. Apr 2002 B1
6366658 Bjornberg et al. Apr 2002 B1
6366663 Bauer et al. Apr 2002 B1
6366925 Meltzer et al. Apr 2002 B1
6370238 Sansone et al. Apr 2002 B1
6370508 Beck et al. Apr 2002 B2
6370567 Ouchi Apr 2002 B1
6373836 Deryugin et al. Apr 2002 B1
6373937 Yegoshin Apr 2002 B1
6377568 Kelly Apr 2002 B1
6377583 Lyles et al. Apr 2002 B1
6377944 Busey et al. Apr 2002 B1
6377975 Florman Apr 2002 B1
6381640 Beck et al. Apr 2002 B1
6385191 Coffman et al. May 2002 B1
6385202 Katseff et al. May 2002 B1
6385646 Brown et al. May 2002 B1
6389007 Shenkman et al. May 2002 B1
6389133 Kamen May 2002 B1
6393018 Miloslavsky May 2002 B2
6393122 Belzile May 2002 B1
6393278 Buchanan et al. May 2002 B1
6393481 Deo et al. May 2002 B1
6396834 Bonomi et al. May 2002 B1
6396919 Shimada et al. May 2002 B1
6400725 Ross Jun 2002 B1
6401066 McIntosh Jun 2002 B1
6401094 Stemp et al. Jun 2002 B1
6405033 Kennedy, III et al. Jun 2002 B1
6407996 Witchalls Jun 2002 B1
6407999 Olkkonen et al. Jun 2002 B1
6408064 Fedorov et al. Jun 2002 B1
6411806 Garner et al. Jun 2002 B1
6418146 Miloslavsky Jul 2002 B1
6418199 Perrone Jul 2002 B1
6424709 Doyle et al. Jul 2002 B1
6427002 Campbell et al. Jul 2002 B2
6430174 Jennings et al. Aug 2002 B1
6430282 Bannister et al. Aug 2002 B1
6434231 Neyman et al. Aug 2002 B2
6434530 Sloane et al. Aug 2002 B1
6434549 Linetsky et al. Aug 2002 B1
6442242 McAllister et al. Aug 2002 B1
6442247 Garcia Aug 2002 B1
6445788 Torba Sep 2002 B1
6449260 Sassin et al. Sep 2002 B1
6449270 Miloslavsky Sep 2002 B1
6449358 Anisimov et al. Sep 2002 B1
6449646 Sikora et al. Sep 2002 B1
6452609 Katinsky et al. Sep 2002 B1
6453038 McFarlane et al. Sep 2002 B1
6453341 Miloslavsky Sep 2002 B1
6456615 Kikinis Sep 2002 B1
6456619 Sassin et al. Sep 2002 B1
6459697 Neyman Oct 2002 B1
6463148 Brady Oct 2002 B1
6470010 Szviatovszki et al. Oct 2002 B1
6470080 Perlmutter Oct 2002 B2
6473787 Miloslavsky Oct 2002 B2
6480600 Neyman et al. Nov 2002 B1
6487663 Jaisimha et al. Nov 2002 B1
6489954 Powlette Dec 2002 B1
6490350 McDuff et al. Dec 2002 B2
6493353 Kelly et al. Dec 2002 B2
6493433 Clabaugh et al. Dec 2002 B2
6493447 Goss et al. Dec 2002 B1
6496567 Bjornberg et al. Dec 2002 B1
6496702 Lockhart Dec 2002 B1
6496981 Wistendahl et al. Dec 2002 B1
6498897 Nelson et al. Dec 2002 B1
6499088 Wexler et al. Dec 2002 B1
6512825 Lindholm et al. Jan 2003 B1
6515996 Tonnby et al. Feb 2003 B1
6519246 Strahs Feb 2003 B1
6519617 Wanderski et al. Feb 2003 B1
6532493 Aviani, Jr. et al. Mar 2003 B1
6535492 Shtivelman Mar 2003 B2
6536043 Guedalia Mar 2003 B1
6539419 Beck et al. Mar 2003 B2
6546405 Gupta et al. Apr 2003 B2
6549539 Neyman Apr 2003 B1
6553114 Fisher et al. Apr 2003 B1
6554183 Sticha et al. Apr 2003 B1
6560328 Bondarenko et al. May 2003 B1
6560329 Draginich et al. May 2003 B1
6560607 Lassesen May 2003 B1
6563788 Torba et al. May 2003 B1
6567854 Olshansky et al. May 2003 B1
6581105 Miloslavsky et al. Jun 2003 B2
6594269 Polcyn Jul 2003 B1
6597685 Miloslavsky et al. Jul 2003 B2
6600733 Deng Jul 2003 B2
6600822 Kamen Jul 2003 B2
6603762 Kikinis Aug 2003 B1
6603854 Judkins et al. Aug 2003 B1
6611498 Baker et al. Aug 2003 B1
6611590 Lu et al. Aug 2003 B1
6614780 Hakim et al. Sep 2003 B2
6614781 Elliott et al. Sep 2003 B1
6625139 Miloslavsky et al. Sep 2003 B2
6628666 Pickering et al. Sep 2003 B1
6631399 Stanczak et al. Oct 2003 B1
6633910 Rajan et al. Oct 2003 B1
6650747 Bala et al. Nov 2003 B1
6651085 Woods Nov 2003 B1
6661882 Muir et al. Dec 2003 B1
6668286 Bateman et al. Dec 2003 B2
6678718 Khouri et al. Jan 2004 B1
6681010 Anderson et al. Jan 2004 B1
6687241 Goss Feb 2004 B1
6690788 Bauer et al. Feb 2004 B1
6693893 Ehlinger Feb 2004 B1
6704409 Dilip et al. Mar 2004 B1
6704410 McFarlane et al. Mar 2004 B1
6704411 Nishidate Mar 2004 B1
6707903 Burok et al. Mar 2004 B2
6711249 Weissman et al. Mar 2004 B2
6711611 Hanhan Mar 2004 B2
6714643 Gargeya et al. Mar 2004 B1
6718032 Vrenjak et al. Apr 2004 B1
6718366 Beck et al. Apr 2004 B2
6721306 Farris et al. Apr 2004 B1
6731626 Neyman May 2004 B1
6735298 Neyman et al. May 2004 B2
6744877 Edwards Jun 2004 B1
6744878 Komissarchik et al. Jun 2004 B1
6748211 Isaac et al. Jun 2004 B1
6751210 Shaffer et al. Jun 2004 B1
6753784 Sznaider et al. Jun 2004 B1
6754181 Elliott et al. Jun 2004 B1
6760322 Fukuda et al. Jul 2004 B1
6760324 Scott et al. Jul 2004 B1
6760428 Foster Jul 2004 B2
6760727 Schroeder et al. Jul 2004 B1
6763104 Judkins et al. Jul 2004 B1
6763369 Ytuarte et al. Jul 2004 B1
6771765 Crowther et al. Aug 2004 B1
6778527 Amin Aug 2004 B1
6785375 Beddus et al. Aug 2004 B1
6785710 Kikinis Aug 2004 B2
6785740 Yoneda et al. Aug 2004 B1
6788779 Ostapchuck Sep 2004 B2
6798771 Low et al. Sep 2004 B1
6801520 Philonenko Oct 2004 B2
6801928 Nuestro Oct 2004 B2
6804346 Mewhinney Oct 2004 B1
6816871 Lee Nov 2004 B2
6816878 Zimmers et al. Nov 2004 B1
6845154 Cave et al. Jan 2005 B1
6847715 Swartz Jan 2005 B1
6847825 Duvall et al. Jan 2005 B1
6850602 Chou Feb 2005 B1
6850614 Collins Feb 2005 B1
6859529 Duncan et al. Feb 2005 B2
6865267 Dezonno Mar 2005 B2
6868391 Hultgren Mar 2005 B1
6874119 Macleod Beck et al. Mar 2005 B2
6876632 Takeda Apr 2005 B1
6879586 Miloslavsky et al. Apr 2005 B2
6882996 Preisig et al. Apr 2005 B2
6898190 Shtivelman et al. May 2005 B2
6903685 Arndt et al. Jun 2005 B1
6907455 Wolfe et al. Jun 2005 B1
6910072 Macleod Beck et al. Jun 2005 B2
6912272 Kirk et al. Jun 2005 B2
6922411 Taylor Jul 2005 B1
6922689 Shtivelman Jul 2005 B2
6934379 Falcon et al. Aug 2005 B2
6934381 Klein et al. Aug 2005 B1
6944272 Thomas Sep 2005 B1
6958994 Zhakov et al. Oct 2005 B2
6965914 Dowling Nov 2005 B2
6970844 Bierenbaum Nov 2005 B1
6977740 Mandalia Dec 2005 B1
6981020 Miloslavsky et al. Dec 2005 B2
6985478 Pogossiants et al. Jan 2006 B2
6985943 Deryugin et al. Jan 2006 B2
6987977 Lockhart Jan 2006 B2
6996603 Srinivasan Feb 2006 B1
7006614 Feinberg et al. Feb 2006 B2
7020264 Neyman et al. Mar 2006 B1
7031442 Neyman et al. Apr 2006 B1
7036128 Julia et al. Apr 2006 B1
7039176 Borodow et al. May 2006 B2
7039857 Beck et al. May 2006 B2
7076048 Lee et al. Jul 2006 B2
7079641 Ostapchuck Jul 2006 B2
7080092 Upton Jul 2006 B2
7088814 Shaffer et al. Aug 2006 B1
7092509 Mears et al. Aug 2006 B1
7106850 Campbell et al. Sep 2006 B2
7110523 Gagle et al. Sep 2006 B2
7110525 Heller et al. Sep 2006 B1
7117244 Florman et al. Oct 2006 B2
7120700 Macleod Beck et al. Oct 2006 B2
7127400 Koch Oct 2006 B2
7133830 Hoban et al. Nov 2006 B1
7136475 Rogers et al. Nov 2006 B1
7155496 Froyd et al. Dec 2006 B2
7155512 Lean et al. Dec 2006 B2
7159224 Sharma et al. Jan 2007 B2
7167924 Symonds et al. Jan 2007 B1
7184747 Bogat Feb 2007 B2
7216350 Martin et al. May 2007 B2
7221377 Okita et al. May 2007 B1
7222301 Makagon et al. May 2007 B2
7231032 Nevman et al. Jun 2007 B2
7236486 Baker et al. Jun 2007 B2
7236584 Torba Jun 2007 B2
7242760 Shires Jul 2007 B2
7245641 Kim Jul 2007 B2
7245711 Margolis Jul 2007 B2
7246009 Hamblen et al. Jul 2007 B2
7254219 Hansen et al. Aug 2007 B1
7254641 Broughton et al. Aug 2007 B2
7263372 Lockhart Aug 2007 B2
7263671 Hull et al. Aug 2007 B2
7269263 Dedieu et al. Sep 2007 B2
7272627 Petrovykh Sep 2007 B2
7277424 Dowling Oct 2007 B1
7277536 Ostapchuk Oct 2007 B2
7277916 Nuestro Oct 2007 B2
7283519 Girard Oct 2007 B2
7336649 Huang Feb 2008 B1
7363228 Wyss et al. Apr 2008 B2
7372956 Kikinis et al. May 2008 B1
7373405 Deryugin et al. May 2008 B2
7373410 Monza et al. May 2008 B2
7376227 Anisimov et al. May 2008 B2
7376431 Niedermeyer May 2008 B2
7401112 Matz et al. Jul 2008 B1
7415009 Neyman Aug 2008 B2
7418094 Golitsin et al. Aug 2008 B2
7428303 Campbell et al. Sep 2008 B2
7434204 Everingham et al. Oct 2008 B1
7460496 Miloslavsky et al. Dec 2008 B2
7496640 Hanhan Feb 2009 B2
7535479 Okita et al. May 2009 B2
7558383 Shtivelman et al. Jul 2009 B2
7561887 Lockhart Jul 2009 B2
7564840 Elliott et al. Jul 2009 B2
7565428 Deryugin et al. Jul 2009 B2
7609829 Wang et al. Oct 2009 B2
7610347 Petrovykh Oct 2009 B2
7619996 Miloslavsky et al. Nov 2009 B2
7669182 Garcia Feb 2010 B2
7672998 Haskins et al. Mar 2010 B1
7706520 Waterson et al. Apr 2010 B1
7715332 Miloslavsky et al. May 2010 B2
7716292 Kikinis May 2010 B2
7739325 Okita et al. Jun 2010 B1
7764231 Karr et al. Jul 2010 B1
7769161 Hession et al. Aug 2010 B1
7779067 Beck et al. Aug 2010 B2
7792773 McCord et al. Sep 2010 B2
7808977 Kikinis Oct 2010 B2
7823167 Makagon et al. Oct 2010 B2
7853717 Petrovykh Dec 2010 B2
7856095 Brown Dec 2010 B2
7903807 Neyman et al. Mar 2011 B2
7907598 Anisimov et al. Mar 2011 B2
7929978 Lockhart Apr 2011 B2
7957401 Zalenski et al. Jun 2011 B2
8009821 Apparao et al. Aug 2011 B1
8018921 Pogossiants et al. Sep 2011 B2
8024401 Gurbani et al. Sep 2011 B1
8031698 Neyman Oct 2011 B2
8036214 Elliott et al. Oct 2011 B2
8059812 Bundy Nov 2011 B1
8068598 Russi et al. Nov 2011 B1
8085761 Elliott et al. Dec 2011 B2
8089958 Elliott et al. Jan 2012 B2
8126133 Everingham et al. Feb 2012 B1
8130749 Kikinis Mar 2012 B2
8180662 Minert et al. May 2012 B2
8180666 Minert et al. May 2012 B2
8199891 Brown et al. Jun 2012 B2
8209207 Minert et al. Jun 2012 B2
8209209 Minert et al. Jun 2012 B2
8223948 Minert et al. Jul 2012 B2
8226477 Machado et al. Jul 2012 B1
8254404 Rabenko et al. Aug 2012 B2
8254558 Minert et al. Aug 2012 B2
8270421 Elliott et al. Sep 2012 B2
8275111 Golitsin et al. Sep 2012 B2
8345856 Anisimov et al. Jan 2013 B1
8351595 Peterson et al. Jan 2013 B2
8358769 Neyman et al. Jan 2013 B2
8395994 Stevenson et al. Mar 2013 B2
8396205 Lowry et al. Mar 2013 B1
8411844 Anisimov et al. Apr 2013 B1
8693347 Elliott et al. Apr 2014 B2
9002920 Deryugin et al. Apr 2015 B2
RE45583 Lockhart Jun 2015 E
9118781 Kavulak et al. Aug 2015 B1
20010000458 Shtivelman et al. Apr 2001 A1
20010001150 Miloslavsky May 2001 A1
20010005382 Cave et al. Jun 2001 A1
20010011366 Beck et al. Aug 2001 A1
20010013041 Macleod Beck et al. Aug 2001 A1
20010014604 Kingdon et al. Aug 2001 A1
20010023430 Srinivasan Sep 2001 A1
20010023448 Hanhan Sep 2001 A1
20010024497 Campbell et al. Sep 2001 A1
20010025309 Macleod Beck et al. Sep 2001 A1
20010028649 Pogossiants et al. Oct 2001 A1
20010029519 Hallinan et al. Oct 2001 A1
20010037316 Shiloh Nov 2001 A1
20010038624 Greenberg et al. Nov 2001 A1
20010040887 Shtivelman et al. Nov 2001 A1
20010042095 Kim et al. Nov 2001 A1
20010043586 Miloslavsky Nov 2001 A1
20010043589 Kikinis Nov 2001 A1
20010044676 Macleod Beck et al. Nov 2001 A1
20010044828 Kikinis Nov 2001 A1
20010054064 Kannan Dec 2001 A1
20020001300 Miloslavsky et al. Jan 2002 A1
20020012428 Neyman et al. Jan 2002 A1
20020013150 McKenna et al. Jan 2002 A1
20020019844 Kurowski et al. Feb 2002 A1
20020019846 Miloslavsky et al. Feb 2002 A1
20020025819 Cetusic et al. Feb 2002 A1
20020035647 Brown et al. Mar 2002 A1
20020037076 Perlmutter Mar 2002 A1
20020041674 Kamen Apr 2002 A1
20020054579 Miloslavsky May 2002 A1
20020055853 Macleod Beck et al. May 2002 A1
20020056000 Coussement May 2002 A1
20020057671 Kikinis May 2002 A1
20020059164 Shtivelman May 2002 A1
20020059374 Nuestro May 2002 A1
20020060988 Shtivelman May 2002 A1
20020062385 Dowling May 2002 A1
20020064149 Elliott et al. May 2002 A1
20020071529 Nelkenbaum Jun 2002 A1
20020076031 Falcon et al. Jun 2002 A1
20020078150 Thompson et al. Jun 2002 A1
20020087648 Petrovykh Jul 2002 A1
20020091726 Macleod Beck et al. Jul 2002 A1
20020095462 Beck et al. Jul 2002 A1
20020097708 Deng Jul 2002 A1
20020099738 Grant Jul 2002 A1
20020101866 Miloslavsky et al. Aug 2002 A1
20020101880 Kim Aug 2002 A1
20020103998 DeBruine Aug 2002 A1
20020105957 Bondarenko et al. Aug 2002 A1
20020114278 Coussement Aug 2002 A1
20020114441 Coussement Aug 2002 A1
20020120719 Lee et al. Aug 2002 A1
20020123899 Hall et al. Sep 2002 A1
20020126678 Kelly et al. Sep 2002 A1
20020126828 Kamen Sep 2002 A1
20020131399 Philonenko Sep 2002 A1
20020136167 Steele et al. Sep 2002 A1
20020150311 Lynn Oct 2002 A1
20020169834 Miloslavsky et al. Nov 2002 A1
20020176404 Girard Nov 2002 A1
20030002479 Vortman et al. Jan 2003 A1
20030002652 Neyman et al. Jan 2003 A1
20030002654 Torba Jan 2003 A1
20030007621 Graves et al. Jan 2003 A1
20030009530 Philonenko et al. Jan 2003 A1
20030018702 Broughton Jan 2003 A1
20030018729 Miloslavsky Jan 2003 A1
20030021259 Miloslavsky et al. Jan 2003 A1
20030021406 Ostapchuck Jan 2003 A1
20030026414 Baker et al. Feb 2003 A1
20030037113 Petrovykh Feb 2003 A1
20030043832 Anisimov et al. Mar 2003 A1
20030051037 Sundaram et al. Mar 2003 A1
20030055884 Yuen et al. Mar 2003 A1
20030058884 Kallner et al. Mar 2003 A1
20030084128 Anderson et al. May 2003 A1
20030084349 Friedrichs et al. May 2003 A1
20030088421 Maes et al. May 2003 A1
20030097457 Saran et al. May 2003 A1
20030099343 Dezonno May 2003 A1
20030115353 Deryugin et al. Jun 2003 A1
20030125048 Lockhart Jul 2003 A1
20030135592 Vetter et al. Jul 2003 A1
20030161296 Butler et al. Aug 2003 A1
20030161448 Parolkar et al. Aug 2003 A1
20030179729 MacLeod Beck et al. Sep 2003 A1
20030212558 Matula Nov 2003 A1
20030216923 Gilmore et al. Nov 2003 A1
20030219029 Pickett Nov 2003 A1
20030220875 Lam et al. Nov 2003 A1
20030229529 Mui et al. Dec 2003 A1
20040006739 Mulligan Jan 2004 A1
20040017797 Chen et al. Jan 2004 A1
20040019638 Makagon et al. Jan 2004 A1
20040030557 Culy et al. Feb 2004 A1
20040047302 Dezonno et al. Mar 2004 A1
20040054743 McPartlan Mar 2004 A1
20040064348 Humenansky et al. Apr 2004 A1
20040081183 Monza et al. Apr 2004 A1
20040083195 McCord et al. Apr 2004 A1
20040083281 Makagon et al. Apr 2004 A1
20040083479 Bondarenko et al. Apr 2004 A1
20040083482 Makagon et al. Apr 2004 A1
20040102977 Metzler et al. May 2004 A1
20040107025 Ransom et al. Jun 2004 A1
20040111269 Koch Jun 2004 A1
20040120502 Strathmeyer et al. Jun 2004 A1
20040169675 Beck et al. Sep 2004 A1
20040179516 Neyman Sep 2004 A1
20040181574 Hanhan Sep 2004 A1
20040199580 Zhakov et al. Oct 2004 A1
20040208134 Neyman et al. Oct 2004 A1
20040208309 Miloslavsky Oct 2004 A1
20040213400 Golitsin et al. Oct 2004 A1
20040223490 Donovan et al. Nov 2004 A1
20040264678 Ostapchuck Dec 2004 A1
20040267892 Kikinis Dec 2004 A1
20050013417 Zimmers et al. Jan 2005 A1
20050033851 Kikinis Feb 2005 A1
20050041678 Nuestro Feb 2005 A1
20050128961 Miloslavsky et al. Jun 2005 A1
20050147090 MacLeod Beck et al. Jul 2005 A1
20050154792 Deryugin et al. Jul 2005 A1
20050207559 Shtivelman et al. Sep 2005 A1
20060029206 Anisimov et al. Feb 2006 A1
20060034262 Pogossiants et al. Feb 2006 A1
20060079250 Lockhart Apr 2006 A1
20060080107 Hill et al. Apr 2006 A1
20060095568 Makagon et al. May 2006 A1
20060109976 Sundaram et al. May 2006 A1
20060133594 Neyman et al. Jun 2006 A1
20060153173 Beck et al. Jul 2006 A1
20060209797 Anisimov et al. Sep 2006 A1
20060210047 Neyman et al. Sep 2006 A1
20060245421 Ostapchuk Nov 2006 A1
20070002744 Mewhinney et al. Jan 2007 A1
20070041525 Tingley et al. Feb 2007 A1
20070041567 Anisimov et al. Feb 2007 A1
20070071224 Shtivelman et al. Mar 2007 A1
20070110043 Girard May 2007 A1
20070127707 Koser et al. Jun 2007 A1
20070143301 Tran Jun 2007 A1
20070195940 Miloslavsky et al. Aug 2007 A1
20070213073 Lockhart Sep 2007 A1
20070274495 Youd et al. Nov 2007 A1
20080002822 Petrovykh Jan 2008 A1
20080013531 Elliott et al. Jan 2008 A1
20080025295 Elliott et al. Jan 2008 A1
20080034354 Brughton Feb 2008 A1
20080043728 Miloslavsky et al. Feb 2008 A1
20080043955 Shtivelman et al. Feb 2008 A1
20080043975 Miloslavsky et al. Feb 2008 A1
20080043977 Neyman et al. Feb 2008 A1
20080046504 Deryugin et al. Feb 2008 A1
20080046531 Shtivelman et al. Feb 2008 A1
20080049731 Kikinis Feb 2008 A1
20080049737 Neyman Feb 2008 A1
20080049928 Miloslavsky et al. Feb 2008 A1
20080049929 Miloslavsky et al. Feb 2008 A1
20080062971 Kikinis Mar 2008 A1
20080130844 Hubbard et al. Jun 2008 A1
20080205378 Wyss et al. Aug 2008 A1
20080222240 Deryugin et al. Sep 2008 A1
20080285739 Golitsin et al. Nov 2008 A1
20090089136 Minert et al. Apr 2009 A1
20090089451 Petrovykh Apr 2009 A1
20090227267 Lockhart Sep 2009 A1
20090240346 Cadigan, Jr. et al. Sep 2009 A1
20100106710 Nishizawa et al. Apr 2010 A1
20100157979 Anisimov et al. Jun 2010 A1
20100198930 Kikinis Aug 2010 A1
20110099602 Apparao et al. Apr 2011 A1
20110110363 Anandani May 2011 A1
20110178946 Minert et al. Jul 2011 A1
20110179304 Peterson Jul 2011 A1
20110179398 Peterson Jul 2011 A1
20110182418 Anisimov et al. Jul 2011 A1
20120047266 Minert Feb 2012 A1
20120066016 Minert et al. Mar 2012 A1
20120177195 Elliott et al. Jul 2012 A1
20120195415 Wyss et al. Aug 2012 A1
20120250849 Liu et al. Oct 2012 A1
20130016115 Minert et al. Jan 2013 A1
20130070757 Elliott et al. Mar 2013 A1
20130129067 Neyman et al. May 2013 A1
20130230160 Neyman et al. Sep 2013 A1
20140376708 Deryugin et al. Dec 2014 A1
20140379936 Anisimov et al. Dec 2014 A1
20150201021 Beck et al. Jul 2015 A1
20150244870 Neyman et al. Aug 2015 A1
Foreign Referenced Citations (537)
Number Date Country
270486 Jul 2004 AT
281039 Nov 2004 AT
316736 Feb 2006 AT
317621 Feb 2006 AT
318048 Mar 2006 AT
337678 Sep 2006 AT
379921 Dec 2007 AT
380434 Dec 2007 AT
384398 Feb 2008 AT
388578 Mar 2008 AT
401736 Aug 2008 AT
413059 Nov 2008 AT
424090 Mar 2009 AT
465451 May 2010 AT
474415 Jul 2010 AT
2604797 Oct 1997 AU
718233 Mar 1998 AU
5274398 Mar 1998 AU
6023598 Aug 1998 AU
6034698 Aug 1998 AU
6167398 Aug 1998 AU
6319498 Aug 1998 AU
6655298 Sep 1998 AU
6655398 Sep 1998 AU
7099298 Oct 1998 AU
735134 Mar 1999 AU
736449 Apr 1999 AU
737483 Apr 1999 AU
743217 Apr 1999 AU
745404 Apr 1999 AU
748636 Apr 1999 AU
9225198 Apr 1999 AU
9228098 Apr 1999 AU
9381998 Apr 1999 AU
9479298 Apr 1999 AU
743880 May 1999 AU
1118899 May 1999 AU
740090 Jun 1999 AU
743737 Jun 1999 AU
744340 Jun 1999 AU
1120099 Jun 1999 AU
1276799 Jun 1999 AU
1286299 Jun 1999 AU
741437 Aug 1999 AU
758713 Aug 1999 AU
2595499 Aug 1999 AU
2595599 Aug 1999 AU
2667299 Aug 1999 AU
2674899 Aug 1999 AU
739979 Sep 1999 AU
2674799 Sep 1999 AU
749023 Dec 1999 AU
4427299 Dec 1999 AU
4819499 Dec 1999 AU
746085 Jan 2000 AU
4426799 Jan 2000 AU
750215 Apr 2000 AU
754238 Apr 2000 AU
755234 Apr 2000 AU
5807099 Apr 2000 AU
5810599 Apr 2000 AU
5813699 Apr 2000 AU
748456 May 2000 AU
751143 May 2000 AU
751232 May 2000 AU
751269 May 2000 AU
751301 May 2000 AU
755138 May 2000 AU
1233800 May 2000 AU
1327200 May 2000 AU
1328200 May 2000 AU
1328300 May 2000 AU
1454700 May 2000 AU
1717700 May 2000 AU
1718600 May 2000 AU
2045900 Jun 2000 AU
748447 Jul 2000 AU
3113800 Jul 2000 AU
2964900 Sep 2000 AU
3470800 Sep 2000 AU
4507700 Feb 2001 AU
6798300 Apr 2001 AU
1077201 Jun 2001 AU
1077301 Jun 2001 AU
8006800 Jun 2001 AU
4732501 Oct 2001 AU
5384201 Oct 2001 AU
5724801 Nov 2001 AU
756656 Jan 2003 AU
2003300117 Aug 2004 AU
9913621 May 2001 BR
9913622 May 2001 BR
2178705 Mar 1997 CA
2391428 Mar 1997 CA
2259912 Jan 1998 CA
2280002 Aug 1998 CA
2289193 Dec 1998 CA
2289198 Dec 1998 CA
2302397 Mar 1999 CA
2302488 Mar 1999 CA
2302674 Mar 1999 CA
2302680 Mar 1999 CA
2302704 Mar 1999 CA
2302678 Apr 1999 CA
2308590 May 1999 CA
2309185 May 1999 CA
2309186 May 1999 CA
2309183 Jun 1999 CA
2320978 Aug 1999 CA
2320979 Aug 1999 CA
2320989 Aug 1999 CA
2330608 Dec 1999 CA
2334513 Dec 1999 CA
2343286 Mar 2000 CA
2343288 Mar 2000 CA
2343756 Mar 2000 CA
2346994 May 2000 CA
2347721 May 2000 CA
2348567 May 2000 CA
2348574 May 2000 CA
2348575 May 2000 CA
2348999 May 2000 CA
2350515 May 2000 CA
2352973 Jun 2000 CA
2362172 Aug 2000 CA
2313596 Feb 2001 CA
1282484 Jan 2001 CN
1282485 Jan 2001 CN
1285990 Feb 2001 CN
1285991 Feb 2001 CN
1293798 May 2001 CN
1293858 May 2001 CN
1298590 Jun 2001 CN
1309861 Aug 2001 CN
1310822 Aug 2001 CN
1323418 Nov 2001 CN
1323421 Nov 2001 CN
1354942 Jun 2002 CN
1130061 Dec 2003 CN
1132399 Dec 2003 CN
1145314 Apr 2004 CN
1149521 May 2004 CN
1152549 Jun 2004 CN
1512724 Jul 2004 CN
1520197 Aug 2004 CN
1197336 Apr 2005 CN
1200548 May 2005 CN
1662025 Aug 2005 CN
1232077 Dec 2005 CN
1756280 Apr 2006 CN
100477702 Apr 2009 CN
100547568 Oct 2009 CN
102257789 Nov 2011 CN
101635775 Dec 2011 CN
60011863 Dec 2004 DE
69730498 Sep 2005 DE
60015236 Feb 2006 DE
69832275 Aug 2006 DE
69833285 Sep 2006 DE
69833394 Oct 2006 DE
69833462 Oct 2006 DE
69833935 Nov 2006 DE
60214191 Dec 2006 DE
69834184 Mar 2007 DE
69838795 Oct 2008 DE
69838814 Nov 2008 DE
69839022 Jan 2009 DE
69839222 Mar 2009 DE
0193961 Sep 1986 EP
0236013 Sep 1987 EP
0376517 Jul 1990 EP
0420779 Apr 1991 EP
0424015 Apr 1991 EP
0425161 May 1991 EP
0425163 May 1991 EP
0515068 Nov 1992 EP
0528732 Feb 1993 EP
0532972 Mar 1993 EP
0539105 Apr 1993 EP
0559979 Sep 1993 EP
0568770 Nov 1993 EP
0610625 Aug 1994 EP
0647050 Apr 1995 EP
0647051 Apr 1995 EP
0660573 Jun 1995 EP
0701358 Mar 1996 EP
0705017 Apr 1996 EP
0721268 Jul 1996 EP
0725526 Aug 1996 EP
0734187 Sep 1996 EP
0740450 Oct 1996 EP
0748102 Dec 1996 EP
0753956 Jan 1997 EP
0755146 Jan 1997 EP
0758175 Feb 1997 EP
0771095 May 1997 EP
0792076 Aug 1997 EP
0806858 Nov 1997 EP
0817455 Jan 1998 EP
0856980 Aug 1998 EP
0863651 Sep 1998 EP
0866407 Sep 1998 EP
0869639 Oct 1998 EP
0883306 Dec 1998 EP
0908047 Apr 1999 EP
0958560 Nov 1999 EP
0962087 Dec 1999 EP
1006706 Jun 2000 EP
1013062 Jun 2000 EP
1013066 Jun 2000 EP
1016280 Jul 2000 EP
1044553 Oct 2000 EP
1064630 Jan 2001 EP
1066712 Jan 2001 EP
1075153 Feb 2001 EP
1087597 Mar 2001 EP
1088277 Apr 2001 EP
1092313 Apr 2001 EP
1107555 Jun 2001 EP
1114543 Jul 2001 EP
1125214 Aug 2001 EP
1133677 Sep 2001 EP
1133736 Sep 2001 EP
1133742 Sep 2001 EP
1145153 Oct 2001 EP
1145154 Oct 2001 EP
1163564 Dec 2001 EP
1193961 Apr 2002 EP
1227635 Jul 2002 EP
1248447 Oct 2002 EP
1290861 Mar 2003 EP
1292901 Mar 2003 EP
1292939 Mar 2003 EP
1328121 Jul 2003 EP
0873642 Apr 2004 EP
1413954 Apr 2004 EP
1107615 Jun 2004 EP
1033024 Sep 2004 EP
1129545 Sep 2004 EP
1061723 Oct 2004 EP
1465397 Oct 2004 EP
1469663 Oct 2004 EP
1484903 Dec 2004 EP
1566949 Aug 2005 EP
0985308 Nov 2005 EP
1359735 Jan 2006 EP
1357729 Feb 2006 EP
1377001 Feb 2006 EP
0954922 Mar 2006 EP
0986875 Apr 2006 EP
1410614 Aug 2006 EP
1774760 Apr 2007 EP
1021905 Nov 2007 EP
1031232 Dec 2007 EP
1865697 Dec 2007 EP
1040638 Jan 2008 EP
1048162 Mar 2008 EP
1157509 Jul 2008 EP
1337079 Sep 2008 EP
1326415 Oct 2008 EP
1013054 Feb 2009 EP
1333653 Apr 2009 EP
0983676 Jun 2009 EP
1125208 Apr 2010 EP
1142284 Jul 2010 EP
2380323 Oct 2011 EP
1408678 Nov 2011 EP
1057301 Aug 2013 EP
1131728 Jan 2014 EP
1625460 May 2014 EP
2231120 May 2005 ES
2255657 Jul 2006 ES
2256666 Jul 2006 ES
2257639 Aug 2006 ES
2671252 Jul 1992 FR
2273225 Jun 1994 GB
2306853 May 1997 GB
2315190 Jan 1998 GB
2324627 Oct 1998 GB
2369263 May 2002 GB
61-51247 Mar 1986 JP
62-200956 Sep 1987 JP
63-149955 Jun 1988 JP
64-7460 Jan 1989 JP
64-77265 Mar 1989 JP
02-170756 Jul 1990 JP
02-298154 Dec 1990 JP
03-052443 Mar 1991 JP
03-160865 Jul 1991 JP
03-177144 Aug 1991 JP
04-40723 Feb 1992 JP
4-66858 Jun 1992 JP
04-265049 Sep 1992 JP
4-336742 Nov 1992 JP
04-371056 Dec 1992 JP
06-044157 Feb 1994 JP
06-046150 Feb 1994 JP
06-066830 Mar 1994 JP
06-069988 Mar 1994 JP
06-83771 Mar 1994 JP
06-90292 Mar 1994 JP
06-103058 Apr 1994 JP
06-121051 Apr 1994 JP
06-284203 Jul 1994 JP
06-261129 Sep 1994 JP
06-291877 Oct 1994 JP
06-334748 Dec 1994 JP
07-046321 Feb 1995 JP
07-058851 Mar 1995 JP
07-115471 May 1995 JP
07-170288 Jul 1995 JP
07-170546 Jul 1995 JP
07-212471 Aug 1995 JP
07-262104 Oct 1995 JP
07-319538 Dec 1995 JP
07-336447 Dec 1995 JP
08-46699 Feb 1996 JP
08-056377 Feb 1996 JP
08-163252 Jun 1996 JP
08-181793 Jul 1996 JP
08-504305 Jul 1996 JP
08-214076 Aug 1996 JP
08-214346 Aug 1996 JP
08-510071 Oct 1996 JP
8-321885 Dec 1996 JP
8-329118 Dec 1996 JP
8-331618 Dec 1996 JP
09-036963 Feb 1997 JP
09-501812 Feb 1997 JP
09-504394 Apr 1997 JP
09-149137 Jun 1997 JP
09-163031 Jun 1997 JP
09-224093 Aug 1997 JP
09-508508 Aug 1997 JP
09-233118 Sep 1997 JP
09-265408 Oct 1997 JP
10-11374 Jan 1998 JP
10-13811 Jan 1998 JP
10-51549 Feb 1998 JP
10-093713 Apr 1998 JP
10-093716 Apr 1998 JP
10-504425 Apr 1998 JP
10-116249 May 1998 JP
10-143451 May 1998 JP
10-506766 Jun 1998 JP
10-214113 Aug 1998 JP
10-224477 Aug 1998 JP
10-509847 Sep 1998 JP
10-304073 Nov 1998 JP
10-304074 Nov 1998 JP
10-327258 Dec 1998 JP
10-513632 Dec 1998 JP
11-055741 Feb 1999 JP
11-506292 Jun 1999 JP
11-183189 Jul 1999 JP
11-508430 Jul 1999 JP
11-508715 Jul 1999 JP
11-317817 Nov 1999 JP
11-512906 Nov 1999 JP
11-346266 Dec 1999 JP
2000-011005 Jan 2000 JP
2000-49847 Feb 2000 JP
2000-151819 May 2000 JP
2000-514985 Nov 2000 JP
2000-514986 Nov 2000 JP
2000-516432 Dec 2000 JP
2000-516795 Dec 2000 JP
2000-517142 Dec 2000 JP
2001-500677 Jan 2001 JP
2001-103533 Apr 2001 JP
2001-292236 Oct 2001 JP
2001-516993 Oct 2001 JP
2001-517027 Oct 2001 JP
2001-517029 Oct 2001 JP
2001-517038 Oct 2001 JP
2001-518754 Oct 2001 JP
2001-522201 Nov 2001 JP
2001-523930 Nov 2001 JP
3226929 Nov 2001 JP
2001-524782 Dec 2001 JP
2001-526871 Dec 2001 JP
2002-503903 Feb 2002 JP
2002-503921 Feb 2002 JP
2002-504783 Feb 2002 JP
2002-518890 Jun 2002 JP
2002-519762 Jul 2002 JP
2002-525895 Aug 2002 JP
2002-528824 Sep 2002 JP
2002-529836 Sep 2002 JP
2002-529943 Sep 2002 JP
2002-529944 Sep 2002 JP
2002-529945 Sep 2002 JP
2002-529994 Sep 2002 JP
2002-530010 Sep 2002 JP
2002-534003 Oct 2002 JP
2002-537594 Nov 2002 JP
2003-502720 Jan 2003 JP
2003-507908 Feb 2003 JP
2003-510929 Mar 2003 JP
3384792 Mar 2003 JP
3393119 Apr 2003 JP
2003-516672 May 2003 JP
3453561 Oct 2003 JP
3461488 Oct 2003 JP
3516656 Apr 2004 JP
3516659 Apr 2004 JP
3547142 Jul 2004 JP
3547397 Jul 2004 JP
2004-312730 Nov 2004 JP
2005-504452 Feb 2005 JP
3615708 Feb 2005 JP
3628962 Mar 2005 JP
2005-094780 Apr 2005 JP
2005-102234 Apr 2005 JP
2005-124184 May 2005 JP
3681403 Aug 2005 JP
3681406 Aug 2005 JP
3686087 Aug 2005 JP
3686337 Aug 2005 JP
3735124 Jan 2006 JP
3820151 Sep 2006 JP
2006-295947 Oct 2006 JP
3877523 Feb 2007 JP
4057785 Mar 2008 JP
4205310 Jan 2009 JP
4234926 Mar 2009 JP
4295186 Jul 2009 JP
4450515 Apr 2010 JP
2012-513725 Jun 2012 JP
10-2011-0098841 Sep 2011 KR
9208194 May 1992 WO
9401959 Jan 1994 WO
9429995 Dec 1994 WO
9508236 Mar 1995 WO
9520860 Aug 1995 WO
9533325 Dec 1995 WO
9614704 May 1996 WO
9620553 Jul 1996 WO
9623265 Aug 1996 WO
9627254 Sep 1996 WO
9701917 Jan 1997 WO
9712472 Apr 1997 WO
9713352 Apr 1997 WO
9716014 May 1997 WO
9718662 May 1997 WO
9720424 Jun 1997 WO
9722201 Jun 1997 WO
9723078 Jun 1997 WO
9726749 Jul 1997 WO
9728635 Aug 1997 WO
9729584 Aug 1997 WO
9734401 Sep 1997 WO
9736414 Oct 1997 WO
9737500 Oct 1997 WO
9738389 Oct 1997 WO
9738519 Oct 1997 WO
9750235 Dec 1997 WO
9801987 Jan 1998 WO
9810573 Mar 1998 WO
9813765 Apr 1998 WO
9813974 Apr 1998 WO
9817048 Apr 1998 WO
9827479 Jun 1998 WO
9831130 Jul 1998 WO
9834390 Aug 1998 WO
9835326 Aug 1998 WO
9835509 Aug 1998 WO
9836551 Aug 1998 WO
9837481 Aug 1998 WO
9837677 Aug 1998 WO
9837686 Aug 1998 WO
9837687 Aug 1998 WO
9844699 Oct 1998 WO
9844714 Oct 1998 WO
9848577 Oct 1998 WO
9854877 Dec 1998 WO
9856133 Dec 1998 WO
9856141 Dec 1998 WO
9857501 Dec 1998 WO
9900960 Jan 1999 WO
9900966 Jan 1999 WO
9903247 Jan 1999 WO
9912367 Mar 1999 WO
9913635 Mar 1999 WO
9914919 Mar 1999 WO
9914920 Mar 1999 WO
9914924 Mar 1999 WO
9914951 Mar 1999 WO
9917518 Apr 1999 WO
9923806 May 1999 WO
9923807 May 1999 WO
9926395 May 1999 WO
9926424 May 1999 WO
9927698 Jun 1999 WO
9941720 Aug 1999 WO
9941890 Aug 1999 WO
9941891 Aug 1999 WO
9941895 Aug 1999 WO
9943137 Aug 1999 WO
9925117 Oct 1999 WO
9956227 Nov 1999 WO
9956229 Nov 1999 WO
9965214 Dec 1999 WO
9965252 Dec 1999 WO
9967718 Dec 1999 WO
0007332 Feb 2000 WO
0016203 Mar 2000 WO
0016207 Mar 2000 WO
0016523 Mar 2000 WO
0018094 Mar 2000 WO
0025238 May 2000 WO
0026804 May 2000 WO
0026816 May 2000 WO
0026817 May 2000 WO
0027063 May 2000 WO
0028425 May 2000 WO
0028702 May 2000 WO
0035173 Jun 2000 WO
0038398 Jun 2000 WO
0044159 Jul 2000 WO
0049482 Aug 2000 WO
0049778 Aug 2000 WO
0113606 Feb 2001 WO
0124025 Apr 2001 WO
0140997 Jun 2001 WO
0141372 Jun 2001 WO
0143410 Jun 2001 WO
0152513 Jul 2001 WO
0180214 Oct 2001 WO
0180540 Oct 2001 WO
0184360 Nov 2001 WO
02065741 Aug 2002 WO
03010948 Feb 2003 WO
2004063854 Jul 2004 WO
2005036907 Apr 2005 WO
2006055059 May 2006 WO
2010075151 Jul 2010 WO
Non-Patent Literature Citations (337)
Entry
“Competitive Gateway Product,” Nikkei Communications, Japan, No. 257, Nov. 1997, 18 pages.
“Guide for the Use of Micro-Researcher II/SGR (Scroll Graph Section),” NEC Corporation, Third Edition, Chapters 1 & 5, Jul. 1995, 2 pages.
“Kana: Customer Messaging System,” Kana Communications Sales Brochure, Palo Alto, CA, 1996, 12 pages.
“Latest Trend in CTI,” Nikkei Communications, No. 248, Jun. 16, 1997, 14 pages.
“Method for Automatic Contextual Transposition Upon Receipt of Item of Specified Criteria,” IBM Technical Disclosure Bulletin, vol. 37, No. 28, Feb. 1994, 1 page.
“New Telephone Service Changing Computer Telephone Business,” Nikkei Communications, Nov. 11, 1996, 7 pages.
“Single Line Suffices for Internet Telephone,” Nikkei Communications, May 19, 1997, 9 pages.
“Solution Drivers/CTI, CTI Solution Strategy of Seven Computer Vendors, Toward Market Development of Mainly Bank, Insurance and Communications Markets,” Computopia, Computer Age Co., Ltd., Japan, vol. 33, No. 379, 5 pages, Apr. 1998.
Bachmann, David W. et al., “NetMod: A Design Tool for Large-Scale Heterogeneous Campus Networks,” Center for Information Technology Integration (CITI), The University of Michigan, Ann Arbor, MI, Jun. 15, 1990, 34 pages.
Bangun, H. et al., A Network Architecture for Multiuser Networked Games on Demand, International Conference on Information Communications and Signal Processing, ICICS '97, Sep. 9-12, 1997, 5 pages.
Beck, C. et al., Interactive process of operating system for multimedia communication center, Genesys Telecom Lab, Inc. 2014, 3 pages.
Bernett, Howard et al., “Assessing Web-Enabled Call Center Technologies,” IT Pro, May/Jun. 2001, 7 pages.
Bertsekas, Dimitri et al., “Data Networks,” Prentice-Hall, New Jersey, 1987, 5 pages.
Bickley, M. et al., Using Servers to Enhance Control System Capability, 1999 Particle Accelerator Conference, New York, NY, Mar. 29-Apr. 2, 1999, 3 page.
Bradley, Kirk A. et al., “Detecting Disruptive Routers: A Distributed Network Monitoring Approach,” Department of Computer Science, University of California, Davis, Sep. 1, 1998, 10 pages.
Canadian Office Action for Application No. 2,259,912, dated Nov. 19, 2001, 2 pages.
Canadian Office Action for Application No. 2,289,198, dated Jun. 28, 2002, 2 pages.
Canadian Office Action for Application No. 2,302,397, dated Apr. 23, 2002, 2 pages.
Canadian Office Action for Application No. 2,302,678, dated Apr. 23, 2002, 2 pages.
Canadian Office Action for Application No. 2308590, dated Jun. 28, 2002, 2 pages.
Canadian Office Action for Application No. 2309183, dated Jul. 23, 2002, 2 pages.
Canadian Office Action for Application No. 2320978, dated Jun. 2, 2003, 2 pages.
Canadian Office Action for Application No. 2320978, dated Sep. 26, 2002, 2 pages.
Canadian Office Action for Application No. 2334513, dated May 30, 2003, 2 pages.
Canadian Office Action for Application No. 2347721, dated Aug. 12, 2004, 3 pages.
Canadian Office Action for Application No. 2352973, dated Apr. 17, 2003, 3 pages.
Chan, Kevin F. et al., “Interactive Network Planning and Analysis on a Personal Computer,” Computer Applications in Power, IEEE, vol. 3, No. 1, Jan. 1990, 5 pages.
Chau, Sam et al., “Intelligent Network Routing Using CCS7 and ISDN,” Global Telecommunications Conference, vol. 3, 6 pages, 1990.
Chaudhuri, Surajit et al., “Optimizing Queries over Multimedia Repositories,” Hewlett-Packard Laboratories, Stanford, Mar. 1996, 12 pages.
Chaum, David, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” Communications of the ACM, vol. 24, No. 2, Feb. 1981, 8 pages.
Chew, T.-S. et al., “NETPLAN—a Telecommunications Network Planning Support System,” TENCON '92, IEEE Region 10 International Conference, vol. 2, 7 pages, 1992.
Chinese Office Action for Application No. 200980151937.6, dated Jul. 1, 2013, 14 pages.
Chinese Office Action for Application No. 98812258.8 dated Jul. 26, 2002, 5 pages.
Chinese of Action for Application No. 98812259.6, dated Jan. 10, 2003, 9 pages.
Chinese Office Action for Application No. 98812261.8, dated Jun. 20, 2003, 10 pages.
Chinese Office Action for Application No. 99808531.6, dated Mar. 14, 2003, 14 pages.
Chinese Office Action for Application No. 99811995.4, dated Apr. 8, 2005, 6 pages.
Chinese Office Action for Application No. 99811995.4, dated Jul. 6, 2007, 11 pages.
Chinese Office Action for Application No. 99811996.2, dated May 9, 2003, 10 pages.
Chinese Office action for Patent Application No. 200980151937.6, dated Feb. 15, 2015, 6 pages.
Chinese Office action with English Translation for Application No. 200980151937.6 dated May 23, 2014, 7 pages.
Chiu, H. et al., “Conferencing Metaphor,” IBM Technical Disclosure Bulletin, vol. 36, No. 2, Feb. 1993, 4 pages.
Chou, Sheng-Lin., et al., “Computer Telephony Integration and Its Applications,” IEEE Communications Surveys & Tutorials, vol. 3, No. 1, 2000, 10 pages.
Cordom, Christopher et al., “Conversant VIS Listens and Talks to Your Customers,” AT&T Technology, vol. 9, No. 2, 4 pages, 1994.
Curbera, Francisco et al., “Unraveling the Web Services Web: An Introduction to SOAP, WSDL, and UDDI,” IEEE Internet Computing, 8 pages, Mar./Apr. 2002.
D'Hooge, Herman, “The Communicating PC,” IEEE Communications Magazine, 6 pages, Apr. 1996.
Durinovic-Johri, Sanja et al., “Advanced Routing Solutions for Toll-Free Customers: Algorithm Design and Performance,” Proceedings of the International Teletraffic Congress, ITC-15, 1997, 12 pages.
Eren, P. Erhan, et al., “Interactive Object-Based Analysis and Manipulation of Digital Video,” IEEE Workshop on Multimedia Signal Processing, 1998, 6 pages.
Esesve, D.R., “Wireless Application Protocol (WAP),” Vitam College of Engineering, No Date Available, 16 pages.
European Office action Application No. 04011886.1, dated Mar. 9, 2007, 6 pages.
European Office action for Application No. 00115441.8, dated Feb. 11, 2004, 7 pages.
European Office action for Application No. 00115441.8, dated Mar. 15, 2005, 4 pages.
European Office Action for Application No. 00115441.8, dated May 18, 2006, 11 pages.
European Office Action for Application No. 00119160.0, dated Jan. 16, 2004, 6 pages.
European Office action for Application No. 00123329.5, dated Jun. 17, 2002, 6 pages.
European Office Action for Application No. 00123331.1, dated Apr. 18, 2006, 5 pages.
European Office Action for Application No. 00305049.9, dated Dec. 29, 2003, 5 pages.
European Office Action for Application No. 00908266.0, dated Aug. 10, 2005, 6 pages.
European Office action for Application No. 02400027.5, dated Jan. 21, 2008, 5 pages.
European Office action for Application No. 02756535.7, dated Aug. 5, 2005, 6 pages.
European Office Action for Application No. 03022831.6, dated Nov. 30, 2006, 7 pages.
European Office Action for Application No. 03800376.0, dated Jul. 8, 2008, 6 pages.
European Office Action for Application No. 04009176.1, dated Oct. 12, 2011, 8 pages.
European Office Action for Application No. 97904087.0, dated Jun. 25, 2002, 5 pages.
European Office Action for Application No. 97933327.5, dated Aug. 26, 2002, 4 pages.
European Office Action for Application No. 97933327.5, dated Feb. 7, 2002, 5 pages.
European Office Action for Application No. 98903471.5, dated May 29, 2006, 4 pages.
European Office Action for Application No. 98903471.5, dated Oct. 11, 2004, 6 pages.
European Office Action for Application No. 98908545.1, dated Mar. 15, 2005, 4 pages.
European Office Action for Application No. 98908545.1, dated Nov. 14, 2003, 10 pages.
European Office Action for Application No. 98924821.6, dated Aug. 26, 2003, 4 pages.
European Office Action for Application No. 98926248.0, dated Aug. 5, 2004, 4 pages.
European Office Action for Application No. 98926248.0, dated Dec. 11, 2003, 4 pages.
European Office Action for Application No. 98926248.0, dated Oct. 21, 2002, 6 pages.
European Office Action for Application No. 98944799.0, dated Aug. 18, 2005, 7 pages.
European Office Action for Application No. 98944799.0, dated Mar. 26, 2008, 5 pages.
European Office Action for Application No. 98944830.3, dated Jan. 30, 2006, 9 pages.
European Office Action for Application No. 98946907,7, dated Jun. 1, 2006, 6 pages.
European Office Action for Application No. 98946926.7, dated Dec. 8, 2005, 4 pages.
European Office Action for Application No. 98953947.3, dated Aug. 22, 2006, 6 pages.
European Office Action for Application No. 98953962.2, dated Oct. 28, 2005, 5 pages.
European Office Action for Application No. 98956309.3, dated Jun. 8, 2005, 5 pages.
European Office Action for Application No. 99905907.4, dated Oct. 31, 2005, 4 pages.
European Office Action for Application No. 99906856.2, dated Sep. 24, 2007, 5 pages.
European Office Action for Application No. 99906958,6, dated Feb. 22, 2006, 7 pages.
European Office Action for Application No. 99927333.7, dated Aug. 21, 2006, 9 pages.
European Office Action for Application No. 99927340.2, dated Aug. 9, 2011, 6 pages.
European Office Action for Application No. 99927340.2, dated Nov. 25, 2013, 5 pages.
European Office Action for Application No. 99945479.6, dated Aug. 9, 2006, 6 pages.
European Office Action for Application No. 99945519.9, dated Aug. 20, 2007, 6 pages.
European Office action for Application No. 99956732.4, dated Aug. 17, 2006, 7 pages.
European Office action for Application No. 99956745.6, dated Mar. 14, 2006, 5 pages.
European Office Action for Application No. 99960267.5, dated May 10, 2007, 6 pages.
European Office Action for Application No. 99960279.0, dated Aug. 16, 2005, 6 pages.
European Office Action for Application No. 99965163.1, dated Jul. 13, 2009, 5 pages.
European Search Report and Written Opinion for Application No. 05783002.8, dated Mar. 16, 2009, 8 pages.
European Search Report for 0115441.8 (now EP1075153), dated Nov. 6, 2002, 3 pages.
European Search Report for Application No. 00123329.5, dated Jan. 30, 2002, 2 pages.
European Search Report for Application No. 00123331.1, dated Dec. 5, 2003, 6 pages.
European Search Report for Application No. 00305049.9, dated May 7, 2003, 3 pages.
European Search Report for Application No. 00908266.0, dated May 24, 2005, 3 pages.
European Search Report for Application No. 00913226.7, dated Feb. 14, 2005, 3 pages.
European Search Report for Application No. 0119160.0, dated Apr. 17, 2003, 3 pages.
European Search Report for Application No. 01920248.0, dated May 3, 2004, 3 pages.
European Search Report for Application No. 01927387.9, dated Jun. 2, 2006, 3 pages.
European Search Report for Application No. 02400027.5, dated Feb. 20, 2004, 3 pages.
European Search Report for Application No. 02756535.7, dated May 25, 2005, 4 pages.
European Search Report for Application No. 03002575.3, dated Jun. 4, 2003, 3 pages.
European Search Report for Application No. 03008532.8, dated Dec. 27, 2004, 3 pages.
European Search Report for Application No. 03008534.4, dated Jul. 23, 2003, 3 pages.
European Search Report for Application No. 03022831.6, dated Mar. 22, 2006, 3 pages.
European Search Report for Application No. 03023463.7, dated Jun. 14, 2004, 3 pages.
European Search Report for Application No. 03076826.1, dated Sep. 10, 2003, 3 pages.
European Search Report for Application No. 03077174.5, dated Sep. 4, 2003, 4 pages.
European Search Report for Application No. 03077712.2, dated Mar. 29, 2004, 3 pages.
European Search Report for Application No. 03800376, dated May 7, 2007, 3 pages.
European Search Report for Application No. 04007911.3, dated Aug. 17, 2004, 5 pages.
European Search Report for Application No. 04007913.9, dated Aug. 5, 2004, 4 pages.
European Search Report for Application No. 04011886.1, dated Jun. 22, 2006, 5 pages.
European Search Report for Application No. 07018035.1, dated Apr. 23, 2009, 4 pages.
European Search Report for Application No. 97904087.0, dated Nov. 5, 2001, 3 pages.
European Search Report for Application No. 97933327.5, dated Oct. 11, 2001, 3 pages.
European Search Report for Application No. 98903471.5, dated Jul. 26, 2002, 4 pages.
European Search Report for Application No. 98903623.1, dated Apr. 17, 2002, 3 pages.
European Search Report for Application No. 98907371.3, dated Mar. 28, 2002, 3 pages.
European Search Report for Application No. 98924821.6, dated Jun. 13, 2002, 2 pages.
European Search Report for Application No. 98926248, dated Jul. 18, 2002, 3 pages.
European Search Report for Application No. 98944799.0, dated Aug. 5, 2004, 3 pages.
European Search Report for Application No. 98944830.3, dated Aug. 11, 2004, 3 pages.
European Search Report for Application No. 98946907.7, dated Aug. 11, 2004, 3 pages.
European Search Report for Application No. 98946926.7, dated Aug. 11, 2004, 3 pages.
European Search Report for Application No. 98948163.5, dated Aug. 8, 2000, 3 pages.
European Search Report for Application No. 98948164.3, dated Jun. 15, 2004, 3 pages.
European Search Report for Application No. 98953947.3, dated Aug. 20, 2004, 3 pages.
European Search Report for Application No. 98953962.2, dated Sep. 2, 2004, 3 pages.
European Search Report for Application No. 98956187.3, dated Sep. 16, 2005, 3 pages.
European Search Report for Application No. 98956309.3, dated Sep. 10, 2004, 3 pages.
European Search Report for Application No. 99905907.4, dated Jun. 1, 2005, 3 pages.
European Search Report for Application No. 99906856.2, dated Oct. 4, 2006, 3 pages.
European Search Report for Application No. 99906958.6, dated Aug. 19, 2005, 3 pages.
European Search Report for Application No. 99927333.7, dated Mar. 30, 2005, 5 pages.
European Search Report for Application No. 99927340.2, dated Oct. 18, 2004, 3 pages.
European Search Report for Application No. 99945479.6, dated Mar. 24, 2006, 3 pages.
European Search Report for Application No. 99945519.9, dated Oct. 18, 2005, 3 pages.
European Search Report for Application No. 99945556.1, dated Nov. 16, 2004, 3 pages.
European Search Report for Application No. 99956732,4, dated Apr. 19, 2006, 4 pages.
European Search Report for Application No. 99956745.6, dated Jun. 30, 2005, 3 pages.
European Search Report for Application No. 99960267.5, dated Jul. 14, 2005, 3 pages.
European Search Report for Application No. 99960279.0, dated Apr. 26, 2005, 3 pages.
European Search Report for Application No. 99965163.1, dated Nov. 19, 2004, 4 pages.
European Search Report for Application No. 99971602.0, dated Feb. 6, 2007, 3 pages.
Festa, Paul, “Vignette Updates StoryServer Platform,” CNET News.com, Sep. 16, 1997, 4 pages.
Foster, Robin Harris, “Advanced DEFINITY Call Centers: Working for You and Your Customers,” AT&T Technology, vol. 9, No. 2, 1994, 6 pages.
Francis, Paul et al., “Flexible Routing and Addressing for a Next Generation IP,” SIGCOMM, 10 pages, 1994.
Gawrys, G.W., et al., “ISDN: Integrated Network/Premises Solutions for Customer Needs,” ICC, 6 pages, 1986.
Gechter, J. et al., “ISDN Service Opportunities in the Intelligent Network,” Proceedings of the National Communications Forum, Chicago, IL, vol. 43, No. 1, Oct. 1989, 4 pages.
Harvey, Dean E. et al., “Call Center Solutions,” AT&T Technical Journal, vol. 70, No. 5, 10 pages, Sep./Oct. 1991.
Held, Gilbert, “Voice Over Data Networks,” McGraw Hill, Texas, 1998, 16 pages.
Henderson, Shane G. et al., “Rostering by Interating Integer Programming and Simulation,” Proceedings of the 1998 Winter Simulation Conference, Washington D.C., Dec. 13, 1998, 7 pages.
Hofmann, Peter, et al., “@INGate: Integrating Telephony and Internet,” IEEE Conference on Protocols for Multimedia Systems, 4 pages, Nov. 1997.
House, Eric, “How to Munge Outgoing From: Field When Using Mail?,” Google Discussion Group, Apr. 2, 1997, 1 page.
Hu, Michael Junke et al., “An Object-Relational Database System for the Interactive Multimedia,” IEEE International Conference on Intelligent Processing Systems, pp. 1571-1575, Oct. 1997.
International Preliminary Examination Report for PCT/US01/13313, dated Apr. 22, 2002, 4 pages.
International Preliminary Examination Report for PCT/US01/40267, dated Dec. 9, 2002, 4 pages.
International Preliminary Examination Report for PCT/US96/16919, dated Feb. 18, 1998, 18 pages.
International Preliminary Examination Report for PCT/US97/01469, dated Oct. 14, 1998, 8 pages.
International Preliminary Examination Report for PCT/US97/11881, dated Mar. 27, 1998, 3 pages.
International Preliminary Examination Report for PCT/US98/00631, dated Sep. 10, 1999, 7 pages.
International Preliminary Examination Report for PCT/US98/02847, dated Jul. 9, 1999, 5 pages.
International Preliminary Examination Report for PCT/US98/13644, dated Jan. 12, 2000, 6 pages.
international Preliminary Examination Report for PCT/US98/18646, dated Oct. 30, 2000, 5 pages.
International Preliminary Examination Report for PCT/US98/18789, dated Dec. 30, 1999, 6 pages.
International Preliminary Examination Report for PCT/US98/22527, dated Jun. 30, 2000, 5 pages.
International Preliminary Examination Report for PCT/US99/12841, dated Jan. 22, 2001, 5 pages.
International Preliminary Examination Report for PCT/US99/25308, dated Sep. 10, 2000, 3 pages.
International Preliminary Examination Report for PCT/U599/25309, dated May 8, 2001, 4 pages.
International Preliminary Report on Patentability for PCT/US2005/027544, dated May 22, 2007, 7 pages.
International Search Report and Written Opinion for PCT/US2009/068402, dated Mar. 31, 2010, 10 pages.
International Search Report for PCT/US00/00781, dated Apr. 12, 2000, 2 pages.
International Search Report for PCT/US00/00785, dated Oct. 2, 2000, 2 pages.
International Search Report for PCT/US00/023066, dated Oct. 30, 2000, 1 page.
International Search Report for PCT/US00/27982, dated Jan. 31, 2001, 3 pages.
International Search Report for PCT/US00/27983, dated Mar. 19, 2001, 2 pages.
International Search Report for PCT/US00/27984, dated Mar. 22, 2001, 1 page.
International Search Report for PCT/US01/07457, dated Aug. 30, 2001, 1 page.
International Search Report for PCT/US01/13313, dated Jul. 6, 2001, 1 page.
International Search Report for PCT/US01/40267, dated Jul. 17, 2001, 1 page.
International Search Report for PCT/US02/23080, dated Oct. 1, 2002, 1 page.
International Search Report for PCT/US03/41677, dated Apr. 10, 2006, 1 page.
International Search Report for PCT/US05/27544, dated Jun. 14, 2006, 1 page.
International Search Report for PCT/US96/16919, dated Jun. 2, 1997, 3 pages.
International Search Report for PCT/US97/01469, dated Apr. 14, 1997, 1 page.
International Search Report for PCT/US97/05457, dated Jun. 24, 1997, 2 pages.
International Search Report for PCT/US97/11881, dated Oct. 24, 1997, 1 page.
International Search Report for PCT/US98/00631, dated Jun. 18, 1998, 1 page.
International Search Report for PCT/US98/01158, dated Jul. 17, 1998, 1 page.
International Search Report for PCT/US98/02152, dated Jun. 25, 1998, 1 page.
International Search Report for PCT/US98/02847, dated Aug. 6, 1998, 1 page.
International Search Report for PCT/US98/02848, dated Aug. 11, 1998, 1 page.
International Search Report for PCT/US98/02923, dated Aug. 19, 1998, 1 page.
International Search Report for PCT/US98/06334, dated Sep. 1, 1998, 2 pages.
International Search Report for PCT/US98/10357, dated Jan. 14, 1999, 1 page.
International Search Report for PCT/US98/11442, dated Oct. 21, 1998, 2 pages.
International Search Report for PCT/US98/13644, dated Apr. 21, 1999, 2 pages.
International Search Report for PCT/US98/18646, dated Jan. 29, 1999, 2 pages.
International Search Report for PCT/US98/18789, dated Jan. 29, 1999, 3 pages.
International Search Report for PCT/US98/18833, dated Nov. 19, 1998, 1 page.
International Search Report for PCT/US98/18874, dated Jan. 29, 1999, 1 page.
International Search Report for PCT/US98/18989, dated Jan. 25, 1999, 1 page.
International Search Report for PCT/US98/22527, dated Apr. 2, 1999, 2 pages.
International Search Report for PCT/US98/22555, mailed Mar. 3, 1999, 1 page.
International Search Report for PCT/US98/22600, mailed Jun. 4, 1999, 1 page.
International Search Report for PCT/US98/22935, mailed Apr. 14, 1999, 1 page.
International Search Report for PCT/US99/02812, mailed May 11, 1999, 1 page.
International Search Report for PCT/US99/02814, mailed Jun. 17, 1999, 1 page.
International Search Report for PCT/US99/02822, mailed Aug. 18, 1999, 1 page.
International Search Report for PCT/US99/03038, mailed Apr. 23, 1999, 1 page.
International Search Report for PCT/US99/03039, mailed May 11, 1999, 1 page.
International Search Report for PCT/US99/12700, mailed Nov. 30, 1999, 1 page.
International Search Report for PCT/US99/12781, mailed Sep. 9, 1999, 2 pages.
International Search Report for PCT/US99/12841, mailed Sep. 10, 1999, 2 pages.
International Search Report for PCT/US99/20259, dated Feb. 15, 2000, 1 page.
International Search Report for PCT/US99/20387, dated Dec. 7, 1999, 2 pages.
International Search Report for PCT/US99/20461, dated Dec. 23, 1999, 2 pages.
International Search Report for PCT/US99/25117, dated Nov. 1, 2000, 2 pages.
International Search Report for PCT/US99/25265, dated Feb. 18, 2000, 1 page.
International Search Report for PCT/US99/25308, dated Feb. 3, 2000, 1 page.
International Search Report for PCT/US99/25309, dated Feb. 10, 2000, 1 page.
International Search Report for PCT/US99/25310, dated Feb. 10, 2000, 1 page.
International Search Report for PCT/US99/26619, dated Mar. 17, 2000, 1 page.
International Search Report for PCT/US99/26659, dated Feb. 4, 2000, 1 page.
International Search Report for PCT/US99/29043, dated Mar. 20, 2000, 1 page.
International Search Report for PCT/US99/29044, dated May 11, 2000, 1 page.
International Written Opinion for PCT/US98/22527, mailed Dec. 27, 1999, 5 pages.
Japanese Interrogation and Re-Examination Report for Application No. 1999-502827, mailed Oct. 26, 2004, 7 pages.
Japanese Office Action for Application No. 1997-527811, mailed Oct. 10, 2000, 6 pages.
Japanese Office Action for Application No. 1998-505335, mailed Mar. 5, 2002, 7 pages.
Japanese Office Action for Application No. 1998-531244, mailed Jan. 6, 2004, 4 pages.
Japanese Office Action for Application No. 1998-531244, mailed Sep. 10, 2002, 5 pages.
Japanese Office Action for Application No. 1998-536740, mailed Feb. 24, 2004, 5 pages.
Japanese Office Action for Application No. 1998-536740, mailed Sep. 3, 2002, 14 pages.
Japanese Office Action for Application No. 1999-500765, mailed Feb. 10, 2004, 6 pages.
Japanese Office Action for Application No. 1999-500765, mailed Sep. 3, 2002, 11 pages.
Japanese Office Action for Application No. 1999-502827, mailed Dec. 3, 2002, 4 pages.
Japanese Office Action for Application No. 1999-502827, mailed May 28, 2002, 3 pages.
Japanese Office Action for Application No. 1999-502827, mailed Nov. 1, 2005, 8 pages.
Japanese Office action for Application No. 2000-220082, mailed on Apr. 1, 2003, 3 pages.
Japanese Office Action for Application No. 2000-511299, mailed Feb. 3, 2004, 4 pages.
Japanese Office Action for Application No. 2000-511299, mailed May 16, 2006, 7 pages.
Japanese Office Action for Application No. 2000-512333, mailed Sep. 3, 2002, 6 pages.
Japanese Office Action for Application No. 2000-512334, mailed Sep. 10, 2002, 9 pages.
Japanese Office Action for Application No. 2000-512336, mailed Jul. 23, 2002, 8 pages.
Japanese Office Action for Application No. 2000-512336, mailed Jun. 24, 2003, 4 pages.
Japanese Office Action for Application No. 2000-514448, mailed Sep. 3, 2002, 10 pages.
Japanese Office Action for Application No. 2000-519541, dated May 16, 2005, 4 pages.
Japanese Office Action for Application No. 2000-519541, mailed Aug. 20, 2002, 10 pages.
Japanese Office Action for Application No. 2000-519541, mailed Dec. 2, 2003, 7 pages.
Japanese Office Action for Application No. 2000-519541, mailed Mar. 14, 2006, 6 pages.
Japanese Office Action for Application No. 2000-522718, mailed Sep. 10, 2002, 9 pages.
Japanese Office Action for Application No. 2000-531822, mailed Sep. 24, 2002, 6 pages.
Japanese Office Action for Application No. 2000-531940, mailed Dec. 3, 2002, 4 pages.
Japanese Office Action for Application No. 2000-532958, mailed Aug. 20, 2002, 7 pages.
Japanese Office Action for Application No. 2000-554115, dated Apr. 27, 2005, 5 pages.
Japanese Office Action for Application No. 2000-554115, mailed Jan. 6, 2004, 4 pages.
Japanese Office Action for Application No. 2000-554115, mailed Oct. 1, 2002, 5 pages.
Japanese Office Action for Application No. 2000-556311, mailed Oct. 21, 2003, 6 pages.
Japanese Office Action for Application No. 2000-570673, dated Oct. 4, 2005, 4 pages.
Japanese Office Action for Application No. 2000-570673, mailed Mar. 8, 2005, 6 pages.
Japanese Office Action for Application No. 2000-570673, mailed Oct. 14, 2003, 6 pages.
Japanese Office Action for Application No. 2000-570677, mailed May 11, 2004, 8 pages.
Japanese Office Action for Application No. 2000-570677, mailed Nov. 30, 2004, 10 pages.
Japanese Office Action for Application No. 2000-570941, mailed Oct. 7, 2003, 6 pages.
Japanese Office Action for Application No. 2000-578753, mailed May 11, 2004, 11 pages.
Japanese Office Action for Application No. 2000-580124, mailed Apr. 12, 2005, 6 pages.
Japanese Office Action for Application No. 2000-580124, mailed Oct. 7, 2003, 5 pages.
Japanese Office Action for Application No. 2000-580329, mailed Feb. 15, 2005, 8 pages.
Japanese Office Action for Application No. 2000-580329, mailed May 13, 2008, 8 pages.
Japanese Office Action for Application No. 2000-580329, mailed Oct. 4, 2005, 5 pages.
Japanese Office Action for Application No. 2000-581781, mailed Feb. 3, 2004, 4 pages.
Japanese Office Action for Application No. 2000-581781, mailed Oct. 8, 2002, 4 pages.
Japanese Office Action for Application No. 2000-590363, mailed Apr. 1, 2003, 6 pages.
Japanese Office Action for Application No. 2001-526724, mailed Aug. 1, 2006, 5 pages.
Japanese Office Action for Application No. 2001-526724, mailed Dec. 13, 2005, 5 pages.
Japanese Office Action for Application No. 2001-526724, mailed May 17, 2005, 4 pages.
Japanese Office Action for Application No. 2006-127262, mailed Jun. 1, 2010 (5 pages).
Japanese Office Action for Application No. 2006-127262, mailed Nov. 18, 2008 (7 pages).
Japanese Office Action for Application No. 2011-543586, mailed Jan. 24, 2013, 5 pages.
Japanese Office Action for Application No. 532950, dated Dec. 17, 2002, 6 pages.
Katz, Michael, “When CTI Meets the Internet” Telecommunications, vol. 31, No. 7, Jul. 1997, 6 pages.
Kaufman, Harvey, “Call Centers in Cyberspace,” Communications News, vol. 34, Issue 7, Jul. 1997, 4 pages.
Kaukonen, S., et al., “Agent-Based Conferencing Using Mobile IP-Telephony,” Proceedings of Multimedia Signal Processing, 1999, 6 pages.
Korean Office Action for Application No. 10-2011-7016735, dated Jun. 13, 2013, 3 pages.
Korean Office Action for Application No. 10-2011-7017067, dated Aug. 21, 2012, 9 pages.
Kramer, Brian, “How to Send a File to the Sender of a Message?,” Google Discussion Group, May 27, 1994, 5 pages.
Lee, Chien-I, et al., “A New Storage and Retrieval Method to Support Editing Operations in a Multi-Disk-based Video Server,” Fourth International Conference on Parallel and Distributed Information Systems, IEEE, Miami Beach, FL, Dec. 1996, 10 pages.
Lin, Yi-Bing et al., “A Flexible Graphical User Interface for Performance Modeling,” Software—Practice and Experience, vol. 25(2), Feb. 1995, 24 pages.
Low, Colin, “The Internet Telephony Red Herring,” Global Telecommunications Conference, May 1996, 9 pages.
Mackay, Wendy E., et al., “Virtual Video Editing in Interactive Multimedia Applications,” Communications of the ACM, vol. 32, No. 7, Jul. 1989, 9 pages.
Malabocchia, Fabio, et al., “Mining Telecommunications Data Bases: An Approach to Support the Business Management,” Network Operations and Management Symposium, IEEE, vol. 1, Feb. 1998, 9 pages.
Masashi, Tsuboi et al., “Computer Telephony Integration System,” CTSTAGE, Oki Electric Research and Development, 174, vol. 64, No. 2, Apr. 1, 1997, 10 pages.
Matsumoto, Akihiko, “Bank CTI/Call Center Using Up Customer Information, Analysis of Six Major Manufacturers' Solutions,” Network Computing, Ric Telecom Corporation, Japan, vol. 10, No. 10, Oct. 1, 1998, 13 pages.
Matsuo, Yasunori, “Microsoft Project for Windows 95,” Nikkei Personal Computing, Nikkei Business Publications, Inc., No. 255, Dec. 18, 1995, 2 pages.
Mattison, Rob, “Data Warehousing and Data Mining for Telecommunications,” Artech House, Boston, 1997, 7 pages.
Metz, Christopher, “IP Routers: New Tool for Gigabit Networking,” On the Wire, IEEE Internet, Nov./Dec. 1998, 5 pages.
Microsoft Dictionary Pages, Microsoft Press, Redmond, WA, 1991, 2 pages.
Monson-Haefel, Richard, “Enterprise JavaBeans,” O'Reilly & Assoc., 2nd Ed., 1999, 7 pages.
Murayama, Hideki, “Integrated Customer Supporting System View Workshop/CS, OA Business Personal Computer,” NEC Business System, Denpa Press Co., Ltd., vol. 15, No. 12, Dec. 1997, 6 pages.
Nariani, Sushil, “Internet Telephony,” Whatis.com, Oct. 25, 1999, 2 pages.
Newton's Telecom Dictionary, The Official Dictionary of Telcommunications & the Internet, 16th Edition, Telecom Books, Feb. 2000, 3 pages.
Newton, Harry, “Newton's Telecom Dictionary,” Flatiron Publishing, New York, 1994, 7 pages.
Orozco-Barbosa, Luis et al., “Design and Performance Evaluation of Intelligent Multimedia Services,” Computer Communications, vol. 20, 1997, 14 pages.
Padmanabhan, M., et al. Speech Recognition Performance on a Voicemail Transcription Task, IBM T.J. Watson Research Center, Yorktown Height, NY, 4 pages.
Rangan, P. Venkat, et al., “A Window-Based Editor for Digital Video and Audio,” Proceedings of the 25th Hawaii International Conference on System Sciences, IEEE, vol. 2, Jan. 1992, 9 pages.
Recker, Mimi M. et al., “Predicting Document Access in Large, Multimedia Repositories,” ACM Transactions on Computer-Human Interaction, vol. 3, 1994, 23 pages.
Rodriguez-Martinez, Manuel et al., “MOCHA: A Self-Extensible Database Middleware System for Distributed Data Sources,” International Conference on Management Data—SIGMOD, 2000, 12 pages.
Rosenberg, Arthur M., “Call Center Computer Telephony: Technology Overview,” Gartner, Inc., Jan. 1998 (24 pages).
Schmandt, Chris, “Phoneshell: The Telephone as Computer Terminal,” Proceedings of ACM Multimedia Conference, 1993, 10 pages.
Sekine, Shoji et al., “Front Office Oriented Solution for Customer Satisfaction and Profit Expansion,” Hitachi Hyoron Co, Ltd., Japan, vol. 80, No. 9, Sep. 1998, 11 pages.
Semilof, Margie, “Call Centers Go On-Line,” Communications Week, No Date Available, 2 pages.
Sevcik, Peter et al., “The Call Center Revolution,” Northeast Consulting Technical Paper, Jan. 1, 1997, 12 pages.
Smith, J.D., An Overview to Computer-Telecommunications Integration (CTI), Telecommunications, Conference Publication No. 404, IEEE, Mar. 26-29, 1995, 5 pages.
Sulkin, Allan, Building the ACD-LAN Connection, Business Communications Review, Jun. 1996, 4 pages.
Supplemental European Search Report for Application No. 98908545.1, dated Sep. 5, 2002, 4 pages.
Szlam, Aleksander et al., “Predictive Dialing Fundamentals,” Flatiron Publishing, New York, 1996, 28 pages.
Tadamura, Katsumi et al., “Synchronizing Computer Graphics Animation and Audio,” IEEE, 1998, 11 pages.
Taisei, Mori et al., “Call Center: Promotion of Information Use with a Direct Link to Core Business with Eye on the Internet Customer,” Ric Telecom Corporation, Japan, vol. 10, No. 8, Aug. 1, 1998, 9 pages.
Tang, Jingrong et al., “Advanced Service Architecture for H.323 Internet Protocol Telephony,” Computer Communications, vol. 23, 2000, 14 pages.
Thio, Fu Wang et al., “Distributed Multimedia Database: A Design and Application Study,” The Fourth International Conference on High Performance Computing in the Asia-Pacific Region, IEEE, Beijing, China, vol. 2, May 2000, 6 pages.
Toji, Ryutaro et al., “A Study of Customer Contact Operation System and Functions,” Proceedings of the IECE General Conference, Comm. 2, Mar. 6, 1997, 3 pages.
Toji, Ryutaro et al., “OCN Multimedia Customer Contact System,” NTT Technical Journal, The Telecommunication Association, Japan, vol. 10, No. 1, Jan. 1, 1998, 6 pages.
Tsunemasa, Mizuo., “CTI World 2: World of CTI,” Business Communication, vol. 34, No. 2, Feb. 1, 1997, 13 pages.
Van Zijl, Lynette, et al., “A Tool for Graphical Network Modeling and Analysis,” IEEE Software, Jan. 1992, 8 pages.
Vazquez, E., et al., Graphical Interface for Communication Network Analysis and Simulation, Department of Telematic Engineering, Technical University of Madrid, IEE, 1991, Spain, 4 pages.
Wagner, Susanne., “Intralingual Speech-to-Text Conversion in Real-Time: Challenges and Opportunities,” Challenges of Multidimensional Translation Conference Proceedings, 2005, 10 pages.
Wang, Yong et al, “Real-time scheduling for multi-agent call center automation”, Information service agents lab, school of computing science Simon Fraser University, Burnaby,BC Canada, 1999, 13 pages.
Wolter, Roger., “XML Web Services Basics,” Microsoft Corporation, Dec. 2001, 4 pages.
Zenel, Bruce et al., Intelligent Communication Filtering for Limited Bandwidth Environments, Computer Science Department, Columnia University, IEEE, 1995, 7 pages.
Related Publications (1)
Number Date Country
20110182418 A1 Jul 2011 US
Provisional Applications (1)
Number Date Country
60267294 Feb 2001 US
Continuations (1)
Number Date Country
Parent 11317105 Dec 2005 US
Child 13045220 US
Continuation in Parts (2)
Number Date Country
Parent 09827608 Apr 2001 US
Child 11317105 US
Parent 09024923 Feb 1998 US
Child 09827608 US