195results about How to "Less memory" patented technology

A system and method is disclosed for detecting and / or mitigating an overload condition from one or more first computers, such as a distributed denial of service (DDoS) attack, viral attack, or the like, targeting one or more of a plurality of second computers located on a network. While one or more DDoS attacks are mitigated, a meter, detection apparatus, software, or method, detects the condition being mitigated in a data cleaning center, and provides an alert or notification regarding the mitigated attack.Another preferred embodiment relates, in general terms, to a system and method for detecting and / or mitigating an overload or attempted overload condition targeting a domain name server. A network connection is provided for receiving one or more DNS requests from one or more client computers located on a network. A preferred embodiment includes a processor for providing a response to the one or more DNS requests to the one or more client computers if more than a threshold number of duplicate DNS requests are received.Another preferred embodiment relates, in general terms, to a system and method for detecting and / or mitigating an attempted overload condition targeting a networked computer system that uses a redirection module to divert data until it is deemed to be clean.

Improved method, data structure and computer readable medium for searching for digital information files. Files referenced by URLs may be quickly located by finding a minimum unique prefix for the desired URL, breaking the prefix into substrings, and traversing a trie data structure to find indices to another trie data structure that will yield the physical location of the stored digital information file. A node data structure may be used to construct the trie data structures, and may be compressed to allow the tries to occupy less memory, thus allowing the tries to be maintained in memory and less access to storage devices. The result is faster retrieval times for digital information files.

Methods, systems, and computer-readable media are provided for efficiently evaluation Boolean expressions. According to the method, the Boolean expression is expressed using pre-fix notation. Each element in the pre-fix expression is then parsed. For each first operand for a Boolean operation, the value of the operand is determined. This may include evaluating a GUID. When an operator and a second operand are encountered, a decision is made as to whether the second operand should be evaluated. The determination as to whether the second operand should be evaluated is made based upon the value of the first operand and the type of operator. If the second operand need not be evaluated, no evaluation is performed thereby saving time and memory space. The evaluation of the Boolean expression continues in this manner until the entire expression has been evaluated. If the Boolean expression is evaluated as true, the program module associated with the Boolean expression may be loaded. Otherwise, the program module will not be loaded.

A system and method are provided for separately distributing edge-device labels and routing information across routing areas of a computer network. Because the edge-device labels are distributed separately from network routing information, the process of distributing the edge-device labels does not preclude conventional edge-device address summarizations. Illustratively, a novel “label mapping” LSA is employed for distributing the edge-device labels across routing areas. The label-mapping LSA may be embodied as an area-scope OSPF opaque LSA (type 10) or an IS-IS LSP containing TLVs of area scope. Advantageously, the present invention is generally applicable whenever label values are allocated to edge devices in a multi-area computer network and data is “tunneled” through the network from one edge device to another.

A method and apparatus for creating USB peripheral device report descriptors: A short, compressed, report descriptor is stored in a peripheral device. This short report descriptor is transmitted to a USB wireless bridge and combined with templates stored in the bridge to create a USP report descriptor. Power is saved because less time is required to transmit the short report descriptor than would be required to transmit a full USB report descriptor. Hardware is also saved in the peripheral device since less memory is required to store the short report descriptors as compared to storing a full USB report descriptor.

A computer authentication device comprising a memory containing a long secret or digital signature, portions of which are requested by a server computer or other device. The authentication device evaluates the nature and timing of authentication requests and selectively varies the time delay for responding to such authentication requests. Such selective variation in response times impedes the unauthorized or malicious copying of the authentication device's authentication credentials.

A method of using additional information at a DMB (Digital Multimedia Broadcasting) receiver is provided. The method includes the steps of: extracting and displaying additional information from a DMB signal; selecting and storing a desired one of the displayed additional information; displaying a list of the stored additional information depending on a user's request command; and outputting additional information selected at the list of the additional information.

In accordance with the teachings of the present invention, a method is presented for generating an application-specific XML parser at runtime. Multiple XML schemas are received and used to generate a software generation tool. The software generation tool then produces an application-specific XML parser that can parse XML input files at runtime.

An embedded systems architecture is disclosed which can flexibly handle compression of both instruction code and data.

State machines are used to order and select matching operations for determining whether an input string matches any of at least one regular expression by (1) accepting the set of regular expression(s), and (2) for each of the regular expression(s) of the set accepted, (A) identifying any look-ahead type strings within the given regular expression, (B) identifying any sequential type strings within the given regular expression, (C) partitioning the regular expression based on any identified simple strings, any identified look-ahead type variable strings, and any sequential type variable strings to generate partitioned parts, (D) reordering the partitioned parts of the regular expression using optimization policies to generate reordered partitioned parts, and (E) configuring nodes of a state machine corresponding to the given regular expression. Once configured, the state machines check for a match between the input string accepted and the regular expression using the configured nodes of the state machine.