Abstract: Techniques for performing query-dependent and content-class (e.g., with product class as a subset, in which content class can be based on a product class in an example implementation) based ranking are disclosed in accordance with some embodiments. In some embodiments, a process for performing query-dependent and content-class based ranking includes receiving a query for a search for content on a web site; performing a query-dependent and content-class based ranking of content available on the web site (e.g., using a processor); and returning a ranked list of content based at least in part on the query-dependent and content-class based ranking of content available on the web site in response to the query.

Abstract: Techniques for performing query-dependent and content-class (e.g., with product class as a subset, in which content class can be based on a product class in an example implementation) based ranking are disclosed in accordance with some embodiments. In some embodiments, a process for performing query-dependent and content-class based ranking includes receiving a query for a search for content on a web site; performing a query-dependent and content-class based ranking of content available on the web site (e.g., using a processor); and returning a ranked list of content based at least in part on the query-dependent and content-class based ranking of content available on the web site in response to the query.

Abstract: Techniques for performing query-dependent and content-class (e.g., with product class as a subset, in which content class can be based on a product class in an example implementation) based ranking are disclosed in accordance with some embodiments. In some embodiments, a process for performing query-dependent and content-class based ranking includes receiving a query for a search for content on a web site; performing a query-dependent and content-class based ranking of content available on the web site (e.g., using a processor); and returning a ranked list of content based at least in part on the query-dependent and content-class based ranking of content available on the web site in response to the query.

Abstract: A technique for mitigating excessive operations attacks in a wireless communication network includes receiving message requests from stations, detecting an excessive operation attack, checking if a received request is a first request or a retry request, and ignoring any first requests. The method can also include saving information about the first request, and wherein if checking reveals that the received request is a retry request, the method further confirms that the retry request and the saved information about the first request meet matching conditions, whereupon the retry request is further processed as normal. Since attacks rarely utilize retry requests, this technique effectively ignores attack messages.

Abstract: A technique for mitigating excessive operations attacks in a wireless communication network includes receiving message requests from stations, detecting an excessive operation attack, checking if a received request is a first request or a retry request, and ignoring any first requests. The method can also include saving information about the first request, and wherein if checking reveals that the received request is a retry request, the method further confirms that the retry request and the saved information about the first request meet matching conditions, whereupon the retry request is further processed as normal. Since attacks rarely utilize retry requests, this technique effectively ignores attack messages.

Abstract: A method and device enables detecting a spoofing attack in a wireless communication network (100). The method includes receiving at the primary access point (105) a beacon signal transmitted from an alternative access point (115), where the beacon signal includes an alternative access point identification. The primary access point (105) then compares the alternative access point identification with an actual identification of the primary access point (105). It is then determined at the primary access point that the alternative access point (115) is conducting a spoofing attack if the alternative access point identification matches the actual identification of the primary access point (105).

Abstract: An improvement in the compilation of classification tables from across control lists increases the efficiency of memory utilization by fragments in the lower level tables and using the classification ID's from a pair of higher-level tables as pointers to the fragments and as indicators of the depth of the entries in the fragments. A further improvement makes use of aggregate bit vectors, thereby simplifying construction of the lower-level tables. The bit-vector sections preferably coincide with the cache lines of the processing, thereby maximizing the speed with which the relevant bits in the bit vector can be identified from the aggregate bit vectors.

Abstract: A technique that simplifies managing and configuring firewalls by provisioning a vendor-neutral firewall in an MPLS-VPN service network. In one example embodiment, this is accomplished by creating a vendor-neutral firewall policy using a service activation tool residing in a host server. One of the one or more VPNs requiring the provisioning of the vendor-neutral firewall in the MPLS-VPN service network is then selected. The created vendor-neutral firewall policy is then transformed to form a vendor-specific firewall policy associated with the selected one of the one or more VPNs.

Abstract: An improvement in the compilation of classification tables from across control lists increases the efficiency of memory utilization by fragments in the lower level tables and using the classification ID's from a pair of higher-level tables as pointers to the fragments and as indicators of the depth of the entries in the fragments. A further improvement makes use of aggregate bit vectors, thereby simplifying construction of the lower-level tables. The bit-vector sections preferably coincide with the cache lines of the processing, thereby maximizing the speed with which the relevant bits in the bit vector can be identified from the aggregate bit vectors.