Distributed Event Management Using Node Identifiers and Local Counters
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed computing systems face challenges in managing events across geographically dispersed nodes, leading to increased messaging and network latency, particularly in transaction processing systems where rapid and reliable digital transactions are required.
Innovation Solution
A method for managing service events in a distributed computing system by using a combination of node identifiers, time elements, and local counter values to uniquely identify and store service events, allowing for effective coordination and removal of events, with cryptographic processes for secure validation and key management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a centralized system is used to manage service events, then event identification and management is simple, but the system cannot scale well and creates a single point of failure
Solution Approach 1:
The patent segments the centralized event management function into distributed event management across multiple computing nodes. Each node maintains its own event database and management capabilities, eliminating the single point of failure while enabling horizontal scaling. The system divides the monolithic event management into independent, replicable units that can operate autonomously.
Solution Approach 2:
The patent implements copying by replicating event management functionality across multiple nodes. Each computing node receives copies of event management logic and databases, allowing the system to distribute the workload. This replication enables the system to scale by adding more nodes without requiring a complex reconfiguration of the management architecture.
2Productivity
If the system is decentralized to improve scalability, then system productivity improves, but messaging quantity increases and network latency increases
Solution Approach 1:
The patent applies local quality by enabling each computing node to manage events locally without requiring constant communication with other nodes. Each node maintains its own event database and can process events independently, reducing the need for widespread messaging across the network. Only necessary event information is transmitted between nodes.
Solution Approach 2:
The patent implements preliminary action by pre-configuring event management logic and databases at each node before events occur. This preparation allows nodes to autonomously process and manage events without requiring real-time communication or messaging with other nodes, thereby reducing network traffic while maintaining scalability.
3Measurement precision
If events are managed at a centralized server, then event identification is consistent across the system, but network latency becomes a serious issue in distributed systems
Solution Approach 1:
The patent segments the event identification function from the centralized server and distributes it across multiple computing nodes. Each node maintains its own event identification capabilities and databases, allowing local events to be identified and managed without network latency. This segmentation eliminates the bottleneck where all events must be routed through a central server for identification.
4Device complexity
If all events are stored centrally, then event management is simplified, but the quantity of data to manage increases excessively in distributed systems
Solution Approach 1:
The patent segments the central event database into distributed databases at each computing node. Each node stores and manages only the events relevant to its local operations, significantly reducing the data quantity that any single node must manage. This segmentation prevents any single node from becoming overwhelmed by the entire event history.
Solution Approach 2:
The patent extracts event data from a centralized storage location and distributes it across multiple nodes. By taking out the monolithic database and breaking it into distributed copies, the system reduces the data burden on individual nodes while maintaining the ability to manage events effectively across the distributed architecture.
Data Source
AI summary
A method is described of managing service events in a distributed computing system. The distributed computing system comprises a plurality of computing nodes able to perform a service using a service process. The method takes place at one of the computing nodes. A service event is received or created. This service event is identified by a combination of a node identifier, a time element, and a local counter value. The local counter value represents a number of service events performed by a service process for a user since a last reset. The identified service event is then stored in a service process database according to node identifier and local counter values. The service process database is used to manage service events in the distributed system. Service events are removed from the service process database when no longer valid using the time element.