Abstract: Techniques for search with autosuggest and refinements are disclosed. In some embodiments, search with autosuggest includes determining a plurality of potential query suggestions for a partially entered query string; and automatically suggesting a plurality of queries based on a query count for each of the queries. For example, the query count can correspond to a popularity of the query. In some implementations, the query count can be determined based on a number of times that the query was received, and the plurality of queries can be listed based on the popularity of each of the plurality of queries (e.g., to facilitate display of more popular queries higher in the list of suggested queries).

Abstract: Techniques for search with more like this refinements are disclosed. In some embodiments, search with more like this refinements includes receiving a product and a context (e.g., the context can include related category information, user context, and/or other context related information); generating a search query based on the product and the context; and determining a plurality of products that match the search query to generate more like this search results.

Abstract: Techniques for providing dynamic categories are disclosed. In some embodiments, a system for providing dynamic categories includes receiving user context data, and dynamically determining a plurality of categories for the user based on the user context data, in which the plurality of categories are for categorizing content on a web site. For example, the user context data can be based on monitored user behavior on a web site, and one or more of the plurality of categories can include a synthesized category on the web site that is dynamically generated based on the monitored user behavior on the web site.

Abstract: Techniques for search with autosuggest and refinements are disclosed. In some embodiments, search with autosuggest includes determining a plurality of potential query suggestions for a partially entered query string; and automatically suggesting a plurality of queries based on a query count for each of the queries. For example, the query count can correspond to a popularity of the query. In some implementations, the query count can be determined based on a number of times that the query was received, and the plurality of queries can be listed based on the popularity of each of the plurality of queries (e.g., to facilitate display of more popular queries higher in the list of suggested queries).

Abstract: The present invention pertains to the allocation of bandwidth on a global large scale network. Systems and methods are provided to base bandwidth allocation on the predicted bandwidth demands of the network users. In allocating bandwidth, each user is assigned a user weight value, and is to be allocated bandwidth in proportion to that value. In addition, the bandwidth allocation is enforced so as to ensure that bandwidth allocation policies are maintained.

Abstract: Techniques for search with autosuggest and refinements are disclosed. In some embodiments, search with autosuggest includes determining a plurality of potential query suggestions for a partially entered query string; and automatically suggesting a plurality of queries based on a query count for each of the queries. For example, the query count can correspond to a popularity of the query. In some implementations, the query count can be determined based on a number of times that the query was received, and the plurality of queries can be listed based on the popularity of each of the plurality of queries (e.g., to facilitate display of more popular queries higher in the list of suggested queries).

Abstract: Techniques for cross platform user joining are disclosed. In some embodiments, cross platform user joining includes associating a first user identification (UID) and a second UID with one or more Internet Protocol addresses (IPs); associating the first UID and the second UID with one or more monitored behaviors; and joining the first UID and the second UID based on the one or more IPs and the one or more monitored behaviors.

Abstract: Techniques for cross platform user joining are disclosed. In some embodiments, cross platform user joining includes associating a first user identification (UID) and a second UID with one or more Internet Protocol addresses (IPs); associating the first UID and the second UID with one or more monitored behaviors; and joining the first UID and the second UID based on the one or more IPs and the one or more monitored behaviors.

Abstract: A system and method are provided that allocate bandwidth on a global large scale network. Bandwidth allocation is based on the predicted bandwidth demands of the network users. Each user may be assigned one of a plurality of different values that determines the amount of bandwidth allocated to that user. In instances where an application runs on behalf of a plurality of remote clients, a system and method is provided that allows for the allocation of bandwidth based each individual remote client.

Abstract: Techniques for search with more like this refinements are disclosed. In some embodiments, search with more like this refinements includes receiving a product and a context (e.g., the context can include related category information, user context, and/or other context related information); generating a search query based on the product and the context; and determining a plurality of products that match the search query to generate more like this search results.

Abstract: Techniques for search with autosuggest and refinements are disclosed. In some embodiments, search with autosuggest includes determining a plurality of potential query suggestions for a partially entered query string; and automatically suggesting a plurality of queries based on a query count for each of the queries. For example, the query count can correspond to a popularity of the query. In some implementations, the query count can be determined based on a number of times that the query was received, and the plurality of queries can be listed based on the popularity of each of the plurality of queries (e.g., to facilitate display of more popular queries higher in the list of suggested queries).

Abstract: Techniques for search with more like this refinements are disclosed. In some embodiments, search with more like this refinements includes receiving a product and a context (e.g., the context can include related category information, user context, and/or other context related information); generating a search query based on the product and the context; and determining a plurality of products that match the search query to generate more like this search results.

Abstract: Techniques for search with autosuggest and refinements are disclosed. In some embodiments, search with autosuggest includes determining a plurality of potential query suggestions for a partially entered query string; and automatically suggesting a plurality of queries based on a query count for each of the queries. For example, the query count can correspond to a popularity of the query. In some implementations, the query count can be determined based on a number of times that the query was received, and the plurality of queries can be listed based on the popularity of each of the plurality of queries (e.g., to facilitate display of more popular queries higher in the list of suggested queries).

Abstract: The present invention pertains to the allocation of bandwidth on a global large scale network. Systems and methods are provided to base bandwidth allocation on the predicted bandwidth demands of the network users. In allocating bandwidth, each user is assigned a user weight value, and is to be allocated bandwidth in proportion to that value. In addition, the bandwidth allocation is enforced so as to ensure that bandwidth allocation policies are maintained.

Abstract: The present invention pertains to the allocation of bandwidth on a global large scale network. Systems and methods are provided to base bandwidth allocation on the predicted bandwidth demands of the network users. In allocating bandwidth, each user is assigned a user weight value, and is to be allocated bandwidth in proportion to that value. In addition, the bandwidth allocation is enforced so as to ensure that bandwidth allocation policies are maintained.

Abstract: Systems and methods are described herein for validating operation of a centrally managed network. A central controller is configured to manage a network, and an emulator configured to emulate one or more nodes in the network is connected to the central controller. The emulator determines a state value for one or more nodes in the network, and the state value represents whether the respective node is in error. The emulator receives a first plurality of policies including instructions for the nodes in the network, and whether the policies are consistent with one another is identified.

Abstract: Techniques for cross platform user joining are disclosed. In some embodiments, cross platform user joining includes associating a first user identification (UID) and a second UID with one or more Internet Protocol addresses (IPs); associating the first UID and the second UID with one or more monitored behaviors; and joining the first UID and the second UID based on the one or more IPs and the one or more monitored behaviors.

Abstract: Embodiments are directed towards managing network routes using a centralized service on behalf of a network of a plurality of forwarding devices. The centralized service develops a global view of the network based on information from the forwarding devices. The centralized service computes changes to the routing policy for each of the nodes. The centralized service then generates an operational command schedule that is distributed to the forwarding devices using a “make before break” sequence to ensure that transient black holes do not happen as the new routing policy is being implemented.

Abstract: Bandwidth is allocated by leveraging a bursty characteristic of data transmission signals to efficiently utilize network resources. Network performance is observed over a time period to identify patterns of data transmission rates as different signals are processed. To compensate for the fact that different jobs/tasks peak at different times, the total bandwidth limit may be increased by a scaling factor. The scaling factor is calculated using information obtained by observing network performance during the time period. The scaling factor is used to increase the total bandwidth available for all jobs/tasks executing during the time period without exceeding any bandwidth limits. The data transmission rate of each job/task may then be adjusted to utilize the newly available bandwidth.

Abstract: The present invention pertains to the allocation of bandwidth on a global large scale network. Systems and methods are provided to base bandwidth allocation on the predicted bandwidth demands of the network users. In allocating bandwidth, each user is assigned a user weight value, and is to be allocated bandwidth in proportion to that value. In addition, the bandwidth allocation is enforced so as to ensure that bandwidth allocation policies are maintained.