Router Memory Efficiency via IP-MAC Table Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional routers inefficiently use memory by recording duplicate destination IP addresses and network masks, leading to decreased memory usage efficiency and inability to effectively support multi-nexthop, multi-default gateway, or multi-NAPT IP configurations.
Innovation Solution
A routing method utilizing two tables: one for unique destination IP addresses and another for corresponding MAC addresses, allowing for efficient selection of nexthops and load-balanced bandwidth allocation by separating routing information and reducing redundant data storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the router records multiple rows in the routing table for alternative nexthops to the same destination IP address, then the router can support multi-nexthop routing, but the memory usage efficiency decreases due to duplicate destination IP addresses and network masks
Solution Approach 1:
The patent segments the routing table into two separate tables: a routing table storing unique destination IP addresses and network masks, and a nexthop table storing multiple alternative nexthops. This segmentation eliminates duplicate destination information while maintaining multi-nexthop routing capability, directly resolving the contradiction between routing versatility and memory efficiency.
Solution Approach 2:
The patent extracts the destination IP address and network mask from multiple routing table entries and stores them once in a separate routing table. The nexthop information is extracted and stored independently in a nexthop table. This extraction eliminates redundancy while preserving the ability to support multiple nexthops for the same destination.
2Ease of manufacture
If the router uses a conventional routing table with duplicate destination information, then the implementation is simple, but the memory requirements increase
Solution Approach 1:
By dividing the conventional routing table into two separate tables with distinct functions, the patent reduces memory requirements while maintaining implementation feasibility. The routing table stores unique destination information, and the nexthop table stores alternative paths, making the system more memory-efficient without significantly complicating the implementation.
3Device complexity
If the router stores all routing information in a single table, then the data structure is simple, but the bandwidth allocation according to load balance rules is less efficient
Solution Approach 1:
The patent segments routing information and nexthop information into separate tables, enabling more efficient bandwidth allocation. The routing table provides unique destination lookup, while the nexthop table stores multiple alternative paths that can be selected based on load balance rules, improving bandwidth utilization without excessive complexity.
Solution Approach 2:
The patent enables dynamic nexthop selection from multiple alternatives stored in the nexthop table, allowing the router to adaptively allocate bandwidth according to load balance rules. This dynamic selection capability improves productivity by optimizing traffic distribution across multiple paths.
Data Source
AI summary
A method used for routing a data packet in a router having a first table used for recording a plurality of destination IP address and second table used for recording destination MAC address, wherein the plurality of destination IP address are different. The method includes: receiving a data packet and retrieving a destination IP address from the data packet; looking up an indication value corresponding to the destination IP address from the first table; selecting a destination MAC address from the second table according to the indication value as a nexthop for the data packet; and transmitting the data packet to the nexthop.