This document relates generally to systems and methods for processing communications and more particularly to systems and methods for prioritizing network traffic.
Internet connectivity has become central to many daily activities. For example, millions of people worldwide use the internet for various bill pay and banking functionalities. Countless more people use the internet for shopping, entertainment, to obtain news, and for myriad other purposes. Moreover, many businesses relies on the internet for communicating with suppliers and customers, as well as providing a resource library for their employees.
However, a large amount of traffic that is communicated by the internet is relatively unimportant or not time critical. For example, electronic mail is typically not time sensitive. Thus, whether electronic mail is delivered instantaneously or delayed by an hour often does not make a difference. Such unimportant communication traffic has the potential to delay and/or disrupt more important traffic.
In one aspect, systems, methods, apparatuses and computer program products are provided. In one aspect, methods are disclosed, which comprise: receiving a plurality of network traffic streams, the network traffic streams comprising data communicated between sender devices and recipient devices; parsing the network traffic streams based upon one or more transmission protocol associated with the network traffic streams, the parsing being operable to identify characteristics of data packets respectively associated with the traffic streams; applying a plurality of tests to the data packets or groupings of data packets, each of the plurality of tests being operable to test some or all of the data packets for a classification characteristic; generating a results array based upon the classification characteristics identified by the plurality of tests; classifying each of the data packets into one or more classifications from a plurality of classifications based upon the results array; and, prioritizing the traffic streams associated with the data packets based upon a prioritization scheme, the prioritization scheme being based on the one or more classifications associated with the data packet.
Systems can include a classification module, a prioritization module and a communications interface. The classification module can receive data packets associated with one or more data streams and can classify each of the plurality of data streams into one or more classifications. The prioritization module can prioritize transmission of the data packets based upon a prioritization scheme, the prioritization scheme including a prioritization of each of the classifications, wherein the application of the prioritization scheme is operable to identify a priority data stream. The communications interface can allocate bandwidth to the priority data stream before allocation of any remaining bandwidth to remaining data streams.
In other implementations, the network traffic prioritization system 110 can have the ability to block types of network traffic based upon one or both of a classification associated with the network traffic or a reputation of an entity associated with the network traffic. In further implementations, the network traffic prioritization system 110 can prioritize certain network traffic based upon classification(s) associated with the network traffic and/or reputations of one or more entities associated with the network traffic, while blocking other network traffic based upon classification(s) of the network traffic and/or reputations of one or more entities associated with the network traffic.
In some implementations, the network traffic prioritization system 110 can be controlled by an administrator (e.g., internet service provider (ISP) or government entity). In various implementations, priority can be based on policy and can be received from an administrator and/or dynamically changed for technical reasons (e.g., exhaustion of bandwidth), legislative rule making (e.g., government policy) or business decision (e.g., conservation of resources) or a combination thereof. For example, in an emergency situation legitimate communications should not be slowed by bulk network traffic (e.g., spam, adult content, music downloads, etc.). In other implementations, the network traffic prioritization system 110 can receive input from the first or second entity indicating that the traffic being communicated between the entities should be prioritized over other traffic. For example, the government emergency telephone service (GETS) provides an access code to high level government workers for use during times of crisis, when phone systems are often overloaded. Such systems could be expanded to data networks to provide robust data access during emergencies.
In some implementations, the first entity and/or the second entity can include a variety of different computing devices. For example, computing devices can include personal computers, routers, servers, mobile communications devices (e.g., cellular phones, mobile electronic mail (e-mail) devices, 802.11x equipped laptop computers, laptop computers equipped evolution-data optimized (EV-DO) access cards, etc.), among many others. In other implementations, the first entity 120 and/or the second entity 130 can include networks. For example, networks can include sub-nets, wireless networks, cellular networks, data networks, voice networks, intranets, infranets, etc.
In various implementations, The first entity 120 and second entity 130 can communicate with each other through a network 140. The network 140, for example, can be the internet. In other examples, the network 140 can include intranets, sub-nets, etc. The first entity and second entity can communicate a variety of classifications of data. The network traffic prioritization system 110 can classify the data, and can apply a prioritization scheme to the data.
In some implementations, the prioritization scheme can allocate network bandwidth to highest priority data classifications first, and recursively allocate bandwidth to successively lower priority data classifications until there is no more bandwidth or all data classifications have been allocated bandwidth. For example, if there are classifications of business traffic having first priority, news traffic having second priority, and spam traffic having third priority, the business traffic can be allocated bandwidth first, the news traffic can be allocated bandwidth second (if any bandwidth is available), and the spam traffic can be allocated bandwidth third (if any bandwidth is available).
In other implementations, a prioritization scheme can specify that traffic can be allocated normally until a threshold network usage is reached. In such implementations, upon detecting the threshold network usage, the network traffic prioritization system 110 can disrupt a low priority data stream when a higher priority data stream is received, the priorities being based upon a prioritization scheme. For example, when a network 140 is experiencing heavy usage, the network traffic prioritization system 110 can disconnect a existing spam traffic stream from the system when a new business traffic stream instance is received or can block an outbound connection where the destination is a known phishing site, according to data from, for example, the classification or reputation modules.
In still further implementations, the network traffic prioritization system 110 can communicate high priority traffic first, and wait for periods of inactivity during which to send lower priority traffic based upon the prioritization scheme. For example, if high priority traffic can be placed in a high priority queue for transmission, while lower priority traffic can be placed in a low priority queue for transmission. In such examples, the data in the low priority queue might not be transmitted until the high priority queue is empty. Thus, the network traffic prioritization system can transmit all of the high priority traffic and then transmit lower priority traffic until more high priority traffic is received or all of the low priority traffic has been transmitted.
In other implementations, the network traffic prioritization scheme can include blocking certain classifications of network traffic and/or network traffic associated with network entities have a specified reputation. For example, network traffic associated with entities having a reputation for originating spam can be blocked from traversing the network. In further implementations, the prioritization scheme in addition to block certain types of network traffic can prioritize other network traffic having a specified classification or reputation can be prioritized over other traffic. In some examples, network traffic which is neither blocked nor prioritized can be transmitted as normal priority (e.g., using available bandwidth, transmitted during periods of low usage, using a reserved segment of bandwidth for normal priority traffic, etc.). In still further examples, the prioritization scheme can specify to block network traffic having a first classification while specifying to de-prioritize network traffic having another classification. De-prioritization of traffic can provide for transmitting low priority traffic (e.g., entertainment, streaming music or video, etc.) with low bandwidth, while blocking can provide for elimination of unwanted traffic (e.g., spam traffic, malware traffic, bot traffic, malicious traffic, etc.).
In various implementations, prioritization schemes according to any of the above implementations of prioritization schemes can be combined.
In various implementations, the classification module 210 can operate to classify data streams based upon the characteristics associated with the data streams. The classification module 210 can apply multiple tests to an individual communication and derive a result array from the message. The result array can be compared to characteristics of known communication classifications in order to define the classification associated with the data stream. Classification of data is described in more detail by U.S. patent application Ser. No. 11/173,941, entitled “Message Profiling Systems and Methods,” filed on Jun. 2, 2005, which is hereby incorporated by reference in its entirety. Classification of data is further described by U.S. patent application Ser. No. 11/173,941, entitled “Content-based Policy Compliance Systems and Methods, filed on May 15, 2006, which is hereby incorporated by reference in its entirety. The classification module 210, in some examples, can be provided by a TrustedSource™ database, available from Secure Computing Corporation of San Jose, Calif., which can operate to provide classification definitions against which communications can be compared for classification.
In various implementations, the classification module 210 can classify data into one or more of a number of categories. In various implementations, the categories can include, for example, adult content, spam content, music content, electronic mail traffic, electronic commerce traffic, business traffic, social traffic, web 2.0 traffic, messaging traffic, conferencing traffic, medical content, search traffic, gaming content, entertainment content, education content, syndicated content, podcast content, malicious content, opinion content, informational content, or news content. In some implementations, the categories can be identified by a corpus of documents associated with a classification. The corpus of documents can be those documents identified by users to include content associated with a particular classification. The classification module can perform a variety of tests on the corpus of documents to identify the defining features of the class of data. In some implementations, the characteristics of subsequently received data can be extracted and compared to the defining features of various identified classes of data to determine whether the subsequently received data belongs to any of the identified classes of data.
In some implementations, the user and/or administrator can define his or her own classifications of data. For example, a user might have his/her own subjective grouping of data. The user can group together documents that exemplify the types of data the user would assign to the classification. In such implementations, the classification module 210 can examine the user defined grouping and identify the distinguishing features that define the class. The classification module 210 can then extract characteristics from subsequently received data and compare the extracted characteristics to the user defined category to determine whether the subsequently received data belongs to the user defined category. Multiple user and/or administrator defined categories can be generated based upon user and/or administrator input.
After classifying the data stream, the network traffic management system 110a can use a prioritization module 220 to determine a priority associated with the data stream. The prioritization module 220 can include a prioritization scheme operable to define a hierarchy associated with classification types. In various examples, the prioritization module can be operable to allocate bandwidth to each of the data streams based upon the classification associated with the respective data streams. For example, a data stream having a highest priority classification can be allocated bandwidth first, a data stream having a second priority classification can be allocated bandwidth second, a data stream having a third priority classification can be allocated bandwidth third, etc.
In some implementations, the prioritization module 220 is operable to receive prioritization input 230 (e.g., a command or instruction). The prioritization input 230, for example, can include specification of a prioritization scheme. In some implementations, the prioritization input 230, can include a signal to enable prioritization of the data streams. Upon prioritizing the data streams, the communications interface 200 can transmit the data streams to their respective destination based upon prioritization of the data streams.
The classification module 310, in various implementations, can operate to classify data streams based upon the characteristics associated with the data streams. The classification module 310c an apply multiple tests to an individual communication and derive a result array from the message. The result array can be compared to characteristics of known communication classifications in order to define the classification associated with the data stream. Classification of the data streams can be used to determine a priority associated with each of the respective data streams.
Upon classifying the data stream, the network traffic management system 110b can use a prioritization module 320 to determine a priority associated with the data stream. The prioritization module 320 can include a prioritization scheme operable to define a hierarchy associated with classification types. In various examples, the prioritization module can be operable to send a low priority data stream to a delay module 330. In some implementations, the delay module 330 can include a low priority queue, whereby high priority traffic is transmitted based upon the available bandwidth, while data in the low priority queue is held until there is no high priority traffic to transmit.
In some implementations, the prioritization module 320 is operable to receive prioritization input 340. The prioritization input 340, for example, can include specification of a prioritization scheme. In some implementations, the prioritization input 340, can include a signal to enable prioritization of the data streams. Upon input from the prioritization module 320, the communications interface 300 can transmit the data streams to their respective destination.
The communications interface 400, in some implementations, can include the functionality of a router. For example, the communications interface can be operable to parse the data packets to determine a destination associated with each of the data packets. The communications interface 400 can forward the data packets to the destination responsive to input received from the prioritization module 430.
The classification module 410, in various implementations, can operate to classify data streams based upon the characteristics associated with the data streams. The classification module 410 can apply multiple tests to an individual communication and derive a result array from the message. The result array can be compared to characteristics of known communication classifications in order to define the classification associated with the data stream. Classification of the data streams can be used to determine a priority associated with each of the respective data streams.
A reputation module 420 can operate to determine the reputation associated with an originating entity (e.g., entity 120 of
After classification of the data stream and reputation of the entities associated with the data stream, the network traffic management system 110c can use a prioritization module 430 to determine a priority associated with the data stream. The prioritization module 430 can include a prioritization scheme operable to define a hierarchy associated with classification types and reputations. In some implementations, the prioritization module can allocate priority to certain classifications of data streams or entities with reputations for transmitting those classifications of data streams over other classifications of data streams and entity reputations based upon a prioritization scheme. The prioritization scheme can be provided, for example, by an administrator. In other examples, the prioritization scheme can be provided by a governmental entity.
In some implementations, the prioritization module 430 is operable to receive prioritization input 440. The prioritization input 440, for example, can include specification of a prioritization scheme. In some implementations, the prioritization input 440, can include a signal to enable prioritization of the data streams. Upon input from the prioritization module 430, the communications interface 400 can transmit the data streams to their respective destination.
In optional implementations, the router 510 can retrieve reputation information associated with the data streams from a reputation engine 560. The reputation information can be used to determine whether to provide priority to data streams associated with an entity of a given reputation. For example, entities with a reputation for sending government traffic might be provided priority over other entities in emergency situations. In other examples, data streams originating from entities with strong reputations for transmitting spam might be assigned a low priority with respect to data traffic originating from entities with reputations for originating reputable traffic. In additional implementations, reputation information can be used to confirm weak classifications of data streams.
In some implementations, the router can use the classification and/or reputation information to assign a priority associated with the data stream. Data streams of a first priority can be given transmission priority over data streams of a second or lower priority. Similarly, data streams of a second priority can be given transmission priority over data streams of a third or lower priority. Priority can be attained through allocation of bandwidth, delay of lower priority traffic, or transmission of low priority traffic during periods of inactivity.
At stage 610 a source and destination address of the data packets can be identified. The source and destination address can be identified, for example, by a communications interface (e.g., communications interface 200 of
At stage 620 the data stream is classified. The data stream can be classified, for example, by a classification module (e.g., classification module 210 of
At stage 630 transmission of data packets can be prioritized. The transmission of data packets can be prioritized, for example, by a prioritization module (e.g., prioritization module 220 of
At stage 710, the data streams can be parsed to identify data packets within the streams. The data streams can be parsed, for example, by a communications interface (e.g., communications interface 200 of
At stage 720, multiple tests can be applied to the data packets. The tests can be applied to the data packets, for example, by a classification engine (e.g., classification module 210 of
At stage 730, a results array can be generated based on the tests. The results array can be generated, for example, by a classification engine (e.g., classification module 210 of
At stage 740, the data packets are classified. The data packets can be classified, for example, by a classification engine (e.g., classification module 210 of
At stage 750, the data packets are prioritized. The data packets can be prioritized, for example, by a prioritization engine (e.g., prioritization module 220 of
The systems and methods disclosed herein may use data signals conveyed using networks (e.g., local area network, wide area network, internet, etc.), fiber optic medium, carrier waves, wireless networks (e.g., wireless local area networks, wireless metropolitan area networks, cellular networks, etc.), etc. for communication with one or more data processing devices (e.g., mobile devices). The data signals can carry any or all of the data disclosed herein that is provided to or from a device.
The methods and systems described herein may be implemented on many different types of processing devices by program code comprising program instructions that are executable by one or more processors. The software program instructions may include source code, object code, machine code, or any other stored data that is operable to cause a processing system to perform methods described herein.
The systems and methods may be provided on many different types of computer-readable media including computer storage mechanisms (e.g., CD-ROM, diskette, RAM, flash memory, computer's hard drive, etc.) that contain instructions for use in execution by a processor to perform the methods' operations and implement the systems described herein.
The computer components, software modules, functions and data structures described herein may be connected directly or indirectly to each other in order to allow the flow of data needed for their operations. It is also noted that software instructions or a module can be implemented for example as a subroutine unit of code, or as a software function unit of code, or as an object (as in an object-oriented paradigm), or as an applet, or in a computer script language, or as another type of computer code or firmware. The software components and/or functionality may be located on a single device or distributed across multiple devices depending upon the situation at hand.
This written description sets forth the best mode of the invention and provides examples to describe the invention and to enable a person of ordinary skill in the art to make and use the invention. This written description does not limit the invention to the precise terms set forth. Thus, while the invention has been described in detail with reference to the examples set forth above, those of ordinary skill in the art may effect alterations, modifications and variations to the examples without departing from the scope of the invention.
As used in the description herein and throughout the claims that follow, the meaning of “a,” “an,” and “the” includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise. Finally, as used in the description herein and throughout the claims that follow, the meanings of “and” and “or” include both the conjunctive and disjunctive and may be used interchangeably unless the context clearly dictates otherwise.
Ranges may be expressed herein as from “about” one particular value, and/or to “about” another particular value. When such a range is expressed, another embodiment includes from the one particular value and/or to the other particular value. Similarly, when values are expressed as approximations, by use of the antecedent “about,” it will be understood that the particular value forms another embodiment. It will be further understood that the endpoints of each of the ranges are significant both in relation to the other endpoint, and independently of the other endpoint.
These and other implementations are within the scope of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
4289930 | Connolly et al. | Sep 1981 | A |
4384325 | Slechta et al. | May 1983 | A |
4386416 | Giltner et al. | May 1983 | A |
4532588 | Foster | Jul 1985 | A |
4713780 | Schultz et al. | Dec 1987 | A |
4754428 | Schultz et al. | Jun 1988 | A |
4837798 | Cohen et al. | Jun 1989 | A |
4853961 | Pastor | Aug 1989 | A |
4864573 | Horsten | Sep 1989 | A |
4951196 | Jackson | Aug 1990 | A |
4975950 | Lentz | Dec 1990 | A |
4979210 | Nagata et al. | Dec 1990 | A |
5008814 | Mathur | Apr 1991 | A |
5020059 | Gorin et al. | May 1991 | A |
5051886 | Kawaguchi et al. | Sep 1991 | A |
5054096 | Beizer | Oct 1991 | A |
5105184 | Pirani et al. | Apr 1992 | A |
5119465 | Jack et al. | Jun 1992 | A |
5144557 | Wang | Sep 1992 | A |
5144659 | Jones | Sep 1992 | A |
5144660 | Rose | Sep 1992 | A |
5167011 | Priest | Nov 1992 | A |
5210824 | Putz et al. | May 1993 | A |
5210825 | Kavaler | May 1993 | A |
5235642 | Wobber et al. | Aug 1993 | A |
5239466 | Morgan et al. | Aug 1993 | A |
5247661 | Hager et al. | Sep 1993 | A |
5276869 | Forrest et al. | Jan 1994 | A |
5278901 | Shieh et al. | Jan 1994 | A |
5283887 | Zachery | Feb 1994 | A |
5293250 | Okumura et al. | Mar 1994 | A |
5313521 | Torii et al. | May 1994 | A |
5319776 | Hile et al. | Jun 1994 | A |
5355472 | Lewis | Oct 1994 | A |
5367621 | Cohen et al. | Nov 1994 | A |
5377354 | Scannell et al. | Dec 1994 | A |
5379340 | Overend et al. | Jan 1995 | A |
5379374 | Ishizaki et al. | Jan 1995 | A |
5404231 | Bloomfield | Apr 1995 | A |
5406557 | Baudoin | Apr 1995 | A |
5414833 | Hershey et al. | May 1995 | A |
5416842 | Aziz | May 1995 | A |
5418908 | Keller et al. | May 1995 | A |
5424724 | Williams et al. | Jun 1995 | A |
5479411 | Klein | Dec 1995 | A |
5481312 | Cash et al. | Jan 1996 | A |
5483466 | Kawahara et al. | Jan 1996 | A |
5485409 | Gupta et al. | Jan 1996 | A |
5495610 | Shing et al. | Feb 1996 | A |
5509074 | Choudhury et al. | Apr 1996 | A |
5511122 | Atkinson | Apr 1996 | A |
5513126 | Harkins et al. | Apr 1996 | A |
5513323 | Williams et al. | Apr 1996 | A |
5530852 | Meske, Jr. et al. | Jun 1996 | A |
5535276 | Ganesan | Jul 1996 | A |
5541993 | Fan et al. | Jul 1996 | A |
5544320 | Konrad | Aug 1996 | A |
5550984 | Gelb | Aug 1996 | A |
5550994 | Tashiro et al. | Aug 1996 | A |
5557742 | Smaha et al. | Sep 1996 | A |
5572643 | Judson | Nov 1996 | A |
5577209 | Boyle et al. | Nov 1996 | A |
5602918 | Chen et al. | Feb 1997 | A |
5606668 | Shwed | Feb 1997 | A |
5608819 | Ikeuchi | Mar 1997 | A |
5608874 | Ogawa et al. | Mar 1997 | A |
5619648 | Canale et al. | Apr 1997 | A |
5632011 | Landfield et al. | May 1997 | A |
5638487 | Chigier | Jun 1997 | A |
5644404 | Hashimoto et al. | Jul 1997 | A |
5657461 | Harkins et al. | Aug 1997 | A |
5673322 | Pepe et al. | Sep 1997 | A |
5675507 | Bobo, II | Oct 1997 | A |
5675733 | Williams | Oct 1997 | A |
5677955 | Doggett et al. | Oct 1997 | A |
5694616 | Johnson et al. | Dec 1997 | A |
5696822 | Nachenberg | Dec 1997 | A |
5706442 | Anderson et al. | Jan 1998 | A |
5708780 | Levergood et al. | Jan 1998 | A |
5708826 | Ikeda et al. | Jan 1998 | A |
5710883 | Hong et al. | Jan 1998 | A |
5727156 | Herr-Hoyman et al. | Mar 1998 | A |
5740231 | Cohn et al. | Apr 1998 | A |
5742759 | Nessett et al. | Apr 1998 | A |
5742769 | Lee et al. | Apr 1998 | A |
5745574 | Muftic | Apr 1998 | A |
5751956 | Kirsch | May 1998 | A |
5758343 | Vigil et al. | May 1998 | A |
5764906 | Edelstein et al. | Jun 1998 | A |
5768528 | Stumm | Jun 1998 | A |
5771348 | Kubatzki et al. | Jun 1998 | A |
5778372 | Cordell et al. | Jul 1998 | A |
5781857 | Hwang et al. | Jul 1998 | A |
5781901 | Kuzma | Jul 1998 | A |
5790789 | Suarez | Aug 1998 | A |
5790790 | Smith et al. | Aug 1998 | A |
5790793 | Higley | Aug 1998 | A |
5793763 | Mayes et al. | Aug 1998 | A |
5793972 | Shane | Aug 1998 | A |
5796942 | Esbensen | Aug 1998 | A |
5796948 | Cohen | Aug 1998 | A |
5801700 | Ferguson | Sep 1998 | A |
5805719 | Pare, Jr. et al. | Sep 1998 | A |
5812398 | Nielsen | Sep 1998 | A |
5812776 | Gifford | Sep 1998 | A |
5822526 | Waskiewicz | Oct 1998 | A |
5822527 | Post | Oct 1998 | A |
5826013 | Nachenberg | Oct 1998 | A |
5826014 | Coley et al. | Oct 1998 | A |
5826022 | Nielsen | Oct 1998 | A |
5826029 | Gore, Jr. et al. | Oct 1998 | A |
5835087 | Herz et al. | Nov 1998 | A |
5845084 | Cordell et al. | Dec 1998 | A |
5850442 | Muftic | Dec 1998 | A |
5855020 | Kirsch | Dec 1998 | A |
5860068 | Cook | Jan 1999 | A |
5862325 | Reed et al. | Jan 1999 | A |
5864852 | Luotonen | Jan 1999 | A |
5878230 | Weber et al. | Mar 1999 | A |
5884033 | Duvall et al. | Mar 1999 | A |
5892825 | Mages et al. | Apr 1999 | A |
5893114 | Hashimoto et al. | Apr 1999 | A |
5896499 | McKelvey | Apr 1999 | A |
5898836 | Freivald et al. | Apr 1999 | A |
5903723 | Beck et al. | May 1999 | A |
5911776 | Guck | Jun 1999 | A |
5923846 | Gage et al. | Jul 1999 | A |
5930479 | Hall | Jul 1999 | A |
5933478 | Ozaki et al. | Aug 1999 | A |
5933498 | Schneck et al. | Aug 1999 | A |
5937164 | Mages et al. | Aug 1999 | A |
5940591 | Boyle et al. | Aug 1999 | A |
5948062 | Tzelnic et al. | Sep 1999 | A |
5958005 | Thorne et al. | Sep 1999 | A |
5963915 | Kirsch | Oct 1999 | A |
5978799 | Hirsch | Nov 1999 | A |
5987609 | Hasebe | Nov 1999 | A |
5991881 | Conklin et al. | Nov 1999 | A |
5999932 | Paul | Dec 1999 | A |
6003027 | Prager | Dec 1999 | A |
6006329 | Chi | Dec 1999 | A |
6012144 | Pickett | Jan 2000 | A |
6014651 | Crawford | Jan 2000 | A |
6023723 | McCormick et al. | Feb 2000 | A |
6029256 | Kouznetsov | Feb 2000 | A |
6035423 | Hodges et al. | Mar 2000 | A |
6052709 | Paul | Apr 2000 | A |
6058381 | Nelson | May 2000 | A |
6058482 | Liu | May 2000 | A |
6061448 | Smith et al. | May 2000 | A |
6061722 | Lipa et al. | May 2000 | A |
6072942 | Stockwell et al. | Jun 2000 | A |
6092114 | Shaffer et al. | Jul 2000 | A |
6092194 | Touboul | Jul 2000 | A |
6094277 | Toyoda | Jul 2000 | A |
6094731 | Waldin et al. | Jul 2000 | A |
6104500 | Alam et al. | Aug 2000 | A |
6108688 | Nielsen | Aug 2000 | A |
6108691 | Lee et al. | Aug 2000 | A |
6108786 | Knowlson | Aug 2000 | A |
6118856 | Paarsmarkt et al. | Sep 2000 | A |
6119137 | Smith et al. | Sep 2000 | A |
6119142 | Kosaka | Sep 2000 | A |
6119230 | Carter | Sep 2000 | A |
6119236 | Shipley | Sep 2000 | A |
6122661 | Stedman et al. | Sep 2000 | A |
6141695 | Sekiguchi et al. | Oct 2000 | A |
6141778 | Kane et al. | Oct 2000 | A |
6145083 | Shaffer et al. | Nov 2000 | A |
6151675 | Smith | Nov 2000 | A |
6161130 | Horvitz et al. | Dec 2000 | A |
6185689 | Todd, Sr. et al. | Feb 2001 | B1 |
6192407 | Smith et al. | Feb 2001 | B1 |
6199102 | Cobb | Mar 2001 | B1 |
6202157 | Brownlie et al. | Mar 2001 | B1 |
6219714 | Inhwan et al. | Apr 2001 | B1 |
6223213 | Cleron et al. | Apr 2001 | B1 |
6249575 | Heilmann et al. | Jun 2001 | B1 |
6249807 | Shaw et al. | Jun 2001 | B1 |
6260043 | Puri et al. | Jul 2001 | B1 |
6269447 | Maloney et al. | Jul 2001 | B1 |
6269456 | Hodges et al. | Jul 2001 | B1 |
6272532 | Feinleib | Aug 2001 | B1 |
6275942 | Bernhard et al. | Aug 2001 | B1 |
6279113 | Vaidya | Aug 2001 | B1 |
6279133 | Vafai et al. | Aug 2001 | B1 |
6282565 | Shaw et al. | Aug 2001 | B1 |
6285991 | Powar | Sep 2001 | B1 |
6289214 | Backstrom | Sep 2001 | B1 |
6298445 | Shostack et al. | Oct 2001 | B1 |
6301668 | Gleichauf et al. | Oct 2001 | B1 |
6304898 | Shiigi | Oct 2001 | B1 |
6304973 | Williams | Oct 2001 | B1 |
6311207 | Mighdoll et al. | Oct 2001 | B1 |
6317829 | Van Oorschot | Nov 2001 | B1 |
6320948 | Heilmann et al. | Nov 2001 | B1 |
6321267 | Donaldson | Nov 2001 | B1 |
6324569 | Ogilvie et al. | Nov 2001 | B1 |
6324647 | Bowman-Amuah | Nov 2001 | B1 |
6324656 | Gleichauf et al. | Nov 2001 | B1 |
6330589 | Kennedy | Dec 2001 | B1 |
6347374 | Drake et al. | Feb 2002 | B1 |
6353886 | Howard et al. | Mar 2002 | B1 |
6363489 | Comay et al. | Mar 2002 | B1 |
6370648 | Diep | Apr 2002 | B1 |
6373950 | Rowney | Apr 2002 | B1 |
6385655 | Smith et al. | May 2002 | B1 |
6393465 | Leeds | May 2002 | B2 |
6393568 | Ranger et al. | May 2002 | B1 |
6405318 | Rowland | Jun 2002 | B1 |
6434624 | Gai et al. | Aug 2002 | B1 |
6442588 | Clark et al. | Aug 2002 | B1 |
6442686 | McArdle et al. | Aug 2002 | B1 |
6453345 | Trcka et al. | Sep 2002 | B2 |
6460141 | Olden | Oct 2002 | B1 |
6470086 | Smith | Oct 2002 | B1 |
6487599 | Smith et al. | Nov 2002 | B1 |
6487666 | Shanklin et al. | Nov 2002 | B1 |
6502191 | Smith et al. | Dec 2002 | B1 |
6516411 | Smith | Feb 2003 | B2 |
6519703 | Joyce | Feb 2003 | B1 |
6539430 | Humes | Mar 2003 | B1 |
6546416 | Kirsch | Apr 2003 | B1 |
6546493 | Magdych et al. | Apr 2003 | B1 |
6550012 | Villa et al. | Apr 2003 | B1 |
6574737 | Kingsford et al. | Jun 2003 | B1 |
6578025 | Pollack et al. | Jun 2003 | B1 |
6609196 | Dickinson, III et al. | Aug 2003 | B1 |
6650890 | Iriam et al. | Nov 2003 | B1 |
6654787 | Aronson et al. | Nov 2003 | B1 |
6675153 | Cook et al. | Jan 2004 | B1 |
6681331 | Munson et al. | Jan 2004 | B1 |
6687687 | Smadja | Feb 2004 | B1 |
6697950 | Ko | Feb 2004 | B1 |
6701440 | Kim et al. | Mar 2004 | B1 |
6704874 | Porras et al. | Mar 2004 | B1 |
6711127 | Gorman et al. | Mar 2004 | B1 |
6725377 | Kouznetsov | Apr 2004 | B1 |
6732101 | Cook | May 2004 | B1 |
6732157 | Gordon et al. | May 2004 | B1 |
6735703 | Kilpatrick et al. | May 2004 | B1 |
6738462 | Brunson | May 2004 | B1 |
6742124 | Kilpatrick et al. | May 2004 | B1 |
6742128 | Joiner | May 2004 | B1 |
6754705 | Joiner et al. | Jun 2004 | B2 |
6757830 | Tarbotton et al. | Jun 2004 | B1 |
6760309 | Rochberger et al. | Jul 2004 | B1 |
6768991 | Hearnden | Jul 2004 | B2 |
6769016 | Rothwell et al. | Jul 2004 | B2 |
6775657 | Baker | Aug 2004 | B1 |
6792546 | Shanklin et al. | Sep 2004 | B1 |
6892178 | Zacharia | May 2005 | B1 |
6892179 | Zacharia | May 2005 | B1 |
6892237 | Gai et al. | May 2005 | B1 |
6895385 | Zacharia et al. | May 2005 | B1 |
6907430 | Chong et al. | Jun 2005 | B2 |
6910135 | Grainger | Jun 2005 | B1 |
6928556 | Black et al. | Aug 2005 | B2 |
6941348 | Petry et al. | Sep 2005 | B2 |
6941467 | Judge et al. | Sep 2005 | B2 |
6968461 | Lucas et al. | Nov 2005 | B1 |
7143213 | Need et al. | Nov 2006 | B2 |
7164678 | Connor | Jan 2007 | B2 |
7272149 | Bly et al. | Sep 2007 | B2 |
7349332 | Srinivasan et al. | Mar 2008 | B1 |
7376731 | Khan et al. | May 2008 | B2 |
7385924 | Riddle | Jun 2008 | B1 |
7460476 | Morris et al. | Dec 2008 | B1 |
7522516 | Parker | Apr 2009 | B1 |
7545748 | Riddle | Jun 2009 | B1 |
20010049793 | Sugimoto | Dec 2001 | A1 |
20020004902 | Toh et al. | Jan 2002 | A1 |
20020016910 | Wright et al. | Feb 2002 | A1 |
20020023089 | Woo | Feb 2002 | A1 |
20020023140 | Hile et al. | Feb 2002 | A1 |
20020026591 | Hartley et al. | Feb 2002 | A1 |
20020032871 | Malan et al. | Mar 2002 | A1 |
20020035683 | Kaashoek et al. | Mar 2002 | A1 |
20020042876 | Smith | Apr 2002 | A1 |
20020046041 | Lang | Apr 2002 | A1 |
20020049853 | Chu et al. | Apr 2002 | A1 |
20020078382 | Sheikh et al. | Jun 2002 | A1 |
20020087882 | Schneier et al. | Jul 2002 | A1 |
20020095492 | Kaashoek et al. | Jul 2002 | A1 |
20020112185 | Hodges | Aug 2002 | A1 |
20020116627 | Tarbotton et al. | Aug 2002 | A1 |
20020120853 | Tyree | Aug 2002 | A1 |
20020133365 | Grey et al. | Sep 2002 | A1 |
20020138416 | Lovejoy et al. | Sep 2002 | A1 |
20020138755 | Ko | Sep 2002 | A1 |
20020138759 | Dutta | Sep 2002 | A1 |
20020138762 | Horne | Sep 2002 | A1 |
20020143963 | Converse et al. | Oct 2002 | A1 |
20020147734 | Shoup et al. | Oct 2002 | A1 |
20020152399 | Smith | Oct 2002 | A1 |
20020165971 | Baron | Nov 2002 | A1 |
20020172367 | Mulder et al. | Nov 2002 | A1 |
20020178227 | Matsa et al. | Nov 2002 | A1 |
20020178383 | Hrabik et al. | Nov 2002 | A1 |
20020188864 | Jackson | Dec 2002 | A1 |
20020194469 | Dominique et al. | Dec 2002 | A1 |
20020199095 | Bandini et al. | Dec 2002 | A1 |
20030005326 | Flemming | Jan 2003 | A1 |
20030009554 | Burch et al. | Jan 2003 | A1 |
20030009693 | Brock et al. | Jan 2003 | A1 |
20030009696 | Bunker, V et al. | Jan 2003 | A1 |
20030009699 | Gupta et al. | Jan 2003 | A1 |
20030014664 | Hentunen | Jan 2003 | A1 |
20030023692 | Moroo | Jan 2003 | A1 |
20030023695 | Kobata et al. | Jan 2003 | A1 |
20030023873 | Ben-Itzhak | Jan 2003 | A1 |
20030023874 | Prokupets et al. | Jan 2003 | A1 |
20030023875 | Hursey et al. | Jan 2003 | A1 |
20030028803 | Bunker, V et al. | Feb 2003 | A1 |
20030033516 | Howard et al. | Feb 2003 | A1 |
20030033542 | Goseva-Popstojanova et al. | Feb 2003 | A1 |
20030041264 | Black et al. | Feb 2003 | A1 |
20030051026 | Carter et al. | Mar 2003 | A1 |
20030051163 | Bidaud | Mar 2003 | A1 |
20030051168 | King et al. | Mar 2003 | A1 |
20030055931 | Cravo De Almeida et al. | Mar 2003 | A1 |
20030061506 | Cooper et al. | Mar 2003 | A1 |
20030065943 | Geis et al. | Apr 2003 | A1 |
20030084280 | Bryan et al. | May 2003 | A1 |
20030084320 | Tarquini et al. | May 2003 | A1 |
20030084323 | Gales | May 2003 | A1 |
20030084347 | Luzzatto | May 2003 | A1 |
20030088792 | Card et al. | May 2003 | A1 |
20030093667 | Dutta et al. | May 2003 | A1 |
20030093695 | Dutta | May 2003 | A1 |
20030093696 | Sugimoto | May 2003 | A1 |
20030095555 | McNamara et al. | May 2003 | A1 |
20030097439 | Strayer et al. | May 2003 | A1 |
20030097564 | Tewari et al. | May 2003 | A1 |
20030105976 | Copeland, III | Jun 2003 | A1 |
20030110392 | Aucsmith et al. | Jun 2003 | A1 |
20030110396 | Lewis et al. | Jun 2003 | A1 |
20030115485 | Milliken | Jun 2003 | A1 |
20030115486 | Choi et al. | Jun 2003 | A1 |
20030123665 | Dunstan et al. | Jul 2003 | A1 |
20030126464 | McDaniel et al. | Jul 2003 | A1 |
20030126472 | Banzhof | Jul 2003 | A1 |
20030135749 | Gales et al. | Jul 2003 | A1 |
20030140137 | Joiner et al. | Jul 2003 | A1 |
20030140250 | Taninaka et al. | Jul 2003 | A1 |
20030145212 | Crumly | Jul 2003 | A1 |
20030145225 | Bruton, III et al. | Jul 2003 | A1 |
20030145226 | Bruton, III et al. | Jul 2003 | A1 |
20030149887 | Yadav | Aug 2003 | A1 |
20030149888 | Yadav | Aug 2003 | A1 |
20030152096 | Chapman | Aug 2003 | A1 |
20030154393 | Young | Aug 2003 | A1 |
20030154399 | Zuk et al. | Aug 2003 | A1 |
20030154402 | Pandit et al. | Aug 2003 | A1 |
20030158905 | Petry et al. | Aug 2003 | A1 |
20030159069 | Choi et al. | Aug 2003 | A1 |
20030159070 | Mayer et al. | Aug 2003 | A1 |
20030167402 | Stolfo et al. | Sep 2003 | A1 |
20030172166 | Judge et al. | Sep 2003 | A1 |
20030172167 | Judge et al. | Sep 2003 | A1 |
20030172289 | Soppera | Sep 2003 | A1 |
20030172291 | Judge et al. | Sep 2003 | A1 |
20030172292 | Judge | Sep 2003 | A1 |
20030172294 | Judge | Sep 2003 | A1 |
20030172301 | Judge et al. | Sep 2003 | A1 |
20030172302 | Judge et al. | Sep 2003 | A1 |
20030187996 | Cardina et al. | Oct 2003 | A1 |
20030212791 | Pickup | Nov 2003 | A1 |
20030233328 | Scott et al. | Dec 2003 | A1 |
20040015554 | Wilson | Jan 2004 | A1 |
20040025044 | Day | Feb 2004 | A1 |
20040054886 | Dickinson et al. | Mar 2004 | A1 |
20040058673 | Iriam et al. | Mar 2004 | A1 |
20040059811 | Sugauchi et al. | Mar 2004 | A1 |
20040088570 | Roberts et al. | May 2004 | A1 |
20040111531 | Staniford et al. | Jun 2004 | A1 |
20040139160 | Wallace et al. | Jul 2004 | A1 |
20040139334 | Wiseman | Jul 2004 | A1 |
20040177120 | Kirsch | Sep 2004 | A1 |
20040203589 | Wang et al. | Oct 2004 | A1 |
20040205135 | Hallam-Baker | Oct 2004 | A1 |
20040267893 | Lin | Dec 2004 | A1 |
20050021738 | Goeller | Jan 2005 | A1 |
20050052998 | Oliver et al. | Mar 2005 | A1 |
20050065810 | Bouron | Mar 2005 | A1 |
20050102366 | Kirsch | May 2005 | A1 |
20050141427 | Bartky | Jun 2005 | A1 |
20050262209 | Yu | Nov 2005 | A1 |
20050262210 | Yu | Nov 2005 | A1 |
20060015942 | Judge et al. | Jan 2006 | A1 |
20060036727 | Kurapati et al. | Feb 2006 | A1 |
20060042483 | Work et al. | Mar 2006 | A1 |
20060095404 | Adelman et al. | May 2006 | A1 |
20060123083 | Goutte et al. | Jun 2006 | A1 |
20060191002 | Lee et al. | Aug 2006 | A1 |
20060212925 | Shull et al. | Sep 2006 | A1 |
20060212930 | Shull et al. | Sep 2006 | A1 |
20060212931 | Shull et al. | Sep 2006 | A1 |
20060230039 | Shull et al. | Oct 2006 | A1 |
20060253458 | Dixon et al. | Nov 2006 | A1 |
20070199070 | Hughes | Aug 2007 | A1 |
20070214151 | Thomas et al. | Sep 2007 | A1 |
20080175266 | Alperovitch et al. | Jul 2008 | A1 |
20080178259 | Alperovitch et al. | Jul 2008 | A1 |
20090003204 | Okholm et al. | Jan 2009 | A1 |
20090113016 | Sen et al. | Apr 2009 | A1 |
20090254499 | Deyo | Oct 2009 | A1 |
20090254572 | Redlich et al. | Oct 2009 | A1 |
Number | Date | Country |
---|---|---|
2564533 | Dec 2005 | CA |
0375138 | Jun 1990 | EP |
0413537 | Feb 1991 | EP |
0420779 | Apr 1991 | EP |
0720333 | Jul 1996 | EP |
0838774 | Apr 1998 | EP |
0869652 | Oct 1998 | EP |
0907120 | Apr 1999 | EP |
1326376 | Jul 2003 | EP |
1271846 | Jul 2005 | EP |
2271002 | Mar 1994 | GB |
18350870 | Dec 2006 | JP |
10-0447082 | Mar 2004 | KR |
2006-0012137 | Feb 2006 | KR |
1020060041934 | May 2006 | KR |
10-0699531 | Mar 2007 | KR |
10-0737523 | Jul 2007 | KR |
10-0750377 | Aug 2007 | KR |
10-2006-0028200 | Sep 2007 | KR |
WO 9635994 | Nov 1996 | WO |
WO 9905814 | Feb 1999 | WO |
WO 9933188 | Jul 1999 | WO |
WO 9937066 | Jul 1999 | WO |
WO 0042748 | Jul 2000 | WO |
WO 0117165 | Mar 2001 | WO |
WO 0150691 | Jul 2001 | WO |
WO 0176181 | Oct 2001 | WO |
WO 0213469 | Feb 2002 | WO |
WO 0213489 | Feb 2002 | WO |
WO 02075547 | Sep 2002 | WO |
WO 02091706 | Nov 2002 | WO |
WO 2004061703 | Jul 2004 | WO |
WO 2004081734 | Sep 2004 | WO |
WO 2005116851 | Dec 2005 | WO |
WO 2008008543 | Jan 2008 | WO |
Number | Date | Country | |
---|---|---|---|
20090122699 A1 | May 2009 | US |