Context Propagation via Leaf Node Extraction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The propagation of nested context information across systems can lead to network bandwidth bottlenecks due to the large amount of data required, and existing solutions that compress data increase processor load and require agreement on compression algorithms, complicating the data transfer process.
Innovation Solution
Propagating only the bottom or leaf context information within a hierarchy, along with mechanisms to manage hierarchical relationships and loopback scenarios, allowing for efficient data transfer and maintaining control within the context hierarchy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If nested context information is propagated between systems, then complete transaction hierarchy information is available at the receiving system, but network bandwidth is consumed and performance bottlenecks occur
Solution Approach 1:
The patent extracts only the essential context information needed for the receiving system to function, specifically propagating context identifiers and hierarchical relationships rather than complete context data. This allows the receiving system to recreate necessary context information locally, reducing network bandwidth consumption while maintaining functional completeness.
Solution Approach 2:
The context information is segmented into hierarchical levels, with only the necessary segments (context identifiers and parent-child relationships) being propagated across systems. The receiving system reconstructs the full context hierarchy locally, dividing the information distribution task between network transmission and local processing.
2Loss of energy
If data compression is applied to reduce network bandwidth usage, then network efficiency improves, but processor load increases and algorithm agreement complexity arises
Solution Approach 1:
Instead of using complex compression algorithms that require agreement and processing overhead, the patent uses a simple, lightweight encoding scheme for context identifiers that is inherently compact and universally interpretable. This approach prioritizes simplicity and universal compatibility over maximum compression ratios.
3Loss of energy
If only leaf context information is propagated, then network data transmission is reduced by at least 50%, but mechanisms to manage hierarchical relationships and loopback scenarios must be implemented
Solution Approach 1:
The patent performs preliminary action by propagating context identifier information and hierarchical relationship data along with the leaf context. This allows the receiving system to pre-establish the context hierarchy structure before processing transactions, enabling efficient loopback handling and hierarchical management without requiring complex runtime mechanisms.
Data Source
AI summary
Contexts are propagated between a first and second system. The contexts provide information about the environment within which work in the first and second systems is to be performed. The contexts have a hierarchical structure in which the bottom most context in the hierarchy is identified as a leaf context. A request is received at the first system to perform work. Context information is created in the first system pertaining to the environment within which the work is to be performed. The context information forms a context hierarchy having a root context and one or more descendant contexts. Information is propagated from the first system to the second system enabling re-creation at the second system of context information pertaining to the leaf context only.