Shared Routing Table Management in Distributed Network Switches
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In distributed network switches, the shared forwarding database can become dominated by end stations with a large number of MAC addresses, leading to resource exhaustion and network flooding for other logical networks, as existing solutions lack effective mechanisms to control utilization and manage routing entries per logical network.
Innovation Solution
Implementing a method that uses counters and threshold values to dynamically manage the shared routing table, where when a counter for a logical network reaches a threshold, existing routing entries are invalidated or the learning of new network addresses is paused to maintain efficient resource allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the shared forwarding database is used without per-logical-network control, then routing information can be freely stored and accessed, but resource exhaustion and network flooding occur when a single logical network dominates the database
Solution Approach 1:
The patent segments the shared forwarding database by introducing per-logical-network counters and threshold values, dividing the monolithic resource management into controlled portions. Each logical network is monitored independently through its own counter, preventing any single network from dominating the entire database while maintaining overall shared access.
Solution Approach 2:
The patent implements feedback mechanisms through counters that track the number of routing entries per logical network and threshold values that trigger control actions. When a counter reaches its threshold, the system provides feedback by pausing learning or invalidating entries, creating a closed-loop control system that maintains database health and prevents resource exhaustion.
2Quantity of substance
If routing entries are freely added to the shared forwarding database, then comprehensive routing information is maintained, but the database becomes overwhelmed by networks with large numbers of MAC addresses
Solution Approach 1:
The patent introduces dynamic control mechanisms where the acceptance of new routing entries is not static but adapts based on current database conditions. Counters and threshold values create dynamic limits that adjust per logical network, allowing the system to accommodate varying numbers of routing entries based on actual resource availability and network behavior patterns.
Solution Approach 2:
The patent changes the parameter of routing entry acceptance from an open, unrestricted state to a controlled state with per-logical-network thresholds. By modifying the system parameters (counter limits, threshold values), the patent enables comprehensive routing information storage while preventing database overload through configurable parameter adjustments.
3Ease of operation
If no control mechanism is implemented, then all logical networks can learn network addresses freely, but end stations with large MAC address counts cause network flooding for other logical networks
Solution Approach 1:
The patent applies preliminary anti-action by proactively preventing harmful behavior before it occurs. Through pre-configured threshold values and per-logical-network counters, the system anticipates and prevents network flooding by stopping address learning or invalidating entries before a single logical network can dominate the forwarding database and cause harm to other networks.
Solution Approach 2:
The patent introduces counters and threshold values as intermediary control elements between the address learning process and the forwarding database. These intermediaries mediate the interaction between logical networks and the shared database, allowing free address learning within limits while preventing harmful flooding behavior through the intermediary control layer.
Data Source
AI summary
Techniques are provided for managing a routing table in a distributed network switch. The distributed network switch is divided into logical switch partitions, or logical networks, that may share a routing table. The shared routing table is configured with counters and thresholds to control utilization of the routing table on a per-logical network basis. When counters exceed certain threshold, the routing table is modified to reduce routing entries within the routing table or pause insertion of new routing entries.