Link State Vector Routing Update via Single Message
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Link state vector routing protocols face scalability and convergence issues in large data centers due to the need for explicit BGP withdrawal messages to delete links, leading to inefficiencies in managing network topology updates.
Innovation Solution
Implementing a method that allows for the addition or deletion of link states using a single message, utilizing a link identifier, summary originated link state (SOLS), and SOLS sequence number (SOLS-SN) within attribute Type-Length-Values (TLVs) triplets, enabling nodes to store a single copy of link states and avoid sending withdrawal messages.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If explicit BGP withdrawal messages are used to delete link states, then link state deletion can be achieved, but scalability and convergence efficiency deteriorate in large data centers
Solution Approach 1:
The patent combines link state advertisement and withdrawal operations into a single BGP update message. Instead of sending separate advertisement messages for adding link states and separate withdrawal messages for deleting them, the system uses a single message type that can carry both addition and deletion operations through a unified data structure containing link state identifiers and operation types.
Solution Approach 2:
The patent creates a universal message format that serves multiple functions: it can advertise new link states, withdraw existing link states, and update link state information all through a single BGP update message structure. This multi-functional message eliminates the need for separate message types for different link state operations.
2Speed
If multiple copies of link states are maintained at each node, then link state information can be readily accessed, but memory usage and device complexity increase
Solution Approach 1:
The patent extracts only the essential link state identifier information that is needed for routing decisions, rather than maintaining complete duplicate copies of all link state data. Each node stores a compact representation of received link states containing just the necessary identification and operational status, reducing memory requirements while maintaining access efficiency.
3Loss of information
If separate advertisement and withdrawal messages are used, then link state updates can be tracked, but message overhead and network traffic increase
Solution Approach 1:
The patent merges multiple link state operations (advertisement, withdrawal, update) into a single message transmission. By combining these operations that were previously handled by separate messages into one unified message structure, the system reduces the total number of messages traversing the network while maintaining complete tracking of all link state changes through the unified operation type field.
Data Source
AI summary
Techniques for updating a routing table based on a single message are described. One technique includes receiving at a first network device a node message from a second network device. The node message includes a sequence number and a list of link state(s) originated by the second network device. The first network device determines whether to withdraw one or more link states originated by the second network device and maintained in a routing table of the first network device based on the sequence number and the list of the link state(s) within the node message. The routing table is updated based on the determinations.