US20160352823A1 - Systems and methods for server failover and load balancing - Google Patents

Systems and methods for server failover and load balancing Download PDF

Info

Publication number
US20160352823A1
US20160352823A1 US15/166,218 US201615166218A US2016352823A1 US 20160352823 A1 US20160352823 A1 US 20160352823A1 US 201615166218 A US201615166218 A US 201615166218A US 2016352823 A1 US2016352823 A1 US 2016352823A1
Authority
US
United States
Prior art keywords
server
servers
clients
application identifier
client application
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US15/166,218
Other languages
English (en)
Inventor
Vladan Djakovic
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hubbell Inc
Original Assignee
iDevices LLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by iDevices LLC filed Critical iDevices LLC
Priority to US15/166,218 priority Critical patent/US20160352823A1/en
Assigned to iDevices, LLC reassignment iDevices, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: DJAKOVIC, VLADAN
Publication of US20160352823A1 publication Critical patent/US20160352823A1/en
Priority to US16/255,374 priority patent/US10819775B2/en
Priority to US17/073,990 priority patent/US20210037090A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1034—Reaction to server failures by a load balancer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1019—Random or heuristic server selection
    • H04L47/823—
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1023—Server selection for load balancing based on a hash applied to IP addresses or costs
    • H04L67/42—

Definitions

  • the present disclosure relates generally to systems, methods and/or media for use in server failover and/or load balancing. More specifically, the present disclosure relates to systems, methods and/or media for use in server failover and/or load balancing using clients.
  • Backend servers that provide services to clients need to be available at all times. When a particular server fails, a mechanism needs to be in place to route clients to one or more alternate servers.
  • Web services typically utilize a front-end load balancer or router, which sends requests to functioning servers. While fast, the load balancer or router is itself a critical single point of failure and introduces additional costs.
  • a new server could be instantiated and the DNS (domain name system) entry for the service could be changed to point to the new server.
  • DNS domain name system
  • the routing of requests and changing of pointers is performed on the backend side (e.g., on the servers themselves) without client involvement.
  • a system may provide load balancing, server failover, scaling, data localization and/or redundancy.
  • the system may achieve load balancing by uniformly selecting a target server over all servers based on a random client application identifier (CAI).
  • CAI random client application identifier
  • the system may provide failover by selecting appropriate alternate servers.
  • the system (and/or method and/or medium) may achieve scalability by extending system capacity by adding new servers and informing directory services about the new additions.
  • the system (and/or method and/or medium) may provide data localization and redundancy by limiting data replication to the first N servers on the CAI-specific Highest Random Weight (HRW) sorted list.
  • HRW Highest Random Weight
  • the system (and/or method and/or medium) may provide the above features so when two or more clients agree on the same CAI, they will always select the same server or the same subset of servers.
  • the system (and/or method and/or medium) may provide these benefits without any centralized services, bottlenecks, and/or single points of failure on the server side. There is no need for load balancers, third party directory involvement (e.g., DNS), or system-wide data replication.
  • DNS third party directory involvement
  • a system comprises an engine executed by one or more clients to select a target server or server subset among a plurality of servers, using a client application identifier. In some embodiments, two or more clients, using the same client application identifier, select the same target server or server subset.
  • each of the plurality of servers is coupled to the one or more clients and configured to provide one or more service classes, the services classes including application services and directory services.
  • the application services on each server serve only a subset of all client applications.
  • the directory services of each server are configured to provide a list of servers, each server tagged with the application services that server supports.
  • the engine includes a service mapping subsystem configured to map each client application identifier to the target server or server subset.
  • the service mapping subsystem is configured to map said client application identifier using Highest Random Weight.
  • the client application identifier comprises a large number.
  • the engine is executed by a first one of the one or more clients to select a target server or server subset among the plurality of servers using the client application identifier; and the engine is executed by a second one of the one or more clients to select the same target server or server subset among the plurality of servers using the client application identifier.
  • the client application identifier is a large number. In some embodiments, the large number comprises at least 128 bits. In some embodiments, the large number comprises at least 512 bits.
  • the system comprises a computer system that is in electronic communication over a network (or otherwise coupled (via any type(s) of communication link(s))) with one or more clients, the computer system including a plurality of servers, and an engine stored on and/or executed by the one or more clients, the engine configured to permit the one or more client applications to select a target server among the plurality of servers using a client application identifier.
  • the client application identifier is a large number. In some embodiments, the large number comprises at least 128 bits. In some embodiments, the large number comprises at least 512 bits.
  • a method comprises electronically (or otherwise) receiving a directory list with server identities for a plurality of servers, electronically (or otherwise) receiving an application specific directory list using a client application identifier to identify servers with a desired application, applying, by an engine stored on and/or executed by a client, a Highest Random Weight to the application specific directory list to electronically (or otherwise) generate a client application identifier specific sorted list of servers that provide the desired application, and attempting by the client to electronically (or otherwise) contact a server from the client application identifier specific sorted list of servers by starting at the top and working down the list.
  • the client application identifier is a large number.
  • the sorted list may comprise any type(s) of information, in any form(s), that defines an order in which to attempt to contact servers until at least one functioning one of the servers is contacted.
  • the large number comprises at least 128 bits. In some embodiments, the large number comprises at least 512 bits.
  • a method comprises: executing, by one or more clients, an engine to select a target server or server subset among a plurality of servers, using a client application identifier. In some embodiments, two or more clients, using the same client application identifier, select the same target server or server subset.
  • each of the plurality of servers is coupled to the one or more clients and configured to provide one or more service classes, the services classes including application services and directory services.
  • the application services on each server serve only a subset of all client applications.
  • the directory services of each server are configured to provide a list of servers, each server tagged with the application services that server supports.
  • the engine includes a service mapping subsystem configured to map each client application identifier to the target server or server subset.
  • the service mapping subsystem is configured to map said client application identifier using Highest Random Weight.
  • the client application identifier comprises a large number.
  • executing an engine to select a target server or server subset among a plurality of servers, using a client application identifier comprises: executing, by a first one of the one or more clients, an engine to select a target server or server subset among a plurality of servers, using a client application identifier; and executing, by a second one of the one or more clients, the engine to select the target server or server subset among the plurality of servers, using the client application identifier.
  • executing an engine to select a target server or server subset among a plurality of servers, using a client application identifier comprises: receiving, by an engine executed by a client, information indicative of identifies of servers that provide a desired application; and generating, by the engine executed by the client, based at least in part on the information and a client application identifier, a client application identifier specific sorted list of servers that provide the desired application.
  • the sorted list may comprise any type(s) of information, in any form(s), that defines an order in which to attempt to contact servers until at least one functioning one of the servers is contacted.
  • the large number comprises at least 128 bits. In some embodiments, the large number comprises at least 512 bits.
  • a non-transitory computer-readable medium has computer-readable instructions stored thereon that, if executed by a computer system, result in a method comprising: executing, by one or more clients, an engine to select a target server or server subset among a plurality of servers, using a client application identifier. In some embodiments, two or more clients, using the same client application identifier, select the same target server or server subset.
  • each of the plurality of servers is coupled to the one or more clients and configured to provide one or more service classes, the services classes including application services and directory services. In some embodiments, the application services on each server serve only a subset of all client applications.
  • the directory services of each server are configured to provide a list of servers, each server tagged with the application services that server supports.
  • the engine includes a service mapping subsystem configured to map each client application identifier to the target server or server subset.
  • the service mapping subsystem is configured to map said client application identifier using Highest Random Weight.
  • the client application identifier comprises a large number.
  • executing an engine to select a target server or server subset among a plurality of servers, using a client application identifier comprises: executing, by a first one of the one or more clients, an engine to select a target server or server subset among a plurality of servers, using a client application identifier; and executing, by a second one of the one or more clients, the engine to select the target server or server subset among the plurality of servers, using the client application identifier.
  • executing an engine to select a target server or server subset among a plurality of servers, using a client application identifier comprises: receiving, by an engine executed by a client, information indicative of identifies of servers that provide a desired application; and generating, by the engine executed by the client, based at least in part on the information and a client application identifier, a client application identifier specific sorted list of servers that provide the desired application.
  • the sorted list may comprise any type(s) of information, in any form(s), that defines an order in which to attempt to contact servers until at least one functioning one of the servers is contacted.
  • the large number comprises at least 128 bits. In some embodiments, the large number comprises at least 512 bits.
  • FIG. 1 is a diagram showing a server failover and load balancing system, in accordance with some embodiments
  • FIG. 2 is a diagram illustrating subsystems of a failover and load balancing engine, in accordance with some embodiments
  • FIG. 3 is a diagram illustrating a client communicating with a server , in accordance with some embodiments.
  • FIG. 4 is a flowchart of a process, in accordance with some embodiments.
  • FIG. 5 is a diagram showing an architecture, in accordance with some embodiments.
  • FIG. 6 is a graphical representation of a list (or other definition), in accordance with some embodiments.
  • FIG. 7 is a graphical representation of a list (or other definition), in accordance with some embodiments.
  • FIG. 8 is a graphical representation of a list (or other definition), in accordance with some embodiments.
  • FIG. 9 is a graphical representation of a list (or other definition) prior to sorting after hashing, in accordance with some embodiments.
  • FIG. 10 is a graphical representation of a list (or other definition), in accordance with some embodiments.
  • FIG. 11 is a graphical representation of a list (or other definition) prior to sorting after hashing, in accordance with some embodiments.
  • FIG. 12 is a graphical representation of a list (or other definition), in accordance with some embodiments.
  • FIG. 13 is a flowchart of a process, in accordance with some embodiments.
  • the present disclosure relates generally to systems and methods for server failover and/or load balancing. More specifically, the present disclosure utilizes clients , which are more numerous than servers, to address server failover and/or load balancing and/or other tasks. Accordingly, the server system is simplified as the server system is not responsible for providing uninterrupted service to clients. Instead, each client is in charge of finding a functioning server. At the same time, the server selection method guarantees that client-specific information will be available on the server chosen.
  • FIG. 1 is a diagram showing a server failover and load balancing system 10 , in accordance with some embodiments.
  • the server failover and load balancing system 10 comprises a plurality of servers 12 (e.g., servers 12 a - 12 n ) and one or more clients 22 (e.g., clients 26 a - 26 c ).
  • Each of the one or more clients 22 may include a server failover and load balancing engine (e.g., server failover and load balancing engines 16 a - 16 c, respectively).
  • Each of the plurality of servers 12 may comprise any suitable type(s) of computer servers (e.g., a server with an INTEL microprocessor, multiple processors, multiple processing cores, etc.) running any suitable operating system (e.g., Windows by Microsoft, Linux, etc.).
  • One or more of the plurality of servers 12 (e.g., servers 12 a - 12 n ) may include a database (e.g., databases 14 a - 14 n, respectively) stored therein or operatively connected thereto.
  • Each database may be stored on its server, or located externally therefrom (e.g., in a separate database server in communication with the server failover and load balancing system 10 ).
  • one or more of the plurality of servers 12 may also include a server failover and load balancing engine (not shown) that may be the same as and/or similar to the server failover and load balancing engines 16 a - 16 c.
  • Each of the plurality of servers 12 is remotely accessible such that it can communicate, through a network 20 (and/or via any other type(s) of communication link(s)), with one or more of the one or more clients 22 .
  • Each of the one or more clients 22 may include any type(s) of client device (e.g., a personal computer system 26 a, a smart cellular telephone 26 b, a tablet computer 26 c, and/or other electronic devices).
  • Network communication may be over the Internet using standard TCP/IP communications protocols (e.g., hypertext transfer protocol (HTTP), secure HTTP (HTTPS), file transfer protocol (FTP), electronic data interchange (EDI), etc.), through a private network connection (e.g., wide-area network (WAN) connection, emails, electronic data interchange (EDI) messages, extensible markup language (XML) messages, file transfer protocol (FTP) file transfers, etc.), or any other suitable wired or wireless electronic (or otherwise) communications format and system as should be understood by those of ordinary skill in the art.
  • HTTP hypertext transfer protocol
  • HTTPS secure HTTP
  • FTP file transfer protocol
  • EDI electronic data interchange
  • EDI electronic data interchange
  • XML extensible markup language
  • FTP file transfer protocol
  • the system 10 is a distributed system, which removes any single point of failure.
  • the system 10 provides services in two basic service classes: directory services and application services.
  • Each of the plurality of servers 12 (sometimes referred to herein as nodes) in the system 10 can provide services in one or both of such service classes (i.e., directory services and application services).
  • the application services include real time communication services (e.g., a real time communication session between two or more clients) and/or storage services (e.g., use of read/write storage by one or more clients).
  • all directory services on all nodes contain service information about the entire system.
  • application services e.g., used by the client application identifier subsystem 30
  • all directory services on all nodes only serve a fraction of all clients, so there is no need to distribute information about all clients to all application nodes. This reduces negative impact on system efficiency. Localization of client information on a subset of servers greatly improves network and storage performance, and enables linear capacity scaling (e.g., just by adding servers to the system).
  • the directory service (e.g., information directory service) provides a list of known servers, where each server is tagged or associated with all the application services it supports. In some embodiments, this list may be generated as follows as servers become “on-line” and/or otherwise available. Initially, a first server becomes “on-line” and/or otherwise available. A second server thereafter becomes “on-line” and/or otherwise available and is given the IP address of the first server. The second server subsequently sends a request to the first server for a list (or other definition) of all servers that are in the system 10 and known to the first server.
  • the second server After receiving a response from the first server, the second server sends a request to each additional server on the list (or other definition) for a list (or other definition) of all servers that are in the system 10 and known to such additional server.
  • the list from the first server may initially consist of only the first server. Thus, the second server may not send any additional requests. However, the process may be repeated as each additional server becomes “on-line” and/or otherwise available and thus each additional server obtains a list (or other definition) of at least some of the servers in the system 10 .
  • Each server may also broadcast a list (or other definition) of servers known to such server, in which case, each server in the system will eventually have a list (or other definition) of each server in the system 10 .
  • the list (or other definition) may also indicate the capabilities (e.g., application services) of each server on the list.
  • the directory services of a server may be used by one or more client computer systems to obtain a list (or other definition) of the servers that are in the system 10 and available to the one or more client computer systems.
  • a client may send a request to a server for such a list (or other definition). The client may thereafter receive a response with the list (or other definition) of servers that are in the system 10 and available to such client.
  • the client may send the request to any server in the system 10 .
  • the client may be required to send the request to one or more designated servers (e.g., a centralized directory service). Clients may occasionally refresh this information by querying directory servers (e.g., in real time, every few hours or days, etc.).
  • FIG. 6 is a graphical representation of a list (or other definition) that may be received by one of the one or more clients 22 , in accordance with some embodiments.
  • the list (or other definition), which is shown in the form of a table 600 having a plurality of entries, e.g., entries 602 - 628 , indicating all of the servers 12 that are in the system 10 and available to the client that requested the list.
  • each entry is associated with a particular one of the plurality of servers 12 available to the client, and indicates: (i) an IP address or other identifier for the server associated with the entry and (ii) one or more capabilities (e.g., application services) of such server.
  • a first entry 602 indicates an IP address, e.g., IP address 1 , associated with a first server available to the client.
  • the first entry 602 further indicates the capabilities of such first server, e.g., real time communication.
  • a third entry 606 indicates an IP address, e.g., IP address 3 , associated with a third server available to the client and further indicates the capabilities of such third server, e.g., real time communication and storage.
  • a ninth entry 618 indicates an IP address, e.g., IP address 9 , associated with a ninth server available to the client and further indicates the capabilities of such ninth server, e.g., storage.
  • each IP address may comprise a 32 bit IP address.
  • a client may receive and/or generate a separate list for each type of server capability (e.g., application service).
  • server capability e.g., application service
  • FIG. 7 is a graphical representation of a list (shown in the form of a table 700 ) of the servers 12 that are available to the client and have the capability of real time communication.
  • FIG. 8 is a graphical representation of a list (shown in the form of a table 800 ) of the servers 12 that are available to the client and have the capability of storage.
  • FIG. 2 is a diagram illustrating subsystems of a server failover and load balancing engine, e.g., one of server failover and load balancing engines 16 a - 16 c, in accordance with some embodiments.
  • each server failover and load balancing engine e.g. server failover and load balancing engines 16 a - 16 c, may include a CAI subsystem 30 and a service mapping subsystem 32 .
  • the CAI subsystem 30 facilitates failover, scaling, and/or locality of the client information.
  • the CAI subsystem 30 associates a client application identifier (CAI) with a particular application of a particular client or group of particular clients.
  • CAI client application identifier
  • the CAI subsystem 30 can include a real time communication session between two or more clients, use of read/write storage by one or more clients, streaming audio/video content from one client to a group of clients, application servicing a group of clients (e.g., payroll), etc.
  • the CAI subsystem 30 defines a partition of the server system used to service a particular set of clients. This limits data and communication to the subset of the entire system, and enables scaling. The redundancy requirements are defined for each particular case within the partition (e.g., subset).
  • the redundancy factor determines the replication within the subset, and subset size. If there is only a real-time component (e.g., for real time communication or live video streaming), the entire system can be involved so the redundancy factor is equal to the number of servers in the entire system. In all these cases, two or more clients that have agreed on the same CAI will always select the same server or the same subset of servers.
  • One possible embodiment of the CAI is a large number (e.g., 128, 512, or more bits), kept secret from outsiders.
  • the service mapping subsystem 32 maps each CAI to a particular server or a server subset for proper functioning of the system. Two or more clients that have agreed on the same CAI will always select the same server or the same subset of servers. This mapping works in the absence of a real-time directory service. Other than a recent directory map of the system, no other external information is required.
  • One possible mapping method that could be used with the system is Highest Random Weight (HRW). See, e.g., https://en.wikipedia.org/wiki/Rendezvous_hashing, the entirety of which is incorporated herein by reference.
  • HRW Highest Random Weight
  • FIG. 3 is a diagram showing one of the one or more clients 22 communicating with one of the plurality of servers 12 using a list of server IP addresses 136 , in accordance with some embodiments.
  • the system 10 may generate and/or otherwise provide a directory list of servers that are available to the client (with server identities represented by IP addresses).
  • the server failover and load balancing engine in the client 22 may combine the CAI with IP addresses of servers are available to the client and provide the desired application (e.g., real time communication and/or other function) and may perform the HRW method on this list of combinations, to generate a CAI-specific sorted list of servers 136 that provide the desired application (e.g., real time communication and/or other function).
  • the engine may sort the list by HRW (CAI, IP).
  • the client 22 may select a server (e.g., server 12 a ) from the CAI-specific sorted list of servers 136 by starting at the top of the list, and if the server at the top of the list is unavailable, the next N-1 servers 12 b - 12 n may be tried in succession, where N is the redundancy factor.
  • the client 134 selects an available server (e.g., server 12 d ) and establishes connection with that server (e.g., server 12 d ).
  • FIG. 9 is a graphical representation of a list (or other definition) prior to sorting after hashing, in accordance with some embodiments.
  • each entry is associated with a particular one of the plurality of servers 12 and indicates: (i) the IP address or other identifier for the server associated with the entry, a combination of the CAI and the IP address of the server (e.g., concatenation of IP address and CAI) and (iii) a hash out value that results from hashing the combination of the CAI and the IP address of the server.
  • a first entry 902 indicates an IP address, e.g., IP address 1 , associated with a first server, a combination (e.g., IP address 1 & CAI)) of such IP address and the CAI, and a hash out value, e.g., hash out 1 , that results from hashing the combination.
  • each IP address comprises 32 bit IP address
  • the CAI comprises 128 bits
  • the combination of the IP address and the CAI comprises 160 bits.
  • the agreed on CAI comprises a 128 bit identifier representing a telephone number.
  • FIG. 10 is a graphical representation of the list (or other definition) of IP addresses shown in table 900 after sorting based on the hash out values in the table 900 , in accordance with some embodiments.
  • the sorted list (or other definition) is shown in the form of a table 1000 having a plurality of entries, e.g., 1002 - 1016 .
  • the hash out values in the table 900 define the following descending sequence of hash out values (greatest to smallest): hash out 7 , hash out 3 , hash out 1 , hash out 2 , hash out 6 , hash out 5 , hash out 4 , hash out 8 .
  • the sorted list is not limited to the forms described above.
  • the sorted list may comprise any type(s) of information, in any form(s), that defines an order in which to attempt to contact servers until at least one functioning one of the servers is contacted.
  • a group of clients belonging to the same business wants to access payroll. They all agree on a CAI, and select a functioning server, which has access to payroll data related to this group (e.g., defined by CAI).
  • the application services in this case have state (e.g., payroll information), and a redundancy requirement with factor N, usually greater than 1.
  • each payroll application service (and/or other portion of the functioning server) when it receives a request/session from a particular client, also receives CAI, and calculates (or otherwise generates) the HRW sorted list itself.
  • the functioning server receives the HRW sorted list (or a portion thereof) from the requesting client and does not generate the HRW sorted list itself. In some embodiments, the functioning server does not replicate the information to the other N-1 servers on the list. In the latter embodiments, the requesting client may replicate the information to the other N-1 servers.
  • FIG. 11 is a graphical representation of a list (or other definition) prior to sorting after hashing, in accordance with some embodiments.
  • each entry is associated with a particular one of the plurality of servers 12 and indicates: (i) the IP address or other identifier for the server associated with the entry, a combination of the CAI and the IP address of the server (e.g., concatenation of IP address and CAI) and (iii) a hash out value that results from hashing the combination of the CAI and the IP address of the server.
  • a first entry 1102 indicates an IP address, e.g., IP address 3 , associated with a third server, a combination (e.g., IP address 3 & CAI)) of such IP address and the CAI, and a hash out value, e.g., hash out 3 , that results from hashing the combination.
  • IP address 3 IP address 3
  • CAI IP address 3 & CAI
  • hash out value e.g., hash out 3
  • FIG. 12 is a graphical representation of the list (or other definition) of IP addresses shown in table 1100 after sorting based on the hash out values in the table 1100 , in accordance with some embodiments.
  • the sorted list (or other definition) is shown in the form of a table 1200 having a plurality of entries, e.g., 1202 - 1216 .
  • the hash out values in the table 1100 define the following descending sequence of hash out values (greatest to smallest): hash out 7 , hash out 3 , hash out 9 , hash out 10 , hash out 6 , hash out 5 , hash out 4 , hash out 8 .
  • the client sends the selected server information to identify a record (of any size) within the selected server at which to store the data (if the data is being stored) and/or from which to retrieve the data (if the data is being retrieved),
  • the information comprises 128 bits.
  • the information may comprise the CAI, which the selected server may use as a key to identifies a partition within the selected server, and a record number that identifies a record within the identified partition.
  • the CAI used to identify the partition may comprise 104 bits and the record number used to identify the record within the storage partition may comprise 24 bits.
  • the sorted list is not limited to the forms described above.
  • the sorted list may comprise any type(s) of information, in any form(s), that defines an order in which to attempt to contact servers until at least one functioning one of the servers is contacted.
  • FIG. 4 is a flowchart of the process 150 , in accordance with some embodiments.
  • the system 10 electronically (or otherwise) generates a directory list with server identities represented by IP addresses.
  • the system electronically (or otherwise) generates an application specific directory list using a client application identifier to identify servers with a desired application.
  • the client electronically (or otherwise) applies the HRW method on the application specific directory list to electronically (or otherwise) generate a CAI-specific sorted list of servers that provide the desired application.
  • one or more clients attempt to contact the first server listed in the CAI-specific sorted list of servers.
  • a determination is made as to whether an answer was received from the server selected. If not, then in step 162 , the client attempts to contact the next server listed in the CAI-specific sorted list of servers. If so, then in step 164 , an electrical or data communication is established between the one or more clients and the server selected.
  • FIG. 13 is a flow chart of a process 1300 , in accordance with some embodiments.
  • the method may be used in server failover and/or load balancing.
  • the method 1300 is not limited to the order shown in the flow chart. Rather, embodiments of the method 1300 may be performed in any order that is practicable. For that matter, unless stated otherwise, any method disclosed herein may be performed in any order that is practicable.
  • the method 1300 (and/or any other method disclosed herein) may be performed by in any manner.
  • the method, (and/or any other method disclosed herein) or one or more portions thereof may be performed by one or more portions of the system 10 and/or any other processing system.
  • a non-transitory computer readable medium may have instructions stored thereon, which if executed by a machine result in performance of the method 1300 (and/or any other method disclosed herein) or one or more portions thereof.
  • the method may include executing, by one or more clients, an engine to select a target server or server subset among a plurality of servers, using a client application identifier.
  • two or more clients using the same client application identifier, select the same target server or server subset.
  • the engine includes a service mapping subsystem configured to map each client application identifier to the target server or server subset.
  • the service mapping subsystem is configured to map said client application identifier using Highest Random Weight.
  • the client application identifier comprises a large number.
  • executing an engine to select a target server or server subset among a plurality of servers, using a client application identifier comprises: executing, by a first one of the one or more clients, an engine to select a target server or server subset among a plurality of servers, using a client application identifier; and executing, by a second one of the one or more clients, the engine to select the target server or server subset among the plurality of servers, using the client application identifier.
  • executing an engine to select a target server or server subset among a plurality of servers, using a client application identifier comprises: receiving, by an engine executed by a client, information indicative of identifies of servers that provide a desired application; and generating, by the engine executed by the client, based at least in part on the information and a client application identifier, a client application identifier specific sorted list of servers that provide the desired application.
  • the sorted list may comprise any type(s) of information, in any form(s), that defines an order in which to attempt to contact servers until at least one functioning one of the servers is contacted.
  • the large number comprises at least 128 bits. In some embodiments, the large number comprises at least 512 bits.
  • FIG. 5 is a diagram showing an architecture 200 , in accordance with some embodiments.
  • one or more of the systems and/or devices (and/or portion(s) thereof) disclosed herein may have an architecture that is the same as and/or similar to one or more portions of the architecture 200 .
  • one or more of the plurality of servers 12 in the server failover and load balancing system 10 and/or one or more of the one or more clients 22 in the server failover and load balancing system 10 have an architecture that is the same as and/or similar to one or more portions of the architecture 200 .
  • one or more of the methods (or portion(s) thereof) disclosed herein may be performed by a system, apparatus and/or device having an architecture that is the same as or similar to the architecture 200 (or portion(s) thereof).
  • the architecture may be implemented as a distributed architecture or a non-distributed architecture.
  • a distributed architecture may be a completely distributed architecture or a partly distributed-partly non distributed architecture.
  • the architecture 200 includes a processing system 202 that may include one or more of a storage device 204 , a network interface 208 , a communications bus 210 , a central processing unit (CPU) (microprocessor) 212 , a random access memory (RAM) 214 , and one or more input devices 216 , such as a keyboard, mouse, etc.
  • the processing system 202 may also include a display (e.g., liquid crystal display (LCD), cathode ray tube (CRT), etc.).
  • LCD liquid crystal display
  • CRT cathode ray tube
  • the storage device 204 may comprise any suitable, computer-readable storage medium such as disk, non-volatile memory (e.g., read-only memory (ROM), erasable programmable ROM (EPROM), electrically-erasable programmable ROM (EEPROM), flash memory, field-programmable gate array (FPGA), etc.).
  • the processing system 202 may comprise a networked computer system, a personal computer, a smart phone, a tablet computer etc.
  • a server failover and load balancing engine 16 may be embodied as computer-readable program code stored on the storage device 204 and executed by the CPU 212 using any suitable, high or low level computing language, such as, for example, Python, Java, C, C++, C#, .NET, MATLAB, etc.
  • the network interface 208 may include an Ethernet network interface device, a wireless network interface device operable with one or more suitable wireless protocol, or any other suitable device that permits the server 202 to communicate via the network.
  • the CPU 212 may include any suitable single or multiple-core microprocessor of any suitable architecture that is capable of implementing and running the server failover and load balancing engine 16 .
  • the random access memory 214 may include any suitable, high-speed, random access memory typical of most modern computers, such as dynamic RAM (DRAM), etc.
  • any process (sometimes referred to herein as a method) disclosed herein is not limited to an order shown in a flow chart. Rather, embodiments may be performed in any order that is practicable.
  • any method disclosed herein may be performed in any manner.
  • a method (or one or more portions thereof) may be performed by one or more portions of the system 10 .
  • a non-transitory computer readable medium may have instructions stored thereon, which if executed by a machine result in performance of any one or more methods (or one or more portions thereof) disclosed herein.
  • a processor may comprise any type of processor.
  • a processor may be programmable or non-programmable, general purpose or special purpose, dedicated or non-dedicated, distributed or non-distributed, shared or not shared, and/or any combination thereof.
  • a processor may include, but is not limited to, hardware, software, firmware, and/or any combination thereof.
  • Hardware may include, but is not limited to off the shelf integrated circuits, custom integrated circuits and/or any combination thereof.
  • a processor comprises a microprocessor.
  • Software may include, but is not limited to, instructions that are storable and/or stored on a computer readable medium, such as, for example, magnetic or optical disk, magnetic or optical tape, CD-ROM, DVD, RAM, EPROM, ROM or other semiconductor memory.
  • a processor may employ continuous signals, periodically sampled signals, and/or any combination thereof. If a processor is distributed, two or more portions of the control/storage circuitry may communicate with one another through a communication link.
  • a processing system is any type of system that includes at least one processor.
  • a communication link may be any type of communication link, for example, but not limited to, wired (e.g., conductors, fiber optic cables) or wireless (e.g., acoustic links, electromagnetic links or any combination thereof including, for example, but not limited to microwave links, satellite links, infrared links), and/or combinations thereof, each of which may be public or private, dedicated and/or shared (e.g., a network).
  • a communication link may or may not be a permanent communication link.
  • a communication link may support any type of information in any form, for example, but not limited to, analog and/or digital (e.g., a sequence of binary values, i.e. a bit string) signal(s) in serial and/or in parallel form.
  • the information may or may not be divided into blocks. If divided into blocks, the amount of information in a block may be predetermined or determined dynamically, and/or may be fixed (e.g., uniform) or variable.
  • a communication link may employ a protocol or combination of protocols including, for example, but not limited to the Internet Protocol.
  • receiving means receiving in any manner(s) from any source(s) internal and/or external.
  • Coupled to means “coupled directly and/or indirectly to”, “send directly and/or indirectly to” and “receive directly and/or indirectly from”, respectively.
  • the disclosure contemplates, but is not limited to, embodiments that do not include any one or more of the features set forth in the above description. Accordingly, the description of embodiments herein is to be taken in an illustrative as opposed to a limiting sense, and neither the invention nor the disclosure is limited to the particular embodiments or combinations of features described herein.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer And Data Communications (AREA)
  • Hardware Redundancy (AREA)
US15/166,218 2015-05-26 2016-05-26 Systems and methods for server failover and load balancing Abandoned US20160352823A1 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US15/166,218 US20160352823A1 (en) 2015-05-26 2016-05-26 Systems and methods for server failover and load balancing
US16/255,374 US10819775B2 (en) 2015-05-26 2019-01-23 Systems and methods for server failover and load balancing
US17/073,990 US20210037090A1 (en) 2015-05-26 2020-10-19 Systems and Methods for Server Failover and Load Balancing

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201562179969P 2015-05-26 2015-05-26
US15/166,218 US20160352823A1 (en) 2015-05-26 2016-05-26 Systems and methods for server failover and load balancing

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/255,374 Continuation US10819775B2 (en) 2015-05-26 2019-01-23 Systems and methods for server failover and load balancing

Publications (1)

Publication Number Publication Date
US20160352823A1 true US20160352823A1 (en) 2016-12-01

Family

ID=57393177

Family Applications (3)

Application Number Title Priority Date Filing Date
US15/166,218 Abandoned US20160352823A1 (en) 2015-05-26 2016-05-26 Systems and methods for server failover and load balancing
US16/255,374 Active 2036-08-27 US10819775B2 (en) 2015-05-26 2019-01-23 Systems and methods for server failover and load balancing
US17/073,990 Pending US20210037090A1 (en) 2015-05-26 2020-10-19 Systems and Methods for Server Failover and Load Balancing

Family Applications After (2)

Application Number Title Priority Date Filing Date
US16/255,374 Active 2036-08-27 US10819775B2 (en) 2015-05-26 2019-01-23 Systems and methods for server failover and load balancing
US17/073,990 Pending US20210037090A1 (en) 2015-05-26 2020-10-19 Systems and Methods for Server Failover and Load Balancing

Country Status (8)

Country Link
US (3) US20160352823A1 (zh)
EP (1) EP3304865B1 (zh)
JP (1) JP6513228B2 (zh)
CN (2) CN107615734B (zh)
AU (1) AU2016267247B2 (zh)
CA (1) CA2986758C (zh)
MX (1) MX2017015021A (zh)
WO (1) WO2016191623A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160352823A1 (en) * 2015-05-26 2016-12-01 iDevices, LLC Systems and methods for server failover and load balancing
WO2021026923A1 (en) * 2019-08-15 2021-02-18 Nokia Solutions And Networks Oy Detection of instance liveness

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100333104A1 (en) * 2009-06-26 2010-12-30 Microsoft Corporation Service-Based Endpoint Discovery for Client-Side Load Balancing
US20130227165A1 (en) * 2012-02-28 2013-08-29 Comcast Cable Communications, LLC. Load Balancing and Session Persistence in Packet Networks
US8902787B2 (en) * 2009-04-24 2014-12-02 At&T Intellectual Property I, L.P. Apparatus and method for deploying network elements

Family Cites Families (40)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001167074A (ja) * 1999-12-10 2001-06-22 Hitachi Ltd 負荷分散処理装置
JP2001282737A (ja) * 2000-03-28 2001-10-12 Mitsubishi Electric Corp 業務負荷分散システム
US7043524B2 (en) * 2000-11-06 2006-05-09 Omnishift Technologies, Inc. Network caching system for streamed applications
US20020075844A1 (en) * 2000-12-15 2002-06-20 Hagen W. Alexander Integrating public and private network resources for optimized broadband wireless access and method
US7099912B2 (en) * 2001-04-24 2006-08-29 Hitachi, Ltd. Integrated service management system
US20030088656A1 (en) * 2001-11-02 2003-05-08 Wahl Mark F. Directory server software architecture
US6856991B1 (en) * 2002-03-19 2005-02-15 Cisco Technology, Inc. Method and apparatus for routing data to a load balanced server using MPLS packet labels
US7086061B1 (en) * 2002-08-01 2006-08-01 Foundry Networks, Inc. Statistical tracking of global server load balancing for selecting the best network address from ordered list of network addresses based on a set of performance metrics
US7774484B1 (en) * 2002-12-19 2010-08-10 F5 Networks, Inc. Method and system for managing network traffic
EP1599793B1 (en) * 2003-02-24 2015-10-21 Oracle International Corporation System and method for server load balancing and server affinity
DE10394206T5 (de) * 2003-03-31 2006-03-30 Fujitsu Ltd., Kawasaki Datenkommunikations-Lastverteilungs-Steuerprogramm und Datenlastverteilungs-Steuerverfahren
US6728729B1 (en) * 2003-04-25 2004-04-27 Apple Computer, Inc. Accessing media across networks
JP2005031736A (ja) * 2003-07-07 2005-02-03 Hitachi Information Systems Ltd サーバ負荷分散装置及びサーバ負荷分散方法及びクライアントサーバシステム
US7752626B1 (en) * 2003-09-30 2010-07-06 Oracle America, Inc. System and method for RMI-IIOP request load balancing
US8156217B2 (en) * 2003-11-24 2012-04-10 Hewlett-Packard Development Company, L.P. Dynamically balancing load for servers
US8306874B2 (en) * 2003-11-26 2012-11-06 Buy.Com, Inc. Method and apparatus for word of mouth selling via a communications network
US7284165B2 (en) * 2004-06-15 2007-10-16 International Business Machines Corporation Computer generated documentation including diagram of computer system
US20060190484A1 (en) * 2005-02-18 2006-08-24 Cromer Daryl C System and method for client reassignment in blade server
US7606904B2 (en) * 2005-03-30 2009-10-20 Microsoft Corporation Sending inter-server notifications using an out-of-band communications protocol
US7720971B2 (en) * 2005-09-12 2010-05-18 Microsoft Corporation Arbitrating an appropriate back-end server to receive channels of a client session
US7627106B1 (en) * 2005-09-26 2009-12-01 At&T Corporation Method and apparatus for sending updates to a call control element from an application server
US7512707B1 (en) * 2005-11-03 2009-03-31 Adobe Systems Incorporated Load balancing of server clusters
US7606808B2 (en) * 2006-08-25 2009-10-20 Microsoft Corporation Maintaining and establishing subscriptions with load-balanced servers
US8756340B2 (en) * 2007-12-20 2014-06-17 Yahoo! Inc. DNS wildcard beaconing to determine client location and resolver load for global traffic load balancing
US8560695B2 (en) * 2008-11-25 2013-10-15 Citrix Systems, Inc. Systems and methods for health based spillover
CN101888620A (zh) * 2009-05-14 2010-11-17 联芯科技有限公司 移动终端应用服务共享系统及共享方法
US8479268B2 (en) * 2009-12-15 2013-07-02 International Business Machines Corporation Securing asynchronous client server transactions
US8578027B2 (en) * 2010-03-09 2013-11-05 Blackberry Limited Communications system providing server load balancing based upon load and separation metrics and related methods
US9241012B2 (en) * 2010-04-18 2016-01-19 Tropo, Inc. System and method for telephony and communication services with message-based API
US8990380B2 (en) * 2010-08-12 2015-03-24 Citrix Systems, Inc. Systems and methods for quality of service of ICA published applications
KR101807286B1 (ko) * 2011-02-11 2017-12-08 삼성전자주식회사 근거리 통신을 이용한 휴대 단말기의 기능 수행 방법 및 장치
US8799470B2 (en) * 2011-03-11 2014-08-05 Qualcomm Incorporated System and method using a client-local proxy-server to access a device having an assigned network address
GB2495079A (en) * 2011-09-23 2013-04-03 Hybrid Logic Ltd Live migration of applications and file systems in a distributed system
US9325785B2 (en) * 2012-06-29 2016-04-26 Rodolfo Kohn Device, system, and method for client-governed session persistency between one or more clients and servers of a data center
US9154735B2 (en) * 2013-03-15 2015-10-06 Blue Jeans Network Provision of video conferencing with load balancing
US9577845B2 (en) * 2013-09-04 2017-02-21 Nicira, Inc. Multiple active L3 gateways for logical networks
US10104166B2 (en) * 2014-05-20 2018-10-16 Citrix Systems, Inc. Systems and methods for providing load balancing as a service
CN104283948B (zh) * 2014-09-26 2018-12-07 东软集团股份有限公司 服务器集群系统及其负载均衡实现方法
CN104301439B (zh) * 2014-11-13 2019-02-26 北京国双科技有限公司 负载均衡方法、装置及系统
US20160352823A1 (en) * 2015-05-26 2016-12-01 iDevices, LLC Systems and methods for server failover and load balancing

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8902787B2 (en) * 2009-04-24 2014-12-02 At&T Intellectual Property I, L.P. Apparatus and method for deploying network elements
US20100333104A1 (en) * 2009-06-26 2010-12-30 Microsoft Corporation Service-Based Endpoint Discovery for Client-Side Load Balancing
US20130227165A1 (en) * 2012-02-28 2013-08-29 Comcast Cable Communications, LLC. Load Balancing and Session Persistence in Packet Networks

Also Published As

Publication number Publication date
EP3304865A1 (en) 2018-04-11
CN112866355B (zh) 2024-05-21
CA2986758A1 (en) 2016-12-01
AU2016267247A1 (en) 2017-12-07
CN112866355A (zh) 2021-05-28
WO2016191623A1 (en) 2016-12-01
EP3304865B1 (en) 2021-01-13
MX2017015021A (es) 2018-04-10
US20210037090A1 (en) 2021-02-04
AU2016267247B2 (en) 2019-05-23
JP6513228B2 (ja) 2019-05-15
CN107615734A (zh) 2018-01-19
CA2986758C (en) 2022-12-06
US10819775B2 (en) 2020-10-27
JP2018521393A (ja) 2018-08-02
CN107615734B (zh) 2021-01-26
EP3304865A4 (en) 2019-01-23
US20190158585A1 (en) 2019-05-23

Similar Documents

Publication Publication Date Title
US10545914B2 (en) Distributed object storage
US20160092493A1 (en) Executing map-reduce jobs with named data
CN109688235A (zh) 虚拟网络业务处理方法、装置和系统，控制器，存储介质
CN108173774B (zh) 一种客户端的升级方法及系统
US20120054265A1 (en) Optimized Content Distribution Based on Metrics Derived from the End User
KR20170073605A (ko) 합성 파티션 함수 제공 기법
CN105991660B (zh) 一种多云存储系统间资源共享的系统
WO2022111313A1 (zh) 一种请求处理方法及微服务系统
US9390156B2 (en) Distributed directory environment using clustered LDAP servers
US20150381747A1 (en) Global provisioning of millions of users with deployment units
US20210037090A1 (en) Systems and Methods for Server Failover and Load Balancing
US10986065B1 (en) Cell-based distributed service architecture with dynamic cell assignment
CN111556135A (zh) 一种请求调度方法、系统、装置及电子设备
CN110650209A (zh) 实现负载均衡的方法和装置
CN110401731B (zh) 用于分配内容分发节点的方法和装置
US9736082B2 (en) Intelligent high-volume cloud application programming interface request caching
CN112653632A (zh) 一种流量控制实现方法和装置
US8996607B1 (en) Identity-based casting of network addresses
CN112804366B (zh) 用于解析域名的方法和装置
US20210073043A1 (en) Method and system for uniform, consistent, stateless and deterministic consistent hashing for fixed size partitions
CN105025042B (zh) 一种确定数据信息的方法及系统、代理服务器
US20200267211A1 (en) File server load balancing
US10193965B2 (en) Management server and operation method thereof and server system
CN113783919B (zh) 访问请求分流方法、系统、设备及存储介质
CN112839071A (zh) 训练系统、训练数据访问方法及装置、电子设备、介质

Legal Events

Date Code Title Description
AS Assignment

Owner name: IDEVICES, LLC, CONNECTICUT

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:DJAKOVIC, VLADAN;REEL/FRAME:038737/0258

Effective date: 20160526

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION