Tree-Based Forwarding Database for Network Switches
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network switching devices face inefficiencies in managing and updating their forwarding databases due to the need for quick and accurate operations as data traffic increases, leading to congestion and potential flooding of packets.
Innovation Solution
The forwarding database in a network switch is structured as a tree data structure, using MAC addresses and VLAN instances as keys, with separate VLAN and port information maintained in tree-based data structures, allowing for efficient operations such as adding and removing entries based on MAC address, VLAN instance, or port number.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a traditional forwarding database is used in network switching devices, then the database can store MAC address to port mappings, but the database management operations become slow and inefficient as data traffic increases
Solution Approach 1:
The forwarding database is segmented into multiple subtrees, where each subtree is responsible for a specific portion of the MAC address space. This segmentation allows parallel processing of database operations across different subtrees, significantly improving lookup, insertion, and deletion speeds as data traffic increases
Solution Approach 2:
The patent introduces a hierarchical tree structure with multiple levels (root nodes, intermediate nodes, leaf nodes) to organize the database. This dimensional transformation from a flat database structure to a hierarchical tree enables more efficient navigation and access patterns, reducing the time complexity of database operations
2Reliability
If the forwarding database stores all learned MAC addresses to ensure accuracy, then the database remains comprehensive, but the database size increases and performance decreases
Solution Approach 1:
The database entries are made dynamic with age counters that automatically expire stale MAC address mappings. The system dynamically adjusts the database content by removing unused entries after a predetermined time period, maintaining accuracy while preventing unbounded growth of database size
Solution Approach 2:
The system implements feedback mechanisms through age counters and expiration policies that continuously monitor and adjust database content. When MAC addresses are not seen for a certain duration, their entries are automatically removed, providing feedback-driven optimization of database size while maintaining reliability
3Reliability
If the switch floods packets to all ports when no FDB match is found, then packet delivery reliability is maintained, but network congestion increases
Solution Approach 1:
The system performs preliminary actions by maintaining accurate and up-to-date forwarding databases through continuous learning and aging mechanisms. By proactively managing FDB entries and their age counters, the system reduces the frequency of fallback flooding scenarios, thereby maintaining reliability while improving overall network throughput
Data Source
AI summary
A layer-2 network switch device forwarding database implementation and method to access the forwarding database. A forwarding database (FDB) is implemented as a tree. A separate VLAN database is also structured as a tree. Each node in the tree represents a separate VLAN. For each VLAN, all associated ports are maintained in a data structure organized as a tree. Likewise, all port information is maintained in a tree-based data structure, and for each port, all VLAN information associated with the port is maintained in a tree data structure. Each node in a VLAN's port tree data structure is linked with each corresponding node in the port's VLAN tree data structure. Each pair of nodes maintains a linked list of all FDB entries relating to the node pair. Operations are quickly and efficiently performed on the FDB using the data structure architecture.