| 摘要 |
PURPOSE: A method for managing a content addressable memory lookup table based on an LPM(Longest Prefix Matching) is provided to reduce data updating time generally by locating an empty area in a lower address, moving data toward a lower address, recording appended data in an area having a length of a prefix to be appended, thereby reducing the number of moving times of CAM(Content Addressable Memory) lookup data averagely in the case that a prefix length of the appended data is more than "N/4" averagely. CONSTITUTION: When data the length thereof is 'n' are appended, items(420) having a length of "n-1" are moved toward the lower address direction in order from an item(410) having a prefix the length thereof is "N/2-1", and a prefix item(430). The length of the prefix item stores 'n'. In the case that a prefix length of an appended item is more than "N/4" averagely, an empty area(440) is located in the lower address, data are moved toward the lower address, appended data are recorded in an area having a prefix length to be appended, the number of moving times of content addressable memory lookup data is reduced averagely, and data updating time is reduced generally.
|
