Patent Grant
10044715
This disclosure relates to managing computing resources based on presence information. Specifically, methods and apparatus for managing access to computing resources by considering a computer's operating environment and interactions with one or more users are disclosed.
The security risk to corporate electronic assets is evolving due to several industry trends. First, the use of mobile devices, such as smart phones, is being widely adopted across the business community. As they adopt them, the users of mobile devices expect to use those devices to perform many of their day to day business processes. For example, smart phones are now used to access corporate email systems and other critical business systems that contain potentially vast amounts of sensitive information. This sensitive information may include, for example, health information (PHI), personally identifiable information (PII), financial information and confidential intellectual property. The existence of this sensitive information on mobile devices makes the information susceptible to data losses, for example, in cases in which the device is lost or stolen.
While the use of mobile devices increases the risk to corporate data generally, the risk may be based on how the mobile device is being used. For example, mobile devices located in certain regions or countries may present an increased risk to corporate data over mobile devices used in other regions or countries. Similarly, mobile devices utilizing particular network connection methods may present a higher risk (for example, sending data over unencrypted channels), when compared to other mobile devices.
While use of mobile devices is increasing the risk to corporate information assets, the evolving malicious software threat is also increasing that risk. Previous generations of malicious software might often destroy data on a computer or network after gaining control of a host computer. However, more modern malicious programs may take a more insidious approach. For example, instead of immediately damaging or destroying the infected hosts and their associated data, modern malicious applications may instead quietly subvert the host so that it may be put to use by the attacker. One of the more damaging attack profiles occurs when a malicious application is able to gain control of a computer for the purposes of forming a botnet.
A botnet is a network of compromised computers, each of which is known as a “bot.” These compromised computers, acting on the attacker's behalf and unbeknownst to the rightful owner of the computer, perform a variety of nefarious tasks, including participating in denial of service attacks or the sending of spam email.
Data theft from malicious software is also becoming an increasing problem. Fifty five percent of data loss is now attributed to data stealing malware web communications. The remaining 45% of non-web malware communications is caused by Trojans or email communications over non-web channels.
In some cases, a legitimate user may be unaware that their computer is infected with malicious software. This software may operate covertly, refraining from activities that may draw attention to its presence, such as excessive use of computing resources, including CPU, I/O channel bandwidth, network access, and the like.
Embodiments of the disclosure may include a method of managing a computer's access to resources. The method may include receiving a request for computer resources, executing instructions on computer hardware to determine presence information relating to the computer, determining a resource control policy to apply to the request for computer resources based on the presence information, and executing instructions on computer hardware to allow or disallow the request for resources based on the policy. In an embodiment, the presence information indicates an interactivity level on the computer. In some of these embodiments, an interactivity level is based on whether an input has been received from an input device directly connected to the computer within a time period. In some embodiments, the interactivity level is based on whether an interactive shell is running on the computer. In an embodiment, the interactivity level is based on whether a screen saver is active on the computer's console. In an embodiment, the interactivity level is based on the amount of idle CPU cycles on the computer within a time period.
In some embodiments, the presence information indicates whether the computer is communicating over a secure network connection. In some embodiments, the presence information indicates the computer's location within a corporate network. In some embodiments, the presence information indicates the physical location of the computer.
In some embodiments, the resource control policy controls the use of hardware resources of the computer. In some embodiments, the resource control policy controls access to network data by the computer. In some of these embodiments, the access to network data is controlled based, at least in part, on one or more content categories of a URL identifying the network data.
In some of these embodiments, a first set of URL categories are accessible to the computer when the presence information indicates a first presence state and a second set of URL categories are accessible to the computer when the presence information indicates a second presence state.
In some other embodiments, the resource control policy controls whether network communication by the computer is encrypted. In some embodiments, the resource control policy controls whether network data sent by the computer is compressed. In some embodiments, the resource control policy controls whether network data sent by the computer is signed.
In some embodiments, the resource control policy controls the rate at which data sent or received by the computer may be transferred on a network. In some embodiments, the resource control policy controls content of email messages sent by the computer.
Another innovative aspect disclosed is an apparatus for managing a computer's access to resources. The apparatus includes a memory, a processor, configured to fetch instructions from the memory, a network interface, operatively coupled to the processor. The memory stores a presence management module, configured to cause the processor to receive and store presence information for the computer to a storage, a URL filtering interface module, configured to cause the processor to receive a URL access request including a requested URL, a URL categorization module, configured to cause the processor to determine one or more URL categories of the requested URL, a policy determination module, configured to cause the processor to determine a policy to apply to the requested URL based, at least in part, on the presence information for the computer, and a policy application module, configured to cause the processor to authorize or not authorize access to the requested URL by the computer based, at least in part, on the determined policy and the one or more URL categories. In some embodiments of the apparatus, the presence information indicates an interactivity level of the computer. In some embodiments, the URL access request is based, at least in part, on a request for the URL by the computer.
Another innovative aspect disclosed is an apparatus including a means for determining presence information relating to a computer, and a means for applying a resource control policy based on the presence information. In some embodiments, the presence information indicates at least one of an interactivity level of the computer or the computer's location within a corporate network, and wherein the resource control policy controls access to network data based, at least in part, on one or more content categories of a URL identifying the network data.
Another innovative aspect is a non-transitory computer readable medium, storing instructions that when executed by a processor perform a method of preventing the loss of sensitive data on a mobile device. The method includes determining presence information relating to a computer, and applying a resource control policy based on the presence information.
In some embodiments, the presence information indicates at least one of an interactivity level of the computer or the computer's location within a corporate network. In some embodiments, the resource control policy controls access to network data based, at least in part, on one or more content categories of a URL identifying the network data.
The disclosed aspects will hereinafter be described in conjunction with the appended drawings, provided to illustrate and not to limit the disclosed aspects, wherein like designations denote like elements.
As described above, the risks presented by mobile devices and malicious applications are substantial. For example, mobile devices may travel to destinations that present inherent risk to corporate assets. Furthermore, a corporate computer infected so as to join a botnet may participate in denial of service attacks or act as an agent for the sending of spam email. These actions by a corporate owned asset could subject the legitimate owner of the computer to legal liability or at a minimum result in negative publicity. Compromised computers may also act as agents for the attacker by sending sensitive data accessible from the compromised computer to the attacker.
To mitigate the effects of these risks, a computer's access to resources may be specifically tailored to minimize risk while providing the access necessary to perform important functions. Applications running on a computer have access to a variety of resources, including both resources local to the computer itself, such as processing power, disk space, and I/O channel bandwidth, but also resources external to the computer. These resources may include network bandwidth, and access to a variety of network applications such as email, internet browsing, network file transfer, networked file storage, and many more.
Depending on the computer's operating environment or presence, legitimate resource needs of a computer application may vary. Additionally, some operating environments present inherently greater risk than others. Therefore, some implementations may vary the accessibility of resources to applications running on the computer based on the computer's operating environment.
A computer's operating environment or presence may encompass various aspects of how the computer is being used. For example, presence information may encompass interactivity aspects of the computer, network connectivity aspects of the computer, or location aspects of the computer. For example, presence may encompass an interactivity level of the computer. Whether a user is currently logged in and working with the computer may be one dimension of an interactivity level. In some implementations for example, whether a computer's console is locked may indicate whether an interactive session is currently active, and whether a user is currently logged in and using the computer. Similarly, activation of a screen saver may provide a similar indication. Whether input has been received from a physically attached keyboard or pointing device may also provide an level of interactivity in some implementations.
The absence or presence of an interactive shell program may also provide an indication of whether the computer is currently being used in an interactive manner. Some computer operating systems support multi-user or remote login capability that provides for interactive use of the computer without use of the console. Implementations for managing resources on these computers may use the presence or activity of an interactive shell program that supports multi-user or remote login capabilities to provide an indication of whether the computer is currently in an interactive mode.
The allocation or authorization of resources to the computer may be based on the interactivity level determined by presence information. When an interactive session is active on a computer, an employee may be actively using an email application, and computing resources may be made available to applications running on the computer to ensure the interactive session is productive.
If the employee steps away from the computer, for example, to attend a meeting, the interactive shell they were using may become inactive. For example, a screen saver may activate, the terminal (such as the console) used by the interactive session may become locked, or their interactive shell program (such as the interactive shell described above), may stop consuming CPU cycles. When the interactive session becomes inactive or ends, the interactivity level of the computer is reduced, and resources authorized for use by applications running on the computer may be different when compared to when the interactive session was active and the interactivity level was also higher. The amount of CPU, I/O bandwidth, network data received or transferred, or the set of network applications that may send or receive data with the computer (for example, based on the network ports used by the network applications) may be different than when an interactive session is active on the computer. Some implementations, for example, may allow the computer to receive email when no interactive session is present, but not allow the computer to send email during that time.
In some implementations, the allocation or authorization of resources to the computer may be based on the ambient light or display settings of an interactive environment. For example, presence information may include the level of ambient light at a user's computer, or the display settings of a user's display. Display settings such as font size or the contrast level between the font and the background may be considered presence information. In some implementations, the display or transfer of sensitive information on or to a user's computer may be prohibited by a policy if the font size is above a predetermined threshold. In some other implementations, whether certain information may be displayed by or transferred to a computer may be based on the contrast level of a font on the computer. For example, some implementations may guard against the display of presentations on a display in environments outside a corporate network.
The type of display connected to a computer may also be considered presence information. In some implementations, access to network content may be based on the type of displays connected to a computer. For example, if a projection device is connected to a computer, some implementations may prohibit the transfer or display of certain types of content (for example, sensitive content) on or to the computer.
Whether a privacy shield is installed on a computer′ display may also be considered presence information, with policies that control the transfer or display of information on or to the computer based on whether the privacy shield is installed. For example, some displays may include sensors or switches that are activated when a privacy shield is installed. A policy may then control access to some data based on output from the sensors or switches.
In some implementations, particular display technologies may provide more privacy than others. For example, the viewing angle of some LCD displays may be more restricted than the viewing angle of other display technologies. In these implementations, the display technology or viewing angle may be considered presence information, with policies controlling access to some data based on the display technology or viewing angle parameters present in an interactive environment.
Some implementations may also vary access to network content identified by URLs based on presence information. For example, when an interactive session is active on a computer, the computer may be allowed to access and download network content from a first set of URL site categories. When no interactive session is active, a second set of URL categories may be accessible, which is different than the first set. Alternatively, implementations may vary a whitelist or blacklist of accessible URL categories or sites based on presence information.
In some implementations, available resources may vary based on the interactivity of the session running a particular application. For example, on a multi-user or multi account computer system, an application running under an account during an active interactive session may be provided with a first set of resource allocations, while the same application running under an account when there is no active interactive session may be provided with a second set of resource allocations.
In addition to interactivity, some aspects of presence may relate to the location of the computer. The risk to corporate data on a computing device may vary with the devices location, either geographically or by its location within a corporate intranet. For example, certain geographic locations may present a higher risk of theft to a corporate mobile device. Other locations may provide network communications infrastructure that is susceptible to snooping or industrial espionage. The security of corporate intranets may also vary. For example, while remote offices may include connections to the corporate intranet, their communications infrastructure may not receive the same level of management as the infrastructure at a corporate headquarters.
Presence may include the computer's physical location on the planet earth, for example, represented by latitude and longitude coordinates. Other aspects of presence relate to the computer's location within a network topology. For example, is the computer located at a corporate headquarters, a branch office, or VPN'ed into the corporate network from a coffee shop.
Therefore, some implementations may determine a resource control policy based on a computer's geographic location or location within a network topology. These resource control policies may, for example, vary the rate at which the computer can send or receive network data based on the computer's location. Some implementations may utilize policies that vary the network path used to communicate with the computer based on the computer's location.
Because the risk to the security of corporate data may vary by location, some implementations may vary the encryption requirements for data sent or received over a network based on the computer's location. Some other implementations may require that certain or all network data sent or received by a computer be electronically signed based on the computer's location. The location of the computer may also determine which network applications are accessible to applications running on the computer. For example, which particular protocol ports may be available to send data on or receive data on may be determined based on the location of the computer. The location of the computer may also determine the content of email messages sent or received by the computer. For example, in some implementations, an email header or footer may be inserted into emails sent from a particular location. The email header or footer may provide notice to the reader that the email was transferred through a less secure location, so that proper considerations may be taken when replying to the email or when opening attachments.
In some implementations, a data policy may not require that data stored on a storage medium be encrypted when a computer is operating within a defined geographic region or connected to a particular set of networks. For example, some implementations may determine that a computer is within a corporate campus based on its geographic location. Some implementations may determine that a computer is operating within a corporate network when it is connected directly to a corporate network or connected via a VPN to the corporate network. These implementations may determine that storage accessed by the computer can be unencrypted when operating in these environments.
These implementations may also detect when the computer transitions from the previously described “secure” environments, such as a corporate campus, to a less secure environment. For example, these implementations may detect when a computer moves off the corporate campus based on its geographic location, or they may detect when the computer connects directly to a non-corporate network. In these implementations, a policy may further require that a storage be encrypted when the computer is operating in a less secure environment. Some implementations may trigger an audit of a computer or a storage based on detecting a change in a security level of the computer's operating environment. One result of an audit could be that data accessed by or located on the computer be encrypted.
Presence information may also include one or more characteristics of the network connection used by the computer. This presence information may be used to determine parameters of the network connections, or restrictions on the type of data sent or received over that network connection. For example, the security level of the network connection may determine whether data sent or received by the computer should be encrypted. The security level of the network connection may also determine whether the resource control policy requires that data sent or received by the computer be electronically signed.
Presence information may also include the speed of a network connection used by the computer. A resource control policy may then be based on this presence information. For example, the rate at which the computer is authorized to send or receive data over a network connection may be based on the speed of the network connection. In some implementations, whether data sent or received by the computer is compressed may be based on whether the speed of the network connection used by the computer is below a threshold.
The system 100 also includes a resource manager 110, a presence detector 115, a presence datastore 145, and resources to be managed 160. Resources to be managed 160 in the implementation of
Before accessing a resource 160, the MRC may submit a resource request 111 to the resource manager 110. The resource manager determines whether access to the resource, for example, any of the resources to be managed 160, should be granted. The decision may be based, at least in part, on presence information. Presence information may relate to one or more aspects of the MRC 105. For example, presence information may relate to the location, interactivity, or network connectivity of the MRC 105. Presence information is obtained in the illustrated implementation by the resource manager 110 from the presence datastore 145. The presence information may be written to the presence datastore by the presence detector 115.
In other implementations, presence information may be obtained by the resource manager 110 directly from the presence detector 115. For example, the resource manager 110 may periodically poll the presence detector to retrieve presence information. Alternatively, the presence detector 115 may asynchronously transmit presence information to the resource manager. For example, when presence information changes on the client computer running the presence detector, the presence detector may then send an update to the resource manager 110.
After the resource manager has made a determination of whether the MRC 105 may have access to a resource, it sends a resource response 112 to the MRC 105. The resource response may indicate whether the MRC 105 may have access to the requested resource.
In the illustrated implementation, the firewall 125 is in communication with the resource manager 110. In some implementations, resource manager 110 may be a URL filter server. For example, resource manager 110 may apply an access control policy to a URL access request. The access control policy may be based, at least in part, on a category of content stored at a destination server identified by the URL. The resource manager 110 in this implementation is in communication with a URL category database 120 and a URL filtering policy database 122. Client computers 105-a-i access the Internet 130 via firewall 125. Each client computer 105a-i includes a presence detector 115. In the illustrated implementation, the presence detector 115 runs on each client computer 105a-i. The presence detector 115 detects presence information for the client computer 105a-i and sends the presence information to a presence datastore. In the illustrated implementation, the presence information sent by the presence detector 115 is sent to the resource manager or resource manager 110 and stored in a presence database 121. This presence information may be read by the resource manager 110 when determining whether resource requests 111 for URLs should be authorized.
Process 200 then moves to block 220. Upon receiving the resource request 111, the resource manager 110 searches the URL category database for the URL to identify one or more categories assigned to the URL. Process 200 then moves to decision block 225. If the URL is not found in the category database, process 200 moves to processing block 230, where a policy for handling uncategorized URLs is determined. An appropriate reply may be sent, based at least in part, on the policy determined in process block 230. If one or more categories are found in decision block 225, process 200 moves to decision block 235. In decision block 235, one or more categories may be compared to categories allowed by a URL filtering policy. The URL filtering policy may be stored in the URL filtering policy database 122, illustrated in
If the URL category is allowed by the URL filtering policy, process 200 moves to processing block 240, where the URL filter sends a resource response 112 to the firewall 125 indicating access to the content identified by the URL is authorized. Upon receiving this response, the firewall 125 may allow the client computers generating the original request to access the Internet content identified by the URL. If the URL category is not allowed by the URL filtering policy, process 200 moves from decision block 235 to decision block 245, where the URL filter sends a resource response 112 to the firewall 125 indicating that access to the URL by the computer is not authorized. Upon receiving the resource response 112, the firewall may disallow access to the URL by the client computer. Whether process 200 executes processing block 240 or processing block 245, after processing of either block is complete, process 200 moves to end block 250 and terminates.
A presence management module 327 includes instructions that configure the processor to detect and maintain presence information for one or more client computers, such as computers 105a-i illustrated in
A URL categorization module 330 includes instructions that configure processor 320 to categorize a URL. For example, in some implementations, module 330 may categorize a URL by searching for the URL in a URL categorization database, such as database 120 illustrated in
A policy determination module 335 includes instructions that configure processor 320 to identify an applicable policy for a URL request. For example, when a URL is received by the resource manager 110, the policy that is appropriate for the URL may be determined based on one or more attributes of the URL or data associated with the URL. For example, attributes that may be used to determine the appropriate policy for the URL include the time of day, the user requesting access to the URL, or the IP address of the client computer requesting access to the URL. In some implementations, a directory server may be consulted by the policy determination module 335 to identify one or groups defined by the directory to which the user requesting access to the URL belongs. These one or more groups may also be used to determine, at least in part, a policy to apply to the URL access request. Presence information associated with the computer requesting access to the URL may be used to determine the appropriate policy to apply the URL request. Whether the presence information indicates a first presence state or a second presence state may determine the policy applied to the URL request.
A policy application module 340 includes instructions that configure processor 320 to apply a policy to a URL access request. For example, the policy application module 340 may compare the URL category determined by the URL categorization module 330 against one or more allowed categories determined by a policy determined by the policy determination module 335. If the URL category is allowed by the determined policy, then access to the URL may be allowed by the resource manager 110. Conversely, if the policy indicates access to URL's in that category are not authorized, the requesting computer may be blocked from accessing content identified by the URL.
A URL filtering interface module 342 includes instructions that configure the processor 320 to provide URL filtering services. In some implementations, the URL filtering interface module 342 may implement a web service interface that allows interface clients, such as firewall 125 in
An operating system module 345 may include instructions that configure the processor 320 to manage the hardware and software resources of resource manager 110. For example, operating system module 345 may include instructions that provide for the modules described above to communicate over network interface 348. Operating system module 345 may also provide instructions that allow the modules described above to communicate with each other, or to utilize storage space provided by storage 310 or working memory 305.
A resource manager communication module 488 includes instructions that communicate the client computer's presence information, detected by the presence detection module 485, to a resource manager, such as the resource manager 110, illustrated in
The client computer 105 also includes an application module 489. The application module 489 includes instructions that configure processor 460 to implement one or more applications that utilize resources managed by a resource management system. For example, in some implementations, the application module 489 may implement one or more applications that consume hardware resources on client computer 105. For example, application module 489 may consume processor time on processor 460, memory space from working memory 465, or storage space from storage 470. Access to these resources may be controlled by resource manager module 490 discussed below.
In other implementations, application module 489 may implement one or more network applications that send or receive network data over network interface 475. For example, the instructions in application module 489 may implement an internet browsing program. Alternatively, the instructions may implement an instant messaging client, streaming client, or file transfer application. Application module 489 may also implement a custom application that sends and receives network data.
A resource manager module 490 includes instructions that manage resources of client computer 105 used by application module 489. In some implementations, the resource manager module 490 authorizes access to resources based, at least in part, on presence information for client computer 105. For example, resource manager module 490 may manage use of the GPS receiver 495, working memory 465, storage 470, or network interface 475 based on presence information, such as whether an interactive session is present on client computer 105. Note that the resource manager module 490 stored in memory 480 may not be included in all implementations. For example, in some other implementations, the resource manager 490 may be external to client computer 105. Some implementations may utilize a resource manager 110 as a resource manager 110. In these implementations, client computer 105 may request authorization to use or access resources from the external resource manager. In still other implementations, there may be an external resource manager and also a resource manager 490 included in the client computer 105. For example, an external resource manager may manage resources external to client computer 105, such as network resources, while an internal resource manager 490 may manage resources internal to client computer 105.
An operating system module 492 includes instructions that configure processor 460 to manage the software and hardware resources of client computer 105. For example, the resource manager communication module 488 may invoke subroutines in the operating system module 492 to send or receive network data over network interface 475. Subroutines in operating system module 492 may also be used to store data to data storage 470 or use working memory 465. Note that in some implementations, a local resource manager such as resource manager 490 may be closely integrated with or part of operating system module 492.
Presence data determined in block 504 may relate to one or more characteristics of a managed resource consumer. For example, the presence data may indicate the physical location of the managed resource consumer, the location of the managed resource consumer within a particular network topology, the security level of the network connection used by the managed resource consumer, or the speed of the network connection used by the managed resource consumer. If the managed resource consumer is a client computer, the presence information may relate to whether a screen saver is currently active on the client computer, or whether the console of the client computer is currently locked. The presence information may also indicate whether any input has been received from a physically attached keyboard or pointing device within a time period, or how much idle time there has been on the client computer within a time period. The presence information may also indicate whether any programs implementing an interactive shell are running on the client computer, or if they are running, how much processing time they have consumed during a time period. Alternatively, how much time has elapsed since interactive shells running on the client computer have consumed CPU processing time may be included in the presence information. Processing block 504 may be implemented by instructions included in the presence management module 327, illustrated in
Table 1 below illustrates presence data in some implementations. Some embodiments may implement one or more of the examples of presence data shown, and not implement other examples. In addition, some implementations may include additional presence data not shown in Table 1. Table 1 is provided only to show examples of presence data in some implementations and is not intended to be limiting:
Process 500 then moves to processing block 506, where a resource control policy is applied based on the presence information. Processing block 506 may be implemented by instructions included in the policy application module 340, illustrated in
Tables 2-4 below illustrates example resource control policies in some implementations. The resource policies may vary based, at least in part, on presence information.
The type of resource requested in block 615 may vary by implementation. For example, some implementations may request access to hardware resources, such as memory, disk space, I/O channel bandwidth, or processor time in processing block 615. Other implementations may request access to network resources. For example, network resources requested in block 615 may include network content identified by a URL, an ability to send or receive network data or packets over one or more network protocols or ports, or the ability to send or receive network data at a particular rate. Requests for network resources may also include an ability to send or receive network data. These are examples and are not intended to be limiting.
Once the resource access request is received in processing block 615, process 600 moves to decision block 620, which determines whether the presence data determined in processing block 612 is set to a first presence state. A first presence state may represent any presence state that can be distinguished from another presence state. For example, any of the presence states described in Table 1 may be a first presence state and evaluated in decision block 620.
While only two values of a presence state are illustrated in
If the presence data is set to the first presence state, process 600 moves to block 625, where a resource control policy associated with the first presence state is applied to the resource access request. If it is determined in block 625 that the presence state is not set to a first presence state, then process 600 moves to processing block 640, where a resource control policy associated with a second presence state is applied. In either case, process 600 then moves to end block 630 and terminates.
In processing block 715, presence data for the client computer generating the URL access request is determined. For example, in some implementations, a database of presence information for each client computer on a communication network may be maintained. Processing block 715 may search the database for presence information based on information received in the URL access request of processing block 710. For example, in some implementations it may determine the presence information based on the source IP address or user specified in the URL access request.
In processing block 720, the category of the URL received in the URL access request of processing block 710 is determined. For example, to determine the category of the URL, some implementations may search a URL category database mapping URLs to one or more categories. Some other implementations may perform dynamic characterization of the URL. For example, in block 720, the network content identified by the URL may be retrieved. The content may be parsed and characterizations of the content performed based on attributes of the content such as links included in the content, keywords detected in the content, pictures or graphics included in the content etc. Based on this analysis, one or more categories of the content may be determined.
In decision block 725, process 700 determines if the presence information determined in block 715 is equal to a first presence state. The first presence state and second presence state referred to in block 725, 730, and 735 may be at least any of the presence states described in Table 1 above. If the presence information in block 725 does equal a first presence state, process 700 moves to block 735, where one or more URL categories that are allowed when the presence information equals the first presence state are determined. If the presence information in block 725 does not equal a first presence state, process 700 moves to block 730, where one or more URL categories allowed by a policy configured for a second presence state are determined.
Process 700 then moves to decision block 740, where it is determined if the category of the URL determined in processing block 720 is in one of the allowed categories. If the URL category is allowed, process 700 moves to processing block 750, where access to content at the site identified by the URL is allowed. In processing block 750, a reply message may be sent to the sender of the URL access request received in processing block 710, with a status code indicating the request is allowed. Conversely, if in block 740 it is determined that the category of the URL requested is not allowed, process 700 moves to processing block 745, where access to the content identified by the URL is denied. In some implementations, processing block 745 may send a reply to the sender of the URL access request, with a status code indicating that access to the content identified b the URL is not authorized. Process 700 then moves to end block 755 and terminates.
In processing block 815, the presence data determined in block 810 is sent to a server. For example, in some implementations, the server may be a URL filtering server 110 as illustrated in
In processing block 820, process 800 waits for a time period. Processing block 820 may be performed in order to efficiently manage the client processing resources consumed by process 800. For example, without a wait period defined by processing block 820, process 800 may continuously send presence data to a server, unnecessarily consuming resources on the computer running process 800.
The length of the time period in block 820 may vary by implementation. Some implementations may wait less than one second. Other implementations may wait for 5, 10, 15, or 20 seconds. Any waiting period between 1 microsecond and 30 minutes may be used by various implementations. Implementations may determine the specific time period based on implementation specific trade-offs between accuracy and timeliness of presence information, which benefits from a shorter time period, and consumption of processing and other resources, which are reduced when using longer time periods.
After the time period of processing block 820 has elapsed, process 800 moves to decision block 825, which determines whether process 800 should shutdown. A shutdown may be appropriate, for example, if the computer running process 800 is shutting down. If a shutdown should be performed, process 800 moves to end block 830 and process 800 terminates. If it is determined in block 525 that no shutdown should be performed, process 800 then returns to processing block 810 and process 800 repeats.
The technology is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, processor-based systems, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
As used herein, instructions refer to computer-implemented steps for processing information in the system. Instructions can be implemented in software, firmware or hardware and include any type of programmed step undertaken by components of the system.
A processor may be any conventional general purpose single- or multi-chip processor such as a Pentium® processor, a Pentium® Pro processor, a 8051 processor, a MIPS® processor, a Power PC® processor, or an Alpha® processor. In addition, the processor may be any conventional special purpose processor such as a digital signal processor or a graphics processor. The processor typically has conventional address lines, conventional data lines, and one or more conventional control lines.
The system is comprised of various modules as discussed in detail. As can be appreciated by one of ordinary skill in the art, each of the modules comprises various subroutines, procedures, definitional statements and macros. Each of the modules are typically separately compiled and linked into a single executable program. Therefore, the description of each of the modules is used for convenience to describe the functionality of the preferred system. Thus, the processes that are undergone by each of the modules may be arbitrarily redistributed to one of the other modules, combined together in a single module, or made available in, for example, a shareable dynamic link library.
The system may be used in connection with various operating systems such as Linux®, UNIX® or Microsoft Windows®.
The system may be written in any conventional programming language such as C, C++, BASIC, Pascal, or Java, and ran under a conventional operating system. C, C++, BASIC, Pascal, Java, and FORTRAN are industry standard programming languages for which many commercial compilers can be used to create executable code. The system may also be written using interpreted languages such as Perl, Python or Ruby.
Those of skill will further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
In one or more example embodiments, the functions and methods described may be implemented in hardware, software, or firmware executed on a processor, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media include both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage medium may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
The foregoing description details certain embodiments of the systems, devices, and methods disclosed herein. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the systems, devices, and methods can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the technology with which that terminology is associated.
It will be appreciated by those skilled in the art that various modifications and changes may be made without departing from the scope of the described technology. Such modifications and changes are intended to fall within the scope of the embodiments. It will also be appreciated by those of skill in the art that parts included in one embodiment are interchangeable with other embodiments; one or more parts from a depicted embodiment can be included with other depicted embodiments in any combination. For example, any of the various components described herein and/or depicted in the Figures may be combined, interchanged or excluded from other embodiments.
With respect to the use of substantially any plural and/or singular terms herein, those having skill in the art can translate from the plural to the singular and/or from the singular to the plural as is appropriate to the context and/or application. The various singular/plural permutations may be expressly set forth herein for sake of clarity.
It will be understood by those within the art that, in general, terms used herein are generally intended as “open” terms (e.g., the term “including” should be interpreted as “including but not limited to,” the term “having” should be interpreted as “having at least,” the term “includes” should be interpreted as “includes but is not limited to,” etc.).
It will be further understood by those within the art that if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases “at least one” and “one or more” to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim recitation to embodiments containing only one such recitation, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an” (e.g., “a” and/or “an” should typically be interpreted to mean “at least one” or “one or more”); the same holds true for the use of definite articles used to introduce claim recitations. In addition, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should typically be interpreted to mean at least the recited number (e.g., the bare recitation of “two recitations,” without other modifiers, typically means at least two recitations, or two or more recitations). Furthermore, in those instances where a convention analogous to “at least one of A, B, and C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, and C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.). In those instances where a convention analogous to “at least one of A, B, or C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, or C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.). It will be further understood by those within the art that virtually any disjunctive word and/or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or “B” or “A and B.”
While various aspects and embodiments have been disclosed herein, other aspects and embodiments will be apparent to those skilled in the art. The various aspects and embodiments disclosed herein are for purposes of illustration and are not intended to be limiting.
This is a continuation application of U.S. patent application Ser. No. 13/724,990, filed Dec. 21, 2012, now U.S. Pat. No. 9,117,054, and entitled “METHOD AND APPARATUS FOR PRESENCE BASED RESOURCE MANAGEMENT.” The content of this prior application is considered part of this application, and is hereby incorporated by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4423414 | Bryant et al. | Dec 1983 | A |
| 4734036 | Kasha | Mar 1988 | A |
| 4941084 | Terada et al. | Jul 1990 | A |
| 5408642 | Mann | Apr 1995 | A |
| 5414833 | Hershey et al. | May 1995 | A |
| 5493692 | Theimer et al. | Feb 1996 | A |
| 5541911 | Nilakantan et al. | Jul 1996 | A |
| 5548729 | Akiyoshi et al. | Aug 1996 | A |
| 5555376 | Theimer et al. | Sep 1996 | A |
| 5581703 | Baugher et al. | Dec 1996 | A |
| 5586121 | Moura et al. | Dec 1996 | A |
| 5606668 | Shwed | Feb 1997 | A |
| 5648965 | Thadani et al. | Jul 1997 | A |
| 5678041 | Baker et al. | Oct 1997 | A |
| 5682325 | Lightfoot et al. | Oct 1997 | A |
| 5696486 | Poliquin et al. | Dec 1997 | A |
| 5696898 | Baker et al. | Dec 1997 | A |
| 5699513 | Feigen et al. | Dec 1997 | A |
| 5706507 | Schloss | Jan 1998 | A |
| 5712979 | Graber et al. | Jan 1998 | A |
| 5724576 | Letourneau | Mar 1998 | A |
| 5768519 | Swift et al. | Jun 1998 | A |
| 5774668 | Choquier et al. | Jun 1998 | A |
| 5781801 | Flanagan et al. | Jul 1998 | A |
| 5787253 | McCreery et al. | Jul 1998 | A |
| 5787427 | Benantar et al. | Jul 1998 | A |
| 5796944 | Hill et al. | Aug 1998 | A |
| 5799002 | Krishnan | Aug 1998 | A |
| 5801747 | Bedard | Sep 1998 | A |
| 5826014 | Coley et al. | Oct 1998 | A |
| 5828835 | Isfeld et al. | Oct 1998 | A |
| 5832212 | Cragun | Nov 1998 | A |
| 5832228 | Holden et al. | Nov 1998 | A |
| 5832503 | Malik et al. | Nov 1998 | A |
| 5835722 | Bradshaw et al. | Nov 1998 | A |
| 5835726 | Shwed et al. | Nov 1998 | A |
| 5842040 | Hughes et al. | Nov 1998 | A |
| 5848233 | Radia et al. | Dec 1998 | A |
| 5848412 | Rowland et al. | Dec 1998 | A |
| 5850523 | Gretta, Jr. | Dec 1998 | A |
| 5855020 | Kirsch | Dec 1998 | A |
| 5864683 | Boebert et al. | Jan 1999 | A |
| 5884033 | Duvall et al. | Mar 1999 | A |
| 5884325 | Bauer et al. | Mar 1999 | A |
| 5889958 | Willens | Mar 1999 | A |
| 5892905 | Brandt et al. | Apr 1999 | A |
| 5896502 | Shieh et al. | Apr 1999 | A |
| 5899991 | Karch | May 1999 | A |
| 5899995 | Millier et al. | May 1999 | A |
| 5911043 | Duffy et al. | Jun 1999 | A |
| 5937404 | Csaszar et al. | Aug 1999 | A |
| 5941947 | Brown et al. | Aug 1999 | A |
| 5944794 | Okamoto et al. | Aug 1999 | A |
| 5950195 | Stockwell et al. | Sep 1999 | A |
| 5958015 | Dascalu | Sep 1999 | A |
| 5961591 | Jones et al. | Oct 1999 | A |
| 5978807 | Mano et al. | Nov 1999 | A |
| 5983270 | Abraham et al. | Nov 1999 | A |
| 5987606 | Cirasole et al. | Nov 1999 | A |
| 5987611 | Freund | Nov 1999 | A |
| 5991807 | Schmidt et al. | Nov 1999 | A |
| 5996011 | Humes | Nov 1999 | A |
| 6052723 | Ginn | Apr 2000 | A |
| 6052730 | Felciano et al. | Apr 2000 | A |
| 6055564 | Phaal | Apr 2000 | A |
| 6065056 | Bradshaw et al. | May 2000 | A |
| 6065059 | Shieh et al. | May 2000 | A |
| 6070242 | Wong et al. | May 2000 | A |
| 6073239 | Dotan | Jun 2000 | A |
| 6085241 | Otis | Jul 2000 | A |
| 6092194 | Touboul | Jul 2000 | A |
| 6105027 | Schneider et al. | Aug 2000 | A |
| 6154741 | Feldman | Nov 2000 | A |
| 6173364 | Zenchelsky et al. | Jan 2001 | B1 |
| 6178505 | Schneider et al. | Jan 2001 | B1 |
| 6182118 | Finney et al. | Jan 2001 | B1 |
| 6219667 | Lu et al. | Apr 2001 | B1 |
| 6226664 | Ng et al. | May 2001 | B1 |
| 6233618 | Shannon | May 2001 | B1 |
| 6233686 | Zenchelsky et al. | May 2001 | B1 |
| 6253188 | Witek et al. | Jun 2001 | B1 |
| 6266664 | Russell-falla et al. | Jul 2001 | B1 |
| 6275497 | Varma et al. | Aug 2001 | B1 |
| 6295559 | Emens et al. | Sep 2001 | B1 |
| 6338088 | Waters et al. | Jan 2002 | B1 |
| 6357010 | Viets et al. | Mar 2002 | B1 |
| 6377577 | Bechtolsheim et al. | Apr 2002 | B1 |
| 6418433 | Chakrabarti et al. | Jul 2002 | B1 |
| 6446119 | Olah et al. | Sep 2002 | B1 |
| 6456306 | Chin et al. | Sep 2002 | B1 |
| 6460141 | Olden | Oct 2002 | B1 |
| 6466940 | Mills | Oct 2002 | B1 |
| 6486892 | Stern | Nov 2002 | B1 |
| 6493758 | Mclain | Dec 2002 | B1 |
| 6516421 | Peters | Feb 2003 | B1 |
| 6519571 | Guheen et al. | Feb 2003 | B1 |
| 6571249 | Garrecht et al. | May 2003 | B1 |
| 6606659 | Hegli et al. | Aug 2003 | B1 |
| 6741997 | Liu | May 2004 | B1 |
| 6742003 | Heckerman et al. | May 2004 | B2 |
| 6785732 | Bates et al. | Aug 2004 | B1 |
| 6804780 | Touboul | Oct 2004 | B1 |
| 6807558 | Hassett et al. | Oct 2004 | B1 |
| 6832230 | Zilliacus et al. | Dec 2004 | B1 |
| 6832256 | Toga et al. | Dec 2004 | B1 |
| 6839680 | Liu et al. | Jan 2005 | B1 |
| 6894991 | Ayyagari et al. | May 2005 | B2 |
| 6944772 | Dozortsev | Sep 2005 | B2 |
| 6978292 | Murakami et al. | Dec 2005 | B1 |
| 7024556 | Hadjinikitas et al. | Apr 2006 | B1 |
| 7058822 | Edery et al. | Jun 2006 | B2 |
| 7089246 | O'laughlen | Aug 2006 | B1 |
| 7093293 | Smithson et al. | Aug 2006 | B1 |
| 7096493 | Liu | Aug 2006 | B1 |
| 7136631 | Jiang et al. | Nov 2006 | B1 |
| 7136867 | Chatterjee et al. | Nov 2006 | B1 |
| 7185015 | Kester et al. | Feb 2007 | B2 |
| 7185361 | Ashoff et al. | Feb 2007 | B1 |
| 7194464 | Kester et al. | Mar 2007 | B2 |
| 7197713 | Stern | Mar 2007 | B2 |
| 7209893 | Nii | Apr 2007 | B2 |
| 7213069 | Anderson et al. | May 2007 | B2 |
| 7313823 | Gao | Dec 2007 | B2 |
| 7359372 | Pelletier et al. | Apr 2008 | B2 |
| 7376154 | Ilnicki et al. | May 2008 | B2 |
| 7376969 | Njemanze et al. | May 2008 | B1 |
| 7478418 | Supramaniam et al. | Jan 2009 | B2 |
| 7590716 | Sinclair et al. | Sep 2009 | B2 |
| 7603685 | Knudson et al. | Oct 2009 | B2 |
| 7603687 | Pietraszak et al. | Oct 2009 | B2 |
| RE41168 | Shannon | Mar 2010 | E |
| 7690013 | Eldering et al. | Mar 2010 | B1 |
| 8549581 | Kailash et al. | Oct 2013 | B1 |
| 9117054 | Black | Aug 2015 | B2 |
| 20010032258 | Ishida et al. | Oct 2001 | A1 |
| 20010039582 | McKinnon, III et al. | Nov 2001 | A1 |
| 20010047343 | Dahan et al. | Nov 2001 | A1 |
| 20020042821 | Muret et al. | Apr 2002 | A1 |
| 20020049883 | Schneider et al. | Apr 2002 | A1 |
| 20020062359 | Klopp et al. | May 2002 | A1 |
| 20020073089 | Schwartz et al. | Jun 2002 | A1 |
| 20020087882 | Schneier et al. | Jul 2002 | A1 |
| 20020110084 | Butt et al. | Aug 2002 | A1 |
| 20020129039 | Majewski et al. | Sep 2002 | A1 |
| 20020129140 | Peled et al. | Sep 2002 | A1 |
| 20020129277 | Caccavale | Sep 2002 | A1 |
| 20020133509 | Johnston et al. | Sep 2002 | A1 |
| 20020144129 | Malivanchuk et al. | Oct 2002 | A1 |
| 20020152284 | Cambray et al. | Oct 2002 | A1 |
| 20020178374 | Swimmer et al. | Nov 2002 | A1 |
| 20030005112 | Krautkremer | Jan 2003 | A1 |
| 20030009495 | Adjaoute | Jan 2003 | A1 |
| 20030023860 | Eatough et al. | Jan 2003 | A1 |
| 20030033525 | Rajaram | Feb 2003 | A1 |
| 20030074567 | Charbonneau | Apr 2003 | A1 |
| 20030093694 | Medvinsky et al. | May 2003 | A1 |
| 20030097617 | Goeller et al. | May 2003 | A1 |
| 20030120543 | Carey | Jun 2003 | A1 |
| 20030126136 | Omoigui | Jul 2003 | A1 |
| 20030126139 | Lee et al. | Jul 2003 | A1 |
| 20030135611 | Kemp et al. | Jul 2003 | A1 |
| 20030149930 | Rey et al. | Aug 2003 | A1 |
| 20030177187 | Levine et al. | Sep 2003 | A1 |
| 20030177389 | Albert et al. | Sep 2003 | A1 |
| 20030185399 | Ishiguro | Oct 2003 | A1 |
| 20040003139 | Cottrille et al. | Jan 2004 | A1 |
| 20040015586 | Hegli et al. | Jan 2004 | A1 |
| 20040019656 | Smith et al. | Jan 2004 | A1 |
| 20040034794 | Mayer et al. | Feb 2004 | A1 |
| 20040049514 | Burkov | Mar 2004 | A1 |
| 20040062106 | Ramesh et al. | Apr 2004 | A1 |
| 20040068479 | Wolfson et al. | Apr 2004 | A1 |
| 20040078591 | Teixeira et al. | Apr 2004 | A1 |
| 20040105416 | Rue | Jun 2004 | A1 |
| 20040111499 | Dobrowski et al. | Jun 2004 | A1 |
| 20040111519 | Fu et al. | Jun 2004 | A1 |
| 20040123157 | Alagna et al. | Jun 2004 | A1 |
| 20040128285 | Green et al. | Jul 2004 | A1 |
| 20040153644 | Mccorkendale et al. | Aug 2004 | A1 |
| 20040172389 | Galai et al. | Sep 2004 | A1 |
| 20040181788 | Kester et al. | Sep 2004 | A1 |
| 20040220924 | Wootton | Nov 2004 | A1 |
| 20050015626 | Chasin | Jan 2005 | A1 |
| 20050033967 | Morino et al. | Feb 2005 | A1 |
| 20050034241 | Prince et al. | Feb 2005 | A1 |
| 20050066197 | Hirata et al. | Mar 2005 | A1 |
| 20050091535 | Kavalam et al. | Apr 2005 | A1 |
| 20050131868 | Lin et al. | Jun 2005 | A1 |
| 20050132042 | Cryer | Jun 2005 | A1 |
| 20050132184 | Palliyil et al. | Jun 2005 | A1 |
| 20050155012 | Tayama et al. | Jul 2005 | A1 |
| 20050210035 | Kester et al. | Sep 2005 | A1 |
| 20050251862 | Talvitie | Nov 2005 | A1 |
| 20050283836 | Lalonde et al. | Dec 2005 | A1 |
| 20060004636 | Kester et al. | Jan 2006 | A1 |
| 20060004717 | Ramarathnam et al. | Jan 2006 | A1 |
| 20060026105 | Endoh | Feb 2006 | A1 |
| 20060031504 | Hegli et al. | Feb 2006 | A1 |
| 20060053488 | Sinclair et al. | Mar 2006 | A1 |
| 20060068755 | Shraim et al. | Mar 2006 | A1 |
| 20060075494 | Bertman et al. | Apr 2006 | A1 |
| 20060095404 | Adelman et al. | May 2006 | A1 |
| 20060095459 | Adelman et al. | May 2006 | A1 |
| 20060095586 | Adelman et al. | May 2006 | A1 |
| 20060095965 | Phillips et al. | May 2006 | A1 |
| 20060101514 | Milener et al. | May 2006 | A1 |
| 20060120526 | Boucher | Jun 2006 | A1 |
| 20060129644 | Owen et al. | Jun 2006 | A1 |
| 20060146056 | Wyatt | Jul 2006 | A1 |
| 20060190525 | Bobde et al. | Aug 2006 | A1 |
| 20060265750 | Huddleston et al. | Nov 2006 | A1 |
| 20070005762 | Knox et al. | Jan 2007 | A1 |
| 20070011739 | Zamir et al. | Jan 2007 | A1 |
| 20070024580 | Sands | Feb 2007 | A1 |
| 20070028302 | Brennan | Feb 2007 | A1 |
| 20070124388 | Thomas | May 2007 | A1 |
| 20070156833 | Nikolov | Jul 2007 | A1 |
| 20070260602 | Taylor | Nov 2007 | A1 |
| 20070300312 | Chitsaz et al. | Dec 2007 | A1 |
| 20080066143 | Charles Tai et al. | Mar 2008 | A1 |
| 20080077995 | Curnyn | Mar 2008 | A1 |
| 20080104196 | Yalakanti et al. | May 2008 | A1 |
| 20080189776 | Constable | Aug 2008 | A1 |
| 20080209577 | Vrielink et al. | Aug 2008 | A1 |
| 20080267144 | Jano et al. | Oct 2008 | A1 |
| 20080295177 | Dettinger et al. | Nov 2008 | A1 |
| 20100005165 | Sinclair et al. | Jan 2010 | A1 |
| 20100125897 | Jain | May 2010 | A1 |
| 20100228614 | Zhang et al. | Sep 2010 | A1 |
| 20120110681 | Kwong | May 2012 | A1 |
| 20130331101 | Thomas et al. | Dec 2013 | A1 |
| 20140075496 | Prakash | Mar 2014 | A1 |
| 20140164761 | Kufluk | Jun 2014 | A1 |
| Number | Date | Country |
|---|---|---|
| 0658837 | Jun 1995 | EP |
| 0748095 | Dec 1996 | EP |
| 1278330 | Jan 2003 | EP |
| 1280040 | Jan 2003 | EP |
| 1318468 | Jun 2003 | EP |
| 1329117 | Jul 2003 | EP |
| 1457885 | Sep 2004 | EP |
| 1494409 | Jan 2005 | EP |
| 1510945 | Mar 2005 | EP |
| 2811494 | Jan 2002 | FR |
| 2418330 | Mar 2006 | GB |
| 10243018 | Sep 1998 | JP |
| 2000235540 | Aug 2000 | JP |
| 2002358253 | Dec 2002 | JP |
| 2003050758 | Feb 2003 | JP |
| 2004013258 | Jan 2004 | JP |
| WO-92019054 | Oct 1992 | WO |
| WO-96005549 | Feb 1996 | WO |
| WO-96042041 | Dec 1996 | WO |
| WO-01033371 | May 2001 | WO |
| WO-01055873 | Aug 2001 | WO |
| WO-01063835 | Aug 2001 | WO |
| WO-2005017708 | Feb 2005 | WO |
| WO-2006027590 | Mar 2006 | WO |
| WO-2006062546 | Jun 2006 | WO |
| WO-2006136605 | Dec 2006 | WO |
| Entry |
|---|
| “U.S. Appl. No. 13/724,990, Advisory Action dated Feb. 20, 2015”, 3 pgs. |
| “U.S. Appl. No. 13/724,990, Examiner Interview Summary dated Jan. 27, 2015”, 4 pgs. |
| “U.S. Appl. No. 13/724,990, Examiner Interview Summary dated Jul 22, 2014”, 4 pgs. |
| “U.S. Appl. No. 13/724,990, Final Office Action dated Nov. 21, 2014”, 16 pgs. |
| “U.S. Appl. No. 13/724,990, Non Final Office Action dated Jun. 5, 2014”, 14 pgs. |
| “U.S. Appl. No. 13/724,990, Notice of Allowance dated Apr. 22, 2015”, 8 pgs. |
| “U.S. Appl. No. 13/724,990, Response filed Feb. 5, 2015 to Final Office Action dated Nov. 21, 2014”, 16 pgs. |
| “U.S. Appl. No. 13/724,990, Response filed Mar. 20, 2015 to Advisory Action dated Feb. 20, 2015”, 15 pgs. |
| “U.S. Appl. No. 13/724,990, Response filed Aug. 5, 2014 to Non Final Office Action dated Jun. 5, 2014”, 16 pgs. |
| “Bloom Filter—Wikipedia, the free encyclopedia”, Internet Citation, [Online]. Retrieved from the Internet: <http://en.wikipedia.org/wiki/Bloom_filter>, (Mar. 1, 2009), 10 pgs. |
| “E-security begins with sound security policies”, Symantec Corporation, Announcement Symantec, XP002265695, (Jun. 14, 2001), 1,9. |
| “European Application Serial No. 00907078.0, Supplementary European Search Report dated May 18, 2004”, 5 pgs. |
| “European Application Serial No. 02258462.7, European Search Report dated Jan. 30, 2006”, 3 pgs. |
| “Google + StopBadward.org=Internet Gestapo?”, [Online] Retrieved from the Internet : <http:I/misterpoll.wordpress.com/2007/01/05/googlestopbadwareorg-internet-gestapo/>, (Jan. 5, 2007), 19 pgs. |
| “International Application Serial No. PCT/US2006/049149, International Search Report dated Mar. 10, 2008”, 3 pgs. |
| “International Application Serial No. PCT/US2007/024557, International Search Report dated Jun. 20, 2008”, 3 pgs. |
| “International Application Serial No. PCT/US2007/024557, Written Opinion dated Jun. 30, 2008”, 5 pgs. |
| “International Application Serial No. PCT/US2010/035992, International Search Report dated Aug. 11, 2010”, 4 pgs. |
| “Mean to Protect System from Virus”, IBM Technical Disclosure Bulletin, vol. 37 No. 08, Aug. 1994, (Aug. 1, 1994), 659-660. |
| Snyder, J, “A Flurry of Firewalls”, Network World, [Online] Retrieved from the Internet : <www.opus1.com/www/jms/nw-firewall.html>, (Jan. 29, 1996), 1-8. |
| Tue, Erica George, “Google launches new anti-badware API”, [Online] Retrieved from the Internet : <http:l/blog.stopbadware.org//2007/06/19/google-launches-new-anti-badware-api>, (Jun. 19, 2007), 1 pg. |
| Wang, et al., “MBF: a Real Matrix Bloom Filter Representation Method on Dynamic Set”, 2007 IFIP International Conference on Network and Parallel Computing-Workshops Piscataway, (Sep. 18, 2007), 733-736. |
| Williams, R, et al., “Data Integrity with Veracity”, [Online]. Retrieved from the Internet: <URL: ftp://ftp.rocksoft.com/clients/rocksoft/papers/vercty1 O.ps>,. (Sep. 12, 1994), 13 pgs. |
| Wobus, J, “DHCP FAQ”, [Online] Retrieved from the Internet : <www.nd.edu/-milind/FAQs/FAQ_dhcp>, (Dec. 29, 1995), 11 pgs. |
| Yialelis, et al., “Role-Based Security for Distributed Object Systems”, Proceedings of the IEEE Fifty Workshops on Enabling Technology: Infrastructure for Collaborative Enterprises (WET ICE '96), (Jun. 19-21, 1996), 6 pgs. |
| “International Application Serial No. PCT/US2007/015730, International Search Report dated Dec. 27, 2007”, 3 pgs. |
| “International Application Serial No. PCT/US2007/015730, Written Opinion dated Dec. 27, 2007”, 5 pgs. |
| Gittler, F, et al., “The DCE Security Service”, Hewlett-Packard Journal, (Dec. 1995), 41-48. |
| “Microsoft Press Computer Dictionary”, 3rd ed., Microsoft Press, (1997), 4 pgs. |
| “Parental Control White Paper”, Internet Citation, [Online]. Retrieved from the Internet: http://www.planetweb.com/products/web/pcwhitepaper. html [retrieved on Mar. 18, 2004], (Aug. 2001), 5 pgs. |
| “Sequel and Surfwatch Partner to Provide Innovative Internet Resource Management Tools for Large Enterprises”, Sequel Technology, Inc, Internet, (Feb. 25, 1999), 5 pgs. |
| “SmartFilter™ Web Tool”, Secure Computing Corporation, (Dec. 1, 1998), 1-2. |
| “SurfWatch® Professional Edition: Product Overview”, SurfWatch Software Internet, [Online]. Retrieved from the Internet: <URL: http://web.archive.org/web/20000831014300/http://www1.surfwatch.com/products/server/pro.pdf>, (May 26, 1999), 1 pg. |
| “Trends in Badware”, [Online] Retrieved from the Internet : <StopBadware.org>, (2007), 12 pgs. |
| Cohen, F, “A Cryptographic Checksum for Integrity Protection”, vol. 6, Issue 6 Amsterdam, NL, (Dec. 1, 1987), 505-510. |
| Forte, M, et al., “A content classification and filtering server for the Internet”, Applied Computing 2006. 21st Annual ACM Symposium on Applied Computing, [Online] Retrieved from the Internet : <http://portal.acm.org/citation.cfm?id=11415538&coll=portal&di=ACM&CFID=21818288&CFTOKEN=6882 7537> [retrieved on Dec. 7, 2007], (2006), 1166-1171. |
| Hubbard, Dan, “Websense Security Labs”, The Web Vector: Exploiting Human and Browser Vulnerabilities, Toorcon, [Online] Retrieved from the Internet : <http://www.toorcon.org>, (2005), 26 pgs. |
| Molitor, Andrew, “An Architecture for Advanced Packet Filtering”, Proceedings of the Fifth USENIX UNIX Security Symposium, (Jun. 1995), 1-11. |
| Newman, H, “A Look at Some Popular Filtering Systems”, Internet, (Jul. 25, 1999), 1-11. |
| Roberts-Witt, S, “The 1999 Utility Guide: Corporate Filtering”, PC Magazine, [Online] retrieved from the internet: <http ://web.archive.org/web/19990508205337 /http:l/www.zdnet.comt/pcmag/features/utilities99/corpfilter01.html, (Apr. 5, 1999), 1-11. |
| Sandhu, R, et al., “Access Control: Principles and Practice”, Journal of IEEE Communications Magazine, vol. 32 (9), (Sep. 1994), 40-48. |
| Schuba, C L, et al., “Countering abuse of name-based authentication”, In 22nd Annual Telecommunications Policy Research Conference, (1996), 21 pgs. |
| Number | Date | Country | |
|---|---|---|---|
| 20160087984 A1 | Mar 2016 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13724990 | Dec 2012 | US |
| Child | 14834220 | US |
