Minimizing Connections in Distributed Systems via Random Walk
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In distributed systems, excessive hyperlinks can lead to increased dependence between resources, making it difficult to manage and update resources, as they are not easily identifiable due to dynamic and unbounded paths, and can result in unnecessary connections that are not observable.
Innovation Solution
A method involving a random walk procedure in a directed graph representation of the distributed system to reduce the number of paths and identify excessive connections by simulating client access, using cache-first and recent-first policies to resolve ambiguities and remove unused connections without preventing client access.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If hyperlinks are added to make all resources reachable in a distributed system, then resource accessibility is improved, but the number of connections increases excessively and dependence between resources increases
Solution Approach 1:
The patent extracts and removes excessive hyperlinks from the distributed system that do not provide new services. By identifying and eliminating redundant connections while preserving essential resource accessibility, the system reduces connection complexity without compromising the ability to reach all resources from the entry point.
2Adaptability or versatility
If hyperlinks are added to ensure resource reachability, then resource accessibility is improved, but identification of excessive connections becomes difficult
Solution Approach 1:
The patent implements a feedback mechanism that simulates client access patterns through random walks in the distributed system. By observing which hyperlinks are actually used during these simulated traversals, the system identifies excessive connections that are not utilized, making them detectable despite the dynamic and unbounded nature of the paths.
3Measurement precision
If all paths are enumerated to identify excessive connections, then connection minimization accuracy is improved, but computational complexity increases
Solution Approach 1:
The patent performs a sufficient number of random walk simulations to achieve accurate identification of excessive connections without enumerating all possible paths. By conducting a adequate but not exhaustive number of simulations, the system achieves high measurement precision while avoiding the prohibitive computational complexity of complete path enumeration.
Data Source
AI summary
A method computer implemented method of minimizing connections in a distributed system includes traversing paths in a directed graph representation of the distributed system having a fixed set of paths between nodes representing resources of the distributed system and edges representing connections between the resources by performing a random walk procedure to provide a reduced number of paths in the directed graph representation, and identifying excessive connections between the resources by simulating a client accessing the resources and identifying as excessive, connections that are not used by any of the reduced number of paths, wherein the excessive connections are removable from the distributed system without preventing client access to resources in the distributed system.