IPv6 Host Table Scalability in Top of Rack Switches
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional methods for storing host address information in ToR switch databases are inefficient, particularly with IPv6 addresses, as they limit storage capacity due to the larger address size, allowing for fewer host devices to be routed compared to IPv4 addresses.
Innovation Solution
The technique optimizes storage by compressing IPv6 addresses, where the first address component is stored in a longest prefix match table and mapped to an index value, which is stored in a host routing table along with the second address component, allowing for increased storage capacity in both tables.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If traditional storage methods are used for IPv6 addresses in ToR switch databases, then the storage structure is simple, but the storage capacity is limited due to the larger address size
Solution Approach 1:
The patent segments the IPv6 address into two components: a first address component (prefix) and a second address component (interface identifier). The first component is stored in a longest prefix match table mapped to an index value, while the second component is stored in a host routing table along with the index value. This segmentation allows the switch to store more IPv6 addresses by avoiding redundant storage of the full 128-bit address in both tables, thereby increasing storage capacity while managing structural complexity.
2Ease of operation
If IPv6 addresses are stored in full form in both longest prefix match table and host routing table, then address lookup is straightforward, but database storage capacity is reduced
Solution Approach 1:
The patent introduces an index value as an intermediary between the first address component (stored in longest prefix match table) and the second address component (stored in host routing table). During address lookup, the switch retrieves the index value from the longest prefix match table using the first address component, then uses this index value to locate the corresponding second address component in the host routing table. This intermediary mechanism maintains lookup simplicity while significantly increasing the number of host addresses that can be stored in the databases.
Data Source
AI summary
Techniques are provided for optimizing storage of address information in switch device databases. A control packet is received from a source host. An address associated with a host is determined. The address comprises a first and second address component. The first address component is stored in a first database and is mapped to an index value that is stored in the first database. The index value is also stored in a second database along with the second address component. The first database may also be examined to determine whether the first address component is stored in the first database. If the first address component is stored in the first database, the index value mapped to the first address component is retrieved. The second database is examined to determine whether the index value and the second address component are stored in the second database.