Routing Table Update via Binary Bit Digital Word
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network protocols face inefficiencies in updating routing tables, particularly in partial mesh networks, as they generate excessive network traffic due to the need for complete routing path information, which is not provided by distance vector routing algorithms.
Innovation Solution
A method where a digital word with binary bits represents each node in the network, indicating whether it is part of the preferred route, allowing for efficient transmission and update of complete routing tables with minimal network traffic by only sending necessary information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If complete routing path information is maintained in routing tables, then routing path completeness is improved, but network traffic increases due to frequent updates
Solution Approach 1:
The patent extracts only the essential routing information (next hop and distance) from complete path data, maintaining partial routing tables that store minimal necessary information. This extraction principle reduces the amount of data that needs to be updated and transmitted across the network while still enabling complete path reconstruction when needed.
Solution Approach 2:
The routing information is segmented into two parts: commonly used partial routing tables (next hop, distance) stored at all nodes, and complete path information stored only at source and destination nodes. This segmentation allows most nodes to operate with minimal data while complete paths are available on-demand without requiring continuous network transmission.
2Quantity of substance
If distance vector routing algorithms are used, then network traffic is reduced, but complete routing path information is not provided
Solution Approach 1:
Source and destination nodes autonomously maintain complete routing path information in their own routing tables without requiring other intermediate nodes to store or transmit this data. This self-service approach allows complete path information to be available locally at endpoints while intermediate nodes operate with minimal partial routing information, eliminating the need for network-wide propagation of complete path data.
3Reliability
If routing tables are updated frequently due to topology changes, then routing accuracy is improved, but network traffic increases
Solution Approach 1:
The patent extracts and transmits only the essential update information (next hop and distance changes) rather than complete routing table updates. This extraction principle reduces update message size and frequency while maintaining routing accuracy, as nodes can reconstruct complete paths from the minimal updated information combined with their existing partial routing tables.
Solution Approach 2:
The routing system dynamically adapts update propagation based on topology changes. When topology changes occur, only affected nodes generate and propagate update messages containing minimal necessary information. This dynamic approach ensures routing accuracy is maintained through timely updates while minimizing network traffic by updating only when and where necessary.
Data Source
AI summary
A method of transmitting routing information within a network is disclosed. In an embodiment, the method involves providing a message including a digital word in which at least each node in the mesh network other than the one node and the another node is represented by a single binary bit. The binary bit associated with each node is set to one value if the node is in the preferred route and the other value if the node is not in the preferred route.