The present invention relates to computer networks, and in particular, to registering documents in a computer network.
Computer networks and systems have become indispensable tools for modern business. Modern enterprises use such networks for communications and for storage. The information and data stored on the network of a business enterprise is often a highly valuable asset. Modern enterprises use numerous tools to keep outsiders, intruders, and unauthorized personnel from accessing valuable information stored on the network. These tools include firewalls, intrusion detection systems, and packet sniffer devices. However, once an intruder has gained access to sensitive content, there is no network device that can prevent the electronic transmission of the content from the network to outside the network. Similarly, there is no network device that can analyze the data leaving the network to monitor for policy violations, and make it possible to track down information, leaks. What is needed is a comprehensive system to capture, store, and analyze all data communicated using the enterprises network.
A document accessible over a network can be registered. A registered document, and the content contained therein, cannot be transmitted undetected over and off of the network. In one embodiment, the invention includes maintaining a plurality of stored signatures, each signature being associated with one of a plurality of registered documents, intercepting an object being transmitted over a network, calculating a set of signatures associated with the intercepted object, and comparing the set of signatures with the plurality of stored signatures. In one embodiment, the invention can further include detecting registered content from the registered document being contained in the intercepted object, if the comparison results in a match of at least one of the signatures in the set of signatures with one or more of the plurality of stored signatures.
The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings in which like reference numerals refer to similar elements and in which:
Although the present system will be discussed with reference to various illustrated examples, these examples should not be read to limit the broader spirit and scope of the present invention. Some portions of the detailed description that follows are presented in terms of algorithms and symbolic representations of operations on data within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the computer science arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared and otherwise manipulated.
It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers or the like. It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise, it will be appreciated that throughout the description of the present invention, use of terms such as “processing”, “computing”, “calculating”, “determining”, “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
As indicated above, one embodiment of the present invention is instantiated in computer software, that is, computer readable instructions, which, when executed by one or more computer processors/systems, instruct the processors/systems to perform the designated actions. Such computer software may be resident in one or more computer readable media, such as hard drives, CD-ROMs, DVD-ROMs, read-only memory, read-write memory and so on. Such software may be distributed on one or more of these media, or may be made available for download across one or more computer networks (e.g., the Internet). Regardless of the format, the computer programming, rendering and processing techniques discussed herein are simply examples of the types of programming, rendering and processing techniques that may be used to implement aspects of the present invention. These examples should in no way limit the present invention, which is best understood with reference to the claims that follow this description.
Networks
In
One embodiment of the present invention is now illustrated with reference to
There are various other possible configurations. For example, the router 12 can also forward a copy of all incoming data to the capture system 22 as well. Furthermore, the capture system 22 can be configured sequentially in front of, or behind the router 20, however this makes the capture system 22 a critical component in connecting to the Internet 12. In systems where a router 20 is not used at all, the capture system can be interposed directly between the LAN 10 and the Internet 12. In one embodiment, the capture system 22 has a user interface accessible from a LAN-attached device, such as a client 16.
Capture System
One embodiment of the present invention is now described with reference to
The captured raw data is then passed to a packet capture module 26. In one embodiment, the packet capture module 26 extracts data packets from the data stream received from the network interface module 24. In one embodiment, the packet capture module 26 reconstructs Ethernet packets from multiple sources to multiple destinations for the raw data stream.
In one embodiment, the packets are then provided the object assembly module 28. The object assembly module 28 reconstructs the objects being transmitted by the packets. For example, when a document is transmitted, e.g. as an email attachment, it is broken down into packets according to various data transfer protocols such as Transmission Control Protocol/Internet Protocol (TCP/IP) and Ethernet. The object assembly module 28 can reconstruct the document from the captured packets.
One embodiment of the object assembly module 28 is now described in more detail with reference to
In one embodiment, the reassembler 36 begins a new flow upon the observation of a starting packet defined by the data transfer protocol. For a TCP/IP embodiment, the starting packet is generally referred to as the “SYN” packet. The flow can terminate upon observation of a finishing packet, e.g., a “Reset” or “FIN” packet in TCP/IP. If now finishing packet is observed by the reassembler 36 within some time constraint, it can terminate the flow via a timeout mechanism. In an embodiment using the TPC protocol, a TCP flow contains an ordered sequence of packets that can be assembled into a contiguous data stream by the reassembler 36. Thus, in one embodiment, a flow is an ordered data stream of a single communication between a source and a destination.
The flow assembled by the reassembler 36 can then be provided to a protocol demultiplexer (demux) 38. In one embodiment, the protocol demux 38 sorts assembled flows using the TCP Ports. This can include performing a speculative classification of the flow contents based on the association of well-known port numbers with specified protocols. For example, Web Hyper Text Transfer Protocol (HTTP) packets——i.e., Web traffic—are typically associated with port 80, File Transfer Protocol (FTP) packets with port 20, Kerberos authentication packets with port 88, and so on. Thus in one embodiment, the protocol demux 38 separates all the different protocols in one flow.
In one embodiment, a protocol classifier 40 also sorts the flows in addition to the protocol demux 38. In one embodiment, the protocol classifier 40—operating either in parallel or in sequence with the protocol demux 38—applies signature filters to the flows to attempt to identify the protocol based solely on the transported data. Furthermore, the protocol demux 38 can make a classification decision based on port number which is subsequently overridden by protocol classifier 40. For example, if an individual or program attempted to masquerade an illicit communication (such as file sharing) using an apparently benign port such as port 80 (commonly used for HTTP Web browsing), the protocol classifier 40 would use protocol signatures, i.e., the characteristic data sequences of defined protocols, to verify the speculative classification performed by protocol demux 38.
In one embodiment, the object assembly module 28 outputs each flow organized by protocol, which represent the underlying objects. Referring again to
The object classification module 30 uses the inherent properties and signatures of various documents to determine the content type of each object. For example, a Word document has a signature that is distinct from a PowerPoint document, or an Email document. The object classification module 30 can extract out each individual object and sort them out by such content types. Such classification renders the present invention immune from cases where a malicious user has altered a file extension or other property in an attempt to avoid detection of illicit activity.
In one embodiment, the object classification module 30 determines whether each object should be stored or discarded. In one embodiment, this determination is based on a various capture rules. For example, a capture rule can indicate that Web Traffic should be discarded. Another capture rule can indicate that all PowerPoint documents should be stored, except for ones originating from the CEO's IP address. Such capture rules can be implemented as regular expressions, or by other similar means.
In one embodiment, the capture rules are authored by users of the capture system 22. The capture system 22 is made accessible to any network-connected machine through the network interface module 24 and user interface 34. In one embodiment, the user interface 34 is a graphical user interface providing the user with friendly access to the various features of the capture system 22. For example, the user interface 34 can provide a capture rule authoring tool that allows users to write and implement any capture rule desired, which are then applied by the object classification module 30 when determining whether each object should be stored. The user interface 34 can also provide pre-configured capture rules that the user can select from along with an explanation of the operation of such standard included capture rules. In one embodiment, the default capture rule implemented by the object classification module 30 captures all objects leaving the network 10.
If the capture of an object is mandated by the capture rules, the object classification module 30 can also determine where in the object store module 32 the captured object should be stored. With reference to
In one embodiment, the content store is a canonical storage location, simply a place to deposit the captured objects. The indexing of the objects stored in the content store 44 is accomplished using a tag database 42. In one embodiment, the tag database 42 is a database data structure in which each record is a “tag” that indexes an object in the content store 44, and contains relevant information about the stored object. An example of a tag record in the tag database 42 that indexes an object stored in the content store 44 is set forth in Table 1:
There are various other possible tag fields, and some embodiments can omit numerous tag fields listed in Table 1. In other embodiments, the tag database 42 need not be implemented as a database; other data structures can be used. The mapping of tags to objects can, in one embodiment, be obtained by using unique combinations of tag fields to construct an object's name. For example, one such possible combination is an ordered list of the Source IP, Destination IP, Source Port, Destination Port, Instance and Timestamp. Many other such combinations including both shorter and longer names are possible. In another embodiment, the tag can contain a pointer to the storage location where the indexed object is stored.
Referring again to
For example, the user interface 34 can provide a query-authoring tool (not shown) to enable users to create complex searches of the object store module 32. These search queries can be provided to a data mining engine (not shown) that parses the queries, scans the tag database 42, and retrieves the found object from the content store 44. Then, these objects that matched the specific search criteria in the user-authored query can be counted and displayed to the user by the user interface 34.
Searches can also be scheduled to occur at specific times or at regular intervals, that is, the user interface 34 can provide access to a scheduler (not shown) that can periodically execute specific queries. Reports containing the results of these searches can be made available to the user at a later time, mailed to the administrator electronically, or used to generate an alarm in the form of an e-mail message, page, syslog or other notification format.
In several embodiments, the capture system 22 has been described above as a stand-alone device. However, the capture system of the present invention can be implemented on any appliance capable of capturing and analyzing data from a network. For example, the capture system 22 described above could be implemented on one or more of the servers 14 or clients 16 shown in
In one embodiment, the capture system 22 is an appliance constructed using commonly available computing equipment and storage systems capable of supporting the software requirements. In one embodiment, illustrated by
Document Registration
The capture system 22 described above can also be used to implement a document registration scheme. In one embodiment, the a user can register a document with the system 22, which can then alert the user if all or part of the content in the registered document is leaving the network. Thus, one embodiment of the present invention aims to prevent un-authorized documents of various formats (e.g., Microsoft Word, Excel, PowerPoint, source code of any kind, text) from leaving an enterprise. There are great benefits to any enterprise that can keep its intellectual property, or other critical, confidential, or otherwise private and proprietary content from being mishandled.
In one embodiment of the present invention, sensitive documents are registered with the capture system 22, although data registration can be implemented using a separate device in other embodiments. One embodiment of implementing registration capability in the capture system 22 is now described with reference to
In one embodiment, the capture/registration system 22 also includes a registration module 54 interacting with a signature database 56 to facilitate a registration scheme. In one embodiment, the user can register a document via the user interface 34. There are numerous ways to register documents. For example, a document can be electrically mailed (e-mailed), or uploaded to the registration system 22. The registration system 22 can also periodically scan a file server (registration server) for documents to be registered. The registration process can be integrated with the enterprise's document management systems. Document registration can also be automated and transparent based on registration rules, such as “register all documents,” or “register all documents by specific author or IP address,” and so on.
After being received, in one embodiment, a document to be registered is passed to the registration module 54. The registration module 54 calculates a signature of the document, or a set of signatures. The set of signatures associated with the document can be calculated in various ways. For example, the signatures can be made up of hashes over various portions of the document, such as selected or all pages, paragraphs, tables and sentences. Other possible signatures include, but are not limited to, hashes over embedded content, indices, headers or footers, formatting information or font utilization. The signatures can also include computations and meta-data other than hash digests, such as Word Relative Frequency Methods (RFM)—Statistical, Karp-Rabin Greedy-String-Tiling-Transposition, vector space models, and diagrammatic structure analysis.
The set of signatures is then stored in the signature database 56. The signature database 56 need not be implemented as a database; the signatures can be maintained using any appropriate data structure. In one embodiment, the signature database 56 is part of the storage complex 52 in
In one embodiment, the registered document is also stored as an object in the object store module 32. In one embodiment, the document is only stored in the content store 44 with no associated tag, since many tag fields do not apply to registered documents. In one embodiment, one file of files 46 is a “Registered Documents” file.
In one embodiment, the document received from the user is now registered. As set forth above, in one embodiment, the object capture modules 31 continue to extract objects leaving the network, and store various objects based on capture rules. In one embodiment, all extracted objects—whether subject to a capture rule or not—are also passed to the registration module for a determination whether each object is, or includes part of, a registered document.
In one embodiment, the registration module 54 calculates the set of signatures of an object received from the object capture modules 31 in the same manner as of a document received from the user interface 34 to be registered. This set of signatures is then compared against all signatures in the signature database 56. In other embodiment, parts of the signature database can be excluded from this search to save time.
In one embodiment, an unauthorized transmission is detected if any one or more signatures in the set of signatures of an extracted object matches one or more signature in the signature database 56 associated with a registered document. Other detection tolerances can be configured for different embodiment, e.g., at least two signatures must match. Also, special rules can be implemented that make the transmission authorized, e.g., if the source address is authorized to transmit any documents off the network.
One embodiment of the registration module 54 is now described with reference to
A captured object 70 arrives via the object capture modules 31. The registration engine calculates the signatures 62 of the captured object, and forwards them to the search engine 64. The search engine 64 queries the signature database 54 to compare the signatures 62 to the signatures stored in the signature database 54. Assuming for the purposes of illustration, that the captured object 70 is a Word document that contains a pasted paragraph from registered PowerPoint document 68, at least one signature of signatures 62 will match a signature of signatures 60. Such an event can be referred to as the detection of an unauthorized transfer, a registered content transfer, or other similarly descriptive terms.
In one embodiment, when a registered content transfer is detected, the transmission can be halted with or without warning to the sender. In one embodiment, in the event of a detected registered content transfer, the search engine 64 activates the notification module 66, which sends an alert 72 to the user via the user interface 34. In one embodiment, the notification module 66 sends different alerts—including different user options—based on the user preference associated with the registration, and the capabilities of the registration system 22.
In one embodiment, the alert 72 can simply indicate that the registered content, i.e., the captured object 70, has been transferred off the network. In addition, the alert 72 can provide information regarding the transfer, such as source IP, destination IP, any other information contained in the tag of the captured object, or some other derived information, such as the name of the person who transferred the document off the network. The alert 72 can be provided to one or more users via e-mail, instant message (IM), page, or any other notification method. In one embodiment, the alert 72 is only sent to the entity or user who requested registration of the document 68.
In another embodiment, the delivery of the captured object 70 is halted—the transfer is not completed—unless the user who registered the document 68 consents. In such an embodiment, the alert 72 can contain all information described above, and in addition, contain a selection mechanism, such as one or two buttons—to allow the user to indicate whether the transfer of the captured object 70 may be completed. If the user elects to allow the transfer, for example because he is aware that someone is emailing a part of a registered document 68 (e.g., a boss asking his secretary to send an email), the transfer is executed and the object 70 is allowed to leave the network.
If the user disallows the transfer, the captured object 70 is not allowed off the network, and delivery is permanently halted. In one embodiment, halting delivery can be accomplished by implementing an intercept technique by having the registration system 22 proxy the connection between the network and the outside. In other embodiments, delivery can be halted using a black hole technique—discarding the packets without notice if the transfer is disallowed—or a poison technique—inserting additional packets onto the network to cause the sender's connection to fail.
Thus, a capture system and a document/content registration system have been described. In the forgoing description, various specific values were given names, such as “objects,” and various specific modules, such as the “registration module” and “signature database” have been described. However, these names are merely to describe and illustrate various aspects of the present invention, and in no way limit the scope of the present invention. Furthermore, various modules, such as the search engine 64 and the notification module 66 in
This patent application is related to, incorporates by reference, and claims the priority benefit of U.S. Provisional Application 60/528,631, entitled “DOCUMENT REGISTRATION”, filed Dec. 10, 2003.
Number | Name | Date | Kind |
---|---|---|---|
4286255 | Siy | Aug 1981 | A |
4710957 | Bocci et al. | Dec 1987 | A |
5465299 | Matsumoto et al. | Nov 1995 | A |
5557747 | Rogers et al. | Sep 1996 | A |
5768578 | Kirk | Jun 1998 | A |
5781629 | Haber et al. | Jul 1998 | A |
5794052 | Harding | Aug 1998 | A |
5943670 | Prager | Aug 1999 | A |
5995111 | Morioka et al. | Nov 1999 | A |
6078953 | Vaid et al. | Jun 2000 | A |
6094531 | Allison et al. | Jul 2000 | A |
6108697 | Raymond et al. | Aug 2000 | A |
6192472 | Garay et al. | Feb 2001 | B1 |
6243091 | Berstis | Jun 2001 | B1 |
6292810 | Richards | Sep 2001 | B1 |
6356885 | Ross et al. | Mar 2002 | B2 |
6408294 | Getchius et al. | Jun 2002 | B1 |
6493761 | Baker et al. | Dec 2002 | B1 |
6499105 | Yoshiura et al. | Dec 2002 | B1 |
6515681 | Knight | Feb 2003 | B1 |
6523026 | Gillis | Feb 2003 | B1 |
6539024 | Janoska et al. | Mar 2003 | B1 |
6571275 | Dong et al. | May 2003 | B1 |
6598033 | Ross et al. | Jul 2003 | B2 |
6662176 | Brunet et al. | Dec 2003 | B2 |
6691209 | O'Connell | Feb 2004 | B1 |
6771595 | Gilbert et al. | Aug 2004 | B1 |
6772214 | McClain et al. | Aug 2004 | B1 |
6785815 | Serret-Avila et al. | Aug 2004 | B1 |
6820082 | Cook et al. | Nov 2004 | B1 |
6857011 | Reinke | Feb 2005 | B2 |
6937257 | Dunlavey | Aug 2005 | B1 |
6950864 | Tsuchiya | Sep 2005 | B1 |
6978297 | Piersol | Dec 2005 | B1 |
7020654 | Najmi | Mar 2006 | B1 |
7020661 | Cruanes et al. | Mar 2006 | B1 |
7062572 | Hampton | Jun 2006 | B1 |
7072967 | Saulpaugh et al. | Jul 2006 | B1 |
7082443 | Ashby | Jul 2006 | B1 |
7093288 | Hydrie et al. | Aug 2006 | B1 |
7130587 | Hikokubo et al. | Oct 2006 | B2 |
7158983 | Willse et al. | Jan 2007 | B2 |
7185073 | Gai et al. | Feb 2007 | B1 |
7185192 | Kahn | Feb 2007 | B1 |
7219131 | Banister et al. | May 2007 | B2 |
7219134 | Takeshima et al. | May 2007 | B2 |
7243120 | Massey | Jul 2007 | B2 |
7246236 | Stirbu | Jul 2007 | B2 |
7254562 | Hsu et al. | Aug 2007 | B2 |
7266845 | Hypponen | Sep 2007 | B2 |
7277957 | Rowley et al. | Oct 2007 | B2 |
7290048 | Barnett et al. | Oct 2007 | B1 |
7296070 | Sweeney et al. | Nov 2007 | B2 |
7296088 | Padmanabhan et al. | Nov 2007 | B1 |
7299277 | Moran et al. | Nov 2007 | B1 |
7373500 | Ramelson et al. | May 2008 | B2 |
7424744 | Wu et al. | Sep 2008 | B1 |
7426181 | Feroz et al. | Sep 2008 | B1 |
7434058 | Ahuja et al. | Oct 2008 | B2 |
7477780 | Boncyk et al. | Jan 2009 | B2 |
7483916 | Lowe et al. | Jan 2009 | B2 |
7493659 | Wu et al. | Feb 2009 | B1 |
7506055 | McClain et al. | Mar 2009 | B2 |
7509677 | Saurabh et al. | Mar 2009 | B2 |
7516492 | Nisbet et al. | Apr 2009 | B1 |
7596571 | Sifry | Sep 2009 | B2 |
7664083 | Cermak et al. | Feb 2010 | B1 |
20010037324 | Agrawal et al. | Nov 2001 | A1 |
20020032677 | Morgenthaler et al. | Mar 2002 | A1 |
20020052896 | Streit et al. | May 2002 | A1 |
20020078355 | Samar | Jun 2002 | A1 |
20020091579 | Yehia et al. | Jul 2002 | A1 |
20020103876 | Chatani et al. | Aug 2002 | A1 |
20020107843 | Biebesheimer et al. | Aug 2002 | A1 |
20020116124 | Garin et al. | Aug 2002 | A1 |
20020126673 | Dagli et al. | Sep 2002 | A1 |
20020129140 | Peled et al. | Sep 2002 | A1 |
20020159447 | Carey et al. | Oct 2002 | A1 |
20030009718 | Wolfgang et al. | Jan 2003 | A1 |
20030028493 | Tajima et al. | Feb 2003 | A1 |
20030028774 | Meka | Feb 2003 | A1 |
20030046369 | Sim et al. | Mar 2003 | A1 |
20030053420 | Duckett et al. | Mar 2003 | A1 |
20030065571 | Dutta | Apr 2003 | A1 |
20030084300 | Koike | May 2003 | A1 |
20030084318 | Schertz | May 2003 | A1 |
20030084326 | Tarquini | May 2003 | A1 |
20030093678 | Bowe et al. | May 2003 | A1 |
20030099243 | Oh et al. | May 2003 | A1 |
20030105739 | Essafi et al. | Jun 2003 | A1 |
20030131116 | Jain et al. | Jul 2003 | A1 |
20030135612 | Huntington | Jul 2003 | A1 |
20030185220 | Valenci | Oct 2003 | A1 |
20030196081 | Savarda et al. | Oct 2003 | A1 |
20030204741 | Schoen et al. | Oct 2003 | A1 |
20030221101 | Micali | Nov 2003 | A1 |
20030225796 | Matsubara | Dec 2003 | A1 |
20030225841 | Song et al. | Dec 2003 | A1 |
20030231632 | Haeberlen | Dec 2003 | A1 |
20040001498 | Chen et al. | Jan 2004 | A1 |
20040059736 | Willse et al. | Mar 2004 | A1 |
20040071164 | Baum | Apr 2004 | A1 |
20040111678 | Hara | Jun 2004 | A1 |
20040114518 | MacFaden et al. | Jun 2004 | A1 |
20040117414 | Braun et al. | Jun 2004 | A1 |
20040120325 | Ayres | Jun 2004 | A1 |
20040122863 | Sidman | Jun 2004 | A1 |
20040181513 | Henderson et al. | Sep 2004 | A1 |
20040194141 | Sanders | Sep 2004 | A1 |
20040196970 | Cole | Oct 2004 | A1 |
20040230572 | Omoigui | Nov 2004 | A1 |
20040267753 | Hoche | Dec 2004 | A1 |
20050004911 | Goldberg et al. | Jan 2005 | A1 |
20050021715 | Dugatkin et al. | Jan 2005 | A1 |
20050021743 | Fleig et al. | Jan 2005 | A1 |
20050022114 | Shanahan et al. | Jan 2005 | A1 |
20050027881 | Figueira et al. | Feb 2005 | A1 |
20050033747 | Wittkotter | Feb 2005 | A1 |
20050033803 | Vleet et al. | Feb 2005 | A1 |
20050038809 | Abajian et al. | Feb 2005 | A1 |
20050050205 | Gordy et al. | Mar 2005 | A1 |
20050055327 | Agrawal et al. | Mar 2005 | A1 |
20050055399 | Savchuk | Mar 2005 | A1 |
20050091443 | Hershkovich et al. | Apr 2005 | A1 |
20050091532 | Moghe | Apr 2005 | A1 |
20050108244 | Riise et al. | May 2005 | A1 |
20050114452 | Prakash | May 2005 | A1 |
20050120006 | Nye | Jun 2005 | A1 |
20050128242 | Suzuki | Jun 2005 | A1 |
20050131876 | Ahuja et al. | Jun 2005 | A1 |
20050132034 | de la Iglesia et al. | Jun 2005 | A1 |
20050132046 | de la Iglesia et al. | Jun 2005 | A1 |
20050132079 | de la Iglesia et al. | Jun 2005 | A1 |
20050132197 | Medlar | Jun 2005 | A1 |
20050132198 | Ahuja et al. | Jun 2005 | A1 |
20050132297 | Milic-Frayling et al. | Jun 2005 | A1 |
20050138242 | Pope et al. | Jun 2005 | A1 |
20050138279 | Somasundaram | Jun 2005 | A1 |
20050149504 | Ratnaparkhi | Jul 2005 | A1 |
20050166066 | Ahuja et al. | Jul 2005 | A1 |
20050177725 | Lowe et al. | Aug 2005 | A1 |
20050180341 | Nelson et al. | Aug 2005 | A1 |
20050203940 | Farrar et al. | Sep 2005 | A1 |
20050204129 | Sudia et al. | Sep 2005 | A1 |
20050228864 | Robertson | Oct 2005 | A1 |
20050235153 | Ikeda | Oct 2005 | A1 |
20050289181 | Deninger et al. | Dec 2005 | A1 |
20060005247 | Zhang et al. | Jan 2006 | A1 |
20060021045 | Cook | Jan 2006 | A1 |
20060021050 | Cook et al. | Jan 2006 | A1 |
20060037072 | Rao et al. | Feb 2006 | A1 |
20060041560 | Forman et al. | Feb 2006 | A1 |
20060041570 | Lowe et al. | Feb 2006 | A1 |
20060041760 | Huang | Feb 2006 | A1 |
20060047675 | Lowe et al. | Mar 2006 | A1 |
20060083180 | Baba et al. | Apr 2006 | A1 |
20060167896 | Kapur et al. | Jul 2006 | A1 |
20060184532 | Hamada et al. | Aug 2006 | A1 |
20060242126 | Fitzhugh | Oct 2006 | A1 |
20060242313 | Le et al. | Oct 2006 | A1 |
20060251109 | Muller et al. | Nov 2006 | A1 |
20060288216 | Buhler et al. | Dec 2006 | A1 |
20070006293 | Balakrishnan et al. | Jan 2007 | A1 |
20070036156 | Liu et al. | Feb 2007 | A1 |
20070050334 | Deninger et al. | Mar 2007 | A1 |
20070050381 | Hu et al. | Mar 2007 | A1 |
20070094394 | Singh et al. | Apr 2007 | A1 |
20070110089 | Essafi et al. | May 2007 | A1 |
20070116366 | Deninger et al. | May 2007 | A1 |
20070136599 | Suga | Jun 2007 | A1 |
20070162609 | Pope et al. | Jul 2007 | A1 |
20070226504 | de la Iglesia et al. | Sep 2007 | A1 |
20070226510 | de la Iglesia et al. | Sep 2007 | A1 |
20070248029 | Merkey et al. | Oct 2007 | A1 |
20070271254 | de la Iglesia et al. | Nov 2007 | A1 |
20070271371 | Singh et al. | Nov 2007 | A1 |
20070271372 | Deninger et al. | Nov 2007 | A1 |
20070280123 | Atkins et al. | Dec 2007 | A1 |
20080028467 | Kommareddy et al. | Jan 2008 | A1 |
Number | Date | Country | |
---|---|---|---|
20050127171 A1 | Jun 2005 | US |
Number | Date | Country | |
---|---|---|---|
60528631 | Dec 2003 | US |