Distributed Hash Table Contract Renewal for Cache Persistence

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In multi-node systems, maintaining resource persistency across all nodes is challenging due to the distributed nature of resource ownership and the need for load balancing, session management, and application-state replication.

Innovation Solution

Implementing a method for contract renewal in a distributed replication table system, where non-owner nodes cache application-state entries and periodically renew timeouts by sending access indications to the owner node, ensuring resource persistency without re-requesting entries from the owner core.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If non-owner nodes frequently re-request entries from the owner node to ensure resource persistency, then resource availability is maintained, but the load on the owner node increases and system performance degrades

Engineering Contradiction:
Improveresource persistencyVSAvoidsystem performance
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The system performs preliminary actions by having non-owner nodes cache entries from the owner node before they are needed again. The cached copies are maintained with timeout periods, allowing nodes to access cached entries without immediately re-requesting from the owner node, thus preventing frequent load on the owner while maintaining resource availability

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system implements feedback mechanisms where non-owner nodes send access indications to the owner node when they access cached entries. The owner node receives this feedback and can reset timeout periods accordingly, creating a closed-loop system that balances resource persistency with load distribution across the distributed hash table

Inventive Principle:
Principle #23Feedback

2Speed

If non-owner nodes cache entries without notifying the owner node, then access speed improves, but the owner node cannot maintain the entry timeout period

Engineering Contradiction:
Improveentry access speedVSAvoidtimeout period maintenance
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

Non-owner nodes send access indications as feedback to the owner node when they access cached entries. This feedback allows the owner node to reset timeout periods and maintain accurate tracking of entry usage, ensuring resource persistency while allowing fast cached access

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The system uses periodic timeout periods for cached entries, where the timeout is renewed periodically based on access indications. This creates a rhythmic pattern of cache validation that balances fast access with reliable timeout management

Inventive Principle:
Principle #19Periodic action

3Reliability

If the owner node maintains all application-state entries centrally, then resource persistency is ensured, but the system cannot achieve effective load balancing across nodes

Engineering Contradiction:
Improveresource persistencyVSAvoidload balancing complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The distributed hash table segments the application-state entries across multiple nodes in the cluster. Each node owns specific portions of the table while non-owner nodes can cache entries from other nodes, distributing the load while maintaining persistency through the caching and timeout renewal mechanism

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The cached entries act as intermediaries between the owner node and non-owner nodes. Instead of direct centralised management, the cached copies mediate access to entries, reducing the direct load on the owner node while maintaining resource availability across the distributed system

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS9596305B2Systems and methods for distributed hash table contract renewal
Publication Date: 2017.03.14 CITRIX SYSTEMS INC
  • US9596305B2 patent drawing
  • US9596305B2 patent drawing
  • US9596305B2 patent drawing

AI summary

The present application is directed towards ASDR table contract renewal. In some embodiments, a core may cache an ASDR table entry received from an owner core such that when the entry is needed again the core does not need to re-request the entry from the owner core. As storing a cached copy of the entry allows the non-owner core to use an ASDR table entry without requesting the entry from the owner core, the owner core may be unaware of an ASDR table entry's use by a non-owner core. To ensure the owner core keeps the ASDR table entry alive, which the non-owner core has cached, the non-owner core may perform contract renewal for each of its recently used cached entries. The contract renewal method may include sending a message to the owner core that indicates which cached ASDR table entries the non-owner core has recently used or accessed. Responsive to receiving the message the owner core may reset a timeout period associated with the ASDR table entry.