Hierarchical Pub-Sub Network for Scalable IoT Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Large-scale deployments of resource-constrained devices face scalability and robustness issues due to the single server model in pub-sub networks, leading to resource starvation and single-point failures, which affect message delivery and device connectivity.
Innovation Solution
Implementing a hierarchical pub-sub network architecture where devices connect to intermediate routing nodes, distributing the broker load and reducing open connections, with a balanced tree structure and distributed hash tables to manage connections and routing efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a single server model is used for pub-sub networks, then device connectivity is simplified, but scalability and robustness deteriorate due to resource starvation and single-point failures
Solution Approach 1:
The patent segments the centralized broker into multiple distributed brokers organized in a hierarchical overlay network. Devices connect to local brokers which forward messages to higher-level brokers, distributing the connection burden and eliminating the single-point failure problem while maintaining simplified connectivity through automatic routing.
Solution Approach 2:
The patent introduces intermediate brokers as mediators between devices and the global pub-sub network. These brokers handle local message routing and filtering, reducing direct connections to the core network while maintaining reliability through distributed architecture.
2Reliability
If devices maintain open connections to the broker for stateful communication, then data delivery verification and retransmission are improved, but resource consumption increases for resource-constrained devices
Solution Approach 1:
The patent implements local quality by allowing devices to maintain persistent connections only with their local broker while using stateless communication with remote brokers. This reduces resource consumption by limiting stateful connections to necessary local interactions while maintaining delivery verification through the hierarchical structure.
Solution Approach 2:
The patent applies partial action by implementing selective connection persistence - devices maintain open connections only when necessary for their specific communication patterns, while other communications use stateless requests. This optimizes resource usage by avoiding unnecessary persistent connections while maintaining reliability where needed.
3Reliability
If a hierarchical pub-sub network is implemented to distribute broker load, then scalability and robustness are improved, but connection management complexity increases
Solution Approach 1:
The patent implements self-service through automatic broker discovery and hierarchical routing. Devices automatically determine which brokers to connect to based on message topics and network configuration, eliminating the need for manual connection management while maintaining the benefits of distributed architecture.
Solution Approach 2:
The patent applies preliminary action by pre-configuring devices with broker hierarchy information and topic routing rules during initialization. This allows devices to automatically navigate the hierarchical structure without real-time management complexity, as the routing paths are established in advance.
Data Source
AI summary
System and techniques for a hierarchical resource constrained networks are described herein. Device participating in the network are divided into groups. These groups correspond to vertices in a routing graph. A leader is selected amongst the devices in each group to function as a routing node connecting to other vertices of the routing graph. Client devices attach to leaf vertices in the routing graph. To reduce overhead in placing devices into the routing pools, a distributed hash table (DHT) can be used. Here, the routing pools can be given DHT IDs based on, for example, a structure of the routing graph. Device DHT IDs are used to assign them to the routing pools based on a distance metric. Routing, in this arrangement, can use the DHT IDs to efficiently compute routing pool hops when routing messages. This arrangement works well for publication-subscription (pub-sub) services.