Transport of caller identification information through diverse communication networks

- Verizon Services Corp.

A voice call is transported through diverse network paths including a switched telephone network and a wide area data internetwork, for example, the Internet. In routing the call, common channel signalling is used to provide data identifying a calling subscriber line from a calling PSTN, which information can then be transported through the separate data internetwork to the destination PSTN, at which the data is then extracted and sent to the called subscriber line while completing routing of the call. A route for the call is established at gateways connected to the data internetwork at the interface points with the calling and destination PSTNs, calling subscriber line information and dialed digit information being conveyed to the gateways. The destination end gateway initiates a call connection to the calling subscriber line via the destination PSTN to complete routing of the call, while supplying identification of the calling subscriber line in a form recognized as such by the called PSTN. The called party central office can then provide caller ID services.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description
RELATED APPLICATIONS

This application is a continuation of application Ser. No. 08/822,602 now U.S. Pat. No. 6,292,479 filed Mar. 19, 1997.

This application is related to application Ser. No. 08/821,027, filed Mar. 3, 1997 and entitled Voice Call Alternative Routing Through PSTN And Internet Networks, application Ser. No. 08/634,544, entitled Universal Access Multimedia Network, filed Apr. 18, 1996 (now U.S. Pat. No. 5,790,548), application Ser. No. 08/634,543, entitled Internet Telephone Service, filed Apr. 18, 1996 and application Ser. No. 08/670,908, entitled Internet Telephone System, filed Jun. 28, 1996 (now U.S. Pat. No. 6,069,890). The specification of those applications are incorporated herein by reference in their entirety.

TECHNICAL FIELD

The present invention relates to telecommunications networks and more particularly to the transport of a voice call through diverse network paths including a switched telephone network and a wide area data internetwork, for example, the Internet. The routing set-up for such call includes conveyance of caller identification information to the destination network to enable provision of caller information based enhanced services to subscribers.

BACKGROUND OF THE INVENTION

Implementation of voice telephone service over a worldwide data network, such as the Internet, offers advantages that are now being explored. The Internet basically comprises several large computer networks joined together over high-speed data links ranging from ISDN to T1, T3, FDDI, SONET, SMDS, OT1, etc.

A computer network is simply a collection of autonomous computers connected together to permit sharing of hardware and software resources, and to increase overall reliability. The qualifying term “local area” is usually applied to computer networks in which the computers are located in a single building or in nearby buildings, such as on a college campus or at a single corporate site. When the computers are further apart, the terms “wide area network” or “long haul network” are used, but the distinction is one of degree and the definitions sometimes overlap.

A bridge is a device that is connected to at least two LANs and serves to pass message frames or packets between LANs, such that a source station on one LAN can transmit data to a destination station on another LAN, without concern for the location of the destination. Bridges are useful and necessary network components, principally because the total number of stations on a single LAN is limited. Bridges can be implemented to operate at a selected layer of protocol of the network.

In operation, computer networks are governed by protocols, i.e., sets of conventions or rules that govern the transfer of data between computer devices. The simplest protocols define only a hardware configuration, while more complex protocols define timing, data formats, error detection and correction techniques, and software structures. Protocols generally are employed in multiple layers. A low-level physical layer protocol assures the transmission and reception of a data stream between two devices. Data packets are constructed in a data link layer. Over the physical layer, a network and transport layer protocol governs transmission of data through the network, thereby ensuring end-to-end reliable data delivery.

The Internet is a collection of networks, including Arpanet, NSFnet, regional networks such as NYsernet, local networks at a number of university and research institutions, and a number of military networks. TCP/IP protocols provide a set of services that permit users to communicate with each other across the entire Internet. The specific services that these protocols provide include file transfer, remote log-in, remote execution, remote printing, computer mail, and access to network file systems.

The basic function of the Transmission Control Protocol (TCP) is to ensure that commands and messages from an application protocol, such as computer mail, are sent to their desired destinations. TCP provides for keeping track of what is sent, and for retransmitting anything that does not get to its destination correctly. If any message is too long to be sent as one “datagram,” it will be split into multiple datagrams and TCP protocol ensures that they all arrive correctly and are reassembled for the application program at the receiving end. Since these functions are needed for many applications, they are collected into a separate protocol (TCP) rather than being part of each application.

The Internet Protocol (IP) provides a basic service to TCP: delivering datagrams to their destinations. TCP in effect hands IP a datagram with an intended destination; IP is unaware of any relationship between successive datagrams, and merely handles routing of each datagram to its destination. If the destination is a station connected to a different LAN, the IP makes use of routers to forward the message.

TCP/IP operates as a five layer protocol, the five layers generally described as follows:

Layer 5—The Application Layer. Applications such as ftp, telnet, SMTP, and NFS relate to this layer.

Layer 4—The Transport Layer. In this layer, TCP and UDP add transport data to the packet and pass it to layer 3.

Layer 3—The Internet Layer. When an action is initiated on a local host (or initiating host) that is to be performed or responded to on a remote host (or receiving host), this layer takes the package from layer 4 and adds IP information before passing it to layer 2.

Layer 2—The Network Interface Layer. This is the network device as the host, or local computer, sees it and it is through this medium that the data is passed to layer 1.

Layer 1—The Physical Layer. This is literally the Ethernet or Serial Line Interface Protocol (SLIP) itself.

At the receiving host the layers are stripped one at a time, and their information is passed to the next highest level until it again reaches the application level. If a gateway exists between the initiating and receiving hosts, the gateway takes the packet from the physical layer, passes it through a data link to the IP physical layer to continue. As a message is sent from the first host to the second, gateways pass the packet along by stripping off lower layers, readdressing the lower layer, and then passing the packet toward its final destination.

A router, like a bridge, is a device connected to two or more LANs. Unlike a bridge, however, a router operates at the network layer level, instead of the data link layer level. Addressing at the network layer level may make use of a 32-bit address field for each host, and the address field includes a unique network identifier and a host identifier within the network. Routers make use of the destination network identifier in a message to determine an optimum path from the source network to the destination network. Various routing algorithms may be used by routers to determine the optimum paths. Typically, routers exchange information about the identities of the networks to which they are connected.

When a message reaches its destination network, a data link layer address is needed to complete forwarding to the destination host. Data link layer addresses are 48 bits long and are globally unique, i.e., no two hosts, wherever located, have the same data link layer address. A protocol called ARP (address resolution protocol) obtains a data link layer address from the corresponding network layer address (the address that IP uses). Typically, each router maintains a database table from which it can look up the data link layer address, but if a destination host is not in this ARP database, the router can transmit an ARP request throughout the network that asks a host having the network layer address to supply its data link layer address in a return message. Only the addressed destination host responds, and the router is then able to insert the correct data link layer address into the message being forwarded, and to transmit the message to its final destination.

IP routing specifies that IP datagrams travel through internetworks one hop at a time (next hop routing) based on the destination address in the IP header. The entire route is not known at the outset of the journey. Instead, at each stop, the next destination (or next hop) is calculated by matching the destination address within the datagram's IP header with an entry in the current node's (typically but not always a router) routing table.

Each node's involvement in the routing process consists only of forwarding packets based on internal information resident in the router, regardless of whether the packets get to their final destination. IP routing does not alter the original datagram; the datagram source and destination addresses remain unaltered. The IP header always specifies the IP address of the original source and the IP address of the ultimate destination.

When IP executes the routing algorithm it computes a new address, the IP address of the machine/router to which the datagram should be sent next. This algorithm uses the information from the routing table entries, as well as any cached information local to the router. This new address is most likely the address of another router/gateway. If the datagram can be delivered directly (the destination network is directly attached to the current host) the new address will be the same as the destination address in the IP header. Reference is made to the above identified copending patent application Ser. No. 08/753,198 filed Nov. 21, 1996 for a further detailed description of routers with respect to IP protocol functionality.

A simplified diagram of the Internet is depicted in FIG. 1. The Internet 50 comprises Autonomous Systems (AS) which may be owned and operated by Internet Service Providers (ISPs) such as PSI, UUNET, MCI, SPRINT, etc. Three such AS/ISPs are shown in FIG. 1 at 52, 54 and 56. The Autonomous Systems (ASs) are linked by Inter-AS Connections 58, 60 and 62. Information Providers (IPs) 64 and 66, such as America Online (AOL) and Compuserve, are connected to the Internet via high speed lines 68 and 70, such as T1/T3 and the like. Information Providers generally do not have their own Internet based Autonomous Systems but have or use Dial-Up Networks such as SprintNet (X.25), DATAPAC and TYMNET.

By way of current illustration, MCI is both an ISP and an IP, Sprint is an ISP, and MicroSoft (MSN) is an IP using UUNET as an ISP. Other information providers, such as universities, are indicated in exemplary fashion at 72 and are connected to the AS/ISPs via the same type connections, here illustrated as T1 lines 74. Corporate Local Area Networks (LANs), such as those illustrated at 76 and 78, are connected through routers 80 and 82 and links shown as T1 lines 84 and 86. Laptop or PC computers 88 and 90 are representative of computers connected to the Internet via the public switched telephone network (PSTN), shown connected to the AS/ISPs via dial up links 92 and 96.

The Information Providers (IPs) are end systems that collect and market the information through their own servers. Access providers are companies such as UUNET, PSI, MCI and SPRINT which transport the information. Such companies market the usage of their networks.

Thus, in simplified fashion the Internet may be viewed as a series of gateway routers connected together with computers connected to the routers. In the addressing scheme of the Internet an address comprises four numbers separated by dots. An example would be 164.109.211.237. Each machine on the Internet has a unique number that includes one of these four numbers. In the address, the leftmost number is the highest number. By analogy this would correspond to the ZIP code in a mailing address. The first two numbers that constitute this portion of the address may indicate a network or a locale. That network is connected to the last router in the transport path. In differentiating between two computers in the same destination network only the last number field changes. In such an example the next number field 211 identifies the destination router. When the packet bearing the destination address leaves the source router it examines the first two numbers in a matrix table to determine how many hops are the minimum to get to the destination. It then sends the packet to the next router as determined from that table and the procedure is repeated. Each router has a database table that finds the information automatically. This process continues until the packet arrives at the destination computer. The separate packets that constitute a message may not travel the same path, depending on traffic load. However, they all reach the same destination and are assembled in their original sequence order in a connectionless fashion. This is in contrast to connection oriented modes such as frame relay and ATM or voice.

Connection-oriented network services require that users establish a single distinct virtual circuit before the data can be transmitted. This circuit then defines a fixed path through the network that all traffic follows during the session. Several packet switching services are connection-oriented, notably X.25 and Frame Relay. X.25 is the slower of the services, but has built-in error correction—enough for its performance not to depend on clean, high-quality optical fiber lines. Frame relay, regarded as the first generation of fast packet technology, is well-suited for high-speed bursty data communication applications.

Connectionless network services, by contrast, let each packet of a communications session take a different, independent path through the network. One example is the Switched Multimegabit Data Service (SMDS), a possible precursor to broadband ISDN. This fast-packet service supports data rates ranging from the T1 rate of 1.544 Mb/s up to 1 Gb/s. The SMDS transport system architecture is defined by IEEE 802.6 Metropolitan Area Network standards.

Software has recently been developed for use on personal computers to permit two-way transfer of real-time voice information via an Internet data link between two personal computers. In one of the directions, the sending computer converts voice signals from analog to digital format. The software facilitates data compression down to a rate compatible with modem communication via a POTS telephone line. The software also facilitates encapsulation of the digitized and compressed voice data into the TCP/IP protocol, with appropriate addressing to permit communication via the Internet. At the receiving end, the computer and software reverse the process to recover the analog voice information for presentation to the other party. Such programs permit telephone-like communication between Internet users registered with Internet Phone Servers. The book “Mastering the Internet”, Glee Cady and Pat McGregor, SYBEX Inc., Alameda, Calif., 1994, ISBN 94-69309, very briefly describes three proprietary programs said to provide real-time video and voice communications via the Internet.

The commonly assigned application Ser. Nos. 08/634,543 and 08/670,908, identified more particularly above, are concerned with providing telephone service via the Internet to users of the public telecommunications network who may not have access to a computer or separate telephone access to the Internet. Such service would be economical, especially for long distance calls, compared with the toll rates charged by long distance interexchange carriers.

The routing of real time voice telephone calls through a wide area data internetwork, such as the Internet, presents challenges to telephone company service providers with respect to providing all of the enhanced services that are currently available for calls that are routed entirely through the traditional public switched telephone network. One group of such services is based in the use of calling party identification.

For example, the caller ID service, with its various enhancements, is a telephone on-hook capability that provides a called party with information about the caller before the incoming call is answered. Conventionally, such information includes the date and time of the call and the caller's telephone number. Expanded versions provide additional information. A data message, preceded by a channel seizure signal, is sent in conjunction with the ringing signal from the central office to the called party during the silent interval after the first 20-Hz, 2-second ringing phase. To perform these functions, the central office must have available the calling party information.

Other services involve various subscriber options to a called party who has not answered a call by reason, for example, of the line being in a busy condition at the time of the call or there being no answer by the called party. By later dialing a particular code of DTMF keys, a party at the called subscriber line station may obtain the identity of the last caller or may have the number of the last caller automatically dialed (known as “return call”). These services also require that the calling party identification information for the last call be available to the central office. The term “caller ID services,” as used hereinafter throughout this disclosure is intended to refer to these various services, briefly described above.

A problem with earlier proposed voice Internet service systems is the inability to provide the destination public switched telephone network the appropriate caller identification information inasmuch as calls are routed from an external network to the destination public switched telephone network. With current implementations, a gateway router, i.e., the node in the Internet that initiates connection of a call to the destination PSTN, would be identified as the calling party source. Caller information identification services would not provide actual caller information under these conditions; instead, the called party would be subject to receiving useless information. In the return call service example, dialing of the appropriate code would result in a call placed to the gateway router as a final destination. The purpose of return call, of course, is to establish connection to the last caller, by whatever communication path, not necessarily to establish connection with the Internet.

BRIEF SUMMARY OF THE INVENTION

The present invention overcomes the above noted drawbacks of earlier proposed systems and provides additional advantages in part by providing the actual directory number of a calling party in the information conveyed throughout the course of set up of a voice call through a data network.

An advantage of the present invention is the use, in routing a voice call, of common channel signalling to provide data identifying a calling subscriber line from a calling PSTN, which information can then be transported through a separate data internetwork to the destination PSTN, at which the data is then extracted and sent to the called subscriber line while completing routing of the call. A route for the call is established at gateways connected to the data internetwork at the interface points with the calling and destination PSTNs, calling subscriber line information and dialed digit information being conveyed to the gateways. The destination end gateway initiates a call connection to the called subscriber line via the destination PSTN to complete routing of the call, while supplying identification of the calling subscriber line in a form recognized as such by the called PSTN. The called party central office can then provide caller ID services.

A further advantage of the present invention is the use of a gateway server connectable to the data internetwork to interface with the destination PSTN through a connection recognizable by the PSTN. Calling party identification conveyed through this connection can be distinguished by the receiving PSTN from data identifying the gateway.

Additional advantages of the present invention will become readily apparent to those skilled in this art from the following detailed description, wherein only the preferred embodiment of the invention is shown and described, simply by way of illustration of the best mode contemplated for carrying out the invention. As will be realized, the invention is capable of other and different embodiments, and its several details are capable of modifications in various obvious respects, all without departing from the invention. Accordingly, the drawings, throughout the various figures of which like elements are depicted by the same reference numerals, and description are to be regarded as illustrative in nature, and not as restrictive.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a simplified diagram of the Internet.

FIG. 2 is a simplified block diagram of a Public Switched Telephone Network (PSTN) that comprises a Common Channel Interoffice Signaling (CCIS) system and voice communication network that perform as an Advanced Intelligent Network (AIN) system.

FIG. 3 is a simplified block diagram illustrating the architecture of a telecommunications system using a wide area packet switched network such as the Internet, in combination with a plurality of PSTNs as used in the present invention.

FIG. 4 is a block diagram of a preferred embodiment of a gateway 20 of FIG. 3.

FIGS. 5a and 5b, taken together, form a flow diagram exemplifying processing of a call routed through the architecture illustrated in FIGS. 3 and 4 according to the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 2 is a depiction of the architectural environment of a switched telephone network that is considerably simplified for explanation purposes. The full network and operating environment for a PSTN comprises multiple central offices, diverse interconnections, and provisions for reliability through redundancy, all of which need not be shown for developing an understanding of the invention. Service Switching Points (SSPs) 11, 13, 15, 17 represent central office (CO) switching systems that are appropriately equipped programmable switches present in the telephone network. Subscriber lines individually connect SSPs to subscriber premises at which locations telephones 12 or other communication devices are connected. In the well known Advanced Intelligent Network (AIN), the SSPs recognize AIN type calls, launch queries to the ISCP and receive commands and data from the ISCP to further process the AIN calls. In the illustrated embodiment, the CO-SSPs are end offices.

SSP capable central office switching systems typically contain a programmable digital switch with CCIS communications capabilities. One example of an SSP capable CO switch is a 5ESS type switch manufactured by AT&T. Other vendors, such as Northern Telecom and Seimens, manufacture comparable digital switches that may serve as the SSPs. A more detailed description of an exemplary SSP type CO is presented in the commonly assigned copending application Ser. No. 08/248,980, filed May 25, 1994, hereby incorporated by reference herein.

The SSP type COs 11 and 13 are shown connected to a first local area STP 23, SSP-COs 15 and 17 being connected to a second local area STP 25. The connections to the STPs are for signalling purposes. The control part of SS7 protocol is known as Integrated Services Digital Network User Part (ISUP). ISUP determines the procedures for setting up, coordinating, and taking down trunk calls on the SS7 network.

Signaling between switching offices is required for transmitting routing and destination information, for transmitting alerting messages such as to indicate the arrival of an incoming call, and for transmitting supervisor information, e.g. relating to line status. Signaling between offices can use ‘in-band’ transport or ‘out-of-band’ transport.

In-band signaling utilizes the same channel that carries the communications of the parties. In a voice telephone system, for example, one of the common forms of in-band signaling between offices utilizes multi-frequency signaling over voice trunk circuits. The same voice trunk circuits also carry the actual voice traffic between switching offices. In-band signaling, however, tends to be relatively slow and ties up full voice channels during the signaling operations. In telephone call processing, a substantial percentage of all calls go unanswered because the destination station is busy. For in-band signaling, the trunk to the end office switching system serving the destination is set-up and maintained for the duration of signaling until that office informs the originating office of the busy line condition. Thus, in-band signaling greatly increases congestion on the voice traffic channels. In-band signaling also is highly susceptible to fraud by hackers who have developed devices that mimic in-band signaling.

Out-of-band signaling has evolved to mitigate the above-described problems. Out-of-band signaling utilizes separate channels, and in many cases separate switching elements. Congestion on the channels carrying the actual communication traffic is thereby considerably reduced. Unauthorized simulation of signaling messages which ride on an out-of-band channel or network is virtually impossible. As out-of-band signaling utilizes its own signal formats and protocols, unconstrained by protocols and formats used for the actual communication, out-of-band signaling typically is considerably faster than in-band signaling.

Out-of-band signaling networks typically include data links and one or more packet switching systems. Out-of-band signaling for telephone networks is often referred to as Common Channel Signaling (CCS) or Common Channel Interoffice Signaling (CCIS). Most such signaling communications for telephone networks utilize signaling system 7 (SS7) protocol. An SS7 compliant CCIS network, such as illustrated in FIG. 2, comprises data Signal Transfer Points (STPs) and data links between the STPs and various telephone switching offices of the network. The STPs are program controlled packet data switching systems. In normal call processing operation, an STP will receive a packet data message from another node of the network, for example from an end office switching system. The STP analyzes point code information in the packet and routes the packet according to a translation table stored within the STP. This translation table is static. Any packet having a particular point code is output on a port going to the next CCIS signaling node specified by translation of that point code. For a more detailed description of the makeup of SS7 messages and their specific component purposes, reference is made to commonly assigned copending application Ser. No. 08/753,198 filed Nov. 21, 1996, identified above.

Each local area STP can connect to a large number of the SSP-COs, as indicated for ease of illustration merely by the circles below STPs 23 and 25. The central office SSPs are interconnected to each other by trunk circuits for carrying telephone services. The overall network may contain end offices without SSP functionality. Such end offices will forward calls to one of the SSPs if such treatment is required. Also, certain switching offices within the network, whether SSPs or not, may function primarily as tandem type offices providing connections between trunk circuits only.

The local area STPs 23 and 25, and any number of other such local area STPs (not shown) communicate with a state or regional STP 31. The state or regional STP 31 in turn provides communications with the ISCP 40. The STP hierarchy can be expanded or contracted to as many levels as needed to serve any size area covered by the Advanced Intelligent Network (AIN) and to service any number of stations and central office switches. Also, certain switching offices within the network, whether SSPs or not, may function primarily as tandem type offices providing connections between trunk circuits only. The links between the central office switching systems and the local area STPs 23 and 25 are typically SS#7 type CCIS interoffice data communication channels. The local area STPs are in turn connected to each other and to the regional STP 31 via a packet switched network. The regional STP 31 also communicates with the ISCP 40 via a packet switched network.

The network shown in FIG. 2, for purposes of explanation of the present invention, may be considered to be one PSTN or a combination of a plurality of PSTNs, depending upon the extent of the geographical area serviced. The networks shown may serve different regions of the country and be operated by different local exchange carriers. Alternatively, one network may be a local exchange carrier network, and another network may comprise an interexchange carrier network.

FIG. 3 is a block diagram illustrating the architecture of a telecommunications system using a wide area packet switched network such as the Internet, in combination with a plurality of PSTNs as used in the present invention. PSTNs 10a, 10b, and 10c may be considered to be operating in different geographical regions. For example, each network may be a public switched telephone network such as a Regional Bell Operating Company (RBOC), or a private communication network having a limited service area. Each network has at least one assigned number code, such as an area code, that uniquely identifies service areas of that network. Each network also includes a plurality of interconnected switching systems 13 serving customer premises terminals 11 via local loop connections 14. Each network 10 also includes trunk lines 16 and signaling lines 18 that support the interoffice signaling for the particular network.

Each telephone system also includes a gateway 20 that functions as an Internet telephony server, providing an interface between the corresponding telephone system 10 and the Internet. It is to be understood that the use of the terms Internet and data internetwork and the like are all used interchangeably herein to denote a wide area packet switched network that may comprise interconnected subnetworks. Similarly the term “gateway” may be variously described as an Internet module or interface, gateway server, or gateway router. The gateway 20 is typically connected to a local central office 13 via a standard voice grade line or trunk connection 22, for example a T-1 or T-3 connection. Alternatively the hardware associated with the gateway 20 may be situated at the central office 13 and associated with the switching system.

The gateways 20 include signaling capabilities, for example SSP capabilities, and are connected into the CCIS network as indicated by the links 24 to the illustrative STP 26. The SSPs serving the corresponding gateway 20 are inter-connected with the central office SSPs and CCIS network. The gateways may be linked to the networks for signaling purposes by conventional F links. As an alternative to the illustrated arrangement, the gateways may be directly linked to the STPs. The gateways are connected to the Internet by T1/T3 trunks 26.

A routing and administration server (RAS) 30, linked to the Internet, includes a routing and administration database for managing call routing translations and user access permissions. The RAS 30 is shown as an Internet node having a dedicated virtual path 32. The routing and administration database stores records for every area code/NNX served by a telephony system 10, along with the network address for the corresponding gateway 20.

FIG. 4 is a block diagram of a preferred embodiment of a gateway 20 of FIG. 3. The gateway comprises a telephony platform 100 and an Internet server platform 102. The telephony platform 100 performs basic telephony functions, including incoming call detection (ringing, trunk seizure, etc.), call supervision/progress detection (busy tone, disconnect, connect, recorded announcement, dialtone, speech, etc.), call origination, DTMF, call termination, call disconnect, switch hook flash, etc.

The telephony platform includes a simplified message desk interface (SMDI) 104 that sends and receives signaling data to the CCS signaling network, a digital switch 106 that sends and receives communication traffic from the trunk line 22, a master control unit (MCU) 108 that controls the overall operations of the gateway, including controlling the switch 106 to separate data traffic on the trunk line 26 into single 64 kb/s data channels 110. The data on each of the data channels 110 is compressed by a voice processor unit (VPU) 112 into compressed communication data having a data rate of approximately 16 kbit/s or lower. The compressed communication data may be either voice data or other data, for example facsimile data.

The compressed communication data is output to a local area network (LAN) 114, for example an Ethernet-based network at 100 Mbit/s. The LAN 114 carries data signals between the MCU 108 and the voice processing units 112. The system also includes T1 type digitized audio links 110 between the switch 106 and each of the VPU's 112. The LAN 114 transports data packets to a packet assembler/disassembler (PAD) 116 that packetizes data on the LAN 114 into TCP/IP packets for transport onto the Internet. The PAD 116 also recovers signaling and communication data from data packets received by the router 118. Hence, the PAD 116 receives signaling information from the SMDI 104 originated from the signaling network, and outputs signaling data recovered from data packets received from the Internet to the SMDI 104 for subsequent call processing via the signaling links 24.

The gateway also may include an RAS database 120 that is an image of the database in the RAS server 30. The RAS database 120 enables translation information to be obtained without accessing the RAS 30 via the Internet. In this arrangement, the gateway would monitor its own bandwidth allocation as stored in the RAS database 120. The router 118 is of the type now generally used in Internet practice. Although not shown for purposes of explanation of the present invention, the router 118 may also be connected to a Domain Name Service (DNS) server and a Dynamic Host Configuration Protocol (DHCP) server of the type conventionally used by Internet Service Providers in existing Internet Service.

FIGS. 5a and 5b, taken together, form a flow diagram exemplifying processing of a call routed through the architecture illustrated in FIGS. 3 and 4 according to the present invention. In this example a calling party at a station 11b, served by PSTN 10b, is assumed to put the telephone off hook to place the call to a called party at station 11a, served by PSTN 10a, at step 200. The caller may indicate a request for an “Internet call” by dialing a code *82, which prefix has been predesignated by a program at the PSTN central office for this purpose. The dialing of the prefix *82 is followed by the dialing of the directory number of the called party station, including the area code. It is to be recognized that Internet calls may also be initiated in other ways, such as under control of the AIN network. For example, the ISCP would determine whether a call is to be routed through the Internet in response to a trigger from the originating central office to access stored criteria for the calling party in an associated CPR in the ISCP.

In the current example, the central office switching system responds to the off-hook and receives the dialed digits from the calling station in step 202. The central office switching system analyzes the received digits and determines from the prefix *82 that the call is an Internet call. Responsive to its programmed recognition of the prefix code, the originating central office 13b suspends the call and sends a CCIS query message in step 204 to the gateway 20b via the signaling channel 24b.

In response to the query message, the gateway 20b identifies the Internet telephony server (gateway 20a) servicing the called party 11a by sending, in step 206, a routing request, including the number of the calling party 11b and the area code of the called party 11a, to the RAS 30 via the Internet. Alternatively, the gateway 20b may access its own internal routing and administration database 120. The RAS data base accesses its internal translation tables and sends a routing response in step 208. The routing response includes the identity (e.g., IP address) of the gateway 20a serving the called party 11a, the predetermined virtual path between the two servers, and any other pertinent information, such as the minimum guaranteed service level for the calling station 11b. The gateway 20b then sends, in step 210, a signaling message through the Internet in the form of a query message packetized in TCP/IP packets having the IP address of the gateway 20a as the destination address. The signaling packets, which include a session ID, the called number, and the directory number of the calling station 11b, are received by the gateway 20a.

At step 212, the gateway 20a recovers the query message from the payload of the TCP/IP packets and formulates an SS7 signaling message, to be conveyed through the common channel signaling network of PSTN 10a, to set up completion of the call routing to station 11a. Station 11a in this example is shown to be a subscriber of a central office SSP 13a that is not directly connected to the gateway 20a. Routing of the call through PSTN 10a is set up through STP 26a in the common channel signaling network. If the called station instead were to have been a subscriber of the central office to which the gateway is directly connected, signaling through the STP is, of course, unnecessary. In either case, the initial SSP in the PSTN that receives the signaling message extracts caller identification information.

In the absence of provision to the contrary, as in the present invention, an originating switching office normally identifies calling party data by correlating the subscriber line connection at the switch with stored information associated with the subscriber. This data is sent in the SS7 signaling message to the terminating switching office (which may also be the originating switching office). The terminating switching office is then enabled to provide caller ID based services to the called party subscriber. In the Internet call architecture shown in FIG. 3, the voice path of the incoming call between PSTN 10a is connection 22a to digital switch 106 in gateway 20a, while the messaging signal path 24a connects the PSTN with SMDI 104 in the gateway. With conventional call processing methods, the receiving SSP 13a either would misinterpret the identity of the calling party to be the gateway or be unable to provide caller ID information.

To overcome this problem with the prior art, in the present invention SSP 13a is programmed to recognize the voice path connection 22a as a special status condition upon receipt of a signaling message associated with that connection. To obtain originating caller identification information, the switch looks to the message data content of incoming signaling packets for the gateway connection 22a instead of the header address portion of received packets. Signaling messages received at switch ports connected to PSTN locations would be identified by the switch as to caller origination in the conventional manner.

In accordance with the present invention, as an alternative to the arrangement shown in FIG. 3, connections between the gateway 20a and SSP 13a may be replaced by an ISDN connection. With an ISDN link, a separate channel for signaling purposes would be provided. As a further alternative, particularly for PSTN systems that do not include a CCIS network, a feature group D trunk can be connected between the gateway and the SSP. Feature group D protocol provides in-band signaling. In all of these alternatives of the invention, the switch at the incoming SSP is programmed to obtain the originating caller identification information by recognizing the connection to the gateway to extract the appropriate data from the signaling messages.

At step 214, the SSP 13a in PSTN 10a connected to the gateway initiates SS7 signaling to determine whether called station 11a is busy. If the called station is busy, the destination central office SSP 13a so informs the gateway via the CCIS signaling network, while temporarily storing the caller ID information. This information is available for later use in caller ID services such as return call or last caller identification. The busy status is sent in a signaling message back through the Internet to gateway 20b, whereupon a busy signal is provided by PSTN 10b to the calling station 11b in conventional manner. At step 220, determination is made of whether the called station has entered an appropriate code for such services. If so, the corresponding service is provided in conventional manner at step 222.

If the called station is not busy, the destination SSP 13a busies out the called station line 14a by blocking all calls. A signaling message is then sent, via the CCIS network in PSTN 10a, the gateways 20a and 20b and the Internet, to the CCIS network in PSTN 20b to indicate that the called line is available and waiting, at step 224. At step 226, an Internet communication path is established for the call in the manner described more fully in copending application Ser. No. 08/753,198 filed Nov. 21, 1996, identified previously. At step 228, a signaling message is sent through the common channel signaling network of PSTN 10a to the terminating SSP 13a to complete the call routing and ring the called station 11a. The caller ID information obtained from the message is used to provide the caller ID service information between ring signals in the conventional manner.

Only the preferred embodiments of the invention and but a few examples of its versatility are shown and described in the present disclosure. It is to be understood that the invention is capable of use in various other combinations and environments and is capable of changes or modifications within the scope of the inventive concept as expressed herein.

Claims

1. A gateway for use in a telecommunications system having a plurality of diverse paths available for transporting a voice call, one of said paths traversing at least a public switched telephone network (PSTN) having a local line to a subscriber receiving the voice call and a packet-switched data communication network, the gateway being connectable between the packet-switched data communication network and the PSTN, the gateway comprising:

(a) a data network server connectable to the packet-switched data communication network, for receiving through the packet-switched data communication network a request from a calling party to set up a voice call through the PSTN to the local line to the subscriber, and for receiving identification information associated with the calling party through the packet-switched data communication network; and
(b) a telephony platform having a call connection to the PSTN for initiating the voice call through the PSTN to the local line to the subscriber in response to the request from the calling party and having a signaling link for providing call-related signaling information to the PSTN including the identification information associated with the calling party, to enable transport of the calling party identification information through the PSTN to the local line to the subscriber;
wherein the call connection and the signaling link utilize a Feature Group D trunk between the telephony platform and the PSTN.

2. A method for providing caller identification information for a voice call, originating from a remote calling subscriber device, to a called telephone subscriber line comprising the steps of:

routing an initial voice call, originated by a calling party at the remote calling subscriber device, through a packet switched data network to a gateway that interfaces between the packet switched data network and a public switched telephone network (PSTN);
in response to said routing step, placing a subsequent telephone call from the gateway through the PSTN to the called subscriber line;
linking the initial voice call at the gateway with the subsequent telephone call; and transporting originating calling party identification information from the gateway through the PSTN to the called subscriber line while the called subscriber line is in an on-hook condition.

3. The method of claim 2, wherein the step of routing the initial voice call comprises:

routing a telephone call from the remote calling subscriber device through a remote public-switched telephone network (PSTN) to a remote gateway coupled between the packet-switched data network and the remote PSTN; and establishing communications relating to the initial voice call between the gateway and the remote gateway via the public switched data network.

4. The method of claim 3 wherein:

the step of establishing communications comprises communicating from the remote gateway an identification of a line of the remote PSTN for the remote calling subscriber device; and
the step of transporting originating calling party identification information is responsive to the identification of the line of the remote PSTN.

5. A method for providing caller identification information for a voice call, originating from a remote calling subscriber device, to a called telephone subscriber line comprising the steps of:

receiving a voice call intended for the called telephone subscriber line, originated by a calling party at the remote calling subscriber device through a packet switched data network, handed-off from a gateway that interfaces between the packet switched data network and a public switched telephone network (PSTN);
initiating routing of a telephone call through the PSTN to the called telephone subscriber line for use in competing the voice call to the called telephone subscriber line;
receiving a signaling message containing originating caller identification information from the gateway; and
transporting the originating caller identification information through the PSTN to the called telephone subscriber line while routing the telephone call through the PSTN;
wherein the step of receiving the signaling message comprises receiving the originating caller identification information over a Feature Group D trunk from the gateway.

6. A public switched telephone network (PSTN) serving a destination subscriber station, comprising:

a first telephone switching office having at least one link for voice telephone calls and associated signaling to a gateway coupled between the PSTN and a packet switched data network; a second telephone switching office serving a telephone link to the destination subscriber station- and
an interconnection between the first and second telephone switching offices, wherein:
the first telephone switching office is adapted to recognize a voice call arriving from the gateway, obtain originating caller identification information from the gateway, and signal the originating caller identification information to the second telephone switching office, and
the second telephone switching office is adapted to attempt to complete a telephone call over the telephone link to the destination subscriber station for the recognized voice call from the gateway, and to transmit the originating caller identification information over said telephone link.

7. The public switched telephone network (PSTN) as in claim 6, wherein the interconnection between the first and second telephone switching offices includes an out-of-band signaling network coupled between the first and second telephone switching offices, for transporting the signaling there between.

8. The public switched telephone network (PSTN) as in claim 6, wherein the second telephone switching office serves a telephone line connected to the destination subscriber station.

9. A method comprising:

detecting an off-hook condition of a calling station;
subsequent to detecting the off-hook condition, receiving dialed digits from the calling station, the dialed digits indicating a telephone number of a called party;
providing a request to a routing database, the request including at least a portion of the telephone number of the called party;
receiving in response to the request an identity of a gateway to the called party;
sending a first signaling message over a packet-switched data network to the gateway using the identity of the gateway, the first signaling message including the telephone number of the called party and a telephone number of the calling station;
receiving the first signaling message at the gateway;
formulating an SS7 signaling message in response to the first signaling message, the SS7 signaling message including the telephone number of the calling station;
sending the SS7 signaling message from the gateway over a connection to a public switched telephone network (PSTN) system.

10. The method of claim 9, wherein the request includes the telephone number of the calling station.

11. The method of claim 9, wherein the at least a portion of the telephone number of the called party includes an area code of the called party.

12. The method of claim 9, wherein the routing database stores records associating telephone number information with network addresses for corresponding gateways.

13. The method of claim 9, wherein the first signaling message includes a session ID.

14. The method of claim 9, wherein the identity of the gateway is an IP address of the gateway.

15. The method of claim 9, further comprising:

receiving a minimum guaranteed service level for the calling station.

16. The method of claim 9, further comprising:

receiving at the gateway over the connection to the PSTN system an indication that the called party is at least one of busy or available;
when the calling party is indicated busy, sending a second signaling message from the gateway over the packet-switched data network indicating the called party is busy;
when the called party is indicated available, sending a third signaling message form the gateway over the packet-switched network indicating the called party is available.

17. The method of claim 9, wherein the dialed digits further include prefix code indicative of a type of calling.

18. The method of claim 9, further comprising:

translating the at least a portion of the telephone number of the called party into the identity of the gateway using at least one translation table.

19. The method of claim 18 wherein the identity of the gateway includes an IP address of the gateway.

20. The method of claim 9, wherein the connection to the PSTN is a link to a Signal Transfer Point (STP) in the PSTN.

21. The method of claim 9, wherein the connection to the PSTN is a Feature Group D trunk.

22. The method of claim 9, wherein providing the request to the routing database and receiving in response to the request the identity of the gateway to the called party both occur within a single physical device without traversing the packet-switched data network.

23. The method of claim 9, wherein providing the request to the routing database includes sending the request over the packet-switched data network to the routing database, and wherein receiving in response to the request the identity of the gateway to the called party includes receiving a routing response from the routing database over the packet-switched data network, the routing response including the identity of the gateway to the called party.

24. The method of claim 9, wherein the packet-switched data network comprises at least one of wide-area networks, local-area networks, and the Internet.

Referenced Cited
U.S. Patent Documents
4191860 March 4, 1980 Weber
4310727 January 12, 1982 Lawser
4313035 January 26, 1982 Jordan et al.
4313036 January 26, 1982 Jabara et al.
4371751 February 1, 1983 Hilligoss, Jr. et al.
4371752 February 1, 1983 Matthews et al.
4375097 February 22, 1983 Ulug
4555594 November 26, 1985 Friedes et al.
4565903 January 21, 1986 Riley
4577066 March 18, 1986 Bimonte et al.
4585906 April 29, 1986 Matthews et al.
4602129 July 22, 1986 Matthews et al.
4609778 September 2, 1986 Franklin et al.
4611094 September 9, 1986 Asmuth et al.
4611096 September 9, 1986 Asmuth et al.
4625081 November 25, 1986 Lotito et al.
4630262 December 16, 1986 Callens et al.
4652700 March 24, 1987 Matthews et al.
4672700 June 16, 1987 Poncy
4710917 December 1, 1987 Tompkins et al.
4730071 March 8, 1988 Schoenthal
4734931 March 29, 1988 Bourg et al.
4741820 May 3, 1988 Coughlin
4748618 May 31, 1988 Brown et al.
4765924 August 23, 1988 Inoue
4766604 August 23, 1988 Axberg
4771425 September 13, 1988 Baran et al.
4782485 November 1, 1988 Gollub
4788718 November 29, 1988 McNabb et al.
4790003 December 6, 1988 Kepley et al.
4827500 May 2, 1989 Binkerd et al.
4865763 September 12, 1989 Inoue
4866763 September 12, 1989 Cooper et al.
4872157 October 3, 1989 Hemmady et al.
4872160 October 3, 1989 Hemmady et al.
4872197 October 3, 1989 Pemmaraju
4875206 October 17, 1989 Nichols et al.
4877949 October 31, 1989 Danielson
4882476 November 21, 1989 White
4894824 January 16, 1990 Hemmady et al.
4897874 January 30, 1990 Lidinsky et al.
4899333 February 6, 1990 Roediger
4899373 February 6, 1990 Lee et al.
4910794 March 20, 1990 Mahany
4916691 April 10, 1990 Goodman
4918722 April 17, 1990 Duehren et al.
4922348 May 1, 1990 Gillon et al.
4922486 May 1, 1990 Lidinsky et al.
4942574 July 17, 1990 Zelle
4958341 September 18, 1990 Hemmady et al.
4969184 November 6, 1990 Gordon et al.
D315573 March 19, 1991 Schultz
5008906 April 16, 1991 Reichwein
5008926 April 16, 1991 Misholi
5009337 April 23, 1991 Bimbi
5012511 April 30, 1991 Hanle et al.
5018191 May 21, 1991 Catron et al.
5019699 May 28, 1991 Koenck
5029199 July 2, 1991 Jones et al.
5029200 July 2, 1991 Haas et al.
5031098 July 9, 1991 Miller
5034975 July 23, 1991 Grimes
5052020 September 24, 1991 Koenck
5052943 October 1, 1991 Davis
5070536 December 3, 1991 Mahany
5098877 March 24, 1992 Coughlin
5115431 May 19, 1992 Williams et al.
5123064 June 16, 1992 Hacker
5134647 July 28, 1992 Pugh et al.
5144282 September 1, 1992 Sutterlin
5146491 September 8, 1992 Silver et al.
5163080 November 10, 1992 Amoroso et al.
5180232 January 19, 1993 Chadma
5185860 February 9, 1993 Wu
5193110 March 9, 1993 Jones et al.
5195086 March 16, 1993 Baumgartner et al.
5195128 March 16, 1993 Knitl
5195183 March 16, 1993 Miller
5199062 March 30, 1993 Von Meister
5200993 April 6, 1993 Wheeler et al.
5202817 April 13, 1993 Koenck
5202825 April 13, 1993 Miller
5206901 April 27, 1993 Harlow et al.
5208848 May 4, 1993 Pula
5215011 June 1, 1993 Monney
5216233 June 1, 1993 Main
5218187 June 8, 1993 Koenck
5218188 June 8, 1993 Hanson
5223820 June 29, 1993 Sutterlin
5225071 July 6, 1993 Coughlin
5227614 July 13, 1993 Danielson
5231492 July 27, 1993 Dangi et al.
5235317 August 10, 1993 Sutterlin
5237604 August 17, 1993 Ryan
5243645 September 7, 1993 Bissell et al.
5243654 September 7, 1993 Hunter
5247571 September 21, 1993 Kay et al.
5254971 October 19, 1993 Sutterlin
5260986 November 9, 1993 Pershan
5263080 November 16, 1993 Jones et al.
5272749 December 21, 1993 Masek
5274696 December 28, 1993 Perelman
5280159 January 18, 1994 Schultz et al.
5289378 February 22, 1994 Miller
5289468 February 22, 1994 Yoshida
5295154 March 15, 1994 Meier
5303297 April 12, 1994 Hillis
5305181 April 19, 1994 Schultz
5308966 May 3, 1994 Danielson
5309437 May 3, 1994 Perlman et al.
5313053 May 17, 1994 Koenck
5317691 May 31, 1994 Traeger
5318719 June 7, 1994 Hughes
5322991 June 21, 1994 Hanson
5327421 July 5, 1994 Hiller et al.
5327486 July 5, 1994 Wolff et al.
5331580 July 19, 1994 Miller
5333266 July 26, 1994 Boaz
5341374 August 23, 1994 Lewen et al.
5345446 September 6, 1994 Hiller et al.
5346611 September 13, 1994 Coughlin
5347633 September 13, 1994 Ashfield et al.
5349497 September 20, 1994 Hanson
5349678 September 20, 1994 Morris
5353331 October 4, 1994 Emery et al.
5359185 October 25, 1994 Hanson
5361256 November 1, 1994 Doeringer et al.
5365524 November 15, 1994 Hiller et al.
5365546 November 15, 1994 Koenck
5367566 November 22, 1994 Moe et al.
5371858 December 6, 1994 Miller
5375068 December 20, 1994 Palmer et al.
5375159 December 20, 1994 Williams
5377186 December 27, 1994 Wegner et al.
5381465 January 10, 1995 Carter et al.
5384831 January 24, 1995 Creswell et al.
5384840 January 24, 1995 Blatchford et al.
5386467 January 31, 1995 Ahmad
5390175 February 14, 1995 Hiller et al.
5394436 February 28, 1995 Meier
5400393 March 21, 1995 Knuth
5406557 April 11, 1995 Baudoin
5408237 April 18, 1995 Patterson et al.
5408382 April 18, 1995 Schultz
5410141 April 25, 1995 Koenck
5410754 April 1995 Klotzbach et al.
5416842 May 16, 1995 Aziz
5420211 May 30, 1995 Hughes
5420916 May 30, 1995 Sekiguchi
5422882 June 6, 1995 Hiller et al.
5422941 June 6, 1995 Hasenauer et al.
5425028 June 13, 1995 Britton et al.
5425051 June 13, 1995 Mahany
5425090 June 13, 1995 Orriss
5425091 June 13, 1995 Josephs
5425780 June 20, 1995 Flatt et al.
5426636 June 20, 1995 Hiller et al.
5428636 June 27, 1995 Meier
5430719 July 4, 1995 Weisser, Jr.
5430727 July 4, 1995 Callon
5434852 July 18, 1995 La Porta et al.
5434913 July 18, 1995 Tung et al.
5436957 July 25, 1995 McConnell
5440621 August 8, 1995 Castro
5442690 August 15, 1995 Nazif et al.
5444709 August 22, 1995 Riddle
5452287 September 19, 1995 DiCecco et al.
5457629 October 10, 1995 Miller
5465207 November 7, 1995 Boatwright
5466170 November 14, 1995 Pavek
5468947 November 21, 1995 Danielson
5468950 November 21, 1995 Hanson
5469497 November 21, 1995 Pierce et al.
5469500 November 21, 1995 Satter et al.
5473677 December 5, 1995 D'Amato et al.
5475732 December 12, 1995 Pester, III
5475737 December 12, 1995 Garner et al.
5475748 December 12, 1995 Jones
5479494 December 26, 1995 Clitherow
5483549 January 9, 1996 Weinberg et al.
5483587 January 9, 1996 Hogan et al.
5483676 January 9, 1996 Mahany
5487111 January 23, 1996 Slusky
5488575 January 30, 1996 Danielson
5490247 February 6, 1996 Tung et al.
5493568 February 20, 1996 Sampat et al.
5493573 February 20, 1996 Kobayashi et al.
5500859 March 19, 1996 Sharma et al.
5504746 April 2, 1996 Meier
5506887 April 9, 1996 Emery et al.
5506893 April 9, 1996 Buscher et al.
5515303 May 7, 1996 Cargin, Jr.
5517434 May 14, 1996 Hanson
5517560 May 14, 1996 Greenspan
5524145 June 4, 1996 Parker
5526353 June 11, 1996 Henley et al.
5526489 June 11, 1996 Nilakantan et al.
5528539 June 18, 1996 Ong
5537470 July 16, 1996 Lee
5539193 July 23, 1996 Gibbs
5539194 July 23, 1996 Miller
5541398 July 30, 1996 Hanson
5544010 August 6, 1996 Schultz
5555276 September 10, 1996 Koenck
5559068 September 24, 1996 Chen
5559871 September 24, 1996 Smith
5568645 October 22, 1996 Morris
5572583 November 5, 1996 Wheeler, Jr. et al.
5575961 November 19, 1996 Kuwabara et al.
5576529 November 19, 1996 Koenck
5583920 December 10, 1996 Wheeler, Jr.
5583926 December 10, 1996 Venier et al.
5583929 December 10, 1996 Ardon
5586175 December 17, 1996 Hogan
5587577 December 24, 1996 Schultz
5590133 December 31, 1996 Billstrom et al.
5590181 December 31, 1996 Hogan
5590346 December 31, 1996 West
5594717 January 14, 1997 Watanabe et al.
5594784 January 14, 1997 Velius
5598464 January 28, 1997 Hess et al.
5598487 January 28, 1997 Hacker
5602456 February 11, 1997 Cargin
5602854 February 11, 1997 Luse
5604737 February 18, 1997 Iwami et al.
5608446 March 4, 1997 Carr et al.
5608447 March 4, 1997 Farry et al.
5608706 March 4, 1997 Park
5608786 March 4, 1997 Gordon
5610910 March 11, 1997 Focsaneanu et al.
5610977 March 11, 1997 Williams et al.
5615251 March 25, 1997 Hogan
5617343 April 1, 1997 Danielson
5621787 April 15, 1997 McKoy et al.
5625180 April 29, 1997 Hanson
5625555 April 29, 1997 Davis
5625675 April 29, 1997 Katsumaru et al.
5625681 April 29, 1997 Butler, II
5625682 April 29, 1997 Gray et al.
5626682 May 6, 1997 Kobari et al.
5633919 May 27, 1997 Hogan
5638430 June 10, 1997 Hogan
5640001 June 17, 1997 Danielson
5644471 July 1, 1997 Schultz
5657317 August 12, 1997 Mahany
5661790 August 26, 1997 Hsu
5661792 August 26, 1997 Akinpelu et al.
5663208 September 2, 1997 Martin
5671436 September 23, 1997 Morrison
5672860 September 30, 1997 Miller
5673031 September 30, 1997 Meier
5679943 October 21, 1997 Schultz et al.
5680442 October 21, 1997 Bartholomew et al.
5680446 October 21, 1997 Fleischer et al.
5680633 October 21, 1997 Koenck
5682379 October 28, 1997 Mahany
5694318 December 2, 1997 Miller
5696903 December 9, 1997 Mahany
5699528 December 16, 1997 Hogan
5706286 January 6, 1998 Reiman et al.
5708680 January 13, 1998 Gollnick
5708833 January 13, 1998 Kinney
5710728 January 20, 1998 Danielson
5712903 January 27, 1998 Bartholomew et al.
5712907 January 27, 1998 Wegner et al.
5722067 February 24, 1998 Fougnies
5724355 March 3, 1998 Bruno et al.
5724412 March 3, 1998 Srinivasan
5726984 March 10, 1998 Kubler et al.
5727002 March 10, 1998 Miller et al.
5732078 March 24, 1998 Arango
5732213 March 24, 1998 Gessel et al.
5737395 April 7, 1998 Irribarren
5737404 April 7, 1998 Segal
5737414 April 7, 1998 Walker et al.
5740164 April 14, 1998 Liron
5740366 April 14, 1998 Mahany
5742596 April 21, 1998 Baratz et al.
5742668 April 21, 1998 Pepe et al.
5742670 April 21, 1998 Bennett
5742675 April 21, 1998 Kilander et al.
5747785 May 5, 1998 Miller
5747786 May 5, 1998 Cargin, Jr.
5748619 May 5, 1998 Meier
5751706 May 12, 1998 Land et al.
5751707 May 12, 1998 Voit et al.
5751961 May 12, 1998 Smyk
5761294 June 2, 1998 Shaffer et al.
5763867 June 9, 1998 Main
5764741 June 9, 1998 Barak
5768513 June 16, 1998 Kuthyar et al.
5774535 June 30, 1998 Castro
5774660 June 30, 1998 Brendel et al.
5774695 June 30, 1998 Autrey et al.
5778313 July 7, 1998 Fougnies
5781620 July 14, 1998 Montgomery et al.
5790536 August 4, 1998 Mahany
5790548 August 4, 1998 Sistanizadeh et al.
5793762 August 11, 1998 Penners et al.
5793763 August 11, 1998 Mayes et al.
5793771 August 11, 1998 Darland et al.
5799072 August 25, 1998 Vulcan et al.
5799156 August 25, 1998 Hogan
5802502 September 1, 1998 Gell et al.
5802513 September 1, 1998 Bowie, III
5804805 September 8, 1998 Koenck
5805474 September 8, 1998 Danielson
5805587 September 8, 1998 Norris
5805807 September 8, 1998 Hanson
5809128 September 15, 1998 McMullin
5812639 September 22, 1998 Bartholomew et al.
5812795 September 22, 1998 Horovitz et al.
5818836 October 6, 1998 DuVal
5825780 October 20, 1998 Christie
5825863 October 20, 1998 Walker
5828740 October 27, 1998 Khuc et al.
5834753 November 10, 1998 Danielson
5838665 November 17, 1998 Kahn et al.
5838682 November 17, 1998 Dekelbaum et al.
5841764 November 24, 1998 Roderique et al.
5844893 December 1, 1998 Gollnick
5844896 December 1, 1998 Marks et al.
5845267 December 1, 1998 Ronen
5848143 December 8, 1998 Andrews et al.
5850358 December 15, 1998 Danielson
5850433 December 15, 1998 Rondeau
5854833 December 29, 1998 Hogan
5854975 December 29, 1998 Fougnies
5862171 January 19, 1999 Mahany
5864610 January 26, 1999 Ronen
5867495 February 2, 1999 Elliott et al.
5867562 February 2, 1999 Scherer
5867566 February 2, 1999 Hogan
5870565 February 9, 1999 Glitho
5873099 February 16, 1999 Hogan
5883891 March 16, 1999 Williams et al.
5884032 March 16, 1999 Bateman et al.
5888087 March 30, 1999 Hanson
5889774 March 30, 1999 Mirashrafi et al.
5892822 April 6, 1999 Gottlieb et al.
5892971 April 6, 1999 Danielson
5895431 April 20, 1999 Miller
5895906 April 20, 1999 Danielson
5898668 April 27, 1999 Shaffer
5898673 April 27, 1999 Riggan et al.
5901140 May 4, 1999 Van As et al.
5903558 May 11, 1999 Jones et al.
5905736 May 18, 1999 Ronen et al.
5907547 May 25, 1999 Foladare et al.
5910946 June 8, 1999 Csapo
5912887 June 15, 1999 Sehgal
5914481 June 22, 1999 Danielson
5915001 June 22, 1999 Uppaluru
5915005 June 22, 1999 He
5917175 June 29, 1999 Miller
5917424 June 29, 1999 Goldman et al.
5918179 June 29, 1999 Foladare et al.
5923659 July 13, 1999 Curry et al.
5926482 July 20, 1999 Christie
5928292 July 27, 1999 Ishikawa et al.
5930343 July 27, 1999 Vasquez
5937045 August 10, 1999 Yaoya et al.
5940479 August 17, 1999 Guy et al.
5940598 August 17, 1999 Strauss et al.
5940771 August 17, 1999 Gollnick
5946299 August 31, 1999 Blonder
5946386 August 31, 1999 Rogers et al.
5949056 September 7, 1999 White
5949776 September 7, 1999 Mahany
5953322 September 14, 1999 Kimball
5953338 September 14, 1999 Ma et al.
5953504 September 14, 1999 Sokal et al.
5953651 September 14, 1999 Lu et al.
5956391 September 21, 1999 Melen et al.
5958016 September 28, 1999 Chang et al.
5958052 September 28, 1999 Bellovin
5959998 September 28, 1999 Takahashi et al.
5966431 October 12, 1999 Reiman et al.
5969321 October 19, 1999 Danielson
5970065 October 19, 1999 Miloslavsky
5970477 October 19, 1999 Roden
5974043 October 26, 1999 Solomon
5974052 October 26, 1999 Johnson et al.
5978569 November 2, 1999 Traeger
5978840 November 2, 1999 Nguyen et al.
5979768 November 9, 1999 Koenck
5982774 November 9, 1999 Foladare et al.
5987499 November 16, 1999 Morris
5991291 November 23, 1999 Asai et al.
5991292 November 23, 1999 Focsaneanu et al.
5991308 November 23, 1999 Fuhrmann et al.
5991864 November 23, 1999 Kinney
5995606 November 30, 1999 Civanlar et al.
6005926 December 21, 1999 Mashinsky
6006100 December 21, 1999 Koenck
6006253 December 21, 1999 Kumar et al.
6012088 January 4, 2000 Li et al.
6014379 January 11, 2000 White et al.
6016343 January 18, 2000 Hogan
6018360 January 25, 2000 Stewart et al.
6021126 February 1, 2000 White et al.
6023147 February 8, 2000 Cargin
6023474 February 8, 2000 Gardner et al.
6026087 February 15, 2000 Mirashrafi et al.
6026091 February 15, 2000 Christie
6028858 February 22, 2000 Rivers et al.
6029261 February 22, 2000 Hartmann
6031840 February 29, 2000 Christie
6036093 March 14, 2000 Schultz
6046992 April 4, 2000 Meier
6047051 April 4, 2000 Ginzboorg et al.
6047326 April 4, 2000 Kilkki
6049813 April 11, 2000 Danielson
6052445 April 18, 2000 Bashoura et al.
6058000 May 2, 2000 Koenck
6064653 May 16, 2000 Farris
6069890 May 30, 2000 White et al.
6075783 June 13, 2000 Voit
6078582 June 20, 2000 Curry et al.
6078943 June 20, 2000 Yu
6081525 June 27, 2000 Christie
6084867 July 4, 2000 Meier
6088431 July 11, 2000 LaDue
6104645 August 15, 2000 Ong
6104704 August 15, 2000 Buhler et al.
6108341 August 22, 2000 Christie
6112206 August 29, 2000 Morris
6115737 September 5, 2000 Ely et al.
6118936 September 12, 2000 Lauer et al.
6122255 September 19, 2000 Bartholomew et al.
6125113 September 26, 2000 Farris et al.
6131121 October 10, 2000 Mattaway
6134235 October 17, 2000 Goldman et al.
6134530 October 17, 2000 Bunting et al.
6137792 October 24, 2000 Jonas et al.
6141404 October 31, 2000 Westerlage et al.
6141412 October 31, 2000 Smith et al.
6144976 November 7, 2000 Silva
6149062 November 21, 2000 Danielson
6154445 November 28, 2000 Farris et al.
6157621 December 5, 2000 Brown et al.
6157636 December 5, 2000 Voit et al.
6157648 December 5, 2000 Voit et al.
6157823 December 5, 2000 Fougnies et al.
6181695 January 30, 2001 Curry et al.
6181703 January 30, 2001 Christie
6185184 February 6, 2001 Mattaway
6192050 February 20, 2001 Stovall
6192400 February 20, 2001 Hanson
6195425 February 27, 2001 Farris et al.
6201812 March 13, 2001 Christie
6205139 March 20, 2001 Voit
6212193 April 3, 2001 Christie
6215790 April 10, 2001 Voit et al.
6226678 May 1, 2001 Mattaway
6236851 May 22, 2001 Fougnies
6243373 June 5, 2001 Turock
6243374 June 5, 2001 White
6263372 July 17, 2001 Hogan
6266685 July 24, 2001 Danielson
6279038 August 21, 2001 Hogan
6282192 August 28, 2001 Murphy et al.
6282284 August 28, 2001 Dezonno et al.
6285745 September 4, 2001 Bartholomew et al.
6289010 September 11, 2001 Voit et al.
6292478 September 18, 2001 Farris
6292479 September 18, 2001 Bartholomew et al.
6292481 September 18, 2001 Voit et al.
6295292 September 25, 2001 Voit et al.
6298057 October 2, 2001 Guy
6298064 October 2, 2001 Christie
6304567 October 16, 2001 Rosenberg
6314103 November 6, 2001 Medhat et al.
6327258 December 4, 2001 Deschaine et al.
6330250 December 11, 2001 Curry et al.
6335927 January 1, 2002 Elliott
6363065 March 26, 2002 Thornton et al.
6363349 March 26, 2002 Urs et al.
6374302 April 16, 2002 Galasso et al.
6375344 April 23, 2002 Hanson
6385191 May 7, 2002 Coffman et al.
6400702 June 4, 2002 Meier
6407991 June 18, 2002 Meier
6430195 August 6, 2002 Christie
6430275 August 6, 2002 Voit et al.
6438218 August 20, 2002 Farris
6449259 September 10, 2002 Allain et al.
6449356 September 10, 2002 Dezonno
6480588 November 12, 2002 Donovan
6493353 December 10, 2002 Kelly et al.
6513066 January 28, 2003 Hutton
6539015 March 25, 2003 Voit et al.
6542497 April 1, 2003 Curry
6546003 April 8, 2003 Farris
6574216 June 3, 2003 Farris et al.
6584093 June 24, 2003 Salama et al.
6600735 July 29, 2003 Iwama et al.
6614768 September 2, 2003 Mahany
6614781 September 2, 2003 Elliott
6621942 September 16, 2003 Hacker
6625170 September 23, 2003 Curry et al.
6633846 October 14, 2003 Bennett et al.
6643362 November 4, 2003 Hogan
6678718 January 13, 2004 Khouri et al.
6681994 January 27, 2004 Koenck
6687738 February 3, 2004 Hutton
6688523 February 10, 2004 Koenck
6694359 February 17, 2004 Morris
6701365 March 2, 2004 Hutton
6711241 March 23, 2004 White et al.
6714559 March 30, 2004 Meier
6714983 March 30, 2004 Koenck
6760429 July 6, 2004 Hung et al.
6792256 September 14, 2004 Kinney
6823384 November 23, 2004 Wilson et al.
6826165 November 30, 2004 Meier
6829645 December 7, 2004 Hutton
6870827 March 22, 2005 Voit et al.
6885678 April 26, 2005 Curry et al.
6895419 May 17, 2005 Cargin
6910632 June 28, 2005 Koerck
6925054 August 2, 2005 Atterton et al.
6990090 January 24, 2006 Meier
7012898 March 14, 2006 Farris et al.
7079534 July 18, 2006 Medhat
7085362 August 1, 2006 Christie
7088705 August 8, 2006 Curry
7092379 August 15, 2006 Singh et al.
7120319 October 10, 2006 Danielson
7149208 December 12, 2006 Mattaway
7206592 April 17, 2007 Gollnick
7274662 September 25, 2007 Kalmanek, Jr. et al.
20020159461 October 31, 2002 Hamamoto et al.
20030078006 April 24, 2003 Mahany
20030169767 September 11, 2003 Christie
20030112767 June 19, 2003 Meier
20030189941 October 9, 2003 Christie
20040018851 January 29, 2004 Koenck
20040023651 February 5, 2004 Gollnick
20040038717 February 26, 2004 Mahany
20040039846 February 26, 2004 Goss et al.
20040044667 March 4, 2004 Mahany
20040073933 April 15, 2004 Gollnick
20040090952 May 13, 2004 Kubler
20040093363 May 13, 2004 Cargin
20040114567 June 17, 2004 Kubler
20040125753 July 1, 2004 Mahany
20040145775 July 29, 2004 Kubler
20040146020 July 29, 2004 Kubler
20040146037 July 29, 2004 Kubler
20040151150 August 5, 2004 Kubler
20040151151 August 5, 2004 Kubler
20040151164 August 5, 2004 Kubler
20040160912 August 19, 2004 Kubler
20040160913 August 19, 2004 Kubler
20040162889 August 19, 2004 Morris
20040165573 August 26, 2004 Kubler
20040165793 August 26, 2004 Hacker
20040166895 August 26, 2004 Koenck
20040169583 September 2, 2004 Meier
20040174841 September 9, 2004 Kubler
20040174842 September 9, 2004 Kubler
20040174843 September 9, 2004 Kubler
20040203834 October 14, 2004 Mahany
20040246940 December 9, 2004 Kubler
20040264442 December 30, 2004 Kubler
20050008002 January 13, 2005 Kubler
20050013266 January 20, 2005 Kubler
20050036467 February 17, 2005 Kubler
20050078647 April 14, 2005 Meier
20050083872 April 21, 2005 Kubler
20050087603 April 28, 2005 Mahany
20050195859 September 8, 2005 Mahany
20050232213 October 20, 2005 Meier
20050242192 November 3, 2005 Koenck
20050254475 November 17, 2005 Kubler
20060007951 January 12, 2006 Meier
20060062240 March 23, 2006 Meier
20060131420 June 22, 2006 Koenck
20060233161 October 19, 2006 Koenck
20060251226 November 9, 2006 Hogan
20060268806 November 30, 2006 Meier
20060268807 November 30, 2006 Meier
20060291752 December 28, 2006 Hacker
20070001007 January 4, 2007 Koenck
20070007353 January 11, 2007 Danielson
20070065046 March 22, 2007 Hacker
20070076687 April 5, 2007 Low et al.
20070086445 April 19, 2007 Mattaway
20070121529 May 31, 2007 Meier
20070206576 September 6, 2007 Radulovic
20070263644 November 15, 2007 Christie et al.
Foreign Patent Documents
0235257 September 1987 EP
0335562 April 1989 EP
0365885 May 1990 EP
0381365 August 1990 EP
0722237 November 2007 EP
97/20424 June 1997 WO
97/23078 June 1997 WO
Other references
  • Weisser et al. “The Intelligent Network and Forward-Looking Technology”, IEEE Comm Magazine, Dec. 1988, pp. 64-69.
  • Shah et al., “Application of a New Network Concept for Faster Service Deployment”, International Conference on Comm. 88 Jun. 12-15, 1988, IEEE Comm, Soc. Conference, Record vol. 3, pp. 1327-1329.
  • Noerpel et al., “PACS: Personal Access Communications System—A Tutorial,” IEEE Personal, Communications, Jun. 1996.
  • Varma et al., “Architecture for Interworking Data over PCS,” IEEE Communications Magazine, Sep. 1996, 124-130.
  • Rosenberg et al., “SIP for Presence,” 41st IETF, Apr. 3, 1998.
  • U.S. Appl. No. 60/023,891, filed Aug. 16, 1996.
  • Mills, M. (Mar. 8, 1996) “Freebie Heebie-Jeebies: New Long-Distance Calling Via the Internet Scares Small Phone Firms”, The Washington Post, sec. F, pp. 1-2.
  • Hughes, D.T. (Feb. 21, 1995) “What Hath (Net) God Wrought?”, The Journal [Fairfax, Virginia], sec. B, pp. 1-2.
  • Hughes, D.T. (May 28, 1996) “WebPhone Heading for Serious Telephony”, The Journal, [Fairfax, Virginia], sec. A, p. 8.
  • Mills, M. (Jan. 23, 1996) “It's the Net's Best Thing to Being There: With Right Software, Computer Becomes Toll-Free Telephone”, The Washington Post, sec. C, pp. 1,5.
  • Hughes, D.T. (Jan. 2, 1996) “Internet Phone Wars Heating Up: Companies Improve and Encourage Users to Test Products”, The Journal, [Fairfax, Virginia], sec. A, p. 6.
  • Yang, C. (Feb. 12, 1995), “INETPhone: Telephone Services and Serves on Internet”, RFC 1789 http://ds.internic.net/rfc/rfc/rfc1789.txt.
  • Kuehn, Richard A. (Jul. 1994) “The Voice of Technology”, [Online text only] Credit World, vol. 82, No. 6, pp. 20-23.
  • Margulies, Edwin (Aug. 1996) Understanding the Voice-Enabled Internet, Flatiron Publishing, Inc., pp. 4-42 and 12-1 to 12-3.
  • C. Low, “The Internet Telephony Red Herring,” Hewlett-Packard Laboratories, (May 15, 1996), pp. 1-15.
  • C. Low et al., WebIN-an architecture for fast deployment of IN-based personal services, Intelligent Network Workshop, 1996, IN '96, IEEE, (Apr. 21-24, 1996), vol. 2, 196+258.
  • Cady et al., “Mastering the Internet”, Sybex Inc., Alameda, CA 1994, ISBN 94-69309.
  • Stevens, “TCPIP Illustrated”, vol. 1, 1994, Addison-Wesley, pp. 12-122 and inside cover.
  • Keiser et al., “Digital Telephony and Network Integration”, 1995, Chapman Hall, Second Edition, pp. 426-428. cited by examiner.
  • Chopra, Manvinder, Exploring Intelligent Peripheral Configuration, Universal Personal Communications, 1994. Record., 1994 Third Annual International Conference on, Sep. 27-Oct. 1, 1994, pp. 635-639.
  • Audio Messaging Interchange Specification (AMIS)—Analog Protocol, Version 1, Issue 2, Feb. 1992.
  • Jabbari, B., “Common Channel Signaling System No. 7 for ISDN and Intelligent Networks”, Proceedings of the IEEE, vol. 79, No. 2, Feb., 1991, pp. 155-169.
  • “Supercharging the Web with Computer Telephony”, CT and the 'Net, Mar. 1996.
  • “Audio and Video Over the Internet”, CT and the 'Net, Computer Telephony, Mar. 1996.
  • Grigonis, Richard, “Computer Telephony Over The Internet”, CT and the Net, Mar. 1996.
  • “Geek of the Week: Carl Malamud Interviews Phil Karn & Jun Murai”, Internet Talk Radio, Mobile IP Networking, Nov. 1993.
  • McConnell, Brian, “How to Build an Internet PBX”, Pacific Telephony Design, printed from http://www.phonezone.com/ip-phone.htm Mar. 5, 1997.
  • “Welcome to the Phone Zone”, Pacific Telephony Design, http://www.phonezone.com/index2.htm, pp. 1-6.
  • Sears, Andrew, “Innovations in Internet Telephony: The Internet as The Competitor to The Pots Network”, Innovations in Internet Telephony: The Internet as the Successor to the Pots Network, Feb. 28, 1996, pp. 1-6.
  • “Computer Telephony And The Internet”, Stylus Innovation, http://www.stylus.com/hvml.htm.
  • Hedrick, C., “Routing Information Protocol”, Jun. 1988, http://www.internic.net/rfc/rfc1058.txt, pp. 1-30.
  • Mills, D.L., “An Experimental Multiple-Path Routing Algorithm”, Mar. 1986, http://www.internic.net.rfc/rfc981.txt, pp. 1-20.
  • Lougheed et al., “A Border Gateway Protocol (BGP)”, Jun. 1990, http://www.internic.net/rfc/rfc1163.txt, pp. 1-26.
  • S. Deering, “Host Extensions for IP Multicasting”, Aug. 1989, http://www.internic.net/rfc/rfc1112.txt, pp. 1-16.
  • Waitzman et al., “Distance Vector Multicast Routing Protocol”, Nov. 1988, http://www.internic.net/rfc/rfc1075.txt, pp. 1-22.
  • Hinden et al., “The DARPA Internet Gateway”, Sep. 1982, http://www.internic.net/rfc/rfc823.txt, pp. 1-41.
  • “VocalTec's Telephony Gateway—The Ultimate Internet Telephony Solution?,” computer Telephony Magazine, Sep. 1996.
  • “A Call to Phones,” Wired Magazine, Issue 4.03, http://www.wired.com/wired/archive/4.03/updata.html (Mar. 1996).
  • Mascoli, Cicchetti & Listanti, “Alternative Scenarios for Data Applications Via Internet-Mobile and DECT-ATM Interworkin,” 4th IEEE International Conference on Universal Personal Communications, pp. 788-792, Nov. 6-10, 1995 published Apr. 1995.
  • Blackwell et al. “Secure Short-Cut Routing for Mobile IP,” USENIX Summary 1994 Technical Conferences, Jun. 6-10, 1994.
  • Okada et al. “Mobile Communication Using PHS [Personal Handy Phone System] Communications Server,” National Technical Report, vol. 42, No. 1, pp. 46-54 (Feb. 1996).
  • Sattler, Michael, “Nautilus Voice Encryption,” May 10, 1995.
  • Chernov, Andrey A. “SpeakFreely” software, Apr. 18, 1996.
  • “Netspeak Corporation Introduces Webphone, Industry's First Internet-Based Telephony Solution for Business Users,” PC Forum, Mar. 18, 1996.
  • “Free World Dialup Beta 2.0a Client,” Feb. 12, 1996.
  • Kahane et al., “VocalTec IP Forum Contribution”, VocalTec Inc., Seattle, WA, Jan. 15, 1997.
  • Handley et al., “SIP: Session Initiation Protocol”, Internet Engineering Task Force, Internet Draft, Jul. 31, 1997, draft-ietf-mmusic-sip-03.txt, Jul. 31, 1997.
  • “Internet Telephony for Dummies” 2nd Edition, Chapters 14-16, 1997.
  • Kahane et al., “Call Management Agent System Specification” VolP Forum Technical Committee, Aug. 14, 199.
  • IMTC Voice over IP Forum Service Interoperability Implementation Agreement, Draft 0.91, Document VolP-008, Jan. 13, 1997.
  • Sebestyn, I., ITU Telecommunication Standardization Sector, Study Group 15, Q;2&3/15 Rapporteur Meeting, Document AVC-1086, v1, Dec. 5, 1996.
  • Oppen et al., “The Clearinghouse: A Decentralized Agent for Locating Named Objects in a Distributed Environment”, ACM Transactions on Office Information Systems, vol. 1, No. 3, Jul. 1983, pp. 230-253.
  • Noerpel et al., “PACS: Personal Access Communications System—A Tutorial,” IEEE Personal Communications, Jun. 1996.
  • Varma et al., “Architecture for Interworking Data over PCS,” IEEE Communications Magazine, Sep. 1996, 124-130.
  • Rosenberg et al., “SIP for Presence,” 41st IETF, Apr. 3, 1998.
  • U.S. Provisional Patent Appl. No. 60/023,891, filed Aug. 16, 1996.
  • Mills, M. (Mar. 8, 1996) “Freebie-Heebie-Jeebies: New Long-Distance Calling Via the Internet Scares Small Phone Firms”, The Washington Post, sec. F, pp. 1-2.
  • Hughes, D.T. (Feb. 21, 1995) “What Hath (Net) God Wrought?”, The Journal [Fairfax, Virginia], sec. B, pp. 1-2.
  • Hughes, D.T. (May 28, 1996) “WebPhone Heading for Serious telephony”, The Journal, [Fairfax, Virginia], sec. A, p. 8.
  • Mills, M. (Jan. 23, 1996) “It's the Net's Best Thing to Being There: With Right Software, Computer Becomes Toll-Free Telephone”, The Washington Post, sec. C, pp. 1,5.
  • Hughes, D.T. (Jan, 2, 1996) “Internet Phone Wars Heating Up: Companies Improve and Encourage Users to Test Products”, The Journal, [Fairfax, Virginia], sec. A, p. 6.
  • Yang, C. (Feb. 12, 1995), “INETPhone: Telephone Services and Serves on Internet”, RFC 1789 http://ds.internic.net/rfc/rfc/rfc1789.txt.
  • Kuehn, Richard A. (Jul. 1994) “The Vocie of Technology”, [Online text only] Credit World, vol. 82, No. 6, pp. 20-23.
  • Margulies, Edwin (Aug. 1996) Understanding the Voice-Enabled Internet, Flatiron Publishing, Inc., pp. 4-42 and 12-1 to 12-3.
  • C. Low, “The Internet Telephony Red Herring,” Hewlett-Packard Laboratories, (May 15, 1996), pp. 1-15.
  • C. Low et al., WebIN-an architecture for fast deployment on IN-based personal services, Intelligent Network Workshop, 1996, IN'96, IEEE, (Apr. 21-24, 1996), vol. 2, 196+258.
  • Cady et al., “Mastering the Internet”, Sybex Inc., Alameda, CA, 1994, ISBN 94-69309.
  • Stevens, “TCPIP Illustrated”, vol. 1, 1994, Addison-Wesley, pp. 12-122 and inside cover.
  • Keiser et al., “Digital Telephony and Network Integration”, 1995, Chapman Hall, Second Edition, pp. 426-428. cited by examiner.
  • Chopra, Manvinder, Exploring Intelligent Peripheral Configuration, Universal Personal Communications, 1994. Record., 1994 Third Annual International Conference on, Sep. 27-Oct. 1, 1994, pp. 635-639.
  • Audio Messaging Interchange Specification (AMIS)—Analog Protocol, Version 1, Issue 2, Feb. 1992.
  • Jabbari, B., “Common Channel Signaling System No. 7 for ISDN and Intelligent Networks”, Proceedings of the IEEE, vol. 79, No. 2, Feb. 1991, pp. 155-169.
  • “Supercharging the Web with Computer Telephony”, CT and the 'Net, Mar. 1996.
  • “Audio and Video Over the Internet”, CT and the 'Net, Computer Telephony, Mar. 1996.
  • Grigonis, Richard, “Computer Telephony Over The Internet”, CT and the Net, Mar. 1996.
  • “Geek of The Week: Carl Malamud Interviews Phil Karn & Jun Murai”, Internet Talk Radio, Mobile IP Networking, Nov. 1993.
  • McConnell, Brian, “How to Build an Internet PBX”, Pacific Telephony Design, printed from http://www.phonezone.com/ip-phone.htm Mar. 5, 1997.
  • “Welcome to the Phone Zone”, Pacific Telephony Design, http://www.phonezone.com/index2.htm, pp. 1-6, 1997.
  • Sears, Andrew, “Innovations in Internet Telephony: The Internet as The Competitor to The Pots Network”, Innovations in Internet Telephony: The Internet as the Successor to the Pots Network, Feb. 28, 1996, pp. 1-6.
  • “Computer Telephony And The Internet”, Stylus Innovation, http://www.stylus.com/hvml.htm, 1996.
  • Hedrick, C., “Routing Information Protocol”, Jun. 1988, http://www.internic.net/rfc/rfc1058.txt, pp. 1-30.
  • Mills, D.L., “An Experimental Multiple-Path Routing Algorithm”, Mar. 1986, http://www.internic.net/rfc/rfc981.txt, pp. 1-20.
  • Lougheed et al., “A Border Gateway Protocol (BGP)”, Jun. 1990, http://www.internic.net.rfc/rfc1163.txt, pp. 1-26.
  • S. Deering, “Host Extensions for IP Multicasting”, Aug. 1989, http://www.internic.net/rfc/rfc1112.txt, pp. 1-16.
  • Waitzman et al., “Distance Vector Multicast Routing Protocol”, Nov. 1988, http://www.internic.net/rfc/rfc1075.txt, pp. 1-22.
  • Hinden et al., “The DARPA Internet Gateway”, Sep. 1982, http://www.internic.net.rfc.rfc823.txt, pp. 1-41.
  • “VocalTec's Telephony Gateway—The Ultimate Internet Telephony Solution?,” Computer Telephony Magazine, Sep. 1996.
  • “A Call to Phones,” Wired Magazine, Issue 4.03, http://www.wired.com/wired/archive/4.03/updata.html (Mar. 1996).
  • Mascoli, Cicchetti & Listanti, “Alternative Scenarios for Data Applications Via Internet-Mobile and DECT-ATM Interworkin,” 4th IEEE International Conference on Universal Personal Communications, pp. 788-792, Nov. 6-10, 1995 published Apr. 1995.
  • Blackwell et al. “Secure Short-Cut Routing for Mobile IP,” USENIX Summary 1994 Technical Conferences, Jun. 6-10, 1994.
  • Okada et al. “Mobile Communication Using PHS [Personal Handy Phone System] Communications Server,” National Technical Report, vol. 42, No. 1, pp. 46-54 (Feb. 1996).
  • Sattler, Michael, “Nautilus Voice Encryption,” May 10, 1995.
  • Chernov, Andrey A. “SpeakFreely” software, Apr. 18, 1996.
  • “Netspeak Corporation Introduces Webphone, Industry's First Internet-Based Telephony Solution for Business Users,” PC Forum, Mar. 18, 1996.
  • “Free World Dialup Beta 2.0a Client,” Feb. 12, 1996.
  • Kahane et al., “VocalTec IP Forum Contribution”, VocalTec Inc., Seattle, WA, Jan. 15, 1997.
  • Handley et al., “SIP: Session Initiation Protocol”, Internet Engineering Task Force, Internet Draft, Jul. 31, 1997, draft-ietf-mmusic-sip-03.txt, Jul. 31, 1997.
  • “Internet Telephony for Dummies” 2nd Edition, Chapters 14-16, 1997.
  • Kahane et al., “Call Management Agent System Specification” VoIP Forum Technical Committee, Aug. 14, 1997.
  • IMTC Voice over IP Forum Service Interoperability Implementation Agreement, Draft 0.91, Document VoIP-008, Jan. 13, 1997.
  • Sebestyn, I., ITU Telecommunication Standardization Sector, Study Group 15, Q;2&3/15 Rapporteur Meeting, Document AVC-1086, v1, Dec. 5, 1996.
  • Oppen et al., “The Clearinghouse: A Decentralized Agent for Locating Named Objects in a Distributed Environment”, ACM Transactions on Office Information Systems, vol. 1, No. 3, Jul. 1983, pp. 230-253.
  • “Camelot Announces Internet Voice Communication Technology Breakthrough”, HighBeam TM Encyclopedia, From: PR Newswire, http://www.encyclopedia.com/doc/1G1-16452259.html?Q=Caml, Feb. 13, 1995, 2 pages.
  • 1979 Annual Technical Report, “A Research Program in Computer Technology”, Oct. 1978- Sep. 1979, Prepared for the Defense Advanced Research Projects Agency, University of Southern California, ISI-SR-80-17.
  • Cohen et al., “A Network Voice Protocol NVP-11”, Lincoln Laboratory Massachsetts Institue of Technology, Apr. 1, 1981, ISI/RR-83-23.
  • 1982 Annual Technical Report, “A Research Program in Computer Technology”, Jul. 1981-Jun1982, University of Southern California, ISI-SR-83-23.
  • Annual Report to the Defense Communications Agency, “Network Speech Systems Technology Program”, Massachusetts Institute of Technology Lincoln Laboratory, Oct. 1, 1980-Sep. 30, 1981, issued Feb. 4, 1982.
  • Heggestad et al., “Voice and Data Communication Experiments on a Wideband Satellite/Terrestrial Internetwork System”, IEEE International Conference on Communications, Integrating Communication for World Progress, Jun. 19-22, 1983.
  • Annual Report to the Defense Communications Agency, “Defense Switched Network Technology and Experiments Technology”, Massachusetts Institute of Technology Lincoln Laboratory, Oct. 1, 1981-Sep. 30, 1982, issued Feb. 5, 1983.
  • Meritt, “Providing Telephone Line Access to a Packet Voice Network”, University of California, Feb. 1983, ISI/RR-83-107.
  • Weinstein, “The Experimental Integrated Switched Networks- A System Level Network Text Facility”, Proceedings of 1983 IEEE Military Communications Conference, Washington, DC, Oct. 31, 1983-Nov. 2, 1983.
  • Cesner et al., “Wideband Communications”, 1984 Annual Technical Report, University of Southern California, ISI/SR-85-150, Jul. 1983-Jun. 1984.
  • Annual Report to the Defense Communications Agency, “Defense Switched Network Technology and Experiments Technology”, Massachusetts Institute of Technology Lincoln Laboratory, Oct. 1, 1982-Sep. 30, 1983, issued Feb. 29, 1984.
  • Gross, “Proceedings of the Oct. 15-17, 1988 Joint Meeting of the Internet Engineering and Internet Architecture Task Forces”, Fourth IETF, The Mitre Corporation.
  • Corley, “Bellsouth Trail of Wideband Packet Technology”, Bellsouth Services, 1990 IEEE, CH2829-0/90/0000-1000.
  • Inoue et al., “Evolution Scenarion of Broadband Services Based on Granulated Broadband Network Concept”, IEEE Region 10 Conference, Tencon 92, Nov. 11-13, 1992.
  • Inoue et al., “Granulated Broadband Network Applicable to B-ISDN and PSTN Services”, IEEE Journal on Selected Areas in Communications, vol. 10, No. 9, Dec. 1992.
  • Cerf et al., “A Protocol for Packet Network Intercommunication”, IEEE Transactions on Communications, No. 8, May 1974.
  • Cole, “Dialing in the WB Network”, Information Sciences Institute University of Southern California, Dailing-Cole. 83, Apr. 30, 1981.
  • Hapgood, “Dialing Without Dollars”, Jul. 1995, vol. 17, No. 4, pp.18, Journal Code, INO.
  • Yang, “INETPhone: Telephone Services and Servers on the Internet”, Network Working Group, RFC 1798, Apr. 1995, http://ds.intemic.net/rfc/rfc1798.txt.
  • Chen et al., “Integrated Voice/Data Switching”, IEEE Communication Magazine, Jun. 1988, vol. 26, No. 6.
  • Frezza, “The Internet Phone is Poised to Conquer”, Communications Week, Dec. 11, 1995, http://techweb.cmp.com/cw/current.
  • “Internet Access: Internet Phone-to-Phone Technology Now a Reality..”, EDGE Publishing, Aug. 12, 1996.
  • “Internet Phone Saves 50% on Long Distance”, 411 Newsletter, Aug. 5, 1996, vol. 17, No. 15, United Communications Group.
  • “Internet Phone Calls are Cheap but LImited”, New Media Markets, Feb. 23, 1995, Financial Times Business Information, Ltd., ISSN:0265-4717.
  • “Internet Telephony Seems to be Evolving East, But is There Anyone on the Line?”, Computergram International, Aug. 19, 1996, No. 2980, ISSN: 0268-716X.
  • “Internet's International Phone Calls are Cheap But Limited”, Telecom Markets, Financial Times Business Information ID, Mar. 2, 1995, ISSN: 0267-1484.
  • Mills, The Washington Post, “Phone Service Via the Internet May Slash Rates”, Aug. 11, 1996.
  • Sears, “The Effect of Internet Telephone of the Long Distance Voice Market”, Jan. 14, 1995.
  • National Technical Information Service, Wideband Integrated Voice/Data Technology, ADA 132284, Mar. 31, 1983, Massachusetts Inst. Of Tech., Lexington, Lincoln Lab.
  • Detreville et al., “A Distributed Experimental Communications System”, Advances in Local Area Networks, IEEE Press, 1987.
  • Borden et al., “Integration of Real-Time Services in an IP-ATM Network”, Internet RFC/STD/FYI/BCP ARchives, Aug. 1995.
  • Laubach, “Classical IP and ARP over ATM” Hewlett-Packard Laboratories, Jan. 1994, http://www.faqs.org/rfc/rfc1577.txt.
  • Comer, “Internetworking with TCP/IP”, vol. 1, Principles, Protocols, and Architecture, Department of Computer Sciences, 1995.
  • Perez et al., “ATM Signaling for IP Over ATM”, Network Working Group, RFC 1765, Feb. 1995, http:/www.ietf.org/rfc/rfc1765.txt.
Patent History
Patent number: 7486660
Type: Grant
Filed: Jul 23, 2001
Date of Patent: Feb 3, 2009
Assignee: Verizon Services Corp. (Arlington, VA)
Inventors: Dale L. Bartholomew (Vienna, VA), Robert D. Farris (Sterling, VA), Stephen J. Flaherty (Upper Marlboro, MD)
Primary Examiner: Wing F Chan
Assistant Examiner: Duc T Duong
Application Number: 09/909,784
Classifications