Dynamic Data Server Node Termination for Resource Optimization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Data server systems face inefficiencies as the size and complexity of data repositories grow, leading to suboptimal performance and increased resource costs, as existing methods often fail to effectively manage and interpret large datasets without unnecessary overhead.

Innovation Solution

A system of dynamically-instantiated data server nodes that operate on specific data collections, allowing for efficient resource allocation by terminating inactive nodes and utilizing high-speed memory for active data, with message routing and node instantiation mechanisms to manage resource distribution and data operations.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If additional system resources are added to improve performance as data repository size grows, then data processing capacity increases, but system cost and overhead increase undesirably

Engineering Contradiction:
Improvedata processing capacityVSAvoidsystem resources
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The patent implements dynamic data server nodes that can be instantiated and terminated based on real-time data processing needs. Instead of maintaining a fixed number of server nodes, the system dynamically creates nodes when data collections need processing and terminates them when no longer needed, allowing resource allocation to adapt to changing workload demands and avoiding permanent overhead for idle capacity

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system changes the operational parameters of data server nodes by transitioning them between active and inactive states. When a data collection is no longer being written to or read from, the associated server node is terminated, effectively changing its resource consumption parameter from active to zero, thereby optimizing the balance between processing capacity and resource usage

Inventive Principle:
Principle #35Parameter changes

2Reliability

If data server nodes are maintained for all data collections, then data access reliability is improved, but system overhead and resource consumption increase

Engineering Contradiction:
Improvedata access reliabilityVSAvoidsystem overhead
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies local quality by providing high-reliability dedicated server nodes only to data collections that require them (actively written or read), while other data collections do not maintain dedicated nodes. This localized approach to reliability ensures that critical data access needs are met without imposing system-wide overhead for maintaining nodes across all data collections

Inventive Principle:
Principle #3Local quality

3Productivity

If dynamic node instantiation and termination is implemented, then resource allocation efficiency is improved, but node management complexity increases

Engineering Contradiction:
Improveresource allocation efficiencyVSAvoidnode management complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system implements self-service through automatic monitoring of data collection access patterns and autonomous instantiation/termination of server nodes based on detected write or read operations. The system monitors itself for data access events and automatically manages node lifecycle without requiring external intervention, thereby achieving efficient resource allocation through automated rather than manually managed processes

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS11882054B2Terminating data server nodes
Publication Date: 2024.01.23 CISCO TECHNOLOGY INC
  • US11882054B2 patent drawing
  • US11882054B2 patent drawing
  • US11882054B2 patent drawing

AI summary

A system of terminating data server nodes based on insufficient processing of messages. In embodiments, a plurality of time-stamped, searchable events from machine data are created. A plurality of data server nodes that service messages across one or more portions of the plurality of time-stamped, searchable events, are executed in parallel. For each message received, the message is sent to a data server node, of the plurality of data server nodes, to cause the receiving data server node to perform a data operation associated with the received message. A determination can then be made that a particular data server node insufficiently processes messages sent to the particular data server node. Thereafter, termination of the particular data server node is initiated to terminate processes or threads executed by the particular data server node.