Event Delivery System Bypassing Rendezvous Node Bottleneck
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing event delivery system experiences a bottleneck at the rendezvous node due to heavy load, which reduces its throughput, as the delivery routes often pass through this node, concentrating its functions and increasing the load.
Innovation Solution
The system reduces load on the rendezvous node by constructing delivery routes that bypass it, using traffic monitoring and specific event determination to identify overloaded routes and constructing new paths through aggregation and branch point nodes detected by broker nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If delivery routes are constructed through the rendezvous node, then event information can be delivered to subscribers, but the load on the rendezvous node increases and creates a bottleneck
Solution Approach 1:
The patent segments the delivery route into multiple paths by introducing alternative routes that bypass the rendezvous node. Broker nodes are divided into different functional roles (aggregation point nodes, branch point nodes) to create a distributed delivery architecture that reduces dependency on the centralized rendezvous node.
Solution Approach 2:
The patent introduces broker nodes as intermediary elements that can directly handle event delivery between publishers and subscribers. These broker nodes act as mediators that can establish direct delivery routes, reducing the load on the rendezvous node while maintaining reliable event delivery through the alternative route construction mechanism.
2Adaptability or versatility
If the rendezvous node concentrates all information management functions, then event advertisement and reception registration can be centralized, but the load on the rendezvous node increases
Solution Approach 1:
The patent segments the information management functions by distributing advertisement information and reception registration data across multiple broker nodes. Each broker node maintains relevant routing information locally, eliminating the need for all management functions to be concentrated at the rendezvous node while preserving system adaptability.
3Productivity
If alternative delivery routes bypassing the rendezvous node are constructed, then load on the rendezvous node is reduced, but route construction complexity increases
Solution Approach 1:
The patent applies preliminary action by having broker nodes pre-establish routing information and maintain awareness of alternative delivery paths during the advertisement and registration phases. This preliminary setup of routing data enables automatic route selection without complex real-time calculations when events need to be delivered, reducing the apparent complexity of the route construction process.
Solution Approach 2:
The patent implements feedback mechanisms where broker nodes exchange routing information and status updates with each other. This feedback loop allows the system to dynamically adjust and maintain alternative delivery routes based on current system state, simplifying route construction by using distributed intelligence rather than centralized complex algorithms.
Data Source
AI summary
Provided is an event delivery system where a bottleneck on the system can be eliminated by reducing load on a rendezvous node. The event delivery system includes publisher nodes, subscriber nodes, the rendezvous node, and broker nodes. The rendezvous node includes a traffic monitoring means that monitors the traffic volume of event information issued by the publisher node, and a specific event determination means that determines specific event information subject to load distribution from among the event information when the traffic volume exceeds a predetermined value. Each broker node includes a route defection means that detects whether its own node is an aggregation point node or a branch point node of the delivery route of the specific event information, and a route construction means that constructs a new delivery route of the specific event information going through the aggregation point node and the branch point node, bypassing the rendezvous node.