The present invention relates to the routing of signaling messages in a communications network, and more particularly to methods and systems for routing signaling messages destined for database network elements.
In modern telephony networks, service control points (SCPs) serve as an interface to telephony related databases, such as: call management services databases (CMSDB); line information databases (LIDB); and business services databases (BSDB). These databases are used, at least in part, to facilitate a variety of advanced intelligent network (AIN) related services including: find me service; follow me service; computer security service; call pickup service; store locator service; call waiting service; call block service; calling name delivery service; three way calling service; and 800 number services.
With particular regard to find me service, this service allows calls to be forwarded to another location. The difference between this feature and current call forwarding functionality is the ability to screen unwanted calls from forwarding. Only authorized callers are forwarded to the new location. Similarly, follow me service allows a number to be forwarded on a time schedule. The subscriber determines the time forwarding is to take place when the feature is invoked. Destinations can include both wired and wireless telephones or handsets.
Computer security service allows subscribers to prevent unauthorized callers from accessing a computer or application services. Only callers with the authorized access code or calling from an authorized number can access the services. The SS7 network delivers the calling party number to the destination end office. This number is then checked in a database located with a service control point (SCP), and, if authorized, is allowed to connect with the application. With call pickup service, when a call is placed to a number and is unanswered, the called party can be paged via radio pager. The called party can then dial a code from any telephone at any location and immediately be connected with the waiting caller. With regard to paging type services, manufacturers of such personal communications services (PCS) devices have to date developed two-way pagers that connect a caller with the party being paged. The pager is a two-way transceiver capable of receiving calls (pages) and connecting the caller with the paged party.
Store locator service allows businesses to advertise one number, and have callers automatically transferred to the nearest location based on the caller's telephone number. This allows businesses to advertise nationwide for all locations without special ads that are region specific. The calling party number is matched in a routing database located at an SCP, and the SCP provides the end office with the routing instructions based on the calling party number. With call routing service, businesses can reroute calls during periods of excessively high call volumes or after business hours.
It will be further appreciated that such telephony service databases may also be employed to provide communication service subscribers the flexibility to easily port their service from one communication service provider to another (i.e., number portability or local number portability). The application of such SCP-type database services is not limited to the traditional wired public switched telephone network (PSTN), but is also widely implemented in the wireless telecommunications industry. Typical wireless network communication database applications include; home location registers (HLRs), visitor location registers (VLRs), authentication centers (AuCs), and equipment identification registers (EIRs). In general, SCPs are the network elements that include database systems for providing the services discussed above.
It will also be appreciated that with the continuing convergence of traditional data networks and traditional telecommunication networks, the number and variety of converged or inter-network service related database applications designed to service the needs of combined data-telecommunications subscribers (e.g., presence service databases) will increase dramatically in the future.
With particular regard to traditional SCP network database elements, those skilled in the art of telecommunication network services will appreciate that an SCP is typically comprised of both a front end computer processor system and a back end database system. That is, the SCP front end processor (FEP) system typically does not store or contain the bulk data or information, but instead is the interface to a mainframe or minicomputer system that holds the actual database. Typically, there is a one-to-one correspondence between each FEP and an associated back end computing platform. In a signaling system 7 (SS7) signaling network environment, communication between an SCP front end and other nodes in the SS7 network is accomplished via dedicated SS7 communication links, while communication between the SCP front end and mainframe database back end is typically affected via a TCP/IP connection (or X.25 in older legacy systems). However, it should be noted that even within the telecommunications industry it is not uncommon to hear the term SCP used to describe the combination of front-end processors and mainframe back end database systems.
From an accessibility standpoint, the SS7 network address component of an SCP front end is a point code (PC), while the address component of an application residing on the database back end is referred to as a subsystem number (SSN). A single SCP may contain multiple applications and databases, and as such, there may be multiple subsystem numbers associated with a single SCP point code. Consequently, each SCP must be assigned a unique SS7 network address PC, but may have multiple back end database subsystems provisioned under each unique SS7 network address PC.
Typically, the front end of an SCP located in an SS7 network can perform protocol conversion from SS7 to TCP/IP (or SS7 to X.25 in the case of legacy systems), or it may provide the capability of communicating with the associated back end database directly through the use of primitives. A primitive is an interface that provides access from one level of the protocol to another level. In the case of back end databases, each database is considered to be an application entity, and the protocol used to access and interface to each application entity is known as transaction capabilities application part or TCAP.
Shown in
Given the above description of network 100, it will be appreciated by one skilled in the art of telecommunication signaling operations that if, for instance, Calling Name (CNAM) service is requested by a subscriber that is serviced by SSP 110, then SSP 110 will be required to formulate and send a CNAM query-type SS7 signaling message to STP 112 via the dedicated SS7 communication link 114. If it is also assumed that a database application corresponding to SSN 20 of SCP 116 is provisioned to provide CNAM-type information, then CNAM query message will either be addressed directly to the PC & SSN of SCP 116 (i.e., PC: 1-1-1, SSN: 20), or the CNAM query message will be addressed so as to request a final destination address translation at the STP 112 (i.e., through global title translation). For purposes of illustration, it is assumed that global title translation service is not required and, consequently, that the CNAM query message is addressed directly to SCP 116 (i.e., PC: 1-1-1, SSN: 20). As such, the CNAM query message is received by STP 112 and subsequently routed over communication link 118 to FEP 128. FEP 128 in turn receives the CNAM query message, processes the message, and facilitates access to the CNAM data stored in the BED 130. Ultimately, a CNAM reply message addressed to SSP 110 (PC: 3-1-1) is formulated and transmitted back to STP 112, which in turn routes the message to SSP 110.
As described above, each complete SCP unit is equipped with a front end processor that is responsible for managing the unit's associated database resources. Such management functions include: protocol conversion, message parsing, administration of inbound queries and outbound responses, load sharing, etc. Each front end processor is integral with the SCP unit and consequently, there is a one-to-one relationship that exists between front end processors and SCP units. Front end processors are expensive, and what is needed is a way to reduce the overall cost of SCP units by allowing one front end processor to drive multiple SCP units.
Therefore, what is needed is a system and method of incorporating SCP front end processing functionality within a communications network routing node such that multiple SCP back ends can be serviced by the single routing node. Furthermore, the SS7 signaling links typically employed to connect to SCP units are capital intensive and expensive to maintain. Consequently, a method of connecting to SCP units that does not require dedicated, expensive SS7 signaling links is also needed.
According to one aspect, the present invention includes a communications network element that is capable of generally routing messages and also performing load sharing, protocol conversion, and other services that have traditionally been provided by SCP front end processing (FEP) modules. The FEP routing node includes a communication module or modules capable of transmitting and receiving data packets over both SS7 and IP networks. A message discrimination process examines incoming data packets and subsequently directs certain packets to a database access control process that administers database lookup, protocol translation, and other FEP related processing services.
The functions for providing database access control are described herein as modules or processes. It is understood that these modules or processes may be implemented as computer-executable instructions embodied in a computer-readable medium. Alternatively, the modules or processes described herein may be implemented entirely in hardware. In yet another alternative embodiment, the modules or processes described herein may be implemented as a combination of hardware and software.
The processes and modules for providing database access control are described below as being associated with cards or subsystems within a routing node. It is understood that these cards or subsystems include hardware for storing and executing the processes and modules. For example, each card or subsystems described below may include one or more microprocessors, such as a Pentium® processor available from Intel Corporation, and associated memory.
Accordingly, it is an object of the present invention to provide a routing node that offers centralized front end processing functionality to multiple SCP back ends.
It is yet another object of the present invention to provide a routing node that facilitates load sharing functionality among multiple SCP back ends.
It is yet another object of the present invention to provide a routing node that facilitates message protocol translation. It is yet another object of the present invention to provide a method of eliminating the need for SS7 network point codes associated with SCP nodes.
It is yet another object of the present invention to provide a method of creating a virtual SCP that is comprised of multiple SCP back end databases, where the virtual SCP is assigned a single SS7 network point code.
It is yet another object of the present invention to provide a method of mapping multiple SCP nodes to a single SS7 network point code.
It is yet another object of the present invention to provide a method of allowing all messages requiring SCP service to be addressed to an SS7 point code that is the same as the SS7 point code of a router of the present invention.
It is yet another object of the present invention to provide a method of allowing messages to be routed based on the ownership of a database or SCP node.
Some of the objects of the invention having been stated hereinabove, other objects will become evident as the description proceeds, when taken in connection with the accompanying drawings as best described hereinbelow.
Embodiments of the invention will now be described with reference to the accompanying drawings, of which:
Disclosed herein are several embodiments of the present invention, all of which include a network element that performs functions similar to that of a traditional telecommunications network packet routing switch, such as a signal transfer point (STP). Each of the embodiments described and discussed below, employs an internal architecture similar to that of high performance STP and signaling gateway (SG) products which are marketed by Tekelec, Inc. of Calabasas, Calif. as the Eagle® STP and IP7 Secure Gateway™, respectively. A block diagram that generally illustrates the base internal architecture of the IP7 Secure Gateway™ product is shown in
The application subsystem 256 includes application cards that are capable of communicating with the other cards through the IMT buses. Numerous types of application cards can be incorporated into STP 250, including but not limited to: al link interface module (LIM) 258 that provides SS7 links and X.25 links, a database communication module (DCM) 260 that provides an IP interface using transmission control protocol (TCP), and an application service module (ASM) 262 that provides global title translation, gateway screening and other services. A translation service module (TSM) 264 may also be provided to support triggered local number portability service. Once again, a detailed description of the Eagle® STP is provided in the above-cited Eagle® Feature Guide and need not be described in detail herein. It should also be appreciated that, in addition to conventional SS7 LIM cards, a database communication module (DCM) can be employed in a similar manner to provide for the transport of IP encapsulated SS7 messages over an IP network, as described in the above referenced Feature Notice IP7 Secure Gateway Release 1.0 publication. With particular regard to the TSM triggered LNP services module mentioned above, a detailed description of the Tekelec triggered LNP solution may be found in the Feature Guide LNP LSMS PN/910-1598-01, Rev. A, January 1998, published by Tekelec, the disclosure of which is incorporated herein by reference in its entirety. Furthermore, systems and methods for providing triggerless LNP functionality within a network routing node are described in commonly-assigned, co-pending U.S. patent application Ser. No. 09/503,541, the disclosure of which is incorporated herein by reference in its entirety.
Shown in
MASP pair 506 implement the maintenance and administration subsystem functions described above. As the MASP pair 506 are not particularly relevant to a discussion of the flexible routing attributes of the present invention, a detailed discussion of their function is not provided herein. For a comprehensive discussion of additional MASP operations and functionality, the above-referenced Tekelec publications can be consulted.
Focusing now on LIM card functionality, it will be appreciated that LIM 502 is comprised of a number of sub-component processes including, but not limited to; SS7 MTP level 1 and 2 processes 512, an I/O buffer or queue 514, an SS7 MTP level 3 HMDC process 516, and an HMDT process 518. MTP level 1 and 2 processes 512 provide the facilities necessary to send and receive digital data over a particular physical media/physical interface, as well as to provide error detection/correction and sequenced delivery of all SS7 message packets. I/O queue 514 provides for temporary buffering of incoming and outgoing signaling message packets. MTP level 3 HMDC process 516 receives signaling messages from the lower processing layers and performs a discrimination function, effectively determining whether an incoming SS7 message packet requires internal processing or is simply to be through switched. HMDT process 518 handles internal routing of SS7 message packets that require additional processing prior to final routing. Once again, it should be appreciated that a LIM card may contain more functional processes than those described above. The above discussion is limited to LIM functionality associated with the basic processing of in-bound signaling messages.
DCM 510, shown in
Once. again, the description of LIM and DCM sub-components provided above is limited to those sub-components that are relevant to the sample implementation scenarios illustrated herein. For a comprehensive discussion of additional LIM and DCM operations and functionality, the above-referenced Tekelec publications can be consulted.
With regard to DACM card 508, it will be appreciated from
DAC process 524 includes a DAC database 526 and a DAC protocol translation process 528, as indicated in
It will be appreciated from
In the embodiment shown in
As indicated in
Once again, DACM 508 also contains HMRT process 532 that is responsible for the routing of message packets once DAC processing has been completed. That is, the HMRT process 532 determines to which DCM or LIM card a message packet should be internally routed for subsequent outbound transmission into the communication network.
Shown in
In the case of FEP routing node 600, it will be appreciated from
Once again, it will be appreciated from
In the embodiment shown in
Once again, as indicated in
For purposes of illustration, the path of a typical SS7 TCAP query message requiring FEP routing node service is traced, in
Beginning with step ST1, an incoming TCAP query message is received at the inbound LIM module 502. In step ST2, the incoming TCAP query message is received and processed by the MTP Level 1 and 2 process 512. With MTP Level 1 and 2 processing complete, the signaling message packet is temporarily buffered in the I/O queue 514 before being passed up the stack to the MTP Level 3 HMDC process 516, where SCCP type discrimination processing is performed. In the example shown in
In this particular example, it is assumed that the FEP routing node 500 is provisioned to respond to query messages that are addressed to the true or capability point code of the FEP routing node 500. However, as mentioned previously, FEP routing node 500 could easily be provisioned to provide FEP-type processing in response to many point codes other than that of the FEP routing node. While it may prove to be advantageous for service providers to implement an FEP routing node of the present invention in a communications network in a manner such that all query messages requiring FEP-type processing are addressed to the same PC as that of the FEP routing node, it is not essential to the operation of the present invention.
The HMDT process 518 examines the service indicator (SI) field of the incoming TCAP MSU, which indicates that the message is of an SCCP type. As such, HMDT process 518 places the incoming MSU on high speed IMT bus 504 for transport to DACM 508 and subsequent FEP servicing (ST5).
The internally routed TCAP MSU is received by the DACM resident SCCP process 520, and subsequently examined by SCRC process 522 that is resident on DACM card 508. Upon successful verification, the TCAP MSU is directed to DAC application 524 for further processing. DAC application processing begins with a general determination of incoming message type. Following the determination that the message is a TCAP-type query message, DAC process 524 proceeds with verification of the pointers and field lengths associated with the TCAP message. Given that the message is a TCAP-type query message, a lookup is performed in DAC database 526 based on PC and SSN information contained within the message (ST6). Referring again to
Once again, as indicated in
With message routing address translation and query protocol translation processing complete, the modified query message is next passed to HMRT process 532 for internal routing to the appropriate DCM card (ST9). Consequently, the modified message packet is internally routed across the IMT bus 504 to DCM 510, where it is generally received by the I/O queue process 540. Eventually, the modified message packet is passed from the I/O queue process 540 on to the IP Level 2 and Level 1 process 542 where properly formatted IP routing label information is applied to the packet prior to transmission into the associated IP network 216 (ST10). Following successful IP Level 1 and 2 processing, the message packet is transmitted into the IP network 216 and generally towards the destination SCP or database node as identified by the previous FEP processing (ST11).
It will also be appreciated that the processing of an incoming TCAP query message is performed in a very similar manner for the embodiment of the FEP routing node 600 shown in
Although the example presented above relates specifically to the reception and subsequent processing of a TCAP query message bound for an SCP or database node, it will be appreciated by those skilled in the art, that the FEP processing node of the present invention can easily be provisioned to intercept and process subsequent response messages generated by such SCP or database nodes. Such response message processing could include database protocol translation, so as to translate the database response statement into a protocol that is usable by the network element that originated or initiated the query transaction.
As discussed briefly above, one aspect of FEP processing includes routing address translation that is based, at least in part, on the congestion and overall operational status of potential destination SCP or database nodes. Consequently, the FEP routing node, and more specifically DAC process 524, must be capable of acquiring and maintaining accurate information related to the status of the SCP or database nodes that are provisioned to have FEP service provided by the FEP routing node.
Given such functional requirements, it will be appreciated that
As indicated in
Once the network management message packet is received by DACM card 508, the message is generally verified and processed by the SCCP and SCRC processes 520 and 522, respectively. The verified and processed network management message is then passed to the DAC process 524. DAC process 524 examines the message packet, extracts the necessary node status information, and updates the appropriate records in the DAC database 526.
Thus, by continuously monitoring and processing network management-type messages generated by the SCP and database nodes provisioned for FEP service by the FEP routing node of the present invention, routing translation data utilized by the FEP routing node to make routing decisions can be maintained in an accurate and useful state.
Once again, it will be appreciated that the FEP routing node configuration shown in
Shown in
Shown in
The network configuration shown in
In the example shown in
As such, when FEP routing node 500 receives a TCAP query message from SSP 110 that is destined for the SCP with point code of 1-1-1 and SSN of 20, FEP routing node might simply perform database protocol translation-type processing on the message, encapsulate the modified message in a properly addressed IP packet, and route the modified message on to SCP 220. Any other processing that was previously performed by FEP 128 shown in
One of the great advantages of even such a simple implementation of a FEP routing node of the present invention is apparent upon closer examination of
Illustrated in
Once again, when compared with the prior art network configuration illustrated in
However, it will be appreciated that the network configuration shown in
As such, when FEP routing node 500 receives a TCAP query message from SSP 110 that is destined for the SCP with point code of 1-1-1 and SSN of 20, FEP routing node might make a decision to route based on the operational status or congestion status of the three SCPs 220, 224 and 228. Such load shedding or load sharing among the three similarly provisioned SCPs will ultimately lead to superior overall network performance. The FEP routing node 500 might further perform database protocol translation-type processing on the message, encapsulate the modified message in a properly addressed IP packet, and route the modified message on to the selected SCP. Once again, any additional processing that was previously performed by FEP 128 shown in
Illustrated in
Once again, when compared with the prior art network configuration illustrated in
It will be appreciated that the network configuration shown in
As such, when FEP routing node 500 receives a TCAP query message from SSP 110 that is destined for the SCP with point code of 1-1-1 and SSN of 50, FEP routing node might make a decision to route based on the operational status or congestion status of the multiple back end processors 432 that are associated with SCP 430. Such load shedding or load sharing among multiple, similarly provisioned back end processors will ultimately lead to superior overall network performance. The FEP routing node 500 might further perform database protocol translation-type processing on the message, encapsulate the modified message in a properly addressed IP packet, and route the modified message on to the selected SCP back end processor. Once again, any additional processing that was previously performed by FEP 128 shown in
Illustrated in
Once again, when compared with the prior art network configuration illustrated in
It will be appreciated that the network configuration shown in
As such, when FEP routing node 500 receives a TCAP query message from SSP 110 that is destined for the SCP with point code of 2-1-1 and SSN of 50, FEP routing node might make a decision to route based on the operational status or congestion status of the multiple back end processors 432 that are associated with SCP 430. Such load shedding or load sharing among multiple, similarly provisioned back end processors will ultimately lead to superior overall network performance. The FEP routing node 500 might further perform database protocol translation-type processing on the message, encapsulate the modified message in a properly addressed IP packet, and route the modified message on to the selected SCP back end processor. Once again, any additional processing that was previously performed by FEP 128 shown in
It will be understood that various details of the invention may be changed without departing from the scope of the invention. Furthermore, the foregoing description is for the purpose of illustration only, and not for the purpose of limitation--the invention being defined by the claims.
This application is a continuation of 09/537,835 filed Mar. 29, 2000 (now U.S. Pat. No. 6,944,184), which is a continuation-in-part of U.S. patent application Ser. No. 09/205,809, filed Dec. 4, 1998 (now U.S. Pat. No. 6,324,183), a continuation-in-part of U.S. patent application Ser. No. 09/443,712, filed Nov. 19, 1999 (now U.S. Pat. No. 7,050,456), and claims the benefit of U.S. Provisional Patent Application Ser. No. 60/127,889, filed Apr. 5, 1999, the disclosures of each of which are incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
4558180 | Scordo | Dec 1985 | A |
5008929 | Olsen et al. | Apr 1991 | A |
5142622 | Owens | Aug 1992 | A |
5173897 | Schrodi et al. | Dec 1992 | A |
5208811 | Kashio et al. | May 1993 | A |
5239542 | Breidenstein et al. | Aug 1993 | A |
5315641 | Montgomery et al. | May 1994 | A |
5384840 | Blatchford et al. | Jan 1995 | A |
5420916 | Sekiguchi | May 1995 | A |
5430727 | Callon | Jul 1995 | A |
5477531 | McKee et al. | Dec 1995 | A |
5509010 | La Porta et al. | Apr 1996 | A |
5568487 | Sitbon et al. | Oct 1996 | A |
5581558 | Horney, II et al. | Dec 1996 | A |
5583926 | Venier et al. | Dec 1996 | A |
5583927 | Fly et al. | Dec 1996 | A |
5586177 | Farris et al. | Dec 1996 | A |
5592530 | Brockman et al. | Jan 1997 | A |
5610910 | Focsaneanu et al. | Mar 1997 | A |
5612949 | Bennett | Mar 1997 | A |
5638431 | Everett et al. | Jun 1997 | A |
5640446 | Everett et al. | Jun 1997 | A |
5650998 | Angenot et al. | Jul 1997 | A |
5651002 | Van Seters et al. | Jul 1997 | A |
5657452 | Kralowetz et al. | Aug 1997 | A |
5661790 | Hsu | Aug 1997 | A |
5664102 | Faynberg | Sep 1997 | A |
5675635 | Vos et al. | Oct 1997 | A |
5680437 | Segal | Oct 1997 | A |
5680552 | Netravali et al. | Oct 1997 | A |
5694463 | Christie et al. | Dec 1997 | A |
5696809 | Voit | Dec 1997 | A |
5701301 | Weisser, Jr. | Dec 1997 | A |
5706286 | Reiman et al. | Jan 1998 | A |
5712903 | Bartholomew et al. | Jan 1998 | A |
5732213 | Gessel et al. | Mar 1998 | A |
5740374 | Raffali-Schreinemachers | Apr 1998 | A |
5754752 | Sheh et al. | May 1998 | A |
5761281 | Baum et al. | Jun 1998 | A |
5761290 | Farris et al. | Jun 1998 | A |
5761500 | Gallant et al. | Jun 1998 | A |
5764750 | Chau et al. | Jun 1998 | A |
5764955 | Doolan | Jun 1998 | A |
5768361 | Cowgill | Jun 1998 | A |
5768525 | Kralowetz et al. | Jun 1998 | A |
5774695 | Autrey et al. | Jun 1998 | A |
5781534 | Perlman et al. | Jul 1998 | A |
5787255 | Parlan et al. | Jul 1998 | A |
5793425 | Balakrishnan | Aug 1998 | A |
5793771 | Darland et al. | Aug 1998 | A |
5802285 | Hirviniemi | Sep 1998 | A |
5805587 | Norris et al. | Sep 1998 | A |
5809028 | Nethercott et al. | Sep 1998 | A |
5812639 | Bartholomew et al. | Sep 1998 | A |
5812669 | Jenkins et al. | Sep 1998 | A |
5812781 | Fahlman et al. | Sep 1998 | A |
5815669 | Lee et al. | Sep 1998 | A |
5828844 | Civanlar et al. | Oct 1998 | A |
5838782 | Lindquist | Nov 1998 | A |
5852660 | Lindquist et al. | Dec 1998 | A |
5867495 | Elliott et al. | Feb 1999 | A |
5870565 | Glitho | Feb 1999 | A |
5872782 | Dendi | Feb 1999 | A |
5878129 | Figurski et al. | Mar 1999 | A |
5889954 | Gessel et al. | Mar 1999 | A |
5892822 | Gottlieb et al. | Apr 1999 | A |
5898667 | Longfield et al. | Apr 1999 | A |
5905724 | Carson et al. | May 1999 | A |
5912887 | Sehgal | Jun 1999 | A |
5917900 | Allison et al. | Jun 1999 | A |
5920562 | Christie, deceased et al. | Jul 1999 | A |
5923659 | Curry et al. | Jul 1999 | A |
5926482 | Christie et al. | Jul 1999 | A |
5933490 | White et al. | Aug 1999 | A |
5940598 | Strauss et al. | Aug 1999 | A |
5949871 | Kabay et al. | Sep 1999 | A |
5958016 | Chang et al. | Sep 1999 | A |
5966431 | Reiman et al. | Oct 1999 | A |
5971900 | Miller | Oct 1999 | A |
5974052 | Johnson et al. | Oct 1999 | A |
5991301 | Christie | Nov 1999 | A |
5995608 | Detampel, Jr. et al. | Nov 1999 | A |
6002754 | Jaiswal et al. | Dec 1999 | A |
6006098 | Rathnasabapathy et al. | Dec 1999 | A |
6011780 | Vaman et al. | Jan 2000 | A |
6011794 | Mordowitz et al. | Jan 2000 | A |
6011803 | Bicknell et al. | Jan 2000 | A |
6014379 | White et al. | Jan 2000 | A |
6018515 | Sorber | Jan 2000 | A |
6021126 | White et al. | Feb 2000 | A |
6023502 | Bouanaka et al. | Feb 2000 | A |
6026091 | Christie et al. | Feb 2000 | A |
6028921 | Malik et al. | Feb 2000 | A |
6035020 | Weinstein et al. | Mar 2000 | A |
6047005 | Sherman et al. | Apr 2000 | A |
6055202 | Merritt | Apr 2000 | A |
6055302 | Schmersel et al. | Apr 2000 | A |
6061364 | Hager et al. | May 2000 | A |
6064653 | Farris | May 2000 | A |
6067546 | Lund | May 2000 | A |
6069890 | White et al. | May 2000 | A |
6075783 | Voit | Jun 2000 | A |
6078582 | Curry et al. | Jun 2000 | A |
6079036 | Moharram | Jun 2000 | A |
6081589 | Jiang et al. | Jun 2000 | A |
6084892 | Benash et al. | Jul 2000 | A |
6084956 | Turner et al. | Jul 2000 | A |
6094437 | Loehndorf, Jr. et al. | Jul 2000 | A |
6097036 | Teshima et al. | Aug 2000 | A |
6097719 | Benash et al. | Aug 2000 | A |
6097805 | Figurski et al. | Aug 2000 | A |
6111780 | Bertin | Aug 2000 | A |
6111870 | Kurtz | Aug 2000 | A |
6111893 | Volftsun et al. | Aug 2000 | A |
6112090 | Valentine | Aug 2000 | A |
6115383 | Bell et al. | Sep 2000 | A |
6118779 | Madonna | Sep 2000 | A |
6118780 | Dunn et al. | Sep 2000 | A |
6119160 | Zhang et al. | Sep 2000 | A |
6122255 | Bartholomew et al. | Sep 2000 | A |
6122263 | Dahlin et al. | Sep 2000 | A |
6122363 | Friedlander et al. | Sep 2000 | A |
6122365 | Yegoshin | Sep 2000 | A |
6125111 | Snow et al. | Sep 2000 | A |
6125177 | Whittaker | Sep 2000 | A |
H1880 | Vines et al. | Oct 2000 | H |
H1896 | Hoffpauir et al. | Oct 2000 | H |
6128379 | Smyk | Oct 2000 | A |
6134235 | Goldman et al. | Oct 2000 | A |
6134246 | Cai et al. | Oct 2000 | A |
6137869 | Voit et al. | Oct 2000 | A |
6137874 | Brown et al. | Oct 2000 | A |
6138110 | Jahn et al. | Oct 2000 | A |
6144667 | Doshi et al. | Nov 2000 | A |
6144670 | Sponaugle et al. | Nov 2000 | A |
6147999 | Honda et al. | Nov 2000 | A |
6151390 | Volftsun et al. | Nov 2000 | A |
6154445 | Farris et al. | Nov 2000 | A |
6154467 | Hager et al. | Nov 2000 | A |
6157710 | Figurski et al. | Dec 2000 | A |
6167025 | Hsing et al. | Dec 2000 | A |
6178181 | Glitho | Jan 2001 | B1 |
6189031 | Badger et al. | Feb 2001 | B1 |
6192051 | Lipman et al. | Feb 2001 | B1 |
6195425 | Farris | Feb 2001 | B1 |
6201804 | Kikinis | Mar 2001 | B1 |
6208642 | Balachandran et al. | Mar 2001 | B1 |
6215783 | Neyman | Apr 2001 | B1 |
6236722 | Gilbert et al. | May 2001 | B1 |
6240067 | Sorber | May 2001 | B1 |
6278697 | Brody et al. | Aug 2001 | B1 |
6285754 | Sun et al. | Sep 2001 | B1 |
6292479 | Bartholomew et al. | Sep 2001 | B1 |
6307926 | Barton et al. | Oct 2001 | B1 |
6311186 | MeLampy et al. | Oct 2001 | B1 |
6324173 | Deschaine et al. | Nov 2001 | B1 |
6324183 | Miller et al. | Nov 2001 | B1 |
6327258 | Deschaine et al. | Dec 2001 | B1 |
6327267 | Valentine et al. | Dec 2001 | B1 |
6327350 | Spangler et al. | Dec 2001 | B1 |
6330250 | Curry et al. | Dec 2001 | B1 |
6330614 | Aggarwal et al. | Dec 2001 | B1 |
6333931 | LaPier et al. | Dec 2001 | B1 |
6335937 | Chao et al. | Jan 2002 | B1 |
6349099 | Larikka et al. | Feb 2002 | B1 |
6366655 | Book et al. | Apr 2002 | B1 |
6377799 | Hameleers et al. | Apr 2002 | B1 |
6385301 | Nolting et al. | May 2002 | B1 |
6393022 | Hewett et al. | May 2002 | B1 |
6393581 | Friedman et al. | May 2002 | B1 |
6411604 | Brockman et al. | Jun 2002 | B1 |
6411632 | Lindgren et al. | Jun 2002 | B2 |
6415027 | Malik | Jul 2002 | B1 |
6425009 | Parrish et al. | Jul 2002 | B1 |
6430189 | Juntumaa et al. | Aug 2002 | B1 |
6442169 | Lewis | Aug 2002 | B1 |
6459697 | Neyman | Oct 2002 | B1 |
6459783 | March et al. | Oct 2002 | B1 |
6483837 | Howell et al. | Nov 2002 | B1 |
6483842 | Mauger | Nov 2002 | B1 |
6487286 | Reaves et al. | Nov 2002 | B1 |
6496512 | Medhat | Dec 2002 | B1 |
6501764 | Fudatate et al. | Dec 2002 | B1 |
6504923 | Swale | Jan 2003 | B1 |
6507649 | Tovander | Jan 2003 | B1 |
6515985 | Shmulevich et al. | Feb 2003 | B2 |
6515997 | Feltner et al. | Feb 2003 | B1 |
6522667 | Oda et al. | Feb 2003 | B1 |
6529524 | Liao et al. | Mar 2003 | B1 |
6535599 | Torrey et al. | Mar 2003 | B1 |
6542497 | Curry et al. | Apr 2003 | B1 |
6546003 | Farris | Apr 2003 | B1 |
6553427 | Chang et al. | Apr 2003 | B1 |
6563835 | Chen | May 2003 | B1 |
6574216 | Farris et al. | Jun 2003 | B1 |
6577626 | Christie et al. | Jun 2003 | B2 |
6584190 | Bressler | Jun 2003 | B1 |
6594246 | Jorgensen | Jul 2003 | B1 |
6594258 | Larson et al. | Jul 2003 | B1 |
6611532 | Madour et al. | Aug 2003 | B1 |
6611533 | Liao et al. | Aug 2003 | B1 |
6625170 | Curry et al. | Sep 2003 | B1 |
6631133 | Christie et al. | Oct 2003 | B1 |
6636504 | Albers et al. | Oct 2003 | B1 |
6668051 | Ashdown et al. | Dec 2003 | B1 |
6674748 | Dykhuizen et al. | Jan 2004 | B1 |
6678242 | Simon | Jan 2004 | B1 |
6680953 | Kim | Jan 2004 | B1 |
6681009 | Graf et al. | Jan 2004 | B1 |
6683881 | Mijares et al. | Jan 2004 | B1 |
6700972 | McHugh et al. | Mar 2004 | B1 |
6724752 | Turtiainen et al. | Apr 2004 | B1 |
6731741 | Fourcand et al. | May 2004 | B1 |
6760343 | Krishnamurthy et al. | Jul 2004 | B1 |
6782004 | Brusilovsky et al. | Aug 2004 | B1 |
6912590 | Lundbäck et al. | Jun 2005 | B1 |
6940866 | Miller et al. | Sep 2005 | B1 |
6944184 | Miller et al. | Sep 2005 | B1 |
6954526 | Glenn et al. | Oct 2005 | B1 |
6965592 | Tinsley et al. | Nov 2005 | B2 |
6967956 | Tinsley et al. | Nov 2005 | B1 |
6987781 | Miller et al. | Jan 2006 | B1 |
6990089 | Benedyk et al. | Jan 2006 | B2 |
7002988 | Benedyk et al. | Feb 2006 | B1 |
7031340 | Sprague et al. | Apr 2006 | B2 |
7046667 | Sprague et al. | May 2006 | B2 |
7050456 | Sprague et al. | May 2006 | B1 |
7088728 | Delaney et al. | Aug 2006 | B2 |
7113581 | Benedyk et al. | Sep 2006 | B2 |
7120139 | Kung et al. | Oct 2006 | B1 |
7190702 | Sprague et al. | Mar 2007 | B2 |
7242695 | Sprague et al. | Jul 2007 | B2 |
7274662 | Kalmanek, Jr. et al. | Sep 2007 | B1 |
7318091 | Brendes et al. | Jan 2008 | B2 |
7327670 | Sprague et al. | Feb 2008 | B2 |
20010029182 | McCann et al. | Oct 2001 | A1 |
20010046227 | Matsuhira et al. | Nov 2001 | A1 |
20010046234 | Agrawal et al. | Nov 2001 | A1 |
20010049730 | Brendes et al. | Dec 2001 | A1 |
20010055380 | Benedyk et al. | Dec 2001 | A1 |
20020048360 | Zambre et al. | Apr 2002 | A1 |
20020105969 | Benedyk et al. | Aug 2002 | A1 |
20020131400 | Tinsley et al. | Sep 2002 | A1 |
20020150221 | Carson et al. | Oct 2002 | A1 |
20050238036 | Miller et al. | Oct 2005 | A1 |
20050265341 | Benedyk et al. | Dec 2005 | A1 |
20050286502 | Benedyk et al. | Dec 2005 | A1 |
20060013203 | Benedyk et al. | Jan 2006 | A1 |
20060013204 | Benedyk et al. | Jan 2006 | A1 |
20060013264 | Eichler et al. | Jan 2006 | A1 |
20060077978 | Sprague et al. | Apr 2006 | A1 |
20080075068 | Brendes et al. | Mar 2008 | A1 |
20080075115 | Brendes et al. | Mar 2008 | A1 |
Number | Date | Country |
---|---|---|
2239764 | Dec 1998 | CA |
0 853 411 | Jul 1998 | EP |
1 014 735 | Dec 1999 | EP |
1 054 568 | May 2000 | EP |
1 026 861 | Aug 2000 | EP |
1 089 575 | Sep 2000 | EP |
1 206 079 | May 2002 | EP |
1 161 819 | Aug 2006 | EP |
1 177 660 | Aug 2006 | EP |
1 135 905 | Oct 2006 | EP |
1 169 829 | Oct 2006 | EP |
1 169 816 | Nov 2006 | EP |
1 192 758 | Feb 2007 | EP |
1755295 | Feb 2007 | EP |
1 715 658 | Oct 2007 | EP |
1 371 246 | Jul 2008 | EP |
1 314 324 | Aug 2008 | EP |
WO 9711563 | Mar 1997 | WO |
WO 9733441 | Sep 1997 | WO |
WO 9742774 | Nov 1997 | WO |
WO 9742776 | Nov 1997 | WO |
WO 9746045 | Dec 1997 | WO |
WO 9828879 | Jul 1998 | WO |
WO 9828885 | Jul 1998 | WO |
WO 9828897 | Jul 1998 | WO |
WO 9909759 | Feb 1999 | WO |
WO 9916256 | Apr 1999 | WO |
WO 0019758 | Apr 2000 | WO |
WO 0022840 | Apr 2000 | WO |
WO 0031933 | Jun 2000 | WO |
WO 0033519 | Jun 2000 | WO |
WO 0035155 | Jun 2000 | WO |
WO 0035156 | Jun 2000 | WO |
WO 0054476 | Sep 2000 | WO |
WO 0056032 | Sep 2000 | WO |
WO 0060812 | Oct 2000 | WO |
WO 0060814 | Oct 2000 | WO |
WO 0060821 | Oct 2000 | WO |
WO 0065785 | Nov 2000 | WO |
WO 0076134 | Dec 2000 | WO |
WO 0111825 | Feb 2001 | WO |
WO 0124499 | Apr 2001 | WO |
WO 0137532 | May 2001 | WO |
WO 0182635 | Nov 2001 | WO |
WO 0193526 | Dec 2001 | WO |
WO 0207455 | Jan 2002 | WO |
WO 0030369 | May 2002 | WO |
WO 02056618 | Jul 2002 | WO |
WO 02060192 | Aug 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20060034329 A1 | Feb 2006 | US |
Number | Date | Country | |
---|---|---|---|
60127889 | Apr 1999 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09537835 | Mar 2000 | US |
Child | 11224705 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09443712 | Nov 1999 | US |
Child | 09537835 | US | |
Parent | 09205809 | Dec 1998 | US |
Child | 09443712 | US |