Paypal, Inc.

Yahoo! Inc.

Eric Leu

Hongfeng Yin

Hongche Liu

Anand Madhavan

Yaping Shi

Majid Mohazzab

Xuetao Li

There are provided systems and methods for scalable service discover and load balancing using direct client connections to servers. A service provider, such as an electronic transaction processor for digital transactions, may provide different computing services to users through client devices, which utilize server instances from server pools and the like to provide the computing services to users. This may include providing servers to handle client requests and process data with users. When client devices connect to the service provider's system, service discovery may be performed to find an available server instance to handle client requests. To provide scalable service discovery, load balancers may, instead of managing client requests through the load balancers, ping server instances from a server pool to identify a network address of an available server. This may be returned to the client device and a direction connection may be made between the device and server.

Scalable service discovery and load balancing using direct client connections to servers

Techniques are disclosed relating to methods that include initializing, by a computer in a computer system, an event counter that includes a plurality of sub-counter groups, each plurality of sub-counter groups including at least two sub-counters located on different nodes of a plurality of nodes in the computer system. In response to an occurrence of an event associated with the event counter, the method may include the computer selecting a particular sub-counter group of the plurality of sub-counter groups to update, and sending, to sub-counters corresponding to the particular sub-counter group, a request to update a sub-counter value for the particular sub-counter group. In response to a request for a current count value of the event counter, the method may include outputting, by the computer, a sum of the sub-counter values for the plurality of sub-counter groups as the current count value.

Updating counters distributed across a plurality of nodes

This disclosure includes an improvement to hashing methods, which can help achieve faster load balancing of computing resources (e.g., processors, storage systems, web servers or other computer systems, etc.) This improvement may be particularly beneficial when a quantity of the available resources changes. Such hashing methods may include assigning a data object associated with a key to a particular computing resource of the available computing resources by using two auxiliary functions that work together to uniformly distribute data objects across available computing resources and reduce an amount of time to assign the data object to the particular computing resource.

Method for distributing keys using two auxiliary hashing functions

A system for determining associations between base content and relevant content and for publishing the base content and relevant content on a client browser. The system includes a parsing module configured to parse the base content to form parsed base content; a unit-dictionary module including a plurality of query units; a unit-extraction module configured to extract query units included in the unit dictionary from the parsed base content, wherein the query units extracted from the base content are referred to as the extracted-query units; a unit-ranking module configured to rank the extracted-query units based on at least one of relevance scores and revenue-generation amounts for the query units; and a unit-matching module configured to generate at least one association between the base content and the relevant content based on whether the extracted-query units and at least one of query units and keywords associated with the relevant content are the same.

Growing community of inventors

San Jose, CA, United States of America

Eric Leu