Network Topology Update via Logical Clock Ordering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems face challenges in maintaining an effective and rapid update of network topology when changes occur due to new nodes or peers joining or leaving the network, leading to inconsistent and slow communication of topology changes.
Innovation Solution
A method and system for updating network topology by receiving and processing topology data sets with time indications, where nodes detect changes and share updated information using logical clocks to ensure timely and consistent updates across the network, optimizing connectivity and data distribution.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If nodes continuously broadcast topology updates to all network participants, then topology change communication speed improves, but network bandwidth consumption and message overhead increase
Solution Approach 1:
The patent segments topology update messages into targeted communications rather than universal broadcasts. Each node sends updates only to specific neighboring nodes that need the information, dividing the network into information zones where updates are propagated selectively through the topology graph structure.
Solution Approach 2:
The patent implements local quality by making topology update propagation adaptive to local network conditions. Nodes adjust their update behavior based on their position in the topology graph, their current knowledge state, and the specific needs of their neighbors, rather than applying a uniform broadcast strategy across the entire network.
2Stability of the object's composition
If nodes wait for comprehensive topology information before updating their knowledge, then update consistency improves, but topology update latency increases
Solution Approach 1:
The patent applies preliminary action by having nodes prepare and send topology update messages in advance, before all network participants have processed previous updates. Nodes proactively push updates to their neighbors as soon as they detect topology changes, rather than waiting for a synchronization point or comprehensive information gathering.
Solution Approach 2:
The patent implements feedback mechanisms where nodes track the propagation state of topology updates through acknowledgments and version vectors. This feedback allows nodes to understand whether their updates have been received and processed by neighbors, enabling them to maintain consistent views without requiring centralized coordination or waiting for complete network-wide propagation.
3Loss of information
If nodes store complete topology information locally, then network knowledge accuracy improves, but memory requirements and processing overhead increase
Solution Approach 1:
The patent segments the global topology knowledge into distributed local views stored at each node. Instead of one node storing complete topology information, each node maintains a segment representing its local knowledge of the network topology, which is sufficient for making routing and update propagation decisions in its vicinity.
Solution Approach 2:
The patent transitions from a centralized dimension of topology storage to a distributed multi-dimensional architecture where topology information exists across multiple nodes simultaneously. Each node holds a portion of the topology knowledge in a different dimensional space of the distributed system, collectively representing the complete network topology without any single node requiring full storage.
Data Source
AI summary
The computer implemented invention provides a method, corresponding systems and arrangement within a network for detecting changes in the topology, ordering those changes by occurrence and constructing a new topology reflecting the changes. The invention addresses problems with keeping the knowledge of the network topology at each network node current, particularly when the network topology is dynamic, i.e., when links fail and recover at arbitrary times. The topology updating is event driven, as it is activated when some change in the network, particularly with nodes and links occurs. Events cause topology changes to be reported to other nodes in the network. Timestamping of messages allows the messages to be correctly applied as the most recent update or discarded. An algorithm is provided that allows each merchant node to maintain a correct view of the network topology despite link and node failures.