Virtual Network Node Routing Control Using Distributed Hash Table
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In virtual networks, the link state routing protocol faces high traffic issues due to the need for individual message transmission to each neighboring node, especially in high link-density networks, leading to inefficient network resource consumption.
Innovation Solution
A node in a virtual network uses a distributed hash table to determine the next hop for message transfer and employs tree delivery control to send link state information along a tree structure with the source node as the root, reducing redundant message transfers and minimizing traffic.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If link state information is flooded to all neighboring nodes individually in a virtual network, then link state information is reliably transferred to all nodes, but the traffic amount of control messages increases significantly in high link-density networks
Solution Approach 1:
The patent merges multiple individual message transmissions into a single broadcast message. Instead of sending link state information separately to each neighboring node, the source node broadcasts the information once to all neighboring nodes simultaneously, reducing control message traffic while ensuring reliable delivery to all nodes in the virtual network.
Solution Approach 2:
The patent makes the link state information message universal by designing it to be delivered to all neighboring nodes through a single broadcast operation. The message structure and delivery mechanism are optimized to serve multiple destinations simultaneously, allowing one message to perform the function of multiple individual messages.
2Reliability
If flooding method is used to transfer link state information to all nodes, then the entire network topology information is reliably distributed, but network resources are consumed wastefully due to repeated message transfers
Solution Approach 1:
The patent applies preliminary action by having the source node perform a single broadcast operation before the information needs to be propagated throughout the network. This preliminary broadcast ensures all nodes receive the link state information in one go, preventing the need for repeated transmissions and reducing overall network resource consumption while maintaining reliable topology distribution.
3Reliability
If Hello messages are sent individually to each neighboring node in a high link-density virtual network, then neighbor recognition is reliable, but the traffic amount of Hello messages becomes large
Solution Approach 1:
The patent merges multiple individual Hello message transmissions into a single broadcast message. Instead of sending Hello messages separately to each neighboring node, the node broadcasts the Hello message once to all neighboring nodes simultaneously, reducing control message traffic while ensuring reliable neighbor recognition across the virtual network.
Solution Approach 2:
The patent makes the Hello message universal by designing it to be delivered to all neighboring nodes through a single broadcast operation. The message structure and delivery mechanism are optimized to serve multiple destinations simultaneously, allowing one message to perform the function of multiple individual messages for neighbor recognition.
Data Source
AI summary
Disclosed is a node that includes a distributed hash table generation means that generates a distributed hash table which indicates the next node to which a message is to be transferred, using a link state routing protocol, a link state information that exchange unit sends and receives link state information, and a tree delivery control unit that determines the transfer destination of the link state information so that the link state information is delivered along a tree where the source node of the link state information is a root.