Opportunistic Gossip Metrics Dissemination in Server Clusters

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In distributed computing systems with heterogeneous nodes, existing methods for disseminating load data are inefficient, leading to bandwidth overload and latency issues due to the need for frequent polling or periodic metric exchanges, which can overwhelm nodes with varying capabilities and workloads.

Innovation Solution

Implementing a 'piggyback' method where server nodes append their metrics to transactional messages, allowing clients to opportunistically disseminate and update load metrics across the cluster without explicit polling, reducing bandwidth usage and improving resource-aware load distribution.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of information

If frequent polling or periodic metric exchanges are used to disseminate load data, then current load information is maintained across the cluster, but bandwidth usage increases and nodes become overwhelmed

Engineering Contradiction:
Improveload information freshnessVSAvoidbandwidth usage
Core Design Contradiction:
Loss of informationVSLoss of energy

Solution Approach 1:

The patent introduces an intermediary mechanism where clients act as mediators in the metric dissemination process. Instead of direct node-to-node polling, clients opportunistically collect metrics from nodes they contact for transactions and propagate these metrics to other nodes. This intermediary approach reduces the direct communication burden between nodes while maintaining information freshness.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The system implements self-service by having nodes autonomously publish their own metrics when contacted by clients. Nodes don't need to actively poll or be polled by other nodes; instead, they passively provide their metrics when a client connects, and clients carry these metrics forward. This self-service model eliminates the need for coordinated polling mechanisms.

Inventive Principle:
Principle #25Self-service

2Loss of information

If explicit polling mechanisms are implemented for metric collection, then load metrics are gathered across the cluster, but communication overhead and latency increase

Engineering Contradiction:
Improvemetric collection completenessVSAvoidcommunication latency
Core Design Contradiction:
Loss of informationVSLoss of time

Solution Approach 1:

The patent merges the metric collection function with existing transactional communications. When clients contact nodes for transactions, they simultaneously collect metrics from these nodes. This combining of purposes eliminates separate polling operations and their associated latency, as metric collection becomes a byproduct of necessary transactional interactions.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

Clients perform preliminary metric collection during their normal transaction interactions with nodes, before needing to make load-balancing decisions. By gathering metrics during routine operations rather than through separate polling actions, the system prepares load information in advance without additional communication overhead.

Inventive Principle:
Principle #10Preliminary action

3Ease of operation

If uniform distribution of work across all nodes is implemented, then simplicity is maintained, but nodes with limited resources get overwhelmed

Engineering Contradiction:
Improveload distribution simplicityVSAvoidnode overload prevention
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The patent applies local quality by having clients make load-balancing decisions based on local metric information collected from individual nodes. Instead of a centralized controller managing all distribution, each client uses locally gathered metrics about node capabilities and current loads to intelligently select target nodes. This distributed decision-making maintains simplicity while preventing node overload through resource-aware routing.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS10713223B2Opportunistic gossip-type dissemination of node metrics in server clusters
Publication Date: 2020.07.14 SALESFORCE INC
  • US10713223B2 patent drawing
  • US10713223B2 patent drawing
  • US10713223B2 patent drawing

AI summary

Among heterogeneous nodes in a cluster, one node's capabilities can vary widely from that of others in the same cluster, for example, in a cluster of storage servers. As each of the clients/writers to the cluster may contact different server nodes in the cluster over time, with each contact the client/writer may receive server metric information, including both the contacted node's current metrics as well as metrics for any other nodes of which the contacted node is aware. The client/writer may provide updated information to the contacted node regarding the metrics for other nodes of which the client/writer is aware or has contacted. The exchange of metric information may be piggybacked upon read/write requests to each node to conserve bandwidth.