Patent application number | Description | Published |
20080301808 | INTERNET ROBOT DETECTION FOR NETWORK DISTRIBUTABLE MARKUP - Embodiments of the present invention provide a method, system and computer program product for bot detection for network distributable markup. In accordance with an embodiment of the present invention, a page request for distributed markup can be processed to incorporate embedded fragment within the requested page. For instance, the fragment can include a script enabled to detect human activity within the requested page such as a mouse movement. Alternatively, the fragment can include an extraneous markup artifact. The requested page subsequently can be returned to the requestor and the embedded fragment can be monitored to detect the presence of a bot depending upon the activation of the artifact. For example, where human activity can be detected within the page or where the extraneous markup artifact becomes activated despite the extraneous nature of the artifact, a human requestor can be concluded. However, where no human activity is detected in the requested page, or where the extraneous markup artifact remains unactivated, a bot requestor can be determined. | 12-04-2008 |
20090055274 | METHOD AND APPARATUS FOR DISTRIBUTED APPLICATION EXECUTION - This invention provides methods and apparatus for executing applications in a distributed manner employing one or more proxy servers and one origin server. The invention allows the applications to be executed primarily at the proxy servers rather than at the origin servers, thereby gaining in scalability and improved user response time. A redirection mechanism is used to direct requests to one of the proxy servers. The proxy server uses caching techniques to bring information records needed for application execution to the proxy servers. The code required for application execution is also obtained from the origin server. The invention discusses applying this technique to three Web-based applications, namely Web-based auctions, generating personalized content for Web-users, and creating advertisements for users accessing a Web page. | 02-26-2009 |
20110078290 | ENERGY-EFFICIENT SERVER LOCATION DETERMINATION FOR CONFIGURATION CHANGES - At a data center controller, a first server location is determined from a set of available server locations at which to change a server active state for a data center. A time and configuration change for the data center are forecasted. A second server location is determined from the set of available server locations at which to change the server active state based upon the forecasted configuration change for the data center. An available server location is selected at which to change the server active state based upon the first server location, the second server location, and the forecasted time associated with the forecasted configuration change for the data center. | 03-31-2011 |
20110078480 | ENERGY-EFFICIENT SERVER LOCATION DETERMINATION - A heat potential value for each of a set of available server locations is calculated via a data center controller based upon at least one active server in a data center. A minimal calculated heat potential value for the set of available server locations is identified. An available server location associated with the identified minimal calculated heat potential value is selected from the set of available server locations. | 03-31-2011 |
20120272075 | ENERGY-EFFICIENT SERVER LOCATION DETERMINATION - A heat potential value for each of a set of available server locations is calculated via a data center controller based upon at least one active server in a data center. A minimal calculated heat potential value for the set of available server locations is identified. An available server location associated with the identified minimal calculated heat potential value is selected from the set of available server locations. A maximal calculated heat potential value is identified for the set of available server locations. An available server location associated with the identified maximal calculated heat potential value is selected from the set of available server locations. A server located at the selected available server location associated with the identified maximal calculated heat potential value is automatically de-energized. | 10-25-2012 |
20130054658 | VIRTUAL FILE DIRECTORY SERVICES FOR MOBILE DEVICES - Establishing virtual file directory services by receiving a notification from a first device in a first zone is that the first device is sharing a resource. Information about the shared resource is stored in an index. The stored information indicates that the resource is available from the device. As the device enters a second zone the stored information is transmitted to the second zone from the first zone. | 02-28-2013 |
20130054691 | FLEXIBLE RULE BASED MULTI-PROTOCOL PEER-TO-PEER CACHING - Flexible rule based multi-protocol peer-to-peer caching in a wireless environment. A request is received from a requestor for a file from one of a plurality of peer-to-peer networks. The peer-to-peer network the request is directed to is determined in response to receiving the request. Using a generic rule structure, the file that is requested from the peer-to-peer network is identified. The generic rule structure is compatible with all of the plurality of peer-to-peer networks. If the file is stored in a cache it is retrieved from the cache and is transmitted to the requestor. | 02-28-2013 |
20130054831 | REDIRECTING FILE TRAFFIC FROM A CORE SERVER TO THE NETWORK EDGE - File traffic redirection from a core server to a network edge. A request for a file from a target system is received from one or more requestors in direct communication with the computer. The request includes a host name of the target system. If the host name is not locally resolvable, requesting a resolution of the host name from a domain name resolution process external to the computer. An Internet protocol address of the target system is received from the domain name resolution process, and all subsequent file requests by any of the one or more requestors for files from the target system are routed directly to the target system without accessing a core network. | 02-28-2013 |
20140059190 | DYNAMIC MIDDLEBOX REDIRECTION BASED ON CLIENT CHARACTERISTICS - Traffic redirection methods include determining a quality-affective factor in a connection between a client and a server in a network; comparing the quality-affective factor to a threshold to determine whether the connection would benefit from a network processing function; reconfiguring the network to redirect the connection to or away from a middlebox that performs the network processing function in accordance with the determination of whether the connection would benefit from the network processing function. | 02-27-2014 |
20140059191 | DYNAMIC MIDDLEBOX REDIRECTION BASED ON CLIENT CHARACTERISTICS - Dynamic middleboxes include a network monitor module configured to determine a quality-affective factor in a connection between a client and a server in a network; a processor configured to compare the quality-affective factor to a threshold to determine whether the connection would benefit from a network processing function; and a network control module configured to reconfigure the network to redirect the connection to a middlebox that performs the network processing function if the connection would benefit and further configured to reconfigure the network to exclude the middlebox from the connection if the connection would not benefit. | 02-27-2014 |
20140164321 | PROACTIVE DATA OBJECT REPLICATION IN NAMED DATA NETWORKS - The present disclosure relates generally to the field of proactive data object replication in named data networks. In various examples, proactive data object replication may be implemented in one or more named data networks in the form of systems, methods and/or algorithms. | 06-12-2014 |
20140164328 | PROACTIVE DATA OBJECT REPLICATION IN NAMED DATA NETWORKS - The present disclosure relates generally to the field of proactive data object replication in named data networks. In various examples, proactive data object replication may be implemented in one or more named data networks in the form of systems, methods and/or algorithms. | 06-12-2014 |
20140207903 | SYSTEMS, METHODS AND ALGORITHMS FOR LOGICAL MOVEMENT OF DATA OBJECTS - The present disclosure relates generally to the field of logical movement of data objects. In various examples, the logical movement of data objects may reduce or eliminate network hotspots (e.g., avoid formation of hotspots, remove existing hotspots and/or reduce the magnitude of hotspots). In various examples, the logical movement of data objects may be implemented in the form of systems, methods and/or algorithms. | 07-24-2014 |
20140207954 | SYSTEMS, METHODS AND ALGORITHMS FOR LOGICAL MOVEMENT OF DATA OBJECTS - The present disclosure relates generally to the field of logical movement of data objects. In various examples, the logical movement of data objects may reduce or eliminate network hotspots (e.g., avoid formation of hotspots, remove existing hotspots and/or reduce the magnitude of hotspots). In various examples, the logical movement of data objects may be implemented in the form of systems, methods and/or algorithms. | 07-24-2014 |
20140250489 | Techniques for Policy Aware Service Composition - Techniques for policy-aware service composition are provided. In one aspect, a method for creating a policy-compliant service composition is provided. The method includes the following steps. One or more policy rules related to services in the service composition are created. A service composition graph is created that represents the service composition, wherein vertices of the service composition graph represent the services and directional edges of the service composition graph represent potential flows of data between the vertices. During creation of the service composition graph, it is determined whether one or more candidate services comply with the policy rules. Only those of the candidate services that comply with the policy rules are included in the service composition graph, wherein the services included in the service composition graph comprise policy-compliant services, such that the service composition graph comprises only the policy-compliant services. | 09-04-2014 |
20140280470 | MIGRATION OF NETWORK CONNECTION UNDER MOBILITY - The present disclosure relates generally to the field of migration (e.g., seamless migration) of a network connection under mobility (e.g., host mobility). In various examples, migration (e.g., seamless migration) of a network connection under mobility (e.g., host mobility) may be implemented in the form of systems, methods and/or algorithms. | 09-18-2014 |
20140280768 | MIGRATION OF NETWORK CONNECTION UNDER MOBILITY - The present disclosure relates generally to the field of migration (e.g., seamless migration) of a network connection under mobility (e.g., host mobility). In various examples, migration (e.g., seamless migration) of a network connection under mobility (e.g., host mobility) may be implemented in the form of methods and/or algorithms. | 09-18-2014 |
20140328342 | Privacy Preserving Query Method and System for Use in Federated Coalition Networks - In at least one embodiment, a method and a system include a node potentially having information responsive to an information request distributed into, for example, a federated coalition network where the node receives at least one information request packet, conducts a search of information at the node to determine if requested information is present, when the requested information is present, then the node sends an acknowledgement to a requesting node, linear network codes the requested information into m packets where m is greater than or equal to k, which is the number of packets needed to be received by the requesting node to reconstruct the requested information, selects multiple paths between the node and the requesting node such that no third party will see more than k−1 different packets, and transmits the m packets distributed over the selected paths. In a further embodiment, the method and system include operation of the network to have the capability to provide responsive information in a protected way. | 11-06-2014 |
20150046452 | GEOTAGGING UNSTRUCTURED TEXT - Mechanisms are described to extract location information from unstructured text, comprising: building a language model from geo-tagged text; building a classifier for differentiating referred and physical location; given unstructured text, identifying referred location using the language model (that is, the location to which the unstructured text refers); given the unstructured text, identifying if referred location is also the physical location using the classifier; and predicting (that is, performing calculation(s) and/or estimation(s) of degree of confidence) of referred and physical location. | 02-12-2015 |