US 7,216,348 B1Grant
Method and apparatus for dynamically balancing call flow workloads in a telecommunications system
Issue Date:2007-05-08
•19 Claims
•6 Drawing Sheets
Abstract
A call flow server is disclosed that processes call flow events from a plurality of gateways bridging between traditional circuit-switched networks and packet-switched networks. The call flow server server, which may be implemented with either a single processor or multi-processor design, includes call flow engine and call flow thread manager modules capable of managing a plurality of call flow events by distributing the call flow scripts associated with such events among a plurality of threads executing on the call flow server. Each call flow event in the form of a call flow script is processed on a single thread within a selected processor. Processing each call flow script on a single thread fully utilizes the processor resources and ensures that a call flow script need not be blocked while another call flow script is running. The call flow server includes a thread manager to direct a given call flow script to a thread that has excess capacity.
Metadata
Assignee
- Net2Phone, Inc.
Inventor
- Linden A. deCarmo
Application Information
Application Number:US 09/477,101
Filing Date:2000-01-04
Priority Date:1999-01-05
Art Unit:2195
Classifications
IPC:
G06F9/46G06F9/54H04Q7/20
Patent Drawings (6 sheets)
Description
Related Applications
[0001] This application claims priority to U.S. Provisional Patent Application Ser. No. 60/114,751, filed Jan. 5, 1999, and entitled “SCALABLE CALL FLOW APPARATUS THAT DYNAMICALLY BALANCES WORKLOADS” by Linden A. deCarmo.
[0002] In addition, this application incorporates by this reference the subject matter of a U.S. utility patent application entitled “METHOD FOR DESIGNING OBJECT-ORIENTED TABLE DRIVEN STATE MACHINES”, U.S. patent application Ser. No. 09/477,435, issued as U.S. Pat. No. 6,463,565, by Keith C. Kelly, Mark Pietras and Michael Kelly, commonly assigned and filed on an even date herewith.
Field of the Invention
[0003] This invention relates, generally, to telecommunication systems, and, more specifically, to a technique for managing call flows within a telecommunications system.
Background of the Invention
[0004] Two fundamentally different switching technologies exist that enable communications. The first type, circuit-switched networks, operate by establishing a dedicated connection or circuit between two points, similar to public switched telephone networks (PSTN). A telephone call causes a circuit to be established from the originating phone through the local switching office across trunk lines, to a remote switching office and finally to the intended destination telephone. While such circuit is in place, the call is guaranteed a data path for digitized or analog voice signals regardless of other network activity. The second type, packet-switched networks, typically connect computers and establish an asynchronous “virtual” channel between two points. In a packet-switched network, data, such as a voice signal, is divided into small pieces called packets which are then multiplexed onto high capacity connections for transmission. Network hardware delivers packets to specific destinations where the packets are reassembled into the original data set. With packet-switched networks, multiple communications among different computers can proceed concurrently with the network connections shared by different pairs of computers concurrently communicating. Packet-switched networks are, however, sensitive to network capacity. If the network becomes overloaded, there is no guarantee that data will be timely delivered. Despite this drawback, packet-switched networks have become quite popular, particularly as part of the Internet and Intranets, due to their cost effectiveness and performance.
[0005] In a packet-switched data network one or more common network protocols hide the technological differences between individual portions of the network, making interconnection between portions of the network independent of the underlying hardware and/or software. A popular network protocol, the Transmission Control Protocol/Internet Protocol (TCP/IP) is utilized by the Internet and Intranets. Intranets are private networks such as Local Area Networks (LANs) and Wide Area Networks (WAN). The TCP/IP protocol utilizes universal addressing as well as a software protocol to map the universal addresses into low level machine addresses. For purposes of this discussion, networks which adhere to the TCP/IP protocol will be referred to hereinafter “IP-based” or as utilizing “IP addresses” or “Internet Protocol address”.
[0006] It is desirable for communications originating from an IP-based network to terminate at equipment in a PSTN network, and vice versa, or for calls which originate and terminate on a PSTN network to utilize a packet-switched data network as an interim communication medium. Problems arise, however, when a user on an IP-based or other packet switched data network tries to establish a communication link beyond the perimeter of the network, due to the disparity in addressing techniques among other differences used by the two types of networks.
[0007] To address the problems of network disparity, telecommunication gateways have been developed to allow calls originating from an IP-based network to terminate at equipment in a PSTN network, and vice versa, or for calls which originate and terminate on a PSTN network to utilize a packet-switched data network as an interim communication medium. Gateway, such as the NetSpeak Model Nos. WGX-MD/24, a 24-port digital T-1 IP telephony gateway, or WGX-M/16, a 16-port analog IP telephony gateway, both commercially available from NetSpeak Corporation, Boca Raton, Fla., have a plurality of ports through which calls are handled.
[0008] Unlike traditional Public Branch Exchanges (PBXs), which merely processed the establishment of a call from one location to another, current telecommunication systems are expected to provide many types of optional services, such as call forwarding, call messaging, call waiting, and data entry, all transparently to the caller. In order to process these various functions, the gateways must be able to process the voice data stream and the call events associated with the call. Call events comprise any action related to a call, e.g. off-hook, on-hook, etc. However, it is desirable for gateway architectures to remain relatively rudimentary, performing only the handling of the data stream. Processing of the call events may be handled by a special server, referred to hereafter as a call flow server. In this manner the telecommunication systems may be updated to handle new types of call events by updating only the call flow server, instead of multiple gateways. Accordingly, gateways forward call events associated with a particular data stream to the call flow server and receive instructions from the call flow server as to how to handle or direct the data stream representing a call.
[0009] The call flow server uses algorithms known as “call flows” to handle one or more call events. A call flow typically comprises a series of instructions that control how one or more call events are processed. Such call flows are typically written in state tables, but may also be written in JAVA or any other type of computing language proprietary or not. Call flows are state machine operations that are managed on threads executing on a processor. However, the assignment of call flows to threads can cause problems.
[0010] In one technique, all call flow scripts are processed on a single thread. This solution is optimal for a single processor environment. However, this solution is not scalable as additional processing resources are added (i.e. the extra processors are ignored). In addition, a processor intensive call flow will block all other call flows from running (i.e. it is single tasking). In another technique, each call flow script is processed on a separate thread. This technique fully utilizes processor resources on multi-processor machines and ensures that a script is never blocked because another script is running. However, it has the following disadvantages: 1) excessive context switches dramatically degrade performance on single processor machines; 2) a single thread per call flow is not realistic for large call flow environments that may process tens of thousands of calls simultaneously; and 3) call flows cannot be spread among multiple threads since one must ensure that events are received in the order they were sent and this cannot be guaranteed across threads.
[0011] Accordingly, there is a need for a method and apparatus that can adjust the call flow load within a single processor or multi-processor environment such that processing of threads associated with the call flows is optimized.
[0012] There is a further need for a method and apparatus for a flexible thread manager that has the performance of the single-threaded solution on a single processor system, but which scales intelligently when processors are added.
Summary of the Invention
[0013] According to the present invention, a call flow server is disclosed that processes call flow events from a plurality of gateways bridging between traditional circuit-switched networks and packet-switched networks. The call flow server server, which may be implemented with either a single processor or multi-processor design, includes call flow engine and call flow thread manager modules capable of managing a plurality of call flow events by distributing the call flow scripts associated with such events among a plurality of threads executing on the call flow server. Each call flow event in the form of a call flow script is processed on a single thread within a selected processor. Processing each call flow script on a single thread fully utilizes the processor resources and ensures that a call flow script need not be blocked while another call flow script is running. The call flow server includes a thread manager to direct a given call flow script to a thread that has excess capacity.
[0014] According to one aspect of the present invention, a method is disclosed for distributing the call flow events among the plurality of threads executing within a telecommunications server. This method is performed to increase call flow event processing efficiency and comprise the steps of: determining a call flow workload level for each of the plurality of threads; determining whether one of the plurality of threads is inefficiently handling its assigned call flow workload; and assigning call flow events from the inefficient thread to a second thread with excess call flow event handling capacity. The method may be further refined to include the steps of processing the call flow events within each of the plurality of threads or repeating selected steps until a balanced call flow event processing level is attained among the active threads.
[0015] According to another aspect of the present, a computer program product for use with a computer system may be implemented that includes program code for implementing the method steps described above. The computer program product may be distributed in the form of a computer useable medium such as a floppy disk, a CD-ROM disk, pre-installed on a hard disk storage drive of the communications server, or any other type of medium used to store data or program code for loading within a computer system, or, alternatively transmitted or propagated as part of a computer usable signal.
[0016] According to yet another aspect of the present invention, in a computer system, an apparatus for distributing call flow events among a plurality of threads, each thread having an associated call flow event queue in which call flow events queued, the apparatus comprises: a call flow engine configured execute call flow events associated with one of the threads; a call flow manager configured to distribute a plurality of call flow events among a plurality of threads used for managing the processing of plurality of call flows, n the call flow manager optimizing the processing of the call flows by determining which plurality of threads are operating inefficiently and reassigning a portion of the call flow events assigned to the inefficient thread to other of the plurality of threads having excess call flow processing capacity.
Brief Description of the Drawings
[0017] FIG. 1 is a block diagram of a computer system suitable for use with the present invention;
[0018] FIG. 2 is a conceptual illustration of a communications network environment in which the present invention may be utilized;
[0019] FIG. 3 is a schematic diagram of a call flow server server in accordance with the present invention;
[0020] FIGS. 4A–B illustrate a schematic diagram of call flow queues, threads, and the reallocation of call flow events from one thread to another in accordance with the present invention; and
[0021] FIG. 5 is a flow chart depicting the method for allocating thread resources in accordance with the present invention.
Detailed Description
[0022] FIG. 1 illustrates the system architecture for a computer system 100, such as an IBM PS/2® computer on which the invention can be implemented. The exemplary computer system of FIG. 1 is for descriptive purposes only. Although the description below may refer to terms commonly used in describing particular computer systems, such as an IBM PS/2 computer, the description and concepts equally apply to other systems, including systems having architectures dissimilar to FIG. 1 .
[0023] The computer system 100 includes a central processing unit (CPU) 105, which may include a conventional microprocessor, a random access memory (RAM) 110 for temporary storage of information, and a read only memory (ROM) 115 for permanent storage of information. A memory controller 120 is provided for controlling system RAM 110. A bus controller 125 is provided for controlling bus 130, and an interrupt controller 135 is used for receiving and processing various interrupt signals from the other system components. Mass storage may be provided by diskette 142, CD ROM 147 or hard drive 152. Data and software may be exchanged with computer system 100 via removable media such as diskette 142 and CD ROM 147. Diskette 142 is insertable into diskette drive 141 which is, in turn, connected to bus 130 by a controller 140. Similarly, CD ROM 147 is insertable into CD ROM drive 146 which is connected to bus 130 by controller 145. Hard disk 152 is part of a fixed disk drive 151 which is connected to bus 130 by controller 150.
[0024] User input to computer system 100 may be provided by a number of devices. For example, a keyboard 156 and mouse 157 are connected to bus 130 by controller 155. An audio transducer 196, which may act as both a microphone and a speaker, is connected to bus 130 by audio controller 197, as illustrated. It will be obvious to those reasonably skilled in the art that other input devices such as a pen and/or tablet and a microphone for voice input may be connected to computer system 100 through bus 130 and an appropriate controller/software. DNA controller 160 is provided for performing direct memory access to system RAM 110. A visual display is generated by video controller 165 which controls video display 170. Computer system 100 also includes a communications adaptor 190 which allows the system to be interconnected to a local area network (LAN) or a wide area network (WAN), schematically illustrated by bus 191 and network 195.
[0025] Computer system 100 is generally controlled and coordinated by operating system software, such the OS/2® operating system, available from International Business Machines Corporation, Armonk, N.Y. or Windows NT operating system, available from Microsoft Corporation, Redmond, Wash. The operating system controls allocation of system resources and performs tasks such as process scheduling, memory management, and networking and I/O services, among other things. The present invention is intended for use with a multitasking operating system, such as those described above which are capable of simultaneous multiple threads of execution. For purposes of this disclosure a thread can be thought of as a “program” having an instruction or sequence of instructions and a program counter dedicated to the thread. An operating system capable of executing multiple threads simultaneously, therefore, is capable of performing multiple programs simultaneously.
[0026] In the illustrative embodiment, a call flow server server in accordance with the present invention is implemented using object-oriented technology and an operating system which supports an execution of an object-oriented programs. For example, the inventive call flow server server may be implemented using the C++ language or as well as other object-oriented standards, including the COM specification and OLE 2.0 specification for MicroSoft Corporation, Redmond, Wash., or, the Java programming environment from Sun Microsystems, Redwood, Calif.
[0027] Telecommunication Environment
[0028] FIG. 2 illustrates a telecommunications environment in which the invention may be practiced such environment being for exemplary purposes only and not to be considered limiting. Network 200 of FIG. 2 illustrates a hybrid telecommunication environment including both a traditional public switched telephone network as well as Internet and Intranet networks and apparatus bridging between the two. The elements illustrated in FIG. 2 are to facilitate an understanding of the invention. Not every element illustrated in FIG. 2 or described herein is necessary for the implementation or the operation of the invention.
[0029] A pair of PSTN central offices 210A–B serve to operatively couple various terminating apparatus through either a circuit switched network or a packet switched network. Specifically, central offices 210A–B are interconnected by a toll network 260. Toll network 260 may be implemented as a traditional PSTN network including all of the physical elements including routers, trunk lines, fiber optic cables, etc. Connected to central office 210A is a traditional telephone terminating apparatus 214A–D and an Internet telephones 232A–D. Terminating apparatus 214A–D may be implemented with either a digital or analog telephone or any other apparatus capable of receiving a call such as modems, facsimile machines, etc., such apparatus being referred to collectively hereinafter as a terminating apparatus, whether the network actually terminates. Further, the PSTN network may be implemented as either an integrated services digital network (ISDN) or a plain old telephone service (POTS) network. The Internet telephony is conceptually illustrated as a telephone icon symbolizing the Internet telephone client application executing on a personal computer and interconnected to central office 210A via a modem 270A. Similarly, telephone 214C is connected to central office 210B and WebPhone 232C is connected to central office 210B via modem 270C. Central offices 210A–B are, in turn, operatively coupled to Internet 220 by ISP 250B and 250C, respectively. In addition, central office 210A is coupled to ISP250B by gateway 218B. Similarly, central office 210B is connected to ISP 250C by gateway 218C. In addition, a telephone 214B and Internet telephone 232B, similar to telephone 214A and Internet telephone 232A, respectively, are interconnected to Internet 220 via PBX 212, gateway 218A and ISP 250A. In addition, a global server 252, coupled to the Internet 220, may be implemented as described in U.S. patent application Ser. No. 08/719,894, entitled Directory Server for Providing Dynamically Assigned Network Protocol Addresses, incorporated herein. A global server suitable for use as Global Server 252 is commercially available from NetSpeak Corporation in the form of a collection of intelligent software modules including connection server Part No. CSR1, information server, Model ISR1, and database server, Model DBSR1. Finally, Internet Service Providers (ISPs) 250A–D may comprise any number of currently commercially available Internet service providers such as America On Line, the IBM Global Network, Compuserve, etc. An Intranet implemented as LAN 275 is coupled to Internet 220 via ISP 250D and server 256. Server 256 may have the architecture as illustrated in FIG. 1 and functions as a proxy server for LAN 275 to which WebPhone 232E is connected via a LAN-based TCP/IP network connector 280. A plurality of Internet telephone 232F and 232E are coupled to LAN 275 via LAN connectors 280.
[0030] A call flow server 300 is coupled over a packet-switched network to gateways 218A–C, as illustrated in FIG. 2 . As described in greater detail hereinafter, gateways 218A–C forward call events to call flow server 300 which uses a call flow engine to efficiently handle processing of all call events. The gateways, call flow server and WebPhone client applications may be implemented as set forth in greater detail hereinafter.
[0031] WebPhone Client
[0032] Any of Internet telephones 232A–C shown in the Figures, and referred to hereafter simply as WebPhone(s), WebPhone process or WebPhone client 232, may be implemented as described in U.S. patent application Ser. No. 08/533,115 entitled “POINT-TO-POINT INTERNET PROTOCOL” by Glenn W. Hutton,—filed Sep. 25, 1995, now U.S. Pat. No. 6,108,704, incorporated herein by reference. An Internet telephony application suitable for use with the present invention is the WebPhone 1.0, 2.0 or 3.0, client software application commercially available from NetSpeak Corporation, Boca Raton, Fla. The WebPhone client comprises a collection of intelligent software modules which perform a broad range of Internet telephony functions. For the purpose of this disclosure, a “virtual” WebPhone client refers to the same functionality embodied in the WebPhone client application without a graphic user interface. Such virtual WebPhone client can be embedded into a gateway, automatic call distributor, call flow server, or other apparatus which do not require extensive visual input/output from a user and may interact with any other WebPhone clients or servers adhering to the WebPhone protocol.
[0033] The WebPhone software applications may run on the computer system described with reference to FIG. 1 , or a similar architecture whether implemented as a personal computer or dedicated server. In such an environment, the sound card 197 accompanying the computer system 100 of FIG. 1 , may be an Media Control Interface (MCI) compliant sound card while communication controller 190 may be implemented through either an analog modem 270 or a LAN-based TCP/IP network connector 280 to enable Internet/Intranet connectivity.
[0034] The WebPhone clients, as well as any other apparatus having a virtual WebPhone embodied therein, each have their own unique E-mail address and adhere to the WebPhone Protocol and packet definitions, as extensively described in the previously referenced related U.S. patent applications. For the reader's benefit, short summary of a portion of the WebPhone Protocol is set forth to illustrate the interaction of WebPhone clients with each other and the connection/information server 252 when establishing a communication connection.
[0035] Each WebPhone client, may serve either as a calling party or a caller party, i.e. the party being called. The calling party transmits an on-line request packet to a connection/information server upon connection to an IP-based network, e.g. the Internet or an Intranet. The on-line request packet contains configuration and settings information, a unique E-mail address and a fixed or dynamically assigned IP address for the WebPhone client. The callee party, also a utilizing a WebPhone client, transmits a similar on-line request packet containing its respective configuration and setting information, E-mail address and IP address to the same or a different connection server upon connection to an IP-based network. The calling party originates a call by locating the callee party in a directory associated with either its own WebPhone client or the connection/information server to which it is connected. The callee party may be identified by alias, E-mail address or key word search criteria. Once the E-mail address of the callee party is identified, the calling party's WebPhone forwards a request packet to the connection/information server, the request packet containing the callee party's E-mail address. The connection/information server uses the E-mail address in the received request packet to locate the last known IP address assigned to the callee party. The connection/information server then transmits to the calling party an information packet containing the IP address of the callee party. Upon receipt of the located IP address from the connection server, the calling party's WebPhone client initiates a direct point-to-point communication link with the callee party by sending a call packet directly to the IP address of the callee party. The callee party either accepts or rejects the call with appropriate response packets. If the call is accepted, a communication session is established directly between the caller and the callee, without intervention of the connection/information server. The above scenario describes establishment of a communication link which originates and terminates with clients on an IP-based network. To facilitate interaction with WebPhone clients, a virtual WebPhone is implemented in the gateways 218A–C, as described hereinafter.
[0036] Gateways 218A–C shown in the Figures, any of which is referred to hereafter simply as gateway 218 acts as a proxy device and includes voice processing hardware that bridges from an IP-based network to a PSTN network. The gateway 218 may be implemented with either a microprocessor based architecture or with dedicated digital signal processing logic and embedded software. A gateway suitable for use as gateway 218 with the present invention is either NetSpeak Model Nos. WGX-MD/24, a 24-port digital T-1 IP telephony gateway, or WGX-M/16, a 16-port analog IP telephony gateway, both commercially available from NetSpeak Corporation, Boca Raton, Fla. Gateway 218 may be implemented using a computer architecture similar to computer system 100 described with reference to FIG. 1 .
[0037] In addition, gateway 218 comprises one or more voice cards, one or more compression/decompression (codec) cards, and a network interface. The voice card(s) provides a T-1 or analog connection to the PBX or central office or analog telephone lines which have a conventional telephony interface, for example, DID, ENM. The voice card application program interface enable the instance of gateway 218 to emulate a conventional telephone on a PBX or central office of a PSTN carrier. Multichannel audio compression and decompression is accessed by gateway 218 via application program interfaces on the respective sound cards and is processed by the appropriate audio codec. Any number of commercially available voice cards may be used to implement voice card(s) within gateway 218. Similarly, any number of commercially available audio codecs providing adequate audio quality may be utilized. Each instance of gateway 218 interfaces with the TCP/IP network through a series of ports which adhere to the WebPhone protocol. Gateway 218 interfaces with the T1 line of the PSTN network through the interfaces contained within the voice card(s).
[0038] One of the capabilities of the gateway 218 is to bridge between the PSTN and Internet/Intranet, and the Internet/Intranet and the PSTN. Gateway 218 virtualizes the PSTN call, making it appear as just another WebPhone client call. This virtual WebPhone process interfaces with ACD server 242 so that incoming PSTN calls can be routed to agent WebPhone processes with the tracking, distribution, and monitoring features of the ACD server 242. For incoming calls originating on a PSTN, gateway 218 provides to ACD server 242 information about incoming calls so that proper call routing can ensue, such information possibly comprising Caller ID (CLID), automatic number identification (ANI), DNIS, PBX trunk information, from the central office 210, or other information collected by voice response units. In a similar manner, gateway 218 virtualizes the PSTN call, and transmits event information associated with the call to call flow server 300. Such information may be transmitted in packetized form using, for example the WebPhone protocol, or another standard or protocol.
[0039] Call Flow Server Architecture
[0040] FIG. 3 illustrates conceptually the system architecture which may be used as the call flow server 300 of FIG. 2 . As Call flow server 300 may be implemented to execute on a computer architecture similar to computer system 100, as described in FIG. 1 , and an operating system, such as Windows NT. Call flow server 300 comprises multiple software modules that collectably enable call processing and call handling, including call flow event processing and handling. Specifically, call flow server 300 comprises a call flow engine 316, a call flow thread manager 318, and a call flow queue 320. Optionally, an Internet telephony application 322, which may perform any telephony feature such as automatic call distribution, call waiting, call forwarding, call conferencing, caller identification, or any other telephony feature, in a manner similar to the WebPhone 232 application described previously, may be included. A server suitable for use as call flow server 300 with the present invention is NetSpeak Gate Keeper 2.1 commercially available from NetSpeak Corporation, Boca Raton, Fla. Alternatively, the call flow server of the present invention may be integrated into a number a different telecommunications apparatus, including an H.323 Standard Gatekeeper, a Session Initiation Protocol (SIP) server or a Media Gateway Control Protocol (MGCP) call agent used in packetized cable communications. As illustrated in FIG. 2 , call flow server 300 may be coupled directly to gateways 218B–C through a LAN or other network. Alternatively, call flow server 300 may be coupled to gateway 218A through the Internet, as illustrated.
[0041] The call flow engine 316 executes one or more call flow events, also known as call flow scripts, in order to process a call. A call flow event or script represents a state table or instruction(s) which the call flow event engine 316 executes. The call flow event state table calls functions that are provided with the script itself in a given script language, or in import libraries. Script language examples may include, but are not limited to, JAVA code, Object Oriented approaches in a language such as C++, or in any other proprietary script language. These functions can be in the form of “C” compiled library functions or script functions. If a new script begins execution at the request of a existing script, its state table takes effect.
[0042] Call flow engine 316 may execute multiple scripts concurrently. To be able to execute multiple scripts, call flow engine 316 utilizes multiple threads. At least one script executes per thread. To manage the number of scripts and to execute these multiple scripts concurrently, call flow engine 316 maintains instant information about each script concurrently executing.
[0043] Call flow scripts are ASCII based files that can be executed in an interpretive manner or compiled and executed. Call flow scripts have two components, the first is a state table while the second is a script function. The state table for a script defines the state events and their transitions. With each transition, a function or method is called. These script objects may be part of the script or they may be in an import library. A script object is made up of an event table and methods. A script object represents a single script state. Each object has a state of events they handle and are located within an event table. These events and methods are contained in an event table. A technique for designing object-oriented table driven state machines is disclosed in the previously referenced copending patent application Ser. No. 09/477,435, entitled “METHOD FOR DESIGNING OBJECT-ORIENTED TABLE DRIVEN STATE MACHINES” by Keith C. Kelly, Mark Pietras and Michael Kelly, now U.S. Pat. No. 6.463,565, commonly assigned and filed on an even date herewith.
[0044] As stated previously, call flow server 300 may be implemented to perform any telephony function such as automatic call distribution, call waiting, call forwarding, call conferencing, caller identification, etc. A further detailed description of the complete call flow server 300, including the actual data associated tables and scripts which call flow engine 316 to function as a state machine are beyond the scope of this invention and will not be set forth herein for brevity.
[0045] Call flow thread manager 318 interacts with call flow engine 316 to manage the multiple threads handling call flow events within call flow server 300. Call flow thread manager 318 distributes call flow events among the respective call flow queues associated 320. Each thread has its own call flow queue 320 which is used to store a call flow script associated with a particular event. Optionally, an additional event queue, closely coupled, with the call flow script queue may be implemented. In such a configuration, each event in the event queue contains a reference to a call flow script stored either in a table or the call flow script queue. A thread is defined as an execution path having at least one call flow instruction. Further, a thread has an associated context, which is the volatile data associated with the execution of the thread. A thread's context includes the contents of system registers and the virtual address space belonging to the thread's process. Thus, it is important to minimize thread context switches when readjusting thread call flow event handling efficiency.
[0046] FIGS. 4A and 4B illustrates conceptually a first thread 410 and a second thread 412 within a call flow server 300 executing on either a single processor or multiple processors. Associated with each of threads 410 and 412 is a call flow queue 320 loaded with one or more call flow events. The call flow queue associated with thread 410 includes call flows 414 and 416. The call flow queue associated with thread includes call flow 418. During operation, thread 410 may experience some type of processing delay where call flow 414 is unable to be processed promptly, thus preventing call flow 416 from being processed. Reasons for processing delay may include a heavy number of events being generated by call flow execution or heavy CPU processing by a given script. In the meanwhile, thread 412 has only call flow 418 to processed in its associated call flow queue. In order to maximize efficiency of call flow server 300, the call flow thread manager 318 evaluates the two threads 410 and 412 and their associated call flow queues to determine whether a call flow event reallocation should be performed in order to optimize call flow handling by the multiple threads, as described with reference to FIG. 5 . Should such an event transfer occur, the results are shown in FIG. 4B where call flow 416 has been transferred from first thread 410 to second thread 412.
[0047] Call flow thread manager 318 is configured to handle a number of threads scaling from a single thread on a single processor system to multiple threads for multiple processor systems. Furthermore, call flow thread manager 318 provides dynamic backlog detection. Specifically, if a call flow is not receiving enough processor resources, it is removed from the backlogged worker thread and added to a different thread as was shown in FIGS. 4A and 4B . Furthermore, call flow thread manager 318 provides intelligent call flow allocation. Call flow manager 318 allocates call flows based on the processor availability and processor work load. As a result, call flows are always allocated to the processor having the least amount of call flow load. Call flow thread manager 318 also minimizes context switches by arranging multiple call flows to run on the same thread where context is a factor in the thread processing.
[0048] FIG. 5 is a flowchart of the process steps performed by call flow thread manager 318 to manage a plurality of threads within the telecommunications server, in accordance with the present invention. After starting in step 500, call flow thread manager 318 allocates the minimum number of worker thread objects for each thread, stores the queue depth and number of client call flows for each thread, as illustrated by step 510. During step 510, several constants and variables are initialized, including MAX_THREADS, MIN_THREADS, MAX_LOAD, MAX_CALL_FLOWS, and LOAD_CHECK_FREQUENCY. MAX_THREADS defines the maximum number of threads to allocate to the service call flows. MIN_THREADS is the minimum number of threads to allocate to the service call flows. Typically, MIN_THREADS is typically equal to the number of processors in the system or the number of threads that can be run by a single processor in a single processor system. MAX_LOAD defines the maximum event queue depth for a worker thread. The event queue depth measures the delay experienced on a given thread when serving events for a given call flow. MAX_CALL_FLOWS define the maximum number of scripts that may be allocated to a thread. The call flow thread manager 318 prevents any thread from processing more than the max number of call flows defined by MAX_CALL_FLOWS, however, under heavy load conditions, this quantity may be exceeded, as necessary. The LOAD_CHECK_FREQUENCY controls the frequency that the event queue size is checked and is adjusted on various performance reasons such as minimum acceptable delay for processing a call flow or based on the number of threads that are actually available for processing call flows. To perform the above described initialization process call flow event manager 318 may execute the pseudo-code example set forth below:
[0049]
| static initialization (once per run): | ||
| allocate MIN_THREADS number of worker thread objects | ||
| for each thread, store queue depth and number of client call flows | ||
| script constructor: | ||
| call attachToThread( ) | ||
| attachToThread: | ||
| set the following variables: | ||
| minscripts = MAX_SCRIPTS_PER_THREAD; | ||
| minload = HEAVILY_LOADED_QUEUE; | ||
| call findBestThread( ) to get the optimal thread for this call flow | ||
| // if minscripts == MAX_SCRIPTS_PER_THREAD or | ||
| minload == HEAVILY_LOADED_QUEUE) | ||
| if (there's no room in the current threads) | ||
| { | ||
| if (the total # of worker threads < MAX_THREADS) | ||
| Allocate a new worker thread | ||
| store queue depth and number of client call flows (0) | ||
| else | // fit the call flow into a fully loaded queue | |
| // find the thread with the fewest scripts and least call | ||
| // flow backlog | ||
| // tell findBestThread to return ANY thread even if all are | ||
| //loaded it won't do this normally | ||
| findBestThread( ); | ||
| } | ||
| else | ||
| { | ||
| attach this script to the worker thread | ||
| } | ||
[0050] After the initialization has been performed in step 510, the call flow manager proceeds to step 512 to determine the number of available threads. After determining the total number of available threads, the call flow manager proceeds to step 514 where it allocates call flow events to the available threads within call flow server 300. Once call flow allocation has been performed, call flow event manager 318 determines the activity on each thread within call flow server 300, as illustrated by step 516.
[0051] Once the call flow thread manager 318 determines the activity on each thread, it determines whether any one thread or more has exceeded its maximum call flow capacity, as illustrated by step 518. To perform such a determination, call flow event manager 318 may execute the pseudo-code example set forth below:
[0052]
| workersMaxedOut: quick check to see if all threads are at capacity | |
| set maxedOut = true | |
| if (active worker threads equals MAX_THREADS) | |
| { | |
| loop through all the threads | |
| { | |
| grab the queue size of the thread | |
| if (the queue size is less than the max permitted backlog | |
| AND total # of client call flows < MAX_SCRIPTS— | |
| PER_THREAD) | |
| { | |
| //this thread still has capacity for more client | |
| //call flows | |
| maxedOut = false; | |
| exit loop | |
| } | |
| } | |
| } | |
| else | |
| { | |
| maxedOut = false; | |
| } | |
| return maxedOut; | |
[0053] If no thread has exceeded its given call flow capacity, thread manager 318 returns to monitor the thread activity. If a thread has exceeded its call flow capacity, call flow thread manager 318 allocates the excess call flow load to another thread, as illustrated by step 520. The criteria used to allocate thread call flow load from one thread to another typically includes determining the thread having the fewest scripts and the least call flow backlog as well as the thread that has the greatest amount of resources available for use. The call flow thread manager 318 locates the thread having the greatest resources available and allocates the blocked scripts to that particular thread. To determine which thread has the greatest resources, call flow event manager 318 may execute the pseudo-code example set forth below:
[0054]
| findBestThread: searches for the thread with the lightest load | |
| while (there are more threads to search through) | |
| { | |
| grab a description of the load of the current thread | |
| if (this thread is running fewer call flows than the max # acceptable | |
| to the caller) | |
| grab a snap shot of the event queue size | |
| if (the event queue is smaller than the max event queue size | |
| permitted by the caller) | |
| { | |
| indicate that this script is the smallest amount we've seen so | |
| far | |
| if this thread has no clients and no backlog, exit loop since | |
| we've found a free thread! | |
| } | |
| } | |
[0055] Otherwise, the system selects a first available thread having adequate resources for processing.
[0056] In step 522, call flow thread manager 318 determines whether a call flow balance has been achieved among the plurality of threads. If such balance has been achieved, then the call flow thread manager has performed its task and returns. If a proper balance has not been achieved, then the call flow thread manager 319 returns to step 520 to allocate call flow events among the plurality of threads until a balance is achieved. Balance is achieved when no thread exceeds MAX_LOAD.
[0057] Once the scripts have been allocated to their various threads, they are added or stored in the call flow queue associated with that thread. To add a call flow event to a call flow queue, call flow event manager 318 may execute the pseudo-code example set forth below:
[0058]
| addElement: add an event to a call flow's event queue | |
| each call flow actually shares a queue with all of the other call flows on that thread | |
| Increment checksize | |
| Increment # of outstandingEvents | |
| // we check to see if the threads should be load balanced every> | |
| LOAD_CHECK_FREQUENCY events. | |
| if (loadcheck > LOAD_CHECK_FREQUENCY) | |
| { | |
| queueSize = size of thread event queue | |
| // if the queue is heavily loaded AND our instance | |
| // isn't reponsible for this load AND | |
| // there's another thread with capacity . . . | |
| if (queueSize > HEAVILY_LOADED_QUEUE && | |
| !(eventsOutstanding > (queueSize >> 2 )) && | |
| !workersMaxedOut( )) | |
| { | |
| remove all this call flows events from the event queue and | |
| store in a temp variable. | |
| remove this call flow from this worker thread . . . | |
| //pick the best available thread . . . | |
| attachToThread( ); | |
| // transfer our events to the new thread's //queue . . . | |
| } | |
| } | |
| add the requested event to the queue | |
| } | |
[0059] Once in call flow queue 320, the scripts are processed by the call flow engine 316 until such time as all the call flow events have been processed. Each worker thread may execute the pseudo-code example set forth below to effect processing of call flows:
[0060]
| eventProcessed: reduces # of events that still must be processed . . . | |
| Increment # of outstandingEvents | |
| serviceEvents: pulls an event from the queue and sends it to the | |
| appropriate call flow for every event in the queue | |
| { | |
| retrieve the first element in the queue | |
| remove first element from the queue | |
| invoke call flow method to handle the event | |
| // let client know we've processed the event . . . | |
| eventProcessed( ); | |
| } | |
| run: main thread worker routine | |
| loop forever | |
| sleep till a call flow generates an event | |
| serviceEvent( ) | |
[0061] The reader will appreciate that the inventive algorithm described herein has the following advantages: 1) a configurable number of threads, that is, it is scalable from a single thread on a single processor systems to multiple threads for multiprocessor systems; 2) dynamic backlog detection, e.g. if a call flow is not receiving enough processor resources, it is removed from the backlogged worker thread and added to a different thread; 3) the algorithm is lightweight and almost as fast as the single processor approach; 4) call flows are allocated based on processor availability and processor workload enabling call flows to be allocated to the processor with the least load; and 5) context switches are minimized since multiple call flows can run on the same thread.
[0062] It is important to distinguish at this time that call flow events and the scripts which they are written are state events that are processed by the computer system within the telecommunications server. Call flow events are not the actual data stream of information being transmitted from one user to another in the form of either audio, video, or other type of file transfer information. Call flow events are actions that are typically requested by one of the client applications or endpoints or by the server itself. These actions typically can include call transactions such as call waiting, call forwarding, call messaging, billing for a particular client, and any other call action that is intended to be secondary to the actual calling information being carried over the call servicing network of FIG. 2 . It is intended that where possible, these call flow events are processed in a manner that is reasonably transparent to the overlying purpose of the phone connection.
[0063] A software implementation of the above-described embodiments may comprise a series of computer instructions either fixed on a tangible medium, such as a computer readable media, e.g. diskette 142, CD-ROM 147, ROM 115, or fixed disk 152 of FIG. 1 , or transmittable to a computer system, via a modem or other interface device, such as communications adapter 190 connected to the network 195 over a medium 191. Medium 191 can be either a tangible medium, including but not limited to optical or analog communications lines, or may be implemented with wireless techniques, including but not limited to microwave, infrared or other transmission techniques. The series of computer instructions embodies all or part of the functionality previously described herein with respect to the invention. Those skilled in the art will appreciate that such computer instructions can be written in a number of programming languages for use with many computer architectures or operating systems. Further, such instructions may be stored using any memory technology, present or future, including, but not limited to, semiconductor, magnetic, optical or other memory devices, or transmitted using any communications technology, present or future, including but not limited to optical, infrared, microwave, or other transmission technologies. It is contemplated that such a computer program product may be distributed as a removable media with accompanying printed or electronic documentation, e.g., shrink wrapped software, preloaded with a computer system, e.g., on system ROM or fixed disk, or distributed from a server or electronic bulletin board over a network, e.g., the Internet or World Wide Web.
[0064] Although various exemplary embodiments of the invention have been disclosed, it will be apparent to those skilled in the art that various changes and modifications can be made which will achieve some of the advantages of the invention without departing from the spirit and scope of the invention. Further, many of the system components described herein such as the client application and the gateway have been described using products from NetSpeak Corporation. It will be obvious to those reasonably skilled in the art that other components performing the same functions may be suitably substituted. Further, the methods of the invention may be achieved in either all software implementations, using the appropriate processor instructions, or in hybrid implementations which utilize a combination of hardware logic and software logic to achieve the same results. Such modifications to the inventive concept are intended to be covered by the appended claims.
Claims
What is claimed is:
1. In a computer system for internet telephony, a method, performed at a manager, of distributing call flow events among a plurality of threads, each thread having a dedicated call flow event queue in which call flow events are queued, the method comprising:
A. determining a call flow workload level for each of the plurality of threads;
B. determining that a first of the plurality of threads is inefficiently handling its assigned call flow workload; and
C. reassigning a call flow event from the call flow event queue dedicated to the first thread to the call flow event queue dedicated to a second of the plurality of threads.
2. The method according to claim 1 further comprising the step:
D. processing the call flow events associated with each of the plurality of threads.
3. The method according to claim 1 wherein step C further comprises:
C.1 removing a call flow event from the call flow event queue associated with the first thread; and
C.2 placing the removed call flow event in the call flow event queue associated with the second thread.
4. The method according to claim 1 wherein step C further comprises:
C.1 selecting the second thread in accordance with the number of call flow events in the call flow event queue associated with the second thread.
5. The method according to claim 1 wherein step C further comprises:
C.1 allocating the call flow events to a thread within the computer system with the least call flow load.
6. The method according to claim 1 wherein step B further comprises:
B.1 determining whether the number of call flow events in the call flow event queue associated with a thread has exceeded a predetermined criteria.
7. The method according to claim 1, wherein step A comprises:
A.1 assigning call flow events among the call flow queues associated with the respective plurality of threads in the system.
8. The method according to claim 1, further comprising:
D. determining whether a call flow balance has been achieved among the plurality of threads;
E. processing the call flow events associated with each of the plurality of threads.
9. A computer program product for use with a computer system for internet telephony, the computer system operatively coupled to a computer network and capable of communicating with one or more processes over the network, the computer program product comprising a computer readable medium having executable program code embodied in the computer readable medium, the executable program code being operable at a manager and comprising:
(A) executable program code for determining a call flow workload level for each of a plurality of threads;
(B) executable program code for determining that a first of the plurality of threads is inefficiently handling its assigned call flow workload; and
(C) executable program code for reassigning a call flow event from the call flow event queue dedicated to the first thread to the call flow event queue dedicated to a second of the plurality of threads.
10. The computer program product of claim 9, further comprising:
(D) executable program code for processing the call flow events within each of the plurality of threads.
11. The computer program product according to claim 9 further comprising:
(C.1) executable program code for removing a call flow event from the call flow event queue associated within the first thread; and
(C.2) executable program code for placing the removed call flow event in the call flow event queue associated with the second thread.
12. The computer program product according to claim 9 further comprising:
(C.1) executable program code for selecting the second thread in accordance with the number of call flow events in the call flow event queue associated with the second thread.
13. The computer program product according to claim 9 further comprising:
(C.1) executable program code for allocating the call flow events to a thread within the computer system with the least call flow load.
14. The computer program product according to claim 9 further comprising:
(B.1) executable program code for determining whether the number of call flow events in the call flow event queue associated with a thread has exceeded a predetermined criteria.
15. The computer program product according to claim 9, further comprising:
(A.1) executable program code for assigning call flow events among the call flow event queues associated with the respective plurality of threads in the system.
16. The computer program product according to claim 9, further comprising:
(D) executable program code for determining whether a call flow balance has been achieved among the plurality of threads;
(E) executable program code for processing the call flow events associated with each of the plurality of threads.
17. In a computer system for internet telephony, an apparatus for distributing call flow events among a plurality of threads, each thread having a dedicated call flow event queue in which call flow events are queued, the apparatus comprising:
a processor including:
a call flow engine configured to execute call flow events associated with one of the threads;
a call flow manager configured to distribute a plurality of call flow events among a plurality of threads used for managing the processing of a plurality of call flows, the call flow manager optimizing the processing of the call flows by determining which of the plurality of threads are operating inefficiently and reassigning a portion of the call flow events assigned to the dedicated call event queue of the inefficient thread to the dedicated call event queue of another of the plurality of threads having excess call flow processing capacity.
18. The apparatus of claim 17 wherein the call flow manager continues to reassign call flow events until a balanced call flow event processing level is attained among the plurality of threads.
19. The apparatus according to claim 17, wherein the call flow manager determines which of the plurality of threads are operating inefficiently by determining whether any of the threads has exceeded its maximum call flow capacity.
Patent Citations (364)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4446519(A) | 1984-05-01 | Thomas | Applicant |
| US4450554(A) | 1984-05-01 | Steensma et al. | Applicant |
| US4528659(A) | 1985-07-01 | Jones, Jr. | Applicant |
| US4589107(A) | 1986-05-01 | Middleton et al. | Applicant |
| US4598397(A) | 1986-07-01 | Nelson et al. | Applicant |
| US4630262(A) | 1986-12-01 | Callens et al. | Applicant |
| US4652703(A) | 1987-03-01 | Lu et al. | Applicant |
| US4658093(A) | 1987-04-01 | Hellman | Applicant |
| US4694492(A) | 1987-09-01 | Wirstrom et al. | Applicant |
| US4740963(A) | 1988-04-01 | Eckley | Applicant |
| US4782485(A) | 1988-11-01 | Gollub | Applicant |
| US4799153(A) | 1989-01-01 | Hann et al. | Applicant |
| US4800488(A) | 1989-01-01 | Agrawal et al. | Applicant |
| US4809271(A) | 1989-02-01 | Kondo et al. | Applicant |
| US4813040(A) | 1989-03-01 | Futato | Applicant |
| US4819228(A) | 1989-04-01 | Baran et al. | Applicant |
| US4821263(A) | 1989-04-01 | Lundh | Applicant |
| US4866704(A) | 1989-09-01 | Bergman | Applicant |
| US4866732(A) | 1989-09-01 | Carey et al. | Applicant |
| US4873715(A) | 1989-10-01 | Shibata | Applicant |
| US4887265(A) | 1989-12-01 | Felix | Applicant |
| US4890282(A) | 1989-12-01 | Lambert et al. | Applicant |
| US4899333(A) | 1990-02-01 | Roediger | Applicant |
| US4912705(A) | 1990-03-01 | Paneth et al. | Applicant |
| US4932022(A) | 1990-06-01 | Keeney et al. | Applicant |
| US4962449(A) | 1990-10-01 | Schlesinger | Applicant |
| US4981371(A) | 1991-01-01 | Gurak et al. | Applicant |
| US4995074(A) | 1991-02-01 | Goldman et al. | Applicant |
| US5031089(A) | 1991-07-01 | Liu et al. | Examiner |
| US5036513(A) | 1991-07-01 | Greenblatt | Applicant |
| US5056140(A) | 1991-10-01 | Kimbell | Applicant |
| US5065425(A) | 1991-11-01 | Lecomte et al. | Applicant |
| US5095480(A) | 1992-03-01 | Fenner | Applicant |
| US5113499(A) | 1992-05-01 | Ankney et al. | Applicant |
| US5121385(A) | 1992-06-01 | Tominaga et al. | Applicant |
| US5127001(A) | 1992-06-01 | Steagall et al. | Applicant |
| US5130985(A) | 1992-07-01 | Kondo et al. | Applicant |
| US5150360(A) | 1992-09-01 | Perlman et al. | Applicant |
| US5150410(A) | 1992-09-01 | Bertrand | Applicant |
| US5155726(A) | 1992-10-01 | Spinney et al. | Applicant |
| US5157592(A) | 1992-10-01 | Walters | Applicant |
| US5159592(A) | 1992-10-01 | Perkins | Applicant |
| US5166931(A) | 1992-11-01 | Riddle | Applicant |
| US5187591(A) | 1993-02-01 | Guy et al. | Applicant |
| US5204669(A) | 1993-04-01 | Dorfe et al. | Applicant |
| US5212789(A) | 1993-05-01 | Rago | Applicant |
| US5214650(A) | 1993-05-01 | Renner et al. | Applicant |
| US5220599(A) | 1993-06-01 | Sasano et al. | Applicant |
| US5224095(A) | 1993-06-01 | Woest et al. | Applicant |
| US5241594(A) | 1993-08-01 | Kung | Applicant |
| US5241625(A) | 1993-08-01 | Epard et al. | Applicant |
| US5249290(A) | 1993-09-01 | Heizer | Applicant |
| US5274635(A) | 1993-12-01 | Rahman et al. | Applicant |
| US5282197(A) | 1994-01-01 | Kreitzer | Applicant |
| US5283819(A) | 1994-02-01 | Glick et al. | Applicant |
| US5287103(A) | 1994-02-01 | Kasprzyk et al. | Applicant |
| US5291554(A) | 1994-03-01 | Morales | Applicant |
| US5301324(A) | 1994-04-01 | Dewey et al. | Examiner |
| US5305312(A) | 1994-04-01 | Fornek et al. | Applicant |
| US5309433(A) | 1994-05-01 | Cidon et al. | Applicant |
| US5309437(A) | 1994-05-01 | Perlman et al. | Applicant |
| US5315705(A) | 1994-05-01 | Iwami et al. | Applicant |
| US5319705(A) | 1994-06-01 | Halter et al. | Applicant |
| US5321813(A) | 1994-06-01 | McMillen et al. | Applicant |
| US5327486(A) | 1994-07-01 | Wolff et al. | Applicant |
| US5335276(A) | 1994-08-01 | Thompson et al. | Applicant |
| US5341374(A) | 1994-08-01 | Lewen et al. | Applicant |
| US5347632(A) | 1994-09-01 | Filepp et al. | Applicant |
| US5357571(A) | 1994-10-01 | Banwart | Applicant |
| US5377260(A) | 1994-12-01 | Long | Applicant |
| US5396485(A) | 1995-03-01 | Ohno et al. | Applicant |
| US5400335(A) | 1995-03-01 | Yamada | Applicant |
| US5410754(A) | 1995-04-01 | Favreau et al. | Applicant |
| US5425028(A) | 1995-06-01 | Britton et al. | Applicant |
| US5428608(A) | 1995-06-01 | Freeman et al. | Applicant |
| US5430709(A) | 1995-07-01 | Galloway | Applicant |
| US5430727(A) | 1995-07-01 | Callon | Applicant |
| US5432846(A) | 1995-07-01 | Norio | Applicant |
| US5434797(A) | 1995-07-01 | Barris | Applicant |
| US5434913(A) | 1995-07-01 | Tung et al. | Applicant |
| US5440547(A) | 1995-08-01 | Easki et al. | Applicant |
| US5442633(A) | 1995-08-01 | Perkins et al. | Applicant |
| US5446891(A) | 1995-08-01 | Kaplan et al. | Applicant |
| US5446919(A) | 1995-08-01 | Wilkins | Applicant |
| US5452296(A) | 1995-09-01 | Shimizu | Applicant |
| US5455854(A) | 1995-10-01 | Dilts et al. | Applicant |
| US5457683(A) | 1995-10-01 | Robins | Applicant |
| US5457738(A) | 1995-10-01 | Sylvan | Applicant |
| US5459864(A) | 1995-10-01 | Brent et al. | Examiner |
| US5461611(A) | 1995-10-01 | Drake, Jr. et al. | Applicant |
| US5463625(A) | 1995-10-01 | Yasrebi | Applicant |
| US5465286(A) | 1995-11-01 | Clare et al. | Applicant |
| US5467388(A) | 1995-11-01 | Redd et al. | Applicant |
| US5469500(A) | 1995-11-01 | Satter et al. | Applicant |
| US5473531(A) | 1995-12-01 | Flora-Holmquist et al. | Applicant |
| US5474741(A) | 1995-12-01 | Mikeska et al. | Applicant |
| US5474819(A) | 1995-12-01 | Chambers et al. | Applicant |
| US5475741(A) | 1995-12-01 | Davis et al. | Applicant |
| US5475819(A) | 1995-12-01 | Miller et al. | Applicant |
| US5479411(A) | 1995-12-01 | Klein | Applicant |
| US5481720(A) | 1996-01-01 | Loucks et al. | Applicant |
| US5483524(A) | 1996-01-01 | Lev et al. | Applicant |
| US5487100(A) | 1996-01-01 | Kane | Applicant |
| US5491800(A) | 1996-02-01 | Goldsmith et al. | Applicant |
| US5499295(A) | 1996-03-01 | Cooper | Applicant |
| US5500890(A) | 1996-03-01 | Rogge et al. | Applicant |
| US5509058(A) | 1996-04-01 | Sestak et al. | Applicant |
| US5517432(A) | 1996-05-01 | Chandra et al. | Applicant |
| US5517494(A) | 1996-05-01 | Green | Applicant |
| US5524110(A) | 1996-06-01 | Danneels et al. | Applicant |
| US5524141(A) | 1996-06-01 | Braun et al. | Applicant |
| US5524254(A) | 1996-06-01 | Morgan et al. | Applicant |
| US5526489(A) | 1996-06-01 | Nilakantan et al. | Applicant |
| US5528671(A) | 1996-06-01 | Ryu et al. | Applicant |
| US5533102(A) | 1996-07-01 | Robinson et al. | Applicant |
| US5533110(A) | 1996-07-01 | Pinard et al. | Applicant |
| US5544164(A) | 1996-08-01 | Baran | Applicant |
| US5544303(A) | 1996-08-01 | Maroteaux et al. | Applicant |
| US5544322(A) | 1996-08-01 | Cheng et al. | Applicant |
| US5546448(A) | 1996-08-01 | Caswell et al. | Applicant |
| US5546452(A) | 1996-08-01 | Andrews et al. | Applicant |
| US5546582(A) | 1996-08-01 | Brockmeyer et al. | Applicant |
| US5548636(A) | 1996-08-01 | Bannister et al. | Applicant |
| US5548694(A) | 1996-08-01 | Frisken Gibson | Applicant |
| US5563882(A) | 1996-10-01 | Bruno et al. | Applicant |
| US5574774(A) | 1996-11-01 | Ahlberg et al. | Applicant |
| US5574934(A) | 1996-11-01 | Mirashrafi et al. | Applicant |
| US5581552(A) | 1996-12-01 | Civanlar et al. | Applicant |
| US5586257(A) | 1996-12-01 | Perlman | Applicant |
| US5586260(A) | 1996-12-01 | Hu | Applicant |
| US5591800(A) | 1997-01-01 | Goldsmith et al. | Applicant |
| US5604737(A) | 1997-02-01 | Iwami et al. | Applicant |
| US5606669(A) | 1997-02-01 | Bertin et al. | Applicant |
| US5608786(A) | 1997-03-01 | Gordon | Applicant |
| US5614940(A) | 1997-03-01 | Cobbley et al. | Applicant |
| US5619557(A) | 1997-04-01 | Van Berkum | Applicant |
| US5623483(A) | 1997-04-01 | Agrawal et al. | Applicant |
| US5623490(A) | 1997-04-01 | Richter et al. | Applicant |
| US5623605(A) | 1997-04-01 | Keshav et al. | Applicant |
| US5625407(A) | 1997-04-01 | Biggs et al. | Applicant |
| US5636282(A) | 1997-06-01 | Holmquist et al. | Applicant |
| US5636346(A) | 1997-06-01 | Saxe | Applicant |
| US5642156(A) | 1997-06-01 | Saiki | Applicant |
| US5644629(A) | 1997-07-01 | Chow | Applicant |
| US5651006(A) | 1997-07-01 | Fujino et al. | Applicant |
| US5652759(A) | 1997-07-01 | Stringfellow, Jr. | Applicant |
| US5655120(A) | 1997-08-01 | Witte et al. | Examiner |
| US5659542(A) | 1997-08-01 | Bell et al. | Applicant |
| US5659596(A) | 1997-08-01 | Dunn | Applicant |
| US5668862(A) | 1997-09-01 | Bannister et al. | Applicant |
| US5671428(A) | 1997-09-01 | Muranaga et al. | Applicant |
| US5675507(A) | 1997-10-01 | Bobo | Applicant |
| US5680392(A) | 1997-10-01 | Semaan | Applicant |
| US5684800(A) | 1997-11-01 | Dobbins et al. | Applicant |
| US5684951(A) | 1997-11-01 | Goldman et al. | Applicant |
| US5689553(A) | 1997-11-01 | Ahuja et al. | Applicant |
| US5692180(A) | 1997-11-01 | Lee | Applicant |
| US5692192(A) | 1997-11-01 | Sudo | Examiner |
| US5694594(A) | 1997-12-01 | Chang | Applicant |
| US5701463(A) | 1997-12-01 | Malcolm | Applicant |
| US5708422(A) | 1998-01-01 | Blonder et al. | Applicant |
| US5708655(A) | 1998-01-01 | Toth et al. | Applicant |
| US5710884(A) | 1998-01-01 | Dedrick | Applicant |
| US5717923(A) | 1998-02-01 | Dedrick | Applicant |
| US5719786(A) | 1998-02-01 | Nelson et al. | Applicant |
| US5721827(A) | 1998-02-01 | Logan et al. | Applicant |
| US5724092(A) | 1998-03-01 | Davidsohn et al. | Applicant |
| US5724412(A) | 1998-03-01 | Srinivasan | Applicant |
| US5724506(A) | 1998-03-01 | Cleron et al. | Applicant |
| US5726984(A) | 1998-03-01 | Kubler et al. | Applicant |
| US5729748(A) | 1998-03-01 | Robbins et al. | Applicant |
| US5732078(A) | 1998-03-01 | Arango | Applicant |
| US5734828(A) | 1998-03-01 | Pendse et al. | Applicant |
| US5740231(A) | 1998-04-01 | Cohn et al. | Applicant |
| US5742668(A) | 1998-04-01 | Pepe et al. | Applicant |
| US5742675(A) | 1998-04-01 | Kilander et al. | Applicant |
| US5742762(A) | 1998-04-01 | Scholl et al. | Applicant |
| US5742905(A) | 1998-04-01 | Pepe et al. | Applicant |
| US5745642(A) | 1998-04-01 | Ahn | Applicant |
| US5745702(A) | 1998-04-01 | Morozumi | Applicant |
| US5751712(A) | 1998-05-01 | Farwell et al. | Applicant |
| US5751961(A) | 1998-05-01 | Smyk | Applicant |
| US5754636(A) | 1998-05-01 | Bayless et al. | Applicant |
| US5754939(A) | 1998-05-01 | Herz et al. | Applicant |
| US5758257(A) | 1998-05-01 | Herz et al. | Applicant |
| US5761606(A) | 1998-06-01 | Wolzien | Applicant |
| US5764736(A) | 1998-06-01 | Shachar et al. | Applicant |
| US5764741(A) | 1998-06-01 | Barak | Applicant |
| US5764756(A) | 1998-06-01 | Onweller | Applicant |
| US5767897(A) | 1998-06-01 | Howell | Applicant |
| US5768527(A) | 1998-06-01 | Zhu et al. | Applicant |
| US5771355(A) | 1998-06-01 | Kuzma | Applicant |
| US5774660(A) | 1998-06-01 | Brendel et al. | Applicant |
| US5774666(A) | 1998-06-01 | Portuesi | Applicant |
| US5778181(A) | 1998-07-01 | Hidary et al. | Applicant |
| US5778187(A) | 1998-07-01 | Monteiro et al. | Applicant |
| US5784564(A) | 1998-07-01 | Camaisa et al. | Applicant |
| US5784619(A) | 1998-07-01 | Evans et al. | Applicant |
| US5787253(A) | 1998-07-01 | McCreery et al. | Applicant |
| US5790548(A) | 1998-08-01 | Sistanizadeh et al. | Applicant |
| US5790792(A) | 1998-08-01 | Dudgeon et al. | Applicant |
| US5790793(A) | 1998-08-01 | Higley | Applicant |
| US5790803(A) | 1998-08-01 | Kinoshita et al. | Applicant |
| US5793365(A) | 1998-08-01 | Tang et al. | Applicant |
| US5794018(A) | 1998-08-01 | Vrvilo et al. | Applicant |
| US5794257(A) | 1998-08-01 | Liu et al. | Applicant |
| US5796394(A) | 1998-08-01 | Wicks et al. | Applicant |
| US5799063(A) | 1998-08-01 | Krane | Applicant |
| US5799072(A) | 1998-08-01 | Vulcan et al. | Applicant |
| US5799150(A) | 1998-08-01 | Hamilton et al. | Applicant |
| US5805587(A) | 1998-09-01 | Norris et al. | Applicant |
| US5805810(A) | 1998-09-01 | Maxwell | Applicant |
| US5805822(A) | 1998-09-01 | Long et al. | Applicant |
| US5809233(A) | 1998-09-01 | Shur | Applicant |
| US5812819(A) | 1998-09-01 | Rodwin et al. | Applicant |
| US5815665(A) | 1998-09-01 | Teper et al. | Applicant |
| US5816919(A) | 1998-10-01 | Scagnelli et al. | Applicant |
| US5818510(A) | 1998-10-01 | Cobbley et al. | Applicant |
| US5818836(A) | 1998-10-01 | DuVal | Applicant |
| US5822524(A) | 1998-10-01 | Chen et al. | Applicant |
| US5825865(A) | 1998-10-01 | Oberlander et al. | Applicant |
| US5828837(A) | 1998-10-01 | Eikeland | Applicant |
| US5828843(A) | 1998-10-01 | Grimm et al. | Applicant |
| US5828846(A) | 1998-10-01 | Kirby et al. | Applicant |
| US5832119(A) | 1998-11-01 | Rhoads | Applicant |
| US5832240(A) | 1998-11-01 | Larsen et al. | Applicant |
| US5835720(A) | 1998-11-01 | Nelson et al. | Applicant |
| US5835723(A) | 1998-11-01 | Andrews et al. | Applicant |
| US5835725(A) | 1998-11-01 | Chiang et al. | Applicant |
| US5838683(A) | 1998-11-01 | Corley et al. | Applicant |
| US5838970(A) | 1998-11-01 | Thomas | Applicant |
| US5841769(A) | 1998-11-01 | Okanoue et al. | Applicant |
| US5842216(A) | 1998-11-01 | Anderson et al. | Applicant |
| US5848143(A) | 1998-12-01 | Andrews et al. | Applicant |
| US5848396(A) | 1998-12-01 | Gerace | Applicant |
| US5854901(A) | 1998-12-01 | Cole et al. | Applicant |
| US5857072(A) | 1999-01-01 | Crowle | Applicant |
| US5864684(A) | 1999-01-01 | Nielsen | Applicant |
| US5867654(A) | 1999-02-01 | Ludwig et al. | Applicant |
| US5867665(A) | 1999-02-01 | Butman et al. | Applicant |
| US5872850(A) | 1999-02-01 | Klein et al. | Applicant |
| US5872922(A) | 1999-02-01 | Hogan et al. | Applicant |
| US5872972(A) | 1999-02-01 | Boland et al. | Examiner |
| US5884032(A) | 1999-03-01 | Bateman et al. | Applicant |
| US5884035(A) | 1999-03-01 | Butman et al. | Applicant |
| US5884077(A) | 1999-03-01 | Suzuki | Examiner |
| US5890162(A) | 1999-03-01 | Huckins | Applicant |
| US5892825(A) | 1999-04-01 | Mages et al. | Applicant |
| US5892903(A) | 1999-04-01 | Klaus | Applicant |
| US5892924(A) | 1999-04-01 | Lyon et al. | Applicant |
| US5903721(A) | 1999-05-01 | Sixtus | Applicant |
| US5903723(A) | 1999-05-01 | Beck et al. | Applicant |
| US5903727(A) | 1999-05-01 | Nielsen | Applicant |
| US5905719(A) | 1999-05-01 | Arnold et al. | Applicant |
| US5905736(A) | 1999-05-01 | Ronen et al. | Applicant |
| US5905865(A) | 1999-05-01 | Palmer et al. | Applicant |
| US5905872(A) | 1999-05-01 | DeSimone et al. | Applicant |
| US5915001(A) | 1999-06-01 | Uppaluru | Applicant |
| US5924093(A) | 1999-07-01 | Potter et al. | Examiner |
| US5925103(A) | 1999-07-01 | Magallanes et al. | Applicant |
| US5928327(A) | 1999-07-01 | Wang et al. | Applicant |
| US5929849(A) | 1999-07-01 | Kikinis | Applicant |
| US5937162(A) | 1999-08-01 | Funk et al. | Applicant |
| US5946386(A) | 1999-08-01 | Rogers et al. | Applicant |
| US5946629(A) | 1999-08-01 | Sawyer et al. | Applicant |
| US5950123(A) | 1999-09-01 | Schwelb et al. | Applicant |
| US5950172(A) | 1999-09-01 | Klingman | Applicant |
| US5953350(A) | 1999-09-01 | Higgins | Applicant |
| US5956482(A) | 1999-09-01 | Agraharam et al. | Applicant |
| US5961584(A) | 1999-10-01 | Wolf | Examiner |
| US5964872(A) | 1999-10-01 | Turpin | Applicant |
| US5969967(A) | 1999-10-01 | Aahlad et al. | Applicant |
| US5982774(A) | 1999-11-01 | Foladare et al. | Applicant |
| US5983005(A) | 1999-11-01 | Monteiro et al. | Applicant |
| US5999965(A) | 1999-12-01 | Kelly | Applicant |
| US6005870(A) | 1999-12-01 | Leung | Applicant |
| US6006257(A) | 1999-12-01 | Slezak | Applicant |
| US6009469(A) | 1999-12-01 | Mattaway et al. | Applicant |
| US6014379(A) | 2000-01-01 | White et al. | Applicant |
| US6014710(A) | 2000-01-01 | Talluri et al. | Applicant |
| US6016393(A) | 2000-01-01 | White et al. | Applicant |
| US6018768(A) | 2000-01-01 | Ullman et al. | Applicant |
| US6018771(A) | 2000-01-01 | Hayden | Applicant |
| US6021126(A) | 2000-02-01 | White et al. | Applicant |
| US6026086(A) | 2000-02-01 | Lancelot et al. | Applicant |
| US6026425(A) | 2000-02-01 | Suguri et al. | Examiner |
| US6029175(A) | 2000-02-01 | Chow et al. | Applicant |
| US6031836(A) | 2000-02-01 | Haserodt | Applicant |
| US6032192(A) | 2000-02-01 | Wegner et al. | Applicant |
| US6041345(A) | 2000-03-01 | Levi et al. | Applicant |
| US6047054(A) | 2000-04-01 | Bayless et al. | Applicant |
| US6047292(A) | 2000-04-01 | Kelly et al. | Applicant |
| US6055594(A) | 2000-04-01 | Lo et al. | Applicant |
| US6061716(A) | 2000-05-01 | Moncreiff | Applicant |
| US6064975(A) | 2000-05-01 | Moon et al. | Applicant |
| US6065048(A) | 2000-05-01 | Higley | Applicant |
| US6069890(A) | 2000-05-01 | White et al. | Applicant |
| US6085217(A) | 2000-07-01 | Ault et al. | Examiner |
| US6101182(A) | 2000-08-01 | Sistanizadeh et al. | Applicant |
| US6105053(A) | 2000-08-01 | Kimmel et al. | Examiner |
| US6108704(A) | 2000-08-01 | Hutton et al. | Applicant |
| US6122255(A) | 2000-09-01 | Bartholomew et al. | Applicant |
| US6125113(A) | 2000-09-01 | Farris et al. | Applicant |
| US6131121(A) | 2000-10-01 | Mattaway et al. | Applicant |
| US6151643(A) | 2000-11-01 | Cheng et al. | Applicant |
| US6154445(A) | 2000-11-01 | Farris et al. | Applicant |
| US6163316(A) | 2000-12-01 | Killian | Applicant |
| US6173044(B1) | 2001-01-01 | Hortensius et al. | Applicant |
| US6178453(B1) | 2001-01-01 | Mattaway et al. | Applicant |
| US6181689(B1) | 2001-01-01 | Choung et al. | Applicant |
| US6185184(B1) | 2001-02-01 | Mattaway et al. | Applicant |
| US6188677(B1) | 2001-02-01 | Oyama et al. | Applicant |
| US6195357(B1) | 2001-02-01 | Polcyn | Applicant |
| US6198303(B1) | 2001-03-01 | Rangasayee | Applicant |
| US6205135(B1) | 2001-03-01 | Chinni et al. | Applicant |
| US6212625(B1) | 2001-04-01 | Russell | Applicant |
| US6226678(B1) | 2001-05-01 | Mattaway et al. | Applicant |
| US6226690(B1) | 2001-05-01 | Banda et al. | Applicant |
| US6240444(B1) | 2001-05-01 | Fin et al. | Applicant |
| US6243373(B1) | 2001-06-01 | Turock | Applicant |
| US6266539(B1) | 2001-07-01 | Pardo | Applicant |
| US6275490(B1) | 2001-08-01 | Mattaway et al. | Applicant |
| US6282272(B1) | 2001-08-01 | Noonen et al. | Applicant |
| US6289369(B1) | 2001-09-01 | Sundaresan | Examiner |
| US6300863(B1) | 2001-10-01 | Cotichini et al. | Applicant |
| US6338078(B1) | 2002-01-01 | Chang et al. | Examiner |
| US6343115(B1) | 2002-01-01 | Foladare et al. | Applicant |
| US6347085(B2) | 2002-02-01 | Kelly | Applicant |
| US6347342(B1) | 2002-02-01 | Marcos et al. | Applicant |
| US6377568(B1) | 2002-04-01 | Kelly | Applicant |
| US6385583(B1) | 2002-05-01 | Ladd et al. | Applicant |
| US6393455(B1) | 2002-05-01 | Eilert et al. | Examiner |
| US6427064(B1) | 2002-07-01 | Henderson | Applicant |
| US6463565(B1) | 2002-10-01 | Kelly | Applicant |
| US6477586(B1) | 2002-11-01 | Achenson et al. | Examiner |
| US6513066(B1) | 2003-01-01 | Hutton et al. | Applicant |
| US6594254(B1) | 2003-07-01 | Kelly | Applicant |
| US6687738(B1) | 2004-02-01 | Hutton | Applicant |
| US6701365(B1) | 2004-03-01 | Hutton | Applicant |
| US6704802(B1) | 2004-03-01 | Finch et al. | Applicant |
| US6728784(B1) | 2004-04-01 | Mattaway | Applicant |
| US6829645(B1) | 2004-12-01 | Hutton | Applicant |
| US6888836(B1) | 2005-05-01 | Cherkasova | Applicant |
| US6909708(B1) | 2005-06-01 | Krishnaswamy et al. | Examiner |
| AU200059377(A1) | 2000-11-01 | Applicant | |
| AU200059378(A1) | 2000-11-01 | Applicant | |
| AU200059379(A1) | 2000-11-01 | Applicant | |
| EP455402(A2) | 1991-11-01 | Applicant | |
| EP518596 | 1992-12-01 | Applicant | |
| EP556012(A2) | 1993-08-01 | Applicant | |
| EP559047 | 1993-09-01 | Applicant | |
| EP581722 | 1994-02-01 | Applicant | |
| EP597691 | 1994-05-01 | Applicant | |
| EP632672 | 1995-01-01 | Applicant | |
| EP648038 | 1995-04-01 | Applicant | |
| EP1379039(A2) | 2004-01-01 | Applicant | |
| EP1379050(A2) | 2004-01-01 | Applicant | |
| GB2283645 | 1995-05-01 | Applicant | |
| JP5944140 | 1984-03-01 | Applicant | |
| JP63-131637 | 1988-03-01 | Applicant | |
| WO-9219054 | 1992-10-01 | Applicant | |
| WO-9422087 | 1994-09-01 | Applicant | |
| WO-9714234 | 1997-04-01 | Applicant | |
| WO-9811704 | 1998-03-01 | Applicant |
Non-Patent Literature (118)
- Lin et al., “A Dynamic Load-Balancing Policy With a Central Job Dispatcher”, IEEE Transactions on Software Engineering, vol. 18, No. 2, pp. 148-158 (Feb. 1992).Examiner
- “Circuit Switching”, Ericsson, last published Jul. 5, 2001, found at http://www.ericsson.com/multiservicenetworks/circuitswitching/axe/ printed on Aug. 1, 2001, 2 pages.Applicant
- “Data Communication Over the Telephone Network”, International Telecommunication Union, CCITT The International Telegraph and Telephone Consultative Committee, Blue Book, vol. VIII—Fascicle VIII.1, IXth Plenary Assembly, Melbourne, Nov. 14-25, 1988, pp. 296-370.Applicant
- “Full Duplex Speakerphone”, IBM Technical Disclosure Bulletin, vol. 29, No. 12, May 1987, pp. 5599-5602.Applicant
- “ICL OPD—One Per Desk”, Issue Aug. 1, 1990, A Comprehensive Technical Information Document (24 pages).Applicant
- “Information Processing Techniques Program. vol. II. Wideband Integrated Voice/Data Technology” Semiannual Technical Summary Report, Massachusetts Institute of Technology Lexington, MA, Oct. 1, 1977-Mar. 31, 1978, Issued Aug. 31, 1978, pp. 1-25 and 27-31 ADA067014.Applicant
- “Integrated Voice/Data PABX Communications”, IBM Technical Disclosure Bulletin, Sep. 1986, http://patents.ibm.com.Applicant
- “Level 1-5 of 65 Stories” 1990 Network World, Inc., Apr. 16, 1990, pp. 114-115.Applicant
- “Multi-Service Networks”, Ericsson, last published Jun. 27, 2001, found at http://www.ericsson.com/multiservicenetworks/circuitswitching/ printed on Aug. 1, 2001, 2 pages.Applicant
- “The History of TPC.INT”, Jan. 15, 1999, 2 pages, found at http://www.tpc.int/faq/history.html printed on Aug. 8, 2002.Applicant
- A. A. Kapauan, et al. “Wideband Packet Access for Workstations: Integrated Voice/Data/Image Services on the UNIX+ PC”, IEEE Global Telecommunications Conference, Houston, Texas, Dec. 1-4, 1986, Conference Record vol. 3, pp. 1439-1441.Applicant
- Ahrens, Richard L., “Frequently-Asked Questions about Internet VoiceChat 1.1 FAQ Version: 1.0”, 1994, 6 pages.Applicant
- Andy Hopper “Pandora—An Experimental System for Multimedia Applications”, Operating Systems Review, Jan. 12, 1990, pp. 1-16.Applicant
- Bennett, Geoff, “Designing TCP/IP Internetworks”, Chapter 11, pp. 290, 291 and 323, Van Nostrand Reinhold, 1995.Applicant
- Bernard Gold “Digital Speech Networks”, Proceedings of the IEEE, vol. 65, No. 12, Dec. 1977, pp. 1636-1658.Applicant
- Bill Newman “An ISDN Data and Voice Terminal Based on a Personal Computer”, Globecom'85, IEEE Global Telecommunications Conference, Conference Record vol. 3, New Orleans, Louisiana, Dec. 2-5, 1985, pp. 1048-1052.Applicant
- Borland, John, “Technology uses one number to find you on any device”, May 17, 2001, 3 pages, found at http://news.cnet.com/news/0-1004-201-5939191-0.html.Applicant
- C. Malamud et al., “Principles of Operation for the TPC.INT Subdomain: General Principles and Policy”, RFC 1530, Oct. 1993, pp. 1-7.Applicant
- C. Malamud et al., “Principles of Operation for the TPC.INT Subdomain: Remote Printing—Administrative Policies”, RFC 1529, Oct. 1993, pp. 1-5.Applicant
- C. Malamud et al., “Principles of Operation for the TPC.INT Subdomain: Remote Printing—Technical Procedures”, RFC 1528, Oct. 1993, pp. 1-12.Applicant
- C. Topolcic “Experimental Internet Stream Protocol. Version 2 (ST-II)”, Request for Comments 1990, Oct. 1990, pp. 1-148.Applicant
- C. Yang, “INETPhone: Telephone Services and Servers on Internet”, Request for Comments 1789, pp. 1-6, Apr. 1995.Applicant
- Carl A. Sunshine, et al. “Broad-Band Personal Computer LAN's”, IEEE Journal on Selected Areas in Communications, vol. SAC-3, No. 3, May 1985, pp. 408-415.Applicant
- Cindy Mueller et al., “ATD Data Services”, http://www.iita.ucar.edu/ws/datawkshop/Abstract-ATD.html, Jan. 5, 1995, 2 pages.Applicant
- Clifford J. Weinstein, et al. “Experience with Speech Communication in Packet Networks” IEEE Journal on Selected Areas in Communications, vol. SAC-1, No. 6, (ISSN 0733-8716), Dec. 1983, pp. 963-980.Applicant
- Comer, Douglas E., “Internetworking with TCP/IP” Principles, Protocols and Architecture, vol. 1, 2nd edition, Prentice Hall Publishing, Englewood Cliffs, Nov. 11, 1991, cover page and pp. vii-xvii, 1-3, 17-19 and 311-333.Applicant
- D. Adolphs, et al. “Adapters for the Public ISDN”, pp. 72-80.Applicant
- D. Perkins “The Point-to-Point Protocol for the Transmission of Multi-Protocol Datagrams Over Point-to-Point Links”, Request for Comments 1171, ftp://ftp.isi.edu/in-notes/rfc1171.txt, Jul. 1990, pp. 1-48.Applicant
- D.C. Swinehart et al., “Adding Voice to an Office Computer Network”, IEEE Global Telecommunications Conference, Nov. 28-Dec. 1, 1983, Conference Record vol. 1 of 3, pp. 392-398.Applicant
- Dale Gulick et al., “Interface the ISDN to Your PC With a Voice/Data Board”, Design Applications, 2328 Electronic Design, 35 (1987) Dec. 10, No. 29, Hashbrouck Heights, NJ, USA, pp. 85-88, XP 000004313.Applicant
- Daniel C. Swinehart “Telephone Management in the Etherphone System”, IEEE/IEICE Global Telecommunications Conference '87, Conference Record vol. 2 of 3, Nov. 15-18, 1987, pp. 1176-1180.Applicant
- Danny Cohen “A Network Voice Protocol NVP-II”, Apr. 1, 1981, pp. 1-68.Applicant
- Danny Cohen “Packet Communication of Online Speech”, AFIPS Conference Proceedings, 1981 National Computer Conference, May 4-7, 1981, Chicago, Illinois, pp. 169-176.Applicant
- Danny Cohen “Specifications for the Network Voice Protocol (NVP)”, Request for Comments 741, Jan. 29, 1976, pp. 1-30.Applicant
- December, John and Randall, Neil, “The World Wide Web Unleashed”, Sams Publishing, Indianapolis, IN, 1994, ISBN 0-672-30617-4, 23 pages.Applicant
- Don H. Johnson, et al. “A Local Access Network for Packetized Digital Voice Communication”, IEEE Transactions on Communications, vol. Com. 29, No. 5, May 1981, pp. 679-688.Applicant
- Douglas B. Terry and Daniel C. Swinehart, “Managing Stored Voice in the Etherphone System”, 1987 ACM 089791-242-X/87/0011/0103, pp. 103-104.Applicant
- Douglas B. Terry and Daniel C. Swinehart, “Managing Stored Voice in the Etherphone System”, ACM Transactions on Computer Systems, vol. 6, No. 1, Feb. 1988, pp. 3-27.Applicant
- Edward J. Weinburg, “Netscape Conference and Cooltalk Meeting Room”, www.q5.com, Feb. 22, 1996, 7 pages.Applicant
- Eve M. Schooler, et al. “A Packet-Switched Multimedia Conferencing System”, SIGOIS Bulletin, pp. 12-22.Applicant
- Gary C. Kessler “ISDN Concepts, Facilities, and Services”, McGraw-Hill, Inc., c1990, pp. 224-231, ISBN 0-07-034242-3.Applicant
- Giulio Barberis, et al. “Coded Speech in Packet-Switched Networks: Models and Experiments” IEEE Journal on Selected Areas in Communications, vol. SAC-1, No. 6, Dec. 1983, pp. 1028-1038.Applicant
- Gull, “Getting IP Address of PPP-Connected Mac”, <[email protected]>, Apr. 3, 1995, 2 pages.Applicant
- Gull, “Internet Phone for Mac?”, <[email protected]>, Apr. 17, 1995, 2 pages.Applicant
- H. Jonathan Chao, et al. “A Packet Video System Using the Dynamic Time Division Multiplexing Technique”, IEEE Global Telecommunications Conference, Houston, Texas, Dec. 1-4, 1988, Conference Record, vol. 3, pp. 0767-0772.Applicant
- H. Opderbeck “Throughput Degredations for Single Packet Messages”, Request for Comments 632, ftp://ftp.isi.edu/in-notes/rfc632.txt, May 20, 1974, pp. 1-6.Applicant
- Harrick M. Vin, et al. “Multimedia Conferencing in the Etherphone Environment”, IEEE, Oct. 1991, pp. 69-79.Applicant
- Henning Schulzrinne “Voice Communication Across the Internet: A Network Voice Terminal”, Jun. 29, 1992, pp. 1-34.Applicant
- Heylighen, Francis, “World-Wide Web: a distributed hypermedia paradigm for global networking”, IEE/INSPEC Database Updates and Additions (1960-1995), Proceedings. SHARE Europe Spring Conference, Apr. 18, 1994, pp. 355-368.Applicant
- Hiroshi Kobayashi and Hideaki Haruyama, “Voice, Data and Video Integrated Broadband Metropolitan Area Network”, Electronics and Communications in Japan, Part 1, vol. 73, No. 11, 1990, pp. 34-42.Applicant
- Hiroyuki Ichikawa et al. “High-Speed Packet Switching Systems for Multimedia Communications”, IEEE Journal on Selected Areas in Communications, Oct. 1987, vol. SAC-5, No. 8 (ISSN 0733-8716), pp. 1336-1345.Applicant
- Ian H. Merritt “Providing Telephone Line Access to a Packet Voice Network”, University of Southern California, Marina Del Rey. Information Sciences Inst. Feb. 1983, ADA126270.Applicant
- Inder Gopal et al., “Directories for Networks with Casually Connected Users”, IEEE, 1988.Applicant
- International Preliminary Examination Report (IPER) issued Mar. 26, 1998 in corresponding International Application Serial No. PCT/US96/15504.Applicant
- International Search Report issued Jan. 27, 1998 in corresponding International Application Serial No. PCT/US96/15504.Applicant
- Israel Gitman, et al. “Economic Analysis of Integrated Voice and Data Networks: A Case Study” Proceedings of the IEEE, vol. 66, No. 11, Nov. 1978, pp. 1549-1570.Applicant
- J. Huelamo, et al. “End User Premises Equipment and Terminals for Broadband Applications”, Electrical Communication, vol. 64, No. 2/3, 1990.Applicant
- J. K. Reynolds et al., Voice File Interchange Protocol (VFIP), Request for Comments 978, ftp://ftp.isi.edu/innotes/rfc978.txt, Feb. 1986, pp. 1-5.Applicant
- J. Romkey “A Nonstandard For Transmission of IP Datagrams Over Serial Lines: Slip”, Request for Comments 1055, ftp://ftp.isi.edu/in-notes/std/std47.txt, Jun. 1988, pp. 1-6.Applicant
- James D. Mills, et al. “A data and voice system for the general service telephone network”, Proceedings IECON '87, 1987 International Conference on IND. Electronics, Control, and Instrumentation, Cambridge, Massachusetts, Nov. 3-6, 1987.Applicant
- James W. Forgie “Speech Transmission in Packet-Switched Store-and-Forward Networks”, AFIPS Conference Proceedings, 1975 National Computer Conference, May 19-22, 1975, Anaheim, California, pp. 137-142.Applicant
- James W. Forgie “Voice Conferencing in Packet Networks”, ICC '80, Conference Record, International Conference on Communications, Seattle, WA, Jun. 8-12, 1980, vol. 1, 80CH1505-6 CSCB, pp. 21.3.1-21.3.4.Applicant
- Jane's Military Communications 1979-80, pp. 452 and 453.Applicant
- Jane's Military Communications 1985, pp. 585, 546, and 545.Applicant
- Jane's Military Communications 1989, Tenth Edition, Edited by John Williamson, ISBN 0710608772, pp. 443, 507, and 512.Applicant
- Jane's Military Communications 1990-91, Eleventh Edition, Edited by John Williamson, ISBN 0710609000, pp. [30], 264, 357, 398, 406, 450, 454, 456, 560, 572, 573, 814, 815, and 816.Applicant
- Jane's Military Communications 1992-93, Thirteenth Edition, Edited by John Williamson, ISBN 0710609809, pp. 375, 376, 384, and 704.Applicant
- Jim Stevens, “Much More Idle Chatter About Reference Models”, http://www-mice.cs.ucl.ac.uk/multimedia/misc/tcp—ip/8709.mm.www/0041.html, Dec. 18, 1987, pp. 1-9.Applicant
- John Bellamy, “Digital Telephony”, c1982 John Wiley & Sons, Inc., pp. 392-397 and 410-412.Applicant
- K. Sohraby, et al. “ISDN Primary Rate Interface Impact on Performance of Integrated Voice and Data on CSMA/CD Networks—A Measurement and Simulation Study”, Globecom '90 IEEE Global Telecommunication Conference & Exhibition, San Diego, California, Dec. 2-5 1990 vol. 2 pp. 0912-0919.Applicant
- Ken Sherman “Data Communications—A User's Guide”, 3rd Edition, c1981 Prentice-Hall, Inc., pp. 296-307 and 404-407.Applicant
- Kevin Jefffay, et al. “Kernel Support for Live Digital Audio and Video”, pp. 10-21, University of North Carolina at Chapel Hill, Department of Computer Science.Applicant
- Kyuta Saito, et al. “Voice Packet Communication System for Private Networks”, Globecom '89, IEEE Global Telecommunications Conference & Exhibition, Dallas, Texas, Nov. 27-30, 1989, vol. 3, pp. 1874-1878.Applicant
- Lawrence G. Roberts “The Evolution of Packet Switching”, Proceedings of the IEEE, vol. 66, No. 11, Nov. 1978, pp. 1307-1313.Applicant
- M. E. Ulug, et al. “Statistical Multiplexing of Data and Encoded Voice in a Transparent Intelligent Network”, Fifth Data Communications Symposium, Sep. 27-29, 1977, Snowbird, Utah, pp. 6-14-6-20.Applicant
- M. Gopalakrishnan, et al. “Integrating Voice and Data SALAN: An Experimtental Local Area Network”, Computer Communications, vol. 9, No. 4, Aug. 1986, pp. 186-194 and p. 169.Applicant
- M.J. Ross “Alternatives for Integrating Voice and Data”, 1981 International Switching Symposium, ISS'81 CIC Montreal, Sep. 21-25, 1981.Applicant
- Natesa Janakiraman “An Overview of Recent Developments in the Designs and Applications of Customer Premises Switches”, IEEE Communications Magazine, Oct. 1985, vol. 23, No. 10, pp. 32-45.Applicant
- P. Borgnis-Desbordes, et al. “Variable-Speed Data Transmission”, IBM Technical Disclosure Bulletin, vol. 27, No. 4A, Sep. 1984, pp. 2269-2270.Applicant
- P. Venkat Rangan and Daniel C. Swinehart, “Software Architecture for Integration of Video Services in the Etherphone System”, IEEE Journal on Selected Areas in Communication, vol. 9, No. 9, Dec. 1991, pp. 1395-1404.Applicant
- Paul Gilster, “Internet Navigator”, Maruzen Kabushiki-Kaisha (1st Ed.), pp. 473-476, Feb. 28, 1995.Applicant
- Philip H. Reagan, “Is it the PBX or is it the LAN?”, Datamation, The Telecom Manager Emerges, Mar. 1984, vol. 30 No. 3, pp. 3-4, 147, 148, 150.Applicant
- Polle T. Zellweger et al., “An Overview of the Etherphone System and its Applications”, 2nd IEEE Conference on Computer Workstations, Mar. 7-10, 1988, pp. 160-168.Applicant
- R. Braudes et al., “Requirements for Multicast Protocols”, Request for Comments 145B, Network Working Group, May 1993, pp. 1-19.Applicant
- R. W. Meba, et al. “Experiments in Wideband Packet Technology”, Digital Communications—New Directions in Switching and Networks, Proceedings of the International Seminar, Zurich, Switzerland, Mar. 11-13, 1986, pp. 135-139.Applicant
- R.P. McNamara, “Some Considerations of the Voice-Data Capabilities of Broadband Cable Networks”, IEEE Digest of Papers Spring CompCon 82, Feb. 22-25, 1982, pp. 312-314.Applicant
- Randy Cole “Packet Voice: When It Makes Sense”, Speech Technology, Sep./Oct. 1982, pp. 52-61.Applicant
- Scott Flinn, “Coordinating Heterogeneous Time-Based Media Between Independent Applications” ACM Multimedia 95—Electronic Proceedings Nov. 5-9, 1995, pp. 1-16.Applicant
- Shimmi Hattori et al., “Integrated Digital Switching System with Queueing Storage Facility”; IEEE Transactions on Communications, vol. Com-30, No. 8, Aug. 1982, pp. 1900-1905, (ISSN 0090-6778).Applicant
- Steve Oltmanns, et al. “A Voice and Communications System for the IBM PC”, Speech Technology, Mar./Apr. 1986, pp. 94-99.Applicant
- Stuart Cheshire et al., “Internet Mobility 4×4”, www.acm.org, 1996, pp. 1-12.Applicant
- Susan Angebranndt et al., “Integrating Audio and Telephony in a Distributed Workstation Environment”, Proceedings of the Summer 1991 USENIX Conference, Jun. 10-14, 1991, Nashville, Tennessee, pp. 419-435.Applicant
- T. Kamae “Visual Terminals and User Interfaces”, FGCS North-Holland, pp. 257-278.Applicant
- T. Kamae, “Voice/Data Integration in the INS Model System and Local Area Networks” IEEE Communications Magazine, Dec. 1986, vol. 24, No. 12, pp. 7-15.Applicant
- T7540 Digital Telephone Codec, AT&T Microelectronics, Jan. 1991, pp. 1-62 and Data Sheet Addendum, Jul. 1991, 4 pages.Applicant
- Takashi Yamada, et al. “New Technologies—Multimedia High-throughput X.25 Packet Switching System”, NTT Review, vol. 1, No. 2, Jul. 1989, pp. 82-88.Applicant
- Tamohiro Kawai, “Debut of Call Software in Internet”, Nikkei Communications, No. 202, pp. 29-30, Nikkei BP, Jul. 17, 1995.Applicant
- Theodore Bially, et al. “Voice Communication in Integrated Digital Voice and Data Networks”, IEEE Transactions on Communications, vol. Com-28, No. 9, Sep. 1980, pp. 1478-1490.Applicant
- Toru Tsuda, et al. “An Approach to Multi-Service Subscriber Loop System Using Packetized Voice/Data Terminals” ISSLS '78, The International Symposium on Subscriber Loops and Services, Mar. 20-24, 1978, Atlanta, Georgia, Conference Record, pp. 161-165.Applicant
- V. Jacobson, et al. “TCP Extension for High-Speed Paths”, Request for Comments 1185, ftp://ftp.isi.edu/in-notes/rfc1185.txt, Oct. 1990, pp. 1-21.Applicant
- V. Jacobson, et al. “TCP Extensions for High Performance”, Request for Comments 1323, ftp://ftp.isi.edu/in-notes/rfc1323.txt, May 1992, pp. 1-37.Applicant
- Vinton, G. Cerf, “Packet Satellite Technology Reference Sources”, Request for Comments 829, Nov. 1982, http://www.cis.ohio-state.edu/htbin/rfc/rfc829.html, pp. 1-5.Applicant
- VocalTec internet Phone (TM) Version 2.5 Readme, VocalTec Ltd., Feb. 1995, 5 pages.Applicant
- Written Opinion issued Feb. 12, 1998 in corrresponding International Application Serial No. PCT/US96/15504.Applicant
- David Strom, “Talking Telephony”, Windows Sources, Ziff-Davis Publishing Company, Sep. 1996, vol. 4, No. 9, pp. 6, 7, 10, 150-152, 157, 158, 163, 167, 171, 174, 181, 184, 186, 195, 203, 208.Applicant
- Emad Farag et al., “Structure and network control of a hierarchical mobile network architecture”, IEEE Fourteenth Annual International Phoenix Conference on Computers and Communications, Mar. 1995, ISBN: 0-7803-2492-7, pp. 671-677.Applicant
- H. Schulzrinne et al., “RTP: A Transport Protocol for Real-Time Applications”, Network Working Group Request for Comments 1889, Jan. 1996, 75 pages.Applicant
- Huanxu Pan et al., “Analysis of a CCSS#7 Network supporting database services”, IEEE International Conference on Information Engineering, Sep. 1993, ISBN: 0-7803-1445-X, pp. 193-197, vol. 1.Applicant
- John E. Goodwin, Project Gutenberg Alpha Edition fo EMAIL 101, http://metalab.unc.edu/pub/docs/books/gutenberg/etext93/email025.txt, Jul. 1993.Applicant
- Mark R. Brown et al. “Special Edition: Using Netscape 2”, Que Publishing, 1995, ISBN 0-7897-0612-1, pp. 7-35, 37-56, 78, 83, 176, 301-320, 393, 395-467, 469-506.Applicant
- Preston Gralla, “How the Internet Works”, Ziff-Davis Press, Emeryville, CA, c1997, pp. 34-37, 202-205, 214-215 and 272-275, ISBN 1-56276-552-3.Applicant
- Co-pending U.S. Appl. No. 08/719,639, filed Sep. 25, 1996.Applicant
- Co-pending U.S. Appl. No. 08/974,329, filed Nov. 19, 1997.Applicant
- Co-pending U.S. Appl. No. 09/998,742, filed Nov. 30, 2001.Applicant
- Co-pending U.S. Appl. No. 09/640,406, filed Aug. 17, 2000.Applicant
- Co-pending U.S. Appl. No. 10/796,335, filed Mar. 8, 2004.Applicant
- Co-pending U.S. Appl. No. 08/719,891, filed Sep. 25, 1996.Applicant
- Co-pending U.S. Appl. No. 08/719,898, filed Sep. 25, 1996.Applicant