Load balancing networks and load balancing methods

• US 9,350,811 B1
• Filed: 03/15/2013
• Issued: 05/24/2016
• Est. Priority Date: 04/04/2012
• Status: Active Grant

• Current Assignee: Nectar Holdings, Inc.
• Original Assignee: Nectar Services Corp.
• Inventors: Kiefer, Matthew R., Martin, Daniel P., Baydian, Edmond
• Primary Examiner(s): Srivastava, Vivek
• Assistant Examiner(s): Doan, Hien
• Application Number:
  US13/844,082
• Time in Patent Office: 1,166 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• CPC Class Codes: H04L 67/141 Setup of application sessions admission control or resource allocation in data switching networks H04L47/70

Abstract

A network may comprise a plurality of nodes wherein each of the plurality of nodes is associated with one of a plurality of hives. A computer may connect to the network by establishing node data for each of the plurality of nodes, the node data indicating a hive with which the node is associated and including a flag indicating whether a connection attempt associated with the node is or has been unsuccessful. When a connection attempt is successful, the computer may determine whether the node to which the computer is connected is a preferred node associated with the preferred hive based on the node data. The computer may connect to the preferred node associated with the preferred hive when the node to which the computer is connected is not the preferred node associated with the preferred hive and the preferred node associated with the preferred hive is not marked unsuccessful.

Claims

1. A method for connecting to a network comprising a plurality of nodes wherein each of the plurality of nodes is associated with one of a plurality of hives, the method comprising:

establishing, with a computer, node data for each of the plurality of nodes, the node data indicating a hive with which the node is associated and including a flag indicating whether a connection attempt associated with the node is or has been unsuccessful;

determining, with the computer, a preferred hive, wherein the determining is based on the node data and/or a designation of a preferred hive stored in a memory;

attempting, with the computer, to connect to one of the plurality of nodes that is not flagged as unsuccessful via a network connection when less than all of the nodes within the plurality of nodes are flagged as unsuccessful;

marking, with the computer, the flag for the one of the plurality of nodes as unsuccessful when the connection attempt is unsuccessful;

determining, with the computer, whether the node to which the computer is connected is a preferred node associated with the preferred hive when the connection attempt is successful, wherein the determining is based on the node data;

determining, with the computer, whether a node associated with the preferred hive is not marked unsuccessful when the node to which the computer is connected is not the preferred node associated with the preferred hive;

connecting, with the computer, to the preferred node associated with the preferred hive when the node to which the computer is connected is not the preferred node associated with the preferred hive and the preferred node associated with the preferred hive is not marked unsuccessful;

receiving, with the computer, a command from the node to which the computer is connected, the command comprising an instruction to disconnect from the node to which the computer is connected;

disconnecting, with the computer, from the node to which the computer is connected, and marking, with the computer, the node to which the computer is connected as unsuccessful;

establishing, after disconnecting, with the computer, node data for each of the plurality of nodes;

determining, with the computer, the preferred hive, wherein the determining is based on the node data and/or a designation of a preferred hive stored in a memory;

attempting, with a computer, via a network connection, to connect to one of the plurality of nodes that is not flagged as unsuccessful, when less than all of the nodes within the plurality of nodes are flagged as unsuccessful;

marking, with the computer, the flag for the one of the plurality of nodes as unsuccessful when the connection attempt is unsuccessful;

determining, with the computer, whether the node to which the computer is connected is a preferred node associated with the preferred hive when the connection attempt is successful, wherein the determining is based on the node data;

determining, with the computer, whether a node associated with the preferred hive is not marked unsuccessful when the node to which the computer is connected is not the preferred node associated with the preferred hive; and

connecting, with the computer, to the preferred node associated with the preferred hive when the node to which the computer is connected is not the preferred node associated with the preferred hive and the preferred node associated with the preferred hive is not marked unsuccessful.