On-Demand Routing Information Propagation in Distributed Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In distributed computing systems, the overhead associated with propagating routing information to clients is significant, especially in complex and dynamic environments, leading to inefficiencies and performance bottlenecks due to the need for frequent updates across all clients.
Innovation Solution
Implementing on-demand propagation of routing information, where clients request updates based on the frequency and number of rerouted requests, reducing unnecessary propagation and focusing updates on clients that need the most current information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If routing information is propagated to all clients frequently to ensure up-to-date information, then routing accuracy is improved, but system overhead increases
Solution Approach 1:
The patent applies partial action by selectively propagating routing information only to clients that need updates, rather than broadcasting to all clients. The server tracks reroute counts per client and sends updates only when a client's reroute threshold is exceeded, reducing unnecessary propagation overhead while maintaining routing accuracy for affected clients.
2Reliability
If routing information is propagated to all clients to maintain system consistency, then reliability is improved, but system performance deteriorates
Solution Approach 1:
The patent segments the client population into groups based on their routing information needs. Each client is individually tracked with a reroute counter, and updates are segmented and sent only to specific clients who have exceeded their reroute thresholds. This segmentation maintains system consistency for affected clients while avoiding unnecessary updates to others, preserving system performance.
3Ease of operation
If centralized routing is used to coordinate request routing, then routing coordination is improved, but performance bottleneck increases
Solution Approach 1:
The patent introduces an intermediary mechanism where each client maintains local routing information and a reroute counter. The server acts as a mediator that only intervenes when necessary (when reroute thresholds are exceeded), providing minimal centralized coordination while allowing clients to operate autonomously most of the time. This reduces the performance bottleneck of centralized routing while maintaining coordination when needed.
4Loss of time
If routing updates are sent to all clients whenever routing information changes, then information freshness is improved, but network traffic increases
Solution Approach 1:
The patent implements feedback by tracking the number of reroutes per client and using this information to determine when updates are needed. The server monitors reroute counts and only propagates routing information to clients whose reroute thresholds are exceeded, creating a feedback-driven update mechanism that maintains information freshness while minimizing network traffic.
Data Source
AI summary
An apparatus, program product and method utilize on-demand propagation of routing information to reduce the overhead associated with distributing routing information throughout a distributed computing system. The staleness of the routing information utilized in routing client requests for a particular client is gauged based upon the number and/or frequency of client requests issued for that client that require rerouting, e.g., as indicated in responses returned in response to the client requests. Once the reroutes of client requests meet a desired propagation criterion, updated routing information is then requested for the client.