Transport of caller identification information through diverse communication networks

Information

  • Patent Grant
  • 7486660
  • Patent Number
    7,486,660
  • Date Filed
    Monday, July 23, 2001
    23 years ago
  • Date Issued
    Tuesday, February 3, 2009
    15 years ago
  • US Classifications
    Field of Search
    • US
    • 370 259000
    • 370 351-356
    • 370 373000
    • 370 385000
    • 370 389000
    • 370 401000
    • 370 466000
    • 370 400000
    • 379 093230
    • 379 142000
    • 379 201000
    • 379 219000
  • International Classifications
    • H04L12/64
    • Term Extension
      1008
Abstract
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.
Description
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. 5
a 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. 5
a 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; andthe 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; andtransporting 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- andan 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, andthe 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.
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.

US Referenced Citations (592)
Number Name Date Kind
4191860 Weber Mar 1980 A
4310727 Lawser Jan 1982 A
4313035 Jordan et al. Jan 1982 A
4313036 Jabara et al. Jan 1982 A
4371751 Hilligoss, Jr. et al. Feb 1983 A
4371752 Matthews et al. Feb 1983 A
4375097 Ulug Feb 1983 A
4555594 Friedes et al. Nov 1985 A
4565903 Riley Jan 1986 A
4577066 Bimonte et al. Mar 1986 A
4585906 Matthews et al. Apr 1986 A
4602129 Matthews et al. Jul 1986 A
4609778 Franklin et al. Sep 1986 A
4611094 Asmuth et al. Sep 1986 A
4611096 Asmuth et al. Sep 1986 A
4625081 Lotito et al. Nov 1986 A
4630262 Callens et al. Dec 1986 A
4652700 Matthews et al. Mar 1987 A
4672700 Poncy Jun 1987 A
4710917 Tompkins et al. Dec 1987 A
4730071 Schoenthal Mar 1988 A
4734931 Bourg et al. Mar 1988 A
4741820 Coughlin May 1988 A
4748618 Brown et al. May 1988 A
4765924 Inoue Aug 1988 A
4766604 Axberg Aug 1988 A
4771425 Baran et al. Sep 1988 A
4782485 Gollub Nov 1988 A
4788718 McNabb et al. Nov 1988 A
4790003 Kepley et al. Dec 1988 A
4827500 Binkerd et al. May 1989 A
4865763 Inoue Sep 1989 A
4866763 Cooper et al. Sep 1989 A
4872157 Hemmady et al. Oct 1989 A
4872160 Hemmady et al. Oct 1989 A
4872197 Pemmaraju Oct 1989 A
4875206 Nichols et al. Oct 1989 A
4877949 Danielson Oct 1989 A
4882476 White Nov 1989 A
4894824 Hemmady et al. Jan 1990 A
4897874 Lidinsky et al. Jan 1990 A
4899333 Roediger Feb 1990 A
4899373 Lee et al. Feb 1990 A
4910794 Mahany Mar 1990 A
4916691 Goodman Apr 1990 A
4918722 Duehren et al. Apr 1990 A
4922348 Gillon et al. May 1990 A
4922486 Lidinsky et al. May 1990 A
4942574 Zelle Jul 1990 A
4958341 Hemmady et al. Sep 1990 A
4969184 Gordon et al. Nov 1990 A
D315573 Schultz Mar 1991 S
5008906 Reichwein Apr 1991 A
5008926 Misholi Apr 1991 A
5009337 Bimbi Apr 1991 A
5012511 Hanle et al. Apr 1991 A
5018191 Catron et al. May 1991 A
5019699 Koenck May 1991 A
5029199 Jones et al. Jul 1991 A
5029200 Haas et al. Jul 1991 A
5031098 Miller Jul 1991 A
5034975 Grimes Jul 1991 A
5052020 Koenck Sep 1991 A
5052943 Davis Oct 1991 A
5070536 Mahany Dec 1991 A
5098877 Coughlin Mar 1992 A
5115431 Williams et al. May 1992 A
5123064 Hacker Jun 1992 A
5134647 Pugh et al. Jul 1992 A
5144282 Sutterlin Sep 1992 A
5146491 Silver et al. Sep 1992 A
5163080 Amoroso et al. Nov 1992 A
5180232 Chadma Jan 1993 A
5185860 Wu Feb 1993 A
5193110 Jones et al. Mar 1993 A
5195086 Baumgartner et al. Mar 1993 A
5195128 Knitl Mar 1993 A
5195183 Miller Mar 1993 A
5199062 Von Meister Mar 1993 A
5200993 Wheeler et al. Apr 1993 A
5202817 Koenck Apr 1993 A
5202825 Miller Apr 1993 A
5206901 Harlow et al. Apr 1993 A
5208848 Pula May 1993 A
5215011 Monney Jun 1993 A
5216233 Main Jun 1993 A
5218187 Koenck Jun 1993 A
5218188 Hanson Jun 1993 A
5223820 Sutterlin Jun 1993 A
5225071 Coughlin Jul 1993 A
5227614 Danielson Jul 1993 A
5231492 Dangi et al. Jul 1993 A
5235317 Sutterlin Aug 1993 A
5237604 Ryan Aug 1993 A
5243645 Bissell et al. Sep 1993 A
5243654 Hunter Sep 1993 A
5247571 Kay et al. Sep 1993 A
5254971 Sutterlin Oct 1993 A
5260986 Pershan Nov 1993 A
5263080 Jones et al. Nov 1993 A
5272749 Masek Dec 1993 A
5274696 Perelman Dec 1993 A
5280159 Schultz et al. Jan 1994 A
5289378 Miller Feb 1994 A
5289468 Yoshida Feb 1994 A
5295154 Meier Mar 1994 A
5303297 Hillis Apr 1994 A
5305181 Schultz Apr 1994 A
5308966 Danielson May 1994 A
5309437 Perlman et al. May 1994 A
5313053 Koenck May 1994 A
5317691 Traeger May 1994 A
5318719 Hughes Jun 1994 A
5322991 Hanson Jun 1994 A
5327421 Hiller et al. Jul 1994 A
5327486 Wolff et al. Jul 1994 A
5331580 Miller Jul 1994 A
5333266 Boaz Jul 1994 A
5341374 Lewen et al. Aug 1994 A
5345446 Hiller et al. Sep 1994 A
5346611 Coughlin Sep 1994 A
5347633 Ashfield et al. Sep 1994 A
5349497 Hanson Sep 1994 A
5349678 Morris Sep 1994 A
5353331 Emery et al. Oct 1994 A
5359185 Hanson Oct 1994 A
5361256 Doeringer et al. Nov 1994 A
5365524 Hiller et al. Nov 1994 A
5365546 Koenck Nov 1994 A
5367566 Moe et al. Nov 1994 A
5371858 Miller Dec 1994 A
5375068 Palmer et al. Dec 1994 A
5375159 Williams Dec 1994 A
5377186 Wegner et al. Dec 1994 A
5381465 Carter et al. Jan 1995 A
5384831 Creswell et al. Jan 1995 A
5384840 Blatchford et al. Jan 1995 A
5386467 Ahmad Jan 1995 A
5390175 Hiller et al. Feb 1995 A
5394436 Meier Feb 1995 A
5400393 Knuth Mar 1995 A
5406557 Baudoin Apr 1995 A
5408237 Patterson et al. Apr 1995 A
5408382 Schultz Apr 1995 A
5410141 Koenck Apr 1995 A
5410754 Klotzbach et al. Apr 1995 A
5416842 Aziz May 1995 A
5420211 Hughes May 1995 A
5420916 Sekiguchi May 1995 A
5422882 Hiller et al. Jun 1995 A
5422941 Hasenauer et al. Jun 1995 A
5425028 Britton et al. Jun 1995 A
5425051 Mahany Jun 1995 A
5425090 Orriss Jun 1995 A
5425091 Josephs Jun 1995 A
5425780 Flatt et al. Jun 1995 A
5426636 Hiller et al. Jun 1995 A
5428636 Meier Jun 1995 A
5430719 Weisser, Jr. Jul 1995 A
5430727 Callon Jul 1995 A
5434852 La Porta et al. Jul 1995 A
5434913 Tung et al. Jul 1995 A
5436957 McConnell Jul 1995 A
5440621 Castro Aug 1995 A
5442690 Nazif et al. Aug 1995 A
5444709 Riddle Aug 1995 A
5452287 DiCecco et al. Sep 1995 A
5457629 Miller Oct 1995 A
5465207 Boatwright Nov 1995 A
5466170 Pavek Nov 1995 A
5468947 Danielson Nov 1995 A
5468950 Hanson Nov 1995 A
5469497 Pierce et al. Nov 1995 A
5469500 Satter et al. Nov 1995 A
5473677 D'Amato et al. Dec 1995 A
5475732 Pester, III Dec 1995 A
5475737 Garner et al. Dec 1995 A
5475748 Jones Dec 1995 A
5479494 Clitherow Dec 1995 A
5483549 Weinberg et al. Jan 1996 A
5483587 Hogan et al. Jan 1996 A
5483676 Mahany Jan 1996 A
5487111 Slusky Jan 1996 A
5488575 Danielson Jan 1996 A
5490247 Tung et al. Feb 1996 A
5493568 Sampat et al. Feb 1996 A
5493573 Kobayashi et al. Feb 1996 A
5500859 Sharma et al. Mar 1996 A
5504746 Meier Apr 1996 A
5506887 Emery et al. Apr 1996 A
5506893 Buscher et al. Apr 1996 A
5515303 Cargin, Jr. May 1996 A
5517434 Hanson May 1996 A
5517560 Greenspan May 1996 A
5524145 Parker Jun 1996 A
5526353 Henley et al. Jun 1996 A
5526489 Nilakantan et al. Jun 1996 A
5528539 Ong Jun 1996 A
5537470 Lee Jul 1996 A
5539193 Gibbs Jul 1996 A
5539194 Miller Jul 1996 A
5541398 Hanson Jul 1996 A
5544010 Schultz Aug 1996 A
5555276 Koenck Sep 1996 A
5559068 Chen Sep 1996 A
5559871 Smith Sep 1996 A
5568645 Morris Oct 1996 A
5572583 Wheeler, Jr. et al. Nov 1996 A
5575961 Kuwabara et al. Nov 1996 A
5576529 Koenck Nov 1996 A
5583920 Wheeler, Jr. Dec 1996 A
5583926 Venier et al. Dec 1996 A
5583929 Ardon Dec 1996 A
5586175 Hogan Dec 1996 A
5587577 Schultz Dec 1996 A
5590133 Billstrom et al. Dec 1996 A
5590181 Hogan Dec 1996 A
5590346 West Dec 1996 A
5594717 Watanabe et al. Jan 1997 A
5594784 Velius Jan 1997 A
5598464 Hess et al. Jan 1997 A
5598487 Hacker Jan 1997 A
5602456 Cargin Feb 1997 A
5602854 Luse Feb 1997 A
5604737 Iwami et al. Feb 1997 A
5608446 Carr et al. Mar 1997 A
5608447 Farry et al. Mar 1997 A
5608706 Park Mar 1997 A
5608786 Gordon Mar 1997 A
5610910 Focsaneanu et al. Mar 1997 A
5610977 Williams et al. Mar 1997 A
5615251 Hogan Mar 1997 A
5617343 Danielson Apr 1997 A
5621787 McKoy et al. Apr 1997 A
5625180 Hanson Apr 1997 A
5625555 Davis Apr 1997 A
5625675 Katsumaru et al. Apr 1997 A
5625681 Butler, II Apr 1997 A
5625682 Gray et al. Apr 1997 A
5626682 Kobari et al. May 1997 A
5633919 Hogan May 1997 A
5638430 Hogan Jun 1997 A
5640001 Danielson Jun 1997 A
5644471 Schultz Jul 1997 A
5657317 Mahany Aug 1997 A
5661790 Hsu Aug 1997 A
5661792 Akinpelu et al. Aug 1997 A
5663208 Martin Sep 1997 A
5671436 Morrison Sep 1997 A
5672860 Miller Sep 1997 A
5673031 Meier Sep 1997 A
5679943 Schultz et al. Oct 1997 A
5680442 Bartholomew et al. Oct 1997 A
5680446 Fleischer et al. Oct 1997 A
5680633 Koenck Oct 1997 A
5682379 Mahany Oct 1997 A
5694318 Miller Dec 1997 A
5696903 Mahany Dec 1997 A
5699528 Hogan Dec 1997 A
5706286 Reiman et al. Jan 1998 A
5708680 Gollnick Jan 1998 A
5708833 Kinney Jan 1998 A
5710728 Danielson Jan 1998 A
5712903 Bartholomew et al. Jan 1998 A
5712907 Wegner et al. Jan 1998 A
5722067 Fougnies Feb 1998 A
5724355 Bruno et al. Mar 1998 A
5724412 Srinivasan Mar 1998 A
5726984 Kubler et al. Mar 1998 A
5727002 Miller et al. Mar 1998 A
5732078 Arango Mar 1998 A
5732213 Gessel et al. Mar 1998 A
5737395 Irribarren Apr 1998 A
5737404 Segal Apr 1998 A
5737414 Walker et al. Apr 1998 A
5740164 Liron Apr 1998 A
5740366 Mahany Apr 1998 A
5742596 Baratz et al. Apr 1998 A
5742668 Pepe et al. Apr 1998 A
5742670 Bennett Apr 1998 A
5742675 Kilander et al. Apr 1998 A
5747785 Miller May 1998 A
5747786 Cargin, Jr. May 1998 A
5748619 Meier May 1998 A
5751706 Land et al. May 1998 A
5751707 Voit et al. May 1998 A
5751961 Smyk May 1998 A
5761294 Shaffer et al. Jun 1998 A
5763867 Main Jun 1998 A
5764741 Barak Jun 1998 A
5768513 Kuthyar et al. Jun 1998 A
5774535 Castro Jun 1998 A
5774660 Brendel et al. Jun 1998 A
5774695 Autrey et al. Jun 1998 A
5778313 Fougnies Jul 1998 A
5781620 Montgomery et al. Jul 1998 A
5790536 Mahany Aug 1998 A
5790548 Sistanizadeh et al. Aug 1998 A
5793762 Penners et al. Aug 1998 A
5793763 Mayes et al. Aug 1998 A
5793771 Darland et al. Aug 1998 A
5799072 Vulcan et al. Aug 1998 A
5799156 Hogan Aug 1998 A
5802502 Gell et al. Sep 1998 A
5802513 Bowie, III Sep 1998 A
5804805 Koenck Sep 1998 A
5805474 Danielson Sep 1998 A
5805587 Norris Sep 1998 A
5805807 Hanson Sep 1998 A
5809128 McMullin Sep 1998 A
5812639 Bartholomew et al. Sep 1998 A
5812795 Horovitz et al. Sep 1998 A
5818836 DuVal Oct 1998 A
5825780 Christie Oct 1998 A
5825863 Walker Oct 1998 A
5828740 Khuc et al. Oct 1998 A
5834753 Danielson Nov 1998 A
5838665 Kahn et al. Nov 1998 A
5838682 Dekelbaum et al. Nov 1998 A
5841764 Roderique et al. Nov 1998 A
5844893 Gollnick Dec 1998 A
5844896 Marks et al. Dec 1998 A
5845267 Ronen Dec 1998 A
5848143 Andrews et al. Dec 1998 A
5850358 Danielson Dec 1998 A
5850433 Rondeau Dec 1998 A
5854833 Hogan Dec 1998 A
5854975 Fougnies Dec 1998 A
5862171 Mahany Jan 1999 A
5864610 Ronen Jan 1999 A
5867495 Elliott et al. Feb 1999 A
5867562 Scherer Feb 1999 A
5867566 Hogan Feb 1999 A
5870565 Glitho Feb 1999 A
5873099 Hogan Feb 1999 A
5883891 Williams et al. Mar 1999 A
5884032 Bateman et al. Mar 1999 A
5888087 Hanson Mar 1999 A
5889774 Mirashrafi et al. Mar 1999 A
5892822 Gottlieb et al. Apr 1999 A
5892971 Danielson Apr 1999 A
5895431 Miller Apr 1999 A
5895906 Danielson Apr 1999 A
5898668 Shaffer Apr 1999 A
5898673 Riggan et al. Apr 1999 A
5901140 Van As et al. May 1999 A
5903558 Jones et al. May 1999 A
5905736 Ronen et al. May 1999 A
5907547 Foladare et al. May 1999 A
5910946 Csapo Jun 1999 A
5912887 Sehgal Jun 1999 A
5914481 Danielson Jun 1999 A
5915001 Uppaluru Jun 1999 A
5915005 He Jun 1999 A
5917175 Miller Jun 1999 A
5917424 Goldman et al. Jun 1999 A
5918179 Foladare et al. Jun 1999 A
5923659 Curry et al. Jul 1999 A
5926482 Christie Jul 1999 A
5928292 Ishikawa et al. Jul 1999 A
5930343 Vasquez Jul 1999 A
5937045 Yaoya et al. Aug 1999 A
5940479 Guy et al. Aug 1999 A
5940598 Strauss et al. Aug 1999 A
5940771 Gollnick Aug 1999 A
5946299 Blonder Aug 1999 A
5946386 Rogers et al. Aug 1999 A
5949056 White Sep 1999 A
5949776 Mahany Sep 1999 A
5953322 Kimball Sep 1999 A
5953338 Ma et al. Sep 1999 A
5953504 Sokal et al. Sep 1999 A
5953651 Lu et al. Sep 1999 A
5956391 Melen et al. Sep 1999 A
5958016 Chang et al. Sep 1999 A
5958052 Bellovin Sep 1999 A
5959998 Takahashi et al. Sep 1999 A
5966431 Reiman et al. Oct 1999 A
5969321 Danielson Oct 1999 A
5970065 Miloslavsky Oct 1999 A
5970477 Roden Oct 1999 A
5974043 Solomon Oct 1999 A
5974052 Johnson et al. Oct 1999 A
5978569 Traeger Nov 1999 A
5978840 Nguyen et al. Nov 1999 A
5979768 Koenck Nov 1999 A
5982774 Foladare et al. Nov 1999 A
5987499 Morris Nov 1999 A
5991291 Asai et al. Nov 1999 A
5991292 Focsaneanu et al. Nov 1999 A
5991308 Fuhrmann et al. Nov 1999 A
5991864 Kinney Nov 1999 A
5995606 Civanlar et al. Nov 1999 A
6005926 Mashinsky Dec 1999 A
6006100 Koenck Dec 1999 A
6006253 Kumar et al. Dec 1999 A
6012088 Li et al. Jan 2000 A
6014379 White et al. Jan 2000 A
6016343 Hogan Jan 2000 A
6018360 Stewart et al. Jan 2000 A
6021126 White et al. Feb 2000 A
6023147 Cargin Feb 2000 A
6023474 Gardner et al. Feb 2000 A
6026087 Mirashrafi et al. Feb 2000 A
6026091 Christie Feb 2000 A
6028858 Rivers et al. Feb 2000 A
6029261 Hartmann Feb 2000 A
6031840 Christie Feb 2000 A
6036093 Schultz Mar 2000 A
6046992 Meier Apr 2000 A
6047051 Ginzboorg et al. Apr 2000 A
6047326 Kilkki Apr 2000 A
6049813 Danielson Apr 2000 A
6052445 Bashoura et al. Apr 2000 A
6058000 Koenck May 2000 A
6064653 Farris May 2000 A
6069890 White et al. May 2000 A
6075783 Voit Jun 2000 A
6078582 Curry et al. Jun 2000 A
6078943 Yu Jun 2000 A
6081525 Christie Jun 2000 A
6084867 Meier Jul 2000 A
6088431 LaDue Jul 2000 A
6104645 Ong Aug 2000 A
6104704 Buhler et al. Aug 2000 A
6108341 Christie Aug 2000 A
6112206 Morris Aug 2000 A
6115737 Ely et al. Sep 2000 A
6118936 Lauer et al. Sep 2000 A
6122255 Bartholomew et al. Sep 2000 A
6125113 Farris et al. Sep 2000 A
6131121 Mattaway Oct 2000 A
6134235 Goldman et al. Oct 2000 A
6134530 Bunting et al. Oct 2000 A
6137792 Jonas et al. Oct 2000 A
6141404 Westerlage et al. Oct 2000 A
6141412 Smith et al. Oct 2000 A
6144976 Silva Nov 2000 A
6149062 Danielson Nov 2000 A
6154445 Farris et al. Nov 2000 A
6157621 Brown et al. Dec 2000 A
6157636 Voit et al. Dec 2000 A
6157648 Voit et al. Dec 2000 A
6157823 Fougnies et al. Dec 2000 A
6181695 Curry et al. Jan 2001 B1
6181703 Christie Jan 2001 B1
6185184 Mattaway Feb 2001 B1
6192050 Stovall Feb 2001 B1
6192400 Hanson Feb 2001 B1
6195425 Farris et al. Feb 2001 B1
6201812 Christie Mar 2001 B1
6205139 Voit Mar 2001 B1
6212193 Christie Apr 2001 B1
6215790 Voit et al. Apr 2001 B1
6226678 Mattaway May 2001 B1
6236851 Fougnies May 2001 B1
6243373 Turock Jun 2001 B1
6243374 White Jun 2001 B1
6263372 Hogan Jul 2001 B1
6266685 Danielson Jul 2001 B1
6279038 Hogan Aug 2001 B1
6282192 Murphy et al. Aug 2001 B1
6282284 Dezonno et al. Aug 2001 B1
6285745 Bartholomew et al. Sep 2001 B1
6289010 Voit et al. Sep 2001 B1
6292478 Farris Sep 2001 B1
6292479 Bartholomew et al. Sep 2001 B1
6292481 Voit et al. Sep 2001 B1
6295292 Voit et al. Sep 2001 B1
6298057 Guy Oct 2001 B1
6298064 Christie Oct 2001 B1
6304567 Rosenberg Oct 2001 B1
6314103 Medhat et al. Nov 2001 B1
6327258 Deschaine et al. Dec 2001 B1
6330250 Curry et al. Dec 2001 B1
6335927 Elliott Jan 2002 B1
6363065 Thornton et al. Mar 2002 B1
6363349 Urs et al. Mar 2002 B1
6374302 Galasso et al. Apr 2002 B1
6375344 Hanson Apr 2002 B1
6385191 Coffman et al. May 2002 B1
6400702 Meier Jun 2002 B1
6407991 Meier Jun 2002 B1
6430195 Christie Aug 2002 B1
6430275 Voit et al. Aug 2002 B1
6438218 Farris Aug 2002 B1
6449259 Allain et al. Sep 2002 B1
6449356 Dezonno Sep 2002 B1
6480588 Donovan Nov 2002 B1
6493353 Kelly et al. Dec 2002 B2
6513066 Hutton Jan 2003 B1
6539015 Voit et al. Mar 2003 B2
6542497 Curry Apr 2003 B1
6546003 Farris Apr 2003 B1
6574216 Farris et al. Jun 2003 B1
6584093 Salama et al. Jun 2003 B1
6600735 Iwama et al. Jul 2003 B1
6614768 Mahany Sep 2003 B1
6614781 Elliott Sep 2003 B1
6621942 Hacker Sep 2003 B1
6625170 Curry et al. Sep 2003 B1
6633846 Bennett et al. Oct 2003 B1
6643362 Hogan Nov 2003 B2
6678718 Khouri et al. Jan 2004 B1
6681994 Koenck Jan 2004 B1
6687738 Hutton Feb 2004 B1
6688523 Koenck Feb 2004 B1
6694359 Morris Feb 2004 B1
6701365 Hutton Mar 2004 B1
6711241 White et al. Mar 2004 B1
6714559 Meier Mar 2004 B1
6714983 Koenck Mar 2004 B1
6760429 Hung et al. Jul 2004 B1
6792256 Kinney Sep 2004 B1
6823384 Wilson et al. Nov 2004 B1
6826165 Meier Nov 2004 B1
6829645 Hutton Dec 2004 B1
6870827 Voit et al. Mar 2005 B1
6885678 Curry et al. Apr 2005 B2
6895419 Cargin May 2005 B1
6910632 Koerck Jun 2005 B2
6925054 Atterton et al. Aug 2005 B1
6990090 Meier Jan 2006 B2
7012898 Farris et al. Mar 2006 B1
7079534 Medhat Jul 2006 B1
7085362 Christie Aug 2006 B1
7088705 Curry Aug 2006 B2
7092379 Singh et al. Aug 2006 B1
7120319 Danielson Oct 2006 B2
7149208 Mattaway Dec 2006 B2
7206592 Gollnick Apr 2007 B1
7274662 Kalmanek, Jr. et al. Sep 2007 B1
20020159461 Hamamoto et al. Oct 2002 A1
20030078006 Mahany Apr 2003 A1
20030169767 Christie May 2003 A1
20030112767 Meier Jun 2003 A1
20030189941 Christie Oct 2003 A1
20040018851 Koenck Jan 2004 A1
20040023651 Gollnick Feb 2004 A1
20040038717 Mahany Feb 2004 A1
20040039846 Goss et al. Feb 2004 A1
20040044667 Mahany Mar 2004 A1
20040073933 Gollnick Apr 2004 A1
20040090952 Kubler May 2004 A1
20040093363 Cargin May 2004 A1
20040114567 Kubler Jun 2004 A1
20040125753 Mahany Jul 2004 A1
20040145775 Kubler Jul 2004 A1
20040146020 Kubler Jul 2004 A1
20040146037 Kubler Jul 2004 A1
20040151150 Kubler Aug 2004 A1
20040151151 Kubler Aug 2004 A1
20040151164 Kubler Aug 2004 A1
20040160912 Kubler Aug 2004 A1
20040160913 Kubler Aug 2004 A1
20040162889 Morris Aug 2004 A1
20040165573 Kubler Aug 2004 A1
20040165793 Hacker Aug 2004 A1
20040166895 Koenck Aug 2004 A1
20040169583 Meier Sep 2004 A1
20040174841 Kubler Sep 2004 A1
20040174842 Kubler Sep 2004 A1
20040174843 Kubler Sep 2004 A1
20040203834 Mahany Oct 2004 A1
20040246940 Kubler Dec 2004 A1
20040264442 Kubler Dec 2004 A1
20050008002 Kubler Jan 2005 A1
20050013266 Kubler Jan 2005 A1
20050036467 Kubler Feb 2005 A1
20050078647 Meier Apr 2005 A1
20050083872 Kubler Apr 2005 A1
20050087603 Mahany Apr 2005 A1
20050195859 Mahany Sep 2005 A1
20050232213 Meier Oct 2005 A1
20050242192 Koenck Nov 2005 A1
20050254475 Kubler Nov 2005 A1
20060007951 Meier Jan 2006 A1
20060062240 Meier Mar 2006 A1
20060131420 Koenck Jun 2006 A1
20060233161 Koenck Oct 2006 A1
20060251226 Hogan Nov 2006 A1
20060268806 Meier Nov 2006 A1
20060268807 Meier Nov 2006 A1
20060291752 Hacker Dec 2006 A1
20070001007 Koenck Jan 2007 A1
20070007353 Danielson Jan 2007 A1
20070065046 Hacker Mar 2007 A1
20070076687 Low et al. Apr 2007 A1
20070086445 Mattaway Apr 2007 A1
20070121529 Meier May 2007 A1
20070206576 Radulovic Sep 2007 A1
20070263644 Christie et al. Nov 2007 A1
Foreign Referenced Citations (7)
Number Date Country
0235257 Sep 1987 EP
0335562 Apr 1989 EP
0365885 May 1990 EP
0381365 Aug 1990 EP
0722237 Nov 2007 EP
9720424 Jun 1997 WO
9723078 Jun 1997 WO
Continuations (1)
Number Date Country
Parent 08822602 Mar 1997 US
Child 09909784 US