Scalable Publish/Subscribe Broker Network Using Active Load Balancing

• US 20070143442A1
• Filed: 12/20/2006
• Published: 06/21/2007
• Est. Priority Date: 12/20/2005
• Status: Abandoned Application

• Current Assignee: NEC Laboratories America Inc (NEC Corporation)
• Original Assignee: NEC Laboratories America Inc (NEC Corporation)
• Inventors: Zhang, Hui, Ganguly, Samrat, Izmailov, Rauf, Bhatnagar, Sudeept
• Application Number:
  US11/613,227
• Publication Number:
  US 20070143442A1
• Time in Patent Office: Days
• US Class Current: 709/217
• CPC Class Codes: G06Q 10/107 Computer-aided management of electronic mailing [e-mailing]
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30
• CPC Class Codes: H04L 67/1019 Random or heuristic server selection
• CPC Class Codes: H04L 67/1023 based on a hash applied to IP addresses or costs

Abstract

A scalable broker publish/subscribe broker network using a suite of active load balancing schemes is disclosed. In a Distributed Hashing Table (DHT) network, a workload management mechanism, consisting of two load balancing schemes on events and subscriptions respectively and one load-balancing scheduling scheme, is implemented over an aggregation tree rooted on a data sink when the data has a uniform distribution over all nodes in the network. An active load balancing method and one of two alternative DHT node joining/leaving schemes are employed to achieve the uniform traffic distribution for any potential aggregation tree and any potential input traffic distribution in the network.

Claims

1. A method for balancing network workload in a publish/subscribe service network, the network comprising a plurality of nodes that utilize a protocol where the plurality of nodes and publish/subscribe messages are mapped by the protocol onto a unified one-dimensional overlay key space, where each node is assigned an ID and range of the key space and where each node maintains a finger table for overlay routing between the plurality of nodes, and where event and subscription messages are hashed onto the key space based on event attributes contained in the messages, such that an aggregation tree is formed between a root node and child nodes among the plurality of nodes in the aggregation tree associated with an attribute A that send messages that are aggregated at the root node, comprising:

receiving aggregated messages at the root node for processing of the aggregated messages; and

upon detecting excessive processing of the aggregated messages at the root node, rebalancing network workload by pushing a portion of the processing of the aggregated messages at the root node back to a child node in the aggregation tree.

2. The method recited in claim 1, further comprising:

a node x receiving an original subscription message m for redistribution in the network;

the node x picking a random key for subscription message m;

the node x sending the subscription message to a node y, where the node y is responsible for the key in the key space;

parsing the subscription message at the node y and constructing a new subscription message n; and

sending subscription message n to the root node z and replicating the subscription message n at each node in the network between the node y and the root node z, wherein each node in the aggregation tree records a fraction of subscription messages forwarded from a child of the node in the aggregation tree, and further wherein the root node z is identified by picking an attribute A contained in m and hashing A onto the overlay key space.

3. The method recited in claim 2, wherein when the root node z is overloaded with subscription messages from the aggregation tree;

further comprising;

the root node z ranking all child nodes by the fraction of subscription messages forwarded to node z from each child node and marking the child nodes as being in an initial hibernating state;

the root node z selecting a node I with the largest fraction of subscription messages among the hibernating child nodes;

the root node z unloading all subscription messages received from the node l back to the node l;

the root node z marking the node l as being in an active state, and forwarding all subsequent subscription messages in an event aggregation tree associated with attribute A to the node l.

4. The method recited in claim 3, further comprising:

a node x receiving an original event message m for redistribution in the network;

the node x picking a random key for the event message m;

the node x sending the event message to a node y, where the node y is responsible for the key in the key space;

parsing the event message at the node y and constructing a new event message n; and

sending the event message n to the root node z and replicating the event message n at each node in the network between the node y and the root node z, wherein each node in the aggregation tree records a fraction of event messages forwarded from a child of the node in the aggregation tree, and further wherein the root node z is identified by picking each attribute A contained in m and hashing A onto the overlay key space.

5. The method recited in claim 4, wherein when the root node z is overloaded with event messages from the aggregation tree;

further comprising;

the root node z ranking all child nodes by the fraction of event messages forwarded to the node z from each child node and marking the child nodes as being in an initial hibernating state;

the root node z selecting a node l with the largest fraction of event messages among the hibernating child nodes;

replicating all messages from the subscription aggregation tree for attribute A at the node l and requesting that the node l hold message forwarding and locally process event messages; and

the root node z marking the node l as active.

6. The method recited in claim 1, further comprising adding a new node to the network using an optimal splitting (OS) scheme.

7. The method recited in claim 6, wherein the OS scheme comprises the new node joining the network by:

finding a node owning a longest key range; and

taking ½

of the key range from the node with the longest key range.

8. The method recited in claim 7, wherein if a plurality of nodes have an identical longest key range, randomly picking one of the nodes owning the identical longest key range

9. The method recited in claim 1, further comprising removing a node x from the network using an optimal splitting (OS) scheme.

10. The method recited in claim 9, wherein the OS scheme comprises removing the node x from the network by:

the node x finding a node owning a shortest key range among the plurality of nodes and an immediate successor node; and

the node x instructing the node owning the shortest key range to leave a current position in the network and rejoin at a position of node x.

11. The method recited in claim 10, wherein if the immediate successor node owns the shortest key range, instructing the immediate successor node to leave a current position, and further wherein if the immediate successor node does not own the shortest key range and a plurality of nodes own the shortest key range, randomly picking one of the nodes having the shortest key range.

12. The method recited in claim 1, further comprising adding a new node to the network using a middle point splitting (MP-k) scheme.

13. The method recited in claim 12, wherein the MP-k scheme comprises the new node joining the network by:

randomly choosing K nodes on the overlay space and if a plurality of nodes among the K nodes have longest key range, randomly selecting a node among the plurality of nodes with the longest key range.

14. The method recited in claim 1, further comprising removing a node x from the network using a middle point splitting (MP-k) scheme.

15. The method recited in claim 14, wherein the MP-k scheme comprises removing the node x from the network by:

the node x picking K random nodes and an immediate successor node in the network; and

the node x selecting a node owning the shortest key range and requesting that the node owning the shortest key range leave a current position in the network and rejoin at a position of node x,

wherein, if the immediate successor node to node x has the shortest key range, giving priority to the immediate successor node to node x, and further wherein if the immediate successor node to node x does not own the shortest key range and a plurality of nodes among the K random nodes own the shortest key range, randomly selecting a node among the plurality of nodes owning the shortest key range.

16. The method of claim 5, further comprising scheduling an order of load balancing operations at an overloaded node root node n among the plurality of nodes, wherein node n is simultaneously overloaded by event and subscription messages by:

node n determining a target processing rate r;

signaling a plurality of child nodes to node n to stop forwarding event messages to node n such that an actual arrival rate of event messages at node n is no greater than r;

determining an upper bound th on the number of subscription messages that can be processed at node n based on r;

signaling a plurality of child nodes to node n to stop forwarding subscription messages based on th; and

unloading subscription messages from node n to the plurality of child nodes.