Abstract: A method and apparatus providing improved set membership determination and group membership identification of candidate data elements using a single Bloom filter programmed to provide a plurality of non-zero f-bit binary vectors, where each of the f-bit binary vectors is associated with a respective group. The Bloom filter is programmed using one or more (but not all) of a plurality of hash filter sets.

Abstract: A method of forming a semiconductor structure is provided. First, a target layer and a mask layer are sequentially formed on a substrate. Thereafter, a first pattern transfer layer having a plurality of openings is formed on the mask layer. Afterwards, a second pattern transfer layer is formed in the openings of the first pattern transfer layer. The mask layer is then patterned, using the first pattern transfer layer and the second pattern transfer layer as a mask, so as to form a patterned mask layer. Further, the target layer is patterned using the patterned mask layer.

Abstract: A method and apparatus for improved inter-domain routing convergence, include transmitting reason information associated with a route update or withdraw. An apparatus receiving the reason information associated with the update or withdraw uses the reason information to determine which of its candidate routes are also affected by substantially the same event that triggered the initial route update or withdraw and which of its candidate routes are not affected. For example, a candidate route may be considered to be transient if the apparatus receiving the reason information determines from the received reason information that a candidate route is going to be updated or withdrawn in the near future due. A candidate route considered as a transient route is avoided being advertised as a preferred route.

Abstract: In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed by hashing a candidate prefix value to generate a plurality of hash values, where m seed hash values are generated by applying m seed hash functions and one or more additional hash values are generated by combining two or more of the seed hash values in different ways, e.g., using a bit-wise XOR function. The hash values are used to perform membership probes into a Bloom filter programmed with the prefixes corresponding to all of the different prefix lengths in the routing table without having to expand any of the prefixes programmed into the Bloom filter.

Abstract: In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed using a Bloom filter that was programmed with the prefixes corresponding to all of the different prefix lengths without having to expand any of the prefixes programmed into the Bloom filter. Membership probes are performed into the Bloom filter using candidate prefix values of a given network address. The Bloom filter can be implemented in a distributed manner using Bloom sub-filters, where each Bloom sub-filter is hashed based on a set of hash functions, where each different hash function in the set corresponds to a different prefix length in the routing table. Each Bloom sub-filter can in turn be implemented using a plurality of practically realizable multi-port memory devices controlled by a port scheduler. False-positive matches can be detected and next-hop information for true-positive matches retrieved using an off-chip, hash-based prefix table.

Abstract: The invention includes a method and apparatus for generating a coincidence count table adapted for determining at least one flow statistic. The method includes receiving a plurality of packets comprising a respective plurality of payloads, comparing payloads associated with consecutive ones of the plurality of packets for identifying at least one simple pattern included within the compared payloads of the consecutive ones of the plurality of packets, for each of the consecutive ones of the plurality of packets, if the at least one simple pattern is identified, processing the at least one simple pattern to form a complex pattern, and for each complex pattern, updating a coincidence count associated with the complex pattern, wherein the coincidence counts are adapted for determining at least one flow statistic.

Abstract: A method and system for generating a bloom filter by mapping into respective groups each of a plurality of initial keys according to a first hash function and mapping each group hashed key into a bloom filter using k respective hash functions.

Abstract: A method of estimating per-flow traffic in a network of nodes interconnected by links splits the incoming traffic stream to a node into a number of parallel sub-streams by flow assignment using a hash function. Since each flow in the incoming traffic stream constitutes a larger fraction of the traffic in its sub-stream, the probability of obtaining two-runs increases. The number of two-runs per flow is then employed to generate an estimate of the traffic of the flow.

Abstract: An “always-on” network and associated systems enable customers to compare and select products and services offered by one or more providers faster than previously thought possible. In addition, communication connections may be established between customers and providers in real-time.

Abstract: A network comprises agents which act as proxies on behalf of devices, such as wireless game devices, phones and personal digital assistants. Each agent collects information concerning a “presence status” of a device. An agent determines whether to forward messages on to a device depending on the collected presence status (e.g., active/inactive) of the device. For example, if the presence status indicates the device is active then messages will be forwarded. If, however, the status indicates the device is inactive the message will not be forwarded. Instead, the agent may act as a proxy for the device while it is inactive. By only forwarding messages when a device is active, valuable airlink time and/or bandwidth can be conserved.

Abstract: Intuitive indicators are presented to the user of a communications device in order to reduce the time it takes the user to launch an application and carry out a communication session, such as an on-line game. Each indicator may be updated by an agent that acts as a proxy for the device even when the device is inactive. Some examples of the indicators presented are: those individuals presently available to play a specific game with the user; the games that are played most often by the user; and those individuals that the user plays games with most often.

Abstract: Components of an “always-on” network exchange messages to, among other things, allow an agent to monitor the “presence status” of an associated user. By monitoring the presence status of the user, the agent may act as a proxy for the user when the user becomes inactive.

Abstract: Sessions, such as on-line gaming sessions, are maintained by proxy agents on behalf of users even when the users are inactive. The agents, along with other components, form a novel “always-on” architecture that greatly reduces the time it takes to initiate and carry out sessions.

Abstract: The invention includes a method and apparatus for determining a coincidence count associated with a traffic flow in a network. The method includes receiving a first packet having a first flow identifier associated with one of the traffic flows, comparing the first flow identifier of the first packet to each of a plurality of other flow identifiers associated with a respective plurality of other packets, and determining a coincidence count associated with the first flow identifier based on the comparison of the first flow identifier to each of the plurality of other flow identifiers. The method for determining a coincidence count associated with one of a plurality of traffic flows may be extended for determining respective coincidence counts associated with a plurality of traffic flows. The determined coincidence counts may be used for determining at least one traffic flow statistic.

Abstract: The invention includes a method and apparatus for generating a coincidence count table adapted for determining at least one flow statistic. The method includes receiving a plurality of packets comprising a respective plurality of payloads, comparing payloads associated with consecutive ones of the plurality of packets for identifying at least one simple pattern included within the compared payloads of the consecutive ones of the plurality of packets, for each of the consecutive ones of the plurality of packets, if the at least one simple pattern is identified, processing the at least one simple pattern to form a complex pattern, and for each complex pattern, updating a coincidence count associated with the complex pattern, wherein the coincidence counts are adapted for determining at least one flow statistic.

Abstract: A method for measuring flow is disclosed. The method includes receiving an IP packet; determining if another IP packet is stored in a register; if another IP packet is stored in the register, comparing the stored IP packet with the received IP packet; and determining the longest match between the stored IP packet and the received IP packet.

Abstract: Congestion in connection-oriented data networks is alleviated by simulating the rerouting of circuits to uncongested parts of the network and then rerouting such circuits in a manner that causes little, or no, disruption to other parts of the network.

Abstract: A transient notification system is described. In one implementation, a Border Gateway Protocol (BGP) speaker receives a transience notification message identifying a route in a network that is no longer valid. The BGP speaker marks the route indicated by the transient notification message as not valid, and avoids using the route for transferring data to a destination. The transient notification message is forwarded faster than standard route advertisement messages.

Abstract: A method of estimating per-flow traffic in a network of nodes interconnected by links splits the incoming traffic stream to a node into a number of parallel sub-streams by flow assignment using a hash function. Since each flow in the incoming traffic stream constitutes a larger fraction of the traffic in its sub-stream, the probability of obtaining two-runs increases. The number of two-runs per flow is then employed to generate an estimate of the traffic of the flow.

Abstract: A keyboard controller (KBC) updating process in a computer system is provided in the present invention. The process provides KBC data and a KBC flash utility to be combined and embedded into a basic input/output system read-only memory (BIOS ROM). The BIOS checks the versions of the KBC data embedded in the BIOS ROM and the KBC in the system. If the version of the embedded KBC is newer than the version of the KBC in the system, a KBC flashing process is performed during a POST of the system.